Improving pushdown system model checking

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

Volumn 4144 LNCS, Issue , 2006, Pages 343-357

  Lal, Akash ^a   Reps, Thomas ^a,b  

^a UNIVERSITY OF WISCONSIN   (United States)

^b GRAMMATECH INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; TIME SERIES ANALYSIS; TRACKING (POSITION);

INCREMENTAL ANALYSIS; MODEL CHECKING; PUSHDOWN SYSTEM (PDS); WITNESS TRACING;

COMPUTER SOFTWARE;

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

References (20)

1. G. Balakrishnan and T. Reps. Analyzing memory accesses in x86 executables. In CC, 2004.
2. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model checking. In Concurrency Theory (CONCUR), pages 135-150, 1997.
3. A. Bouajjani, J. Esparza, and T. Touili. A generic approach to the static analysis of concurrent programs with procedures. In POPL, pages 62-73, 2003.
4. C. L. Conway, K. S. Namjoshi, D. Dams, and S. A. Edwards. Incremental algorithms for inter-procedural analysis of safety properties. In CAV, pages 449-461, 2005.
5. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In CAV, pages 232-247, 2000.
6. J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In CAV, pages 324-336, 2001.
7. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. Electronic Notes in Theoretical Computer Science, 9, 1997.
8. N. Kidd, T. Reps, D. Melski, and A. Lal. WPDS++: A C++ library for weighted pushdown systems, 2005. http://www.cs.wisc.edu/wpis/wpds++.
9. S. Kiefer, S. Schwoon, and D. Suwimonteerabuth. nMoped, 2005. http://www.informatik.uni-stuttgart.de/fmi/szs/tools/moped/nmoped/.
10. A. Lal, J. Lim, M. Polishchuk, and B. Liblit. Path optimization in programs and its application to debugging. In European Symposium On Programming, pages 246-263, 2006.
11. A. Lal and T. Reps. Improving pushdown system model checking. Technical Report 1552, University of Wisconsin-Madison, Jan. 2006.
12. A. Lal, T. Reps, and G. Balakrishnan. Extended weighted pushdown systems. In CAV, pages 434-448, 2005.
13. Y. Matsunaga, P. C. McGeer, and R. K. Brayton. On computing the transitive closure of a state transition relation. In Design Automation Conference (DAC), pages 260-265, 1993.
14. E. W. Myers. A precise interprocedural data flow algorithm. In POPL, pages 219-230, 1981.
15. G. Ramalingam. Data flow frequency analysis. In PLDI, pages 267-277, 1996.
16. T. Reps, S. Schwoon, S. Jha, and D. Melski. Weighted pushdown systems and their application to interprocedural dataflow analysis. Science of Computer Programming, 2005.
17. S. Schwoon. Model-Checking Pushdown Systems. PhD thesis, Technical Univ. of Munich, Munich, Germany, July 2002.
18. S. Schwoon. Moped, 2002. http://www.fmi.uni-stuttgart.de/szs/tools/moped/ .
19. R. E. Tarjan. Fast algorithms for solving path problems. J. ACM, 28(3):594-614, 1981.
20. R. E. Tarjan. A unified approach to path problems. J. ACM, 28(3):577-593, 1981.