Inferring congruence equations using SAT

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

Volumn 5123 LNCS, Issue , 2008, Pages 281-293

  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

COMPUTER AIDED ANALYSIS; INFORMATION THEORY; REAL TIME SYSTEMS; TRANSFER FUNCTIONS;

BASIC BLOCKS; COMPUTER AIDED VERIFICATION; INTERNATIONAL CONFERENCES; NEW APPROACHES; PROPOSITIONAL FORMULAS; SAT-SOLVING;

BOOLEAN FUNCTIONS;

EID: 48949104409     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70545-1_26     Document Type: Conference Paper

References (20)

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. Bryant, R.E.: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Transactions on Computers 40(2), 205-213 (1991)
3. 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)
4. Cousot, P., Halbwachs, N.: Automatic discovery of linear constraints among variables of a program. In: Symposium on Principles of Programming Languages, pp. 84-97. ACM, New York (1978)
5. Granger, P.: Static analysis of arithmetical congruences. International Journal of Computer Mathematics 30, 165-190 (1989)
6. Granger, P.: Static analyses of linear congruence equalities among variables of a program. In: Abramsky, S. (ed.) CAAP 1991 and TAPSOFT 1991. LNCS, vol. 493, pp. 167-192. Springer, Heidelberg (1991)
7. Gulwani, S., Necula, G.C.: Discovering affine equalities using random interpretation. In: Principles of Programming Languages, pp. 74-84. ACM, New York (2003)
8. 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)
9. Karr, M.: Affine relationships among variables of a program. Acta Informatica 6, 133-151 (1976)
10. Kettle, N., King, A., Strzemecki, T.: Widening ROBDDs with prime implicants. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol. 3920, pp. 105-119. Springer, Heidelberg (2006)
11. King, A., Søndergaard, H.: Inferring congruence equations using SAT. Technical Report 1-08, Computing Laboratory, University of Kent, CT2 7NF (2008)
12. Le Berre, D.: A satisfiability library for Java, http://www.sat4j.org
13. Leroux, J.: Disjunctive invariants for numerical systems. In: Wang, F. (ed.) ATVA 2004. LNCS, vol. 3299, pp. 93-107. Springer, Heidelberg (2004)
14. Müller-Olm, M., Seidl, H.: A Note on Karr's Algorithm. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1016-1028. Springer, Heidelberg (2004)
15. Müller-Olm, M., Seidl, H.: Analysis of modular arithmetic. ACM Transactions on Programming Languages and Systems 29(5) (August 2007) (Article 29)
16. Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. Journal of Symbolic Compututation 2(3), 293-304 (1986)
17. Ravi, K., McMillan, K.L., Shiple, T.R., Somenzi, F.: Approximation and decomposition of binary decision diagrams. In: Design Automation Conference, pp. 445-450. IEEE Press, Los Alamitos (1998)
18. Warren Jr., H.S.: Hacker's Delight. Addison Wesley, Reading (2003)
19. Wegner, P.: A technique for counting ones in a binary computer. Communications of the ACM 3(5), 322-322 (1960)
20. Xie, Y., Aiken, A.: SATURN: A scalable framework for error detection using Boolean satisfiability. ACM Transactions on Programming Languages and Systems 29(3) (2007) (Article 16)