Calysto: Scalable and precise extended static checking

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2008, Pages 211-220

  Babić, Domagoj ^a   Hu, Alan J ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Formal verification; Static analysis; Static checking

Indexed keywords

CONTEXT SENSITIVES; DESIGN DECISIONS; DETECTING BUGS; FORMAL ANALYSIS; FORMAL VERIFICATION; LARGE CODE BASIS; LEVELS OF AUTOMATIONS; LOW RATES; MODELING DATUM; OPEN SOURCES; PROGRAM BEHAVIORS; STATIC CHECKING; CONTEXT-SENSITIVE; DATA OPERATIONS; LEVELS OF AUTOMATION;

CODES (SYMBOLS); COMPUTER SOFTWARE SELECTION AND EVALUATION; SCALABILITY; SOFTWARE ENGINEERING; STATIC ANALYSIS;

PROGRAM DEBUGGING;

EID: 56249143748     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1368088.1368118     Document Type: Conference Paper

References (38)

1. Saturn-discuss mailing list archives, August 2007. https://mailman. stanford.edu/pipermail/saturn-discuss/.
2. D. Babić and A. J. Hu. Exploiting Shared Structure in Software Verification Conditions. Third International Haifa Verification Conference, HVC 2007, LNCS vol 4899, pp. 169-184. Springer, 2008.
3. D. Babić and A. J. Hu. Structural Abstraction of Software Verification Conditions. Computer Aided Verification (CAV), LNCS vol 4590, pp. 371-383. Springer, 2007.
4. D. Babić and M. Musuvathi. Modular Arithmetic Decision Procedure. Technical Report TR-2005-114, Microsoft Research Redmond, 2005.
5. T. Ball, R. Majumdar, T. Millstein, and S. Rajamani. Automatic Predicate Abstraction of C Programs. Programming Language Design and Implementation (PLDI), pp. 203-213. ACM Press, 2001.
6. T. Ball and S. K. Rajamani. The Slam project: debugging system software via static analysis. Principles of Prog Languages (POPL), pp. 1-3. ACM Press, 2002.
7. A. R. Bradley, Z. Manna, and H. B. Sipma. What's decidable about arrays? Verification, Model Checking, and Abstract Interpretation: (VMCA1), volume 3855 of LNCS, pp. 427-442. Springer, 2006.
8. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput., 35(8):677-691, 1986.
9. E. Clarke, D. Kroening, and F. Lerda. A tool for checking ANSI-C programs. Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2004), LNCS vol 2988, pp. 168-176. Springer, 2004.
10. E. Clarke, D. Kroening, N. Sharygina, and K. Yorav. Predicate abstraction of ansi-c programs using sat. Form. Methods Syst. Des., 25(2-3): 105-127, 2004.
11. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. Workshop on Logics of Programs, pp. 52-71, May 1981. Published 1982 as LNCS Vol l31.
12. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. POPL, pp. 238-252, 1977.
13. D. W. Currie, A. J. Hu, S. Rajan, and M. Fujita. Automatic formal verification of DSP software. 37th Design Automation Conference, pp. 130-135. ACM/IEEE, 2000.
14. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently Computing Static Single Assignment Form and the Control Dependence Graph. ACM Trans. Programming Languages and Systems, 13(4):451-490, October 1991.
15. D. L. Detlefs, K. R. M. Leino, G. Nelson, and J. B. Saxe. Extended static checking. Technical Report SRC-RR-159, Digital Equipment Corporation, Systems Research Center, 1998. Now available from HP Labs.
16. E. W. Dijkstra and C. S. Scholten. Predicate calculus and program semantics. Springer, 1990.
17. I. Dillig, T. Dillig, and A. Aiken. Static error detection using semantic inconsistency inference. SIGPLAN Not., 42(6):435-445, 2007.
18. D. Engler, B. Chelf, A. Chou, and S. Hallem. Checking system rules using system-specific, programmer-written compiler extensions. Operating Systems Design and Implementation (OSDI), 2000.
19. C. Flanagan, K. Leino, M. Lillibridge, G. Nelson, J. Saxe, and R. Stata. Extended static checking for Java. Programming Language Design and Implementation (PLDI), pp. 234-245. ACM Press, 2002.
20. D. Heine and M. S. Lam. Static detection of leaks in polymorphic containers. 28th Intl Confon Software Engineering, pp. 252-261, 2006.
21. T. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy Abstraction. POPL'2002: Principles of Programming Languages, pp. 58-70. ACM Press, 2002.
22. T. Hoare. The verifying compiler: A grand challenge for computing research. J. ACM, 50(l):63-69, 2003.
23. G. J. Holzmann. The model checker spin. IEEE Trans. Softw. Eng., 23(5):279-295, 1997.
24. F. Hutter, D. Babić, H. H. Hoos, and A. J. Hu. Boosting Verification by Automatic Tuning of Decision Procedures. Formal Methods in Computed Aided Design (FMCAD), pp. 27-34. IEEE Computer Society Press, 2007.
25. S. Johnson. Lint, a C program checker. Computer Science Technical Report 65, Bell Laboratories, December 1977.
26. J. C. King. Symbolic execution and program testing. Commun. ACM, 19(7):385-394, 1976.
27. A. Kölbl and C. Pixley. Constructing efficient formal models from high-level descriptions using symbolic simulation. Intl J of Parallel Programming, 33(6):645-666, 2005.
28. C. Lattner and V. Adve. LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. CGO '04: Intl Symp on Code Generation and Optimization, pp. 75-88. IEEE Computer Society, 2004.
29. K. R. M. Leino. Efficient weakest preconditions. Inf. Process. Lett., 93(6):281-288, 2005.
30. K. R. M. Leino and F. Logozzo. Loop invariants on demand. APLAS, volume 3780 of LNCS, pp. 119-134. Springer, 2005.
31. Y. V. Matiyasevich. Hubert's Tenth Problem. MIT Press, 1993.
32. J.-P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. 5th Intl Symp on Programming, pp. 337-351. Springer, 1981. LNCS Vol 137.
33. Robby, M. B. Dwyer, and J. Hatcliff. Bogor: an extensible and highly-modular model checking framework. European Software Engineering Conf./Symp. Foundations of Software Engineering (ESEC/FSE), pp. 267-276. ACM Press, 2003.
34. G. S. Tseitin. On the complexity of derivation in propositional calculus. Automation of Reasoning 2: Classical Papers on Computational Logic 1967-1970, pp. 466-483. Springer, 1983.
35. P. Tu and D. A. Padua. Efficient Building and Placing of Gating Functions. Programming Language Design and Implementation (PLDI), pp. 47-55, 1995.
36. W. Visser, K. Havelund, G. Brat, S. Park, and F. Lerda. Model checking programs. Automated Software Engineering, 10(2):203-232, April 2003.
37. J. Whaley and M. S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. Programming Language Design and Implementation (PLDI), pp. 131-144. ACM Press, 2004.
38. Y. Xie and A. Aiken. Scalable error detection using boolean satisfiability. Principles of Programming Languages (POPL), pp. 351-363. ACM Press, 2005.