Bounded model checking for weak alternating Büchi automata

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

Volumn 4144 LNCS, Issue , 2006, Pages 95-108

  Heljanko, Keijo ^a   Junttila, Tommi ^a   Keinänen, Misa ^a   Lange, Martin ^b   Latvala, Timo ^c  

^a AALTO UNIVERSITY   (Finland)

^b UNIVERSITY OF MUNICH   (Germany)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

Bounded Model Checking, PSL; NuSMV; Weak Alternating B chi Automata

Indexed keywords

ALGORITHMS; FORMAL LANGUAGES; MATHEMATICAL MODELS; SOFTWARE PROTOTYPING;

BOUNDED MODEL CHECKING, PSL; MINIMAL LENGTH COUNTEREXAMPLES; PROTOTYPE IMPLEMENTATION; WEAK ALTERNATING BÜCHI AUTOMATA;

AUTOMATA THEORY;

EID: 33749842657     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_12     Document Type: Conference Paper

References (22)

1. Lichtenstein, O., Pnueli, A., Zuck, L.D.: The glory of the past. In: Logic of Programs. Volume 193 of LNCS., Springer (1985) 196-218
2. Vardi, M.: Branching vs. linear time: Final showdown. In: TACAS. Volume 2031 of LNCS., Springer (2001) 1-22
3. Accellera: Property specification language: Reference manual - version 1.1 (2004) http://www.eda.org/vfv/docs/PSL-v1.1.pdf.
4. IEEE: IEEE Standard 1850 - Property Specification Language (PSL) (2005)
5. Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: TACAS. Volume 1579 of LNCS., Springer (1999) 193-207
6. Sheeran, M., Singh, S., Stålmarck, G.: Checking safety properties using induction and a SAT-solver. In: FMCAD. Volume 1954 of LNCS., Springer (2000) 108-125
7. McMillan, K.L.: Interpolation and SAT-based model checking. In: CAV. Volume 2725 of LNCS., Springer (2003) 1-13
8. Awedh, M., Somenzi, F.: Proving more properties with bounded model checking. In: CAV. Volume 3114 of LNCS. (2004) 96-108
9. Heljanko, K., Junttila, T., Latvala, T.: Incremental and complete bounded model checking for full PLTL. In: CAV. Volume 3576 of LNCS., Springer (2005) 98-111
10. Ben-David, S., Bloem, R., Fisman, D., Griesmayer, A., Pill, I., Ruah, S.: Automata constructon algorithms optimized for PSL. Technical Report Deliverable 3.2/4, ProdSyd project (2005) Available from: http://www.prosyd.org/.
11. Miyano, S., Hayashi, T.: Alternating finite automata on ω-words. Theoretical Computer Science 32 (1984) 321-330
12. Sheridan, D.: Bounded model checking with SNF, alternating automata, and Büchi automata. Electronic Notes in Theoretical Computer Science 119 (2005) 83-101
13. Rohde, G.S.: Alternating Automata and the Temporal Logic of Ordinals. PhD thesis, University of Illinois at Urbana-Champaign (1997)
14. Löding, C., Thomas, W.: Alternating automata and logics over infinite words. In: IFIP TCS2000. Volume 1872 of LNCS., Springer (2000) 521-535
15. Jehle, M., Johannsen, J., Lange, M., Rachinsky, N.: Bounded model checking for all regular properties. Electronic Notes in Theoretical Computer Science 144 (2006) 3-18
16. Latvala, T., Biere, A., Heljanko, K., Junttila, T.: Simple bounded LTL model checking. In: FMCAD. Volume 3312 of LNCS., Springer (2004) 186-200
17. Latvala, T., Biere, A., Heljanko, K., Junttila, T.: Simple is better: Efficient bounded model checking for past LTL. In: VMCAI. Volume 3385 of LNCS., Springer (2005) 380-395
18. Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. J. ACM 47 (2000) 312-360
19. Cleaveland, R., Steffen, B.: A linear-time model-checking algorithm for the alternation-free modal mu-calculus. Formal Methods in System Design 2 (1993) 121-147
20. Gastin, P., Oddoux, D.: Fast LTL to Büchi automata translation. In Berry, G., Comon, H., Finkel, A., eds.: CAV. Volume 2102 of LNCS., Springer (2001) 53-65
21. Cimatti, A., Clarke, E.M., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV 2: An OpenSource tool for symbolic model checking. In: CAV. Volume 2404 of LNCS., Springer (2002) 359-364
22. Schuppan, V., Biere, A.: Shortest counterexamples for symbolic model checking of LTL with past. In: TACAS. Volume 3440 of LNCS., Springer (2005) 493-509