Design and evaluation of a symbolic and abstraction-based model checker

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3299, Issue , 2004, Pages 196-210

  Haddad, Serge ^a   Ilié, Jean Michel ^a,b   Klai, Kais ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b University of Paris   (France)

Author keywords

Abstraction; Model checking; OBDD

Indexed keywords

ABSTRACTING; GRAPH THEORY; TEMPORAL LOGIC;

ABSTRACTION; COMPACT REPRESENTATION; DESIGN AND EVALUATIONS; LINEAR TIME LOGIC; MIXED SOLUTION; OBDD; SYMBOLIC METHODS; SYMBOLIC MODEL CHECKING;

MODEL CHECKING;

EID: 33749626026     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30476-0_19     Document Type: Article

References (17)

1. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers C-35 (1986) 677-691
2. Wegener, I.: Branching Programs and Binary Decision Diagrams: Theory and Application. SIAM Monographs on Discrete Mathematics and Applications (2000)
3. Fisler, K., Fraer, R., Khami, G., Vardi, M., Yang, Z.: Is there a best symbolic cycle-detection algorithm? Tools and Algorithms for the Construction and Analysis of Systems, 7th International Conference, TACAS 2001 2031 (2001) 420-434
4. Emerson, E., Lei, C.: Efficient model-checking in fragments of propositional model mu-calculus. Proceedings of LICS86 (1986) 267-278
5. Ravi, K., Bloem, R., Somenzi, F.: A comparative study of symbolic algorithms for the computation of fair cycles. In: International Conference on Formal Methods for Computer-Aided Verification. L.N.C.S., Springer-Verlag (2000) 143-160
6. Bloem, R., Gabow, H., Somenzi, F.: An algorithm for strongly connected component analysis in n log n symbolic steps. In: International Conference on Formal Methods for Computer-Aided Verification. L.N.C.S., Springer-Verlag (2000) 37-54
7. Gentilini, R., Piazza, C., Policriti, A.: Computing strongly connected components in a linear number of symbolic steps. In: Proceedings of International Symposium on Discrete Algorithms (SODA'03), ACM/SIAM (2003) 573-582
8. Xie, A., Beerel, P.: Implicit enumeration of strongly connected components and an application to formal verification. IEEETCAD: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 19 (2000)
9. Manna, Z., Pnueli, A.: The temporal logic of reactive and concurrent systems. Volume 1. Springer-Verlag New York, Inc. (1992)
10. Kaivola, R., Valmari, A.: The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic. In: International Conference on Concurrency Theory. (1992) 207-221
11. Puhakka, A., Valmari, A.: Weakest-congruence results for livelock-preserving equivalences. In: Proceedings of the 10th International Conference on Concurrency Theory, Springer-Verlag (1999) 510-524
12. Valmari, A.: Failure-based equivalences are faster than many believe. In Desel, J., ed.: Structures in Concurrency Theory, Proceedings of the International Workshop on Structures in Concurrency Theory (STRICT), Berlin, 11-13 May 1995. (1995) 326-340
13. Valmari, A.: The state explosion problem. In: Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets, Springer-Verlag (1998) 429-528
14. Miner, A., Ciardo, G.: Efficient reachability set generation and storage using decision diagrams. In: International Conference on Application and Theory of Petri Nets. LNCS, Springer-Verlag (1999) 388-393
15. Geldenhuys, J., Valmari, A.: Techniques for smaller intermediary bdds. In: CONCUR 2001 - Concurrency Theory, 12th International Conference. Volume 2154 of Lecture Notes in Computer Science., Springer (2001) 233-247
16. Lind-Nielsen, J.: Buddy, a binary decision diagram package. Technical Report IT-TR 1999-028, Institute of Information Technology Technical University of Denmark (1999) http://cs.it.dtu.dk/buddy.
17. Pastor, E., Roig, O., Cortadella, J., Badia, R.M.: Petri net analysis using boolean manipulation. In Valette, R., ed.: Proc. of the 15th Int. Conf. on Application and Theory of Petri Nets (PNPM'94), Zaragosa, Spain. LNCS 815, Springer (1994) 416-435