Please use this identifier to cite or link to this item:
|Title:||Bounded model checking of compositional processes|
|Authors:||Sun, J. |
|Citation:||Sun, J., Liu, Y., Dong, J.S., Sun, J. (2008). Bounded model checking of compositional processes. Proceedings - 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2008 : 23-30. ScholarBank@NUS Repository. https://doi.org/10.1109/TASE.2008.12|
|Abstract:||Verification techniques like SAT-based bounded model checking have been successfully applied to a variety of system models. Applying bounded model checking to compositional process algebras is, however, not a trivial task. One challenge is that the number of system states for process algebra models is not statically known, whereas exploring the full state space is computationally expensive. This paper presents a compositional encoding of hierarchical processes as SAT problems and then applies state-of-the-art SAT solvers for bounded model checking. The encoding avoids exploring the full state space for complex systems so as to deal with state space explosion. We developed an automated analyzer which combines complementing model checking techniques (i.e., bounded model checking and explicit on-the-fly model checking) to validate system models against event-based temporal properties. The experiment results show the analyzer handles large systems. © 2008 IEEE.|
|Source Title:||Proceedings - 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2008|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 12, 2018
WEB OF SCIENCETM
checked on Dec 4, 2018
checked on Nov 24, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.