Paper Info
Title
Recursive Abstractions for Parameterized Systems
Abstract
We consider a language of recursively defined formulas about arrays of variables, suitable for specifying safety properties of parameterized systems. We then present an abstract interpretation framework which translates a paramerized system as a symbolic transition system which propagates such formulas as abstractions of underlying concrete states. The main contribution is a proof method for implications between the formulas, which then provides for an implementation of this abstract interpreter.
Year
DOI
Venue
2009
10.1007/978-3-642-05089-3_6
World Congress on Formal Methods
Keywords
Field
DocType
main contribution,recursive abstractions,parameterized systems,concrete state,paramerized system,parameterized system,proof method,safety property,symbolic transition system,abstract interpreter,abstract interpretation framework
Transition system,Parameterized complexity,Abstraction,Abstract interpretation,Computer science,Program counter,Theoretical computer science,Interpreter,Proof obligation,Recursion
Conference
Volume
ISSN
Citations 
5850
0302-9743
3
PageRank 
References 
Authors
0.39
15
2
Name
Order
Citations
PageRank
Joxan Jaffar12350283.50
Andrew Santosa214613.36