Pushdown module checking

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

Volumn 3835 LNAI, Issue , 2005, Pages 504-518

  Bozzelli, Laura ^a   Murano, Aniello ^a   Peron, Adriano ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; FINITE AUTOMATA; FORMAL LOGIC; MATHEMATICAL MODELS; OPEN SYSTEMS; PROBLEM SOLVING;

FORMAL SPECIFICATION; MODEL-CHECKING PROBLEMS; MODULE CHECKING;

COMPUTER OPERATING SYSTEMS;

EID: 33745439925     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_35     Document Type: Conference Paper

References (21)

1. [BC96] E. Bhat and R. Cleaveland. Efficient model checking via the equational μ-calculus. In LICS'96, pages 304-312, 1996.
2. [BEM97] A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Push-down Automata: Application to Model-Checking. In CONCUR'97, LNCS 1243, pages 135-150. Springer-Verlag, 1997.
3. [Buc62] J.R. Buchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method. and Philos. Sci. 1960, pages 1-12, Stanford, 1962.
4. [CE81] E.M. Clarke and E.A. Emerson. Design and verification of synchronization skeletons using branching time temporal logic. In Proceedings of Workshop on Logic of Programs, LNCS 131, pages 52-71. Springer-Verlag, 1981.
5. [CKS81] A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, 1981.
6. [EH86] E.A. Emerson and J.Y. Halpern. Sometimes and not never revisited: On branching versus linear time. Journal of the ACM, 33(1):151-178, 1986.
7. [EJ88] E.A. Emerson and C.S. Jutla. The complexity of tree automata and logics of programs. In FOCS'88, pages 328-337, 1988.
8. [EJ91] E.A. Emerson and C.S. Jutla. Tree automata, μ-calculus and determinacy. In FOCS'91, pages 368-377, 1991.
9. [Hoa85] C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
10. [KG96] O. Kupferman and O. Grumberg. Buy one, get one free!!! Journal of Logic and Computation, 6(4):523-539, 1996.
11. [KPV02] O. Kupferman, N. Piterman, and M.Y. Vardi. Pushdown specifications. In LPAR'02, LNCS 2514, pages 262-277. Springer-Verlag, 2002.
12. [KTMV00] O. Kupferman, P.S. Thiagarajan, P. Madhusudan, and M.Y. Vardi. Open systems in reactive environments: Control and Synthesis. In CONCUR'00, LNCS 1877, pages 92-107. Springer-Verlag, 2000.
13. [KVW00] O. Kupferman, M.Y. Vardi, and P. Wolper. An Automata-Theoretic Approach to Branching-Time Model Checking. Journal of the ACM, 47(2):312-360, 2000.
14. [KVW01] O. Kupferman, M.Y. Vardi, and P. Wolper. Module Checking. Information and Computation, 164(2):322-344, 2001.
15. [LMS04] C. Loding, P. Madhusudan, and O. Serre. Visibly pushdown games. In FSTTCS'04, pages 408-420. Springer-Verlag, 2004.
16. [MS85] D.E. Muller and P.E. Shupp. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37:51-75, 1985.
17. [QS81] J.P. Queille and J. Sifakis. Specification and verification of concurrent programs in Cesar. In Proceedings of the Fifth International Symposium on Programming, LNCS 137, pages 337-351. Springer-Verlag, 1981.
18. [Var98] M.Y. Vardi. Reasoning about the past with two-way automata. In ICALP'98, LNCS 1443, pages 628-641. Springer-Verlag, 1998.
19. [VW86] M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. J. of Computer and System Sciences, 32(2):182-221, 1986.
20. [Wal96] I. Walukiewicz. Pushdown processes: Games and Model Checking. In CAV'96, LNCS 1102, pages 62-74. Springer-Verlag, 1996.
21. [Wa100] I. Walukiewicz. Model checking CTL properties of pushdown systems. In FSTTCS'00, LNCS 1974, pages 127-138. Springer-Verlag, 2000.