Exploiting traces in program analysis

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

Volumn 3920 LNCS, Issue , 2006, Pages 379-393

  Groce, Alex ^a   Joshi, Rajeev ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTER OPERATING SYSTEMS; COMPUTER SOFTWARE; INFORMATION ANALYSIS; MATHEMATICAL MODELS; PROBLEM SOLVING; SPACECRAFT;

CBMC BOUNDED MODEL; HISTORY VARIABLES; POST-MORTEM; RUNNING TIME;

WEB BROWSERS;

EID: 33745802589     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691372_25     Document Type: Conference Paper

References (20)

1. H. Agrawal and J. Horgan. Dynamic program slicing. In Programming Language Design and Implementation, pages 246-256, 1990.
2. A. Biere. The evolution from Limmat to Nanosat. Technical Report 444, Dept. of Computer Science, ETH Zǔrich, 2004.
3. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for the Construction and Analysis of Systems, pages 193-207, 1999.
4. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, New Jersey, 1976.
5. J. Field, G Ramalingam, and F. Tip. Parametric program slicing. In Principles of Programming Languages, pages 379-392, 1995.
6. C. Flanagan, K. R. M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended static checking for Java. In Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 234-245, May 2002.
7. C. Flanagan and J. B. Saxe. Avoiding exponential explosion: Generating compact verification conditions. In Principles of Programming Languages, pages 193-205, 2002.
8. G. Gannod and S. Murthy. Using log files to reconstruct state-based software architectures. In WCRE'02 Workshop on Software Architecture Reconstruction, 2002.
9. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Principles of Programming Languages, pages 58-70, 2002.
10. G. J. Holzmann. The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley Professional, 2003.
11. Y. Howard, S. Gruner, A. Gravell, C. Ferreira, and J. Augusto. Model-based tracechecking. In SoftTest: UK Software Testing Research Workshop II, 2003.
12. R. Jhala and R. Majumdar. Path slicing. In Programming Language Design and Implementation, pages 38-47, 2005.
13. D. Kroening, E. Clarke, and F. Lerda. A tool for checking ANSI-C programs. In Tools and Algorithms for the Construction and Analysis of Systems, pages 168-176, 2004.
14. K. Rustan M. Leino. Efficient weakest preconditions. Information Processing Letters, 93(6), 2005.
15. B. Liblit and A. Aiken. Building a better backtrace: Techniques for postmortem program analysis. Technical Report UCB CSD-02-1203, Computer Science Division, University of California at Berkeley, 2002.
16. R. Manevich, M. Sridharan, S. Adams, M. Das, and Z. Yang. PSE: explaining program failures via postmortem static analysis. In Tools and Algorithms for the Construction and Analysis of Systems, pages 63-72, 2004.
17. L. Millett and T. Teitelbaum. Slicing Promela and its applications to model checking, simulation, and protocol understanding. In SPIN Workshop on Model Checking of Software, pages 75-83, 1998.
18. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Design Automation Conference, pages 530-535, 2001.
19. M. Roger and J. Goubault-Larrecq. Log auditing through model-checking. In IEEE Workshop on Computer Security Foundations, page 220, 2001.
20. F. Tip. A survey of program slicing techniques. Journal of programming languages, 3:121-189, 1995.