The SLAM project: Debugging system software via static analysis

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2002, Pages 1-3

  Ball, Thomas ^a   Rajamani, Sriram K ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; C (PROGRAMMING LANGUAGE); COMPUTER AIDED SOFTWARE ENGINEERING; MATHEMATICAL MODELS; PROGRAM DIAGNOSTICS;

MODEL CHECKING; PROGRAM ANALYSIS; STATIC ANALYSIS;

PROGRAM DEBUGGING;

EID: 0036039066     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Mining specifications
2. Automatic predicate abstraction of C programs
3. Polymorphic predicate abstraction
4. Boolean and cartesian abstractions for model checking C programs
5. On the relative completeness of abstraction refinement
6. Bebop: A symbolic model checker for Boolean programs
7. Automatically validating temporal safety properties of interfaces
8. Bebop: A path-sensitive interprocedural dataflow engine
9. SLIC: A specification language for interface checking
10. Graph-based algorithms for boolean function manipulation
11. 20 states and beyond
12. A static analyzer for finding dynamic programming errors
13. Abstract interpretation: A unified lattice model for the static analysis of programs by construction or approximation of fixpoints
14. Unification-based pointer analysis with directional assignments
15. Successive approximation of abstract transition relations
16. Extended static checking
17. Tool-supported program abstraction for finite-state verification
18. Checking system rules using system-specific, programmer-written compiler extensions
19. Static detection of dynamic memory errors
20. Construction of abstract state graphs with PVS
21. Lazy abstraction
22. Logic verification of ANSI-C code with spin
23. Proving the correctness of multiprocess programs
24. CCured: Type-safe retrofitting of legacy code
25. Precise interprocedural dataflow analysis via graph reachability
26. On proving safety properties by integrating static analysis, theorem proving and abstraction
27. Abstract and model check while you prove
28. Enforceable security policies
29. An automata theoretic approach to automatic program verification