The reduced product of abstract domains and the combination of decision procedures

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

Volumn 6604 LNCS, Issue , 2011, Pages 456-472

  Cousot, Patrick ^b,c   Cousot, Radhia ^a,c   Mauborgne, Laurent ^c,d  

^a CNRS   (France)

^b NEW YORK UNIVERSITY   (United States)

^c ECOLE NORMALE SUPÉRIEURE   (France)

^d Brown University   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DOMAINS; APPLICATION DOMAINS; DECISION PROCEDURE; DISJOINTNESS; LOGICAL ABSTRACTION; LOGICAL THEORIES; NELSON-OPPEN PROCEDURE; ON-THE-FLY; SATISFIABILITY; STATIC ANALYZERS; SWEET SPOT;

ABSTRACTING; EMBEDDED SYSTEMS; FORMAL LOGIC; SEMANTICS;

STATIC ANALYSIS;

EID: 79953225550     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19805-2_31     Document Type: Conference Paper

References (21)

1. Bertrane, J., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Rival, X.: Static analysis and verification of aerospace software by abstract interpretation. In: Infotech@ Aerospace, pp. 2010-3385 (2010)
2. Bradley, A.R., Manna, Z.: The Calculus of Computation, Decision procedures with Applications to Verification. Springer, Heidelberg (2007)
3. th POPL, pp. 238-252 (1977)
4. th POPL, pp. 269-282 (1979)
5. Cousot, P., Cousot, R., Mauborgne, L.: Logical Abstract Domains and Interpretations. In: Nanz, S. (ed.) The Future of Engineering. Springer, Heidelberg (2010)
6. nd NSAD, ENTCS (2010)
7. Ferrara, P., Logozzo, F., Fähndrich, M.: Safer unsafe code in.NET. In: OOPSLA, pp. 329-346 (2008)
8. Granger, P.: Improving the results of static analyses of programs by local decreasing iterations. In: Shyamasundar, R.K. (ed.) FSTTCS 1992. LNCS, vol. 652, pp. 68-79. Springer, Heidelberg (1992)
9. th POPL, pp. 239-251 (2009)
10. Gulwani, S., McCloskey, B., Tiwari, A.: Lifting abstract interpreters to quantified logical domains. In: 35th POPL, pp. 235-246 (2008)
11. Gulwani, S., Necula, G.C.: Path-sensitive analysis for linear arithmetic and uninterpreted functions. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, pp. 328-343. Springer, Heidelberg (2004)
12. Gulwani, S., Tiwari, A.: Combining abstract interpreters. In: PLDI, pp. 376-386 (2006)
13. McIlraith, S.A., Amir, E.: Theorem proving with structured theories. In: IJCAI, pp. 624-634 (2001)
14. Miné, A.: Field-sensitive value analysis of embedded C programs with union types and pointer arithmetics. In: LCTES, pp. 54-63 (2006)
15. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. TOPLAS 1(2), 245-257 (1979)
16. Reps, T.W., Sagiv, S., Yorsh, G.: Symbolic implementation of the best transformer. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 252-266. Springer, Heidelberg (2004)
17. Shankar, N., Rueß, H.: Combining shostak theories. In: Tison, S. (ed.) RTA 2002. LNCS, vol. 2378, pp. 1-18. Springer, Heidelberg (2002)
18. Tinelli, C., Harandi, M.T.: A new correctness proof of the Nelson-Oppen combination procedure. In: Frontiers of Combining Systems, pp. 103-120. Kluwer Academic Publishers, Dordrecht (1996)
19. Tinelli, C., Ringeissen, C.: Unions of non-disjoint theories and combinations of satisfiability procedures. Theor. Comput. Sci. 290(1), 291-353 (2003)
20. Tinelli, P., Zarba, C.G.: Combining non-stably infinite theories. Electr. Notes Theor. Comput. Sci. 86(1) (2003)
21. Tiwari, A., Gulwani, S.: Logical interpretation: Static program analysis using theorem proving. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 147-166. Springer, Heidelberg (2007)