Please use this identifier to cite or link to this item:
|Title:||Recursive abstractions for parameterized systems||Authors:||Jaffar, J.
|Issue Date:||2009||Citation:||Jaffar, J.,Santosa, A.E. (2009). Recursive abstractions for parameterized systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5850 LNCS : 72-88. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-05089-3_6||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.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/41105||ISBN:||3642050883||ISSN:||03029743||DOI:||10.1007/978-3-642-05089-3_6|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 16, 2019
checked on May 22, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.