Demand-driven model checking for context-free processes

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

Volumn 1742, Issue , 1999, Pages 201-213

  Knoop, Jens ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; CONTEXT FREE LANGUAGES; DATA FLOW ANALYSIS; TEMPORAL LOGIC;

CLASSICAL COUNTERPART; COMPUTATIONAL EFFORT; CONTEXT-FREE PROCESS; INTERPROCEDURAL DATAFLOW ANALYSIS; LOCAL MODEL CHECKING; MODEL CHECKING ALGORITHM; SECOND-ORDER ALGORITHMS; SECOND-ORDER MODELS;

MODEL CHECKING;

EID: 3042686374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46674-6_18     Document Type: Conference Paper

References (22)

1. J. W. Backus, F. L. Bauer, J. Green, and et al. Revised report on the algorithmic language ALGOL60. Numer. Math., 4:420-453, 1963.
2. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In Proc. 8th Int. Conf. on Concurrency Theory (CONCUR’97), LNCS 1243, pages 135-150. Springer-V., 1997.
3. J. C. Bradfield. Verifying Temporal Properties of Systems. Birkhäuser, Boston, 1992.
4. J. C. Bradfield and C. P. Stirling. Verifying temporal properties of processes. In Proc. 1st Int. Conf. on Concurrency Theory (CONCUR’90), LNCS 458, pages 115-125. Springer-V., 1990.
5. O. Burkart and B. Steffen. Model checking for context-free processes. In Proc. 3rd Int. Conf. on Concurrency Theory (CONCUR’92), LNCS 630, pages 123-137. Springer-V., 1992.
6. O. Burkart and B. Steffen. Pushdown processes: Parallel composition and model checking. In Proc. 5th Int. Conf. on Concurrency Theory (CONCUR’94), LNCS 836, pages 98-113. Springer-V., 1994.
7. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Proc. IBM Workshop on Logic of Programs (LoP’81), LNCS 131, pages 52-71. Springer-V., 1981.
8. R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A semantics-based verification tool for finite state systems. ACM Trans. Prog. Lang. Syst., 15(1):36-72, 1993.
9. E. Duesterwald, R. Gupta, and M. L. Soffa. A practical framework for demanddriven interprocedural data flow analysis. ACM Trans. Prog. Lang. Syst., 19(6):992-1030, 1997.
10. E. A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In Proc. 1st IEEE Annual Symp. on Logic in Computer Science (LICS’86), pages 267-278. IEEE Computer Society, 1986.
11. S. Horwitz, T. Reps, and M. Sagiv. Demand interprocedural dataflow analysis. In Proc. 3rd ACM SIGSOFT Symp. on the Foundations of Software Engineering (FSE’95), pages 104-115, 1995.
12. H. Hungar and B. Steffen. Local model checking for context-free processes. In Proc. 20th Colloquium on Automata, Languages, and Programming (ICALP’93), LNCS 700, pages 593-605. Springer-V., 1993.
13. J. Knoop. Optimal Interprocedural Program Optimization: A new Framework and its Application. PhD thesis, Univ. of Kiel, Germany, 1993. LNCS Tutorial 1428, Springer-V., 1998.
14. R. Mayr. Strict lower bounds for model checking BPA. ENTCS, 18:12 pages, 1998.
15. K. L. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers, 1993.
16. J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. 5th Int. Symp. on Programming (SoP’82), LNCS 137, pages 337-351. Springer-V., 1982.
17. T. Reps. Solving demand versions of interprocedural analysis problems. In Proc. 5th Int. Conf. on Compiler Construction (CC’94), LNCS 786, pages 389-403. Springer-V., 1994.
18. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S. S. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 189-233. Prentice Hall, Englewood Cliffs, NJ, 1981.
19. B. Steffen, A. Claßen, M. Klein, J. Knoop, and T. Margaria. The fixpoint-analysis machine. In Proc. 6th Int. Conf. on Concurrency Theory (CONCUR’95), LNCS 962, pages 72-87. Springer-V., 1995. Invited contribution.
20. C. Stirling and D. Walker. Local model checking in the modal mu-calculus. In Proc. 3rd Int. Joint Conf. on Theory and Practice of Software Development (TAPSOFT’89), LNCS 351, pages 369-383. Springer-V., 1989.
21. C. Stirling and D. Walker. Local model checking in the modal mu-calculus. TCS, 89(1):161-177, 1991.
22. I. Walukiewicz. Pushdown processes: Games and model checking. In Proc. 8th Int. Workshop on Computer Aided Verification (CAV’96), LNCS 1102, pages 62-74. Springer-V., 1996.