Automatic abstraction for congruences

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

Volumn 5944 LNCS, Issue , 2010, Pages 197-213

  King, Andy ^a   Søndergaard, Harald ^b  

^a Portcullis Computer Security Limited   (United Kingdom)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS RESULTS; INTEGER COEFFICIENT; POWER-OF-TWO; PROGRAM TRANSFORMATIONS; PROPOSITIONAL VARIABLES; SAT-SOLVING; TRIANGULAR MATRICES;

ABSTRACTING; MODEL CHECKING; PROGRAM INTERPRETERS;

TRANSFER FUNCTIONS;

EID: 77949345970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11319-2_16     Document Type: Conference Paper

References (16)

1. Bagnara, R., Dobson, K., Hill, P.M., Mundell, M., Zaffanella, E.: Grids: A domain for analyzing the distribution of numerical values. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol. 4407, pp. 219-235. Springer, Heidelberg (2007)
2. Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168-176. Springer, Heidelberg (2004)
3. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Principles of Programming Languages, pp. 238-252. ACM, New York (1977)
4. Graf, S., Saïdi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72-83. Springer, Heidelberg (1997)
5. Granger, P.: Static analyses of linear congruence equalities among variables of a program. In: Abramsky, S. (ed.) TAPSOFT 1991. LNCS, vol. 493, pp. 167-192. Springer, Heidelberg (1991)
6. Howe, J.M., King, A.: Logahedra: A new weakly relational domain. In: Liu, Z., Ravn, A.P. (eds.) Automated Technology for Verification and Analysis. LNCS, vol. 5799, pp. 306-320. Springer, Heidelberg (2009)
7. Jackson, D., Vaziri, M.: Finding bugs with a constraint solver. In: International Symposium on Software Testing and Analysis, pp. 14-25. ACM, New York (2000)
8. King, A., Søndergaard, H.: Inferring congruence equations using SAT. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 281-293. Springer, Heidelberg (2008)
9. Laviron, V., Logozzo, F.: Subpolyhedra: A (more) scalable approach to infer linear inequalities. In: Jones, N.D., Müller-Olm, M. (eds.) VMCAI 2009. LNCS, vol. 5403, pp. 229-244. Springer, Heidelberg (2009)
10. Monniaux, D.: Automatic modular abstractions for linear constraints. In: Principles of Programming Languages, pp. 140-151. ACM, New York (2009)
11. Müller-Olm, M., Seidl, H.: Analysis of modular arithmetic. ACM Transactions on Programming Languages and Systems, article 29, 29(5) (August 2007)
12. Nelson, G., Oppen, D.C.: Fast decision procedures based on congruence closure. Journal of the ACM 27(2), 356-364 (1980)
13. Reps, T., Sagiv, M., 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)
14. Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Scalable analysis of linear systems using mathematical programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 25-41. Springer, Heidelberg (2005)
15. Simon, A., King, A.: Exploiting sparsity in polyhedral analysis. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 336-351. Springer, Heidelberg (2005)
16. Warren Jr., H.S.: Hacker's Delight. Addison Wesley, Reading (2003)