Paper Info
Title
Graph-based specification and simulation of featherweight Java with around advice
Abstract
In this paper we specify an operational run-time semantics of Assignment Featherweight Java -- a minimal subset of Java with assignments -- with around advice, using graph transformations. We introduce a notion of correctness of our specification with respect to an existing semantics and claim a number of advantages over traditional mathematical notations, that come forth from the executable nature of graph-transformation-based semantics. Using test programs as graphs during specification of the semantics, simulation can help in verifying the correctness of the rules simply by testing, increasing the rigorousness of the specification process. Also, execution of the semantics results in a state space that can be used for analysis and verification, giving rise to an effective method for aspect program verification. As a criterion for correctness, we use a structural operational semantics of this language from the so-called Common Aspect Semantics Base.
Year
DOI
Venue
2009
10.1145/1509837.1509844
Microelectronic Engineering
Keywords
Field
DocType
graph-transformation-based semantics,structural operational semantics,specification process,existing semantics,effective method,graph-based specification,aspect program verification,semantics result,featherweight java,operational run-time semantics,executable nature,assignment featherweight java,simulation,verification
Operational semantics,Programming language,Computer science,Correctness,Action semantics,Denotational semantics,Failure semantics,Theoretical computer science,Java,Semantics,Well-founded semantics
Conference
Citations 
PageRank 
References 
0
0.34
4
Authors
2
Name
Order
Citations
PageRank
Tom Staijen1211.65
Arend Rensink2119393.96