On the satisfiability of modular arithmetic formulae

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

Volumn 4218 LNCS, Issue , 2006, Pages 186-199

  Wang, Bow Yaw ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; INTEGER PROGRAMMING; MATHEMATICAL MODELS; NONLINEAR SYSTEMS;

INTEGRAL COMPUTATION MODELS; MODULAR ARITHMETIC; PRESBURGER ARITHMETIC;

DIGITAL ARITHMETIC;

EID: 33845232740     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11901914_16     Document Type: Conference Paper

References (23)

1. Babić, D., Musuvathi, M.: Modular arithmetic decision procedure. Technical Report MSR-TR-2005-114, Microsoft Research (2005)
2. Barrett, C., Berezin, S.: CVC Lite: A new implementation of the cooperating validity checker. In Alur, R., Peled, D.A., eds.: Computer Aided Verification. Volume 3114 of LNCS., Springer-Verlag (2004) 515-518
3. Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: Design Automation Conference, ACM Press (1999) 317-320
4. Boigelot, B., Wolper, P.: Representing arithmetic constraints with finite automata: An overview. In Stuckey, P.J., ed.: International Conference on Logic Programming. Volume 2401 of LNCS., Springer-Verlag (2002) 1-19
5. Clarke, E., Kroening, D., Sharygina, N., Yorav, K.: Predicate abstraction of ANSIC programs using SAT, Formal Methods in System Design 25(2-3) (2004) 105-127
6. Cooper, D.C.: Theorem proving in arithmetic without multiplication. Machine Intelligence 7 (1972)
7. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, In: ACM Symposium on Principles of Programming Languages, (1977) 238-252
8. Enderton, H.: A Mathematical Introduction to Logic, Academic Press (1972)
9. Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R, Sunderam, V.: PVM: Parallel Virtual Machine - A Users' Guide and Tutorial for Networked Parallel Computing. The MIT Press (1994)
10. Huet, G, Kahn, G., Paulin-Mohring: The Coq proof assistant: a tutorial: version 6.1. Technical Report 204, Institut National de Recherche en Informatique et en Automatique (1997)
11. Hungerford, T.W.: Algebra. Volume 73 of Graduate Texts in Mathematics. Springer-Verlag (1980)
12. Knuth, D.E.: The Art of Computer Programming. Volume II, Seminumerical Algorithms. Addison-Wesley (1997)
13. Melham, T.F.: Introduction to the HOL theorem prover. University of Cambridge, Computer Laboratory. (1990)
14. Murtagh, B.A.: Advanced Linear Programming: Computation and Practice. McGrawHill (1981)
15. Oppen, D.C.: Elementary bounds for presburger arithmetic, In: ACM Symposium on Theory of Computing, ACM (1973) 34-37
16. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)
17. Paulson, L.C., Nipkow, T.: Isabelle tutorial and user's manual. Technical Report TR-189, Computer Laboratory, University of Cambridge (1990)
18. Ralphs, T.K., Guzelsoy, M.: The SYMPHONY callable library for mixed integer, programming. In: INFORMS Computing Society. (2005)
19. Reddy, C.R., Loveland, D.W.: Presburger arithmetic with bounded quantifier alternation. In: ACM Symposium on Theory of Computing, ACM (1978) 320-325
20. Saídi, H., Graf, S.: Construction of abstract state graphs with PVS. In Grumberg, ed.: Computer Aided Verification. Volume 1254 of LNCS., Springer Verlag (1997) 72-83
21. Seshia, S.A., Bryant, R.E.: Deciding quantifier-free presburger formulas using parameterized solution bounds. In: Logic in Computer Science, IEEE Computer Society (2004) 100-109
22. Stinson, D.R.: Cryptography: Theory and Practice. CRC Press, Inc (1995)
23. Wang, B.Y.: On the satisfiability of modular arithmetic formula. Technical Report TR-IIS-06-001, Institute of Information Science, Academia Sinica (2006) http://www.iis.sinica.edu.tw/LIB/TechReport/tr2006/tr06.html.