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. © 2009 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Jaffar, J., & Santosa, A. E. (2009). Recursive abstractions for parameterized systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5850 LNCS, pp. 72–88). https://doi.org/10.1007/978-3-642-05089-3_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
