Linear arithmetic with stars

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

Volumn 5123 LNCS, Issue , 2008, Pages 268-280

  Piskac, Ruzica ^a   Kuncak, Viktor ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; DATA DESCRIPTION; DIGITAL ARITHMETIC; INTEGER PROGRAMMING; LINEARIZATION; MATHEMATICAL OPERATORS; NUCLEAR PROPULSION; SET THEORY; SOLUTIONS; THEOREM PROVING; VECTORS;

CARDINALITY CONSTRAINTS; COMPUTER AIDED VERIFICATION; DESCRIPTION LOGICS; INTEGER LINEAR PROGRAMMING PROBLEMS; INTERACTIVE THEOREM PROVING; INTERNATIONAL CONFERENCES; LINEAR ARITHMETIC; MULTI-SETS; NP-COMPLETE; NP-HARD PROBLEMS; OPTIMAL DECISIONS; REACHABILITY PROBLEMS; SATISFIABILITY PROBLEM; SEMILINEAR; SOLUTION SETS; SPARSE SOLUTIONS; STATE VECTORS; TRANSITION SYSTEMS; VECTOR ADDITION;

LINEAR PROGRAMMING;

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

References (25)

1. Ball, T., Cook, B., Lahiri, S.K., Zhang, L.: Zapato: Automatic theorem proving for predicate abstraction refinement. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 457-461. Springer, Heidelberg (2004)
2. Ball, T., Majumdar, R., Millstein, T., Rajamani, S.K.: Automatic predicate abstraction of C programs. In: Proc. ACM PLDI (2001)
3. Balser, M., Reif, W., Schellhorn, G., Stenzel, K., Thums, A.: Formal System Development with KIV. In: Maibaum, T.S.E. (ed.) ETAPS 2000 and FASE 2000. LNCS, vol. 1783, Springer, Heidelberg (2000)
4. Banâtre, J.-P., Métayer, D.L.: Programming by multiset transformation. Commun. ACM 36(1), 98-111 (1993)
5. Barrett, C., Berezin, S.: CVC Lite: A new implementation of the cooperating validity checker. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 515-518. Springer, Heidelberg (2004)
6. Basin, D., Friedrich, S.: Combining WS1S and HOL. In: FROCOS. vol. 7 of Studies in Logic and Computation (2000)
7. de Moura, L., Bjørner, N.: Efficient E-Matching for SMT Solvers. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 183-198. Springer, Heidelberg (2007)
8. Dennis, L.A., Collins, G., Norrish, M., Boulton, R., Slind, K., Robinson, G., Gordon, M., Melham, T.: The PROSPER Toolkit. In: Schwartzbach, M.I., Graf, S. (eds.) ETAPS 2000 and TACAS 2000. LNCS, vol. 1785, Springer, Heidelberg (2000)
9. Eisenbrand, F., Shmonin, G.: Carathéodory bounds for integer cones. Operations Research Letters 34(5), 564-568 (2006), http://dx.doi.org/10. 1016/j.orl.2005.09.008
10. Ge, Y., Barrett, C., Tinelli, C.: Solving quantified verification conditions using satisfiability modulo theories. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 167-182. Springer, Heidelberg (2007)
11. Ginsburg, S., Spanier, E.: Semigroups, Pressburger formulas and languages. Pacific Journal of Mathematics 16(2), 285-296 (1966)
12. Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: POPL (2002), http://doi.acm.org/10.1145/503272.503279
13. Kuncak, V.: Modular Data Structure Verification. PhD thesis, EECS Department, Massachusetts Institute of Technology (February 2007)
14. Kuncak, V., Rinard, M.: Towards efficient satisfiability checking for Boolean Algebra with Presburger Arithmetic. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 215-230. Springer, Heidelberg (2007)
15. Lahiri, S.K., Seshia, S.A.: The UCLID decision procedure. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 475-478. Springer, Heidelberg (2004)
16. Lugiez, D.: Multitree automata that count. Theor. Comput. Sci. 333(1-2), 225-263 (2005)
17. McLaughlin, S., Barrett, C., Ge, Y.: Cooperating theorem provers: A case study combining HOL-Light and CVC Lite. In: PDPAR. ENTCS, vol. 144(2) (2006)
18. Nguyen, H.H., David, C., Qin, S., Chin, W.-N.: Automated verification of shape, size and bag properties via separation logic. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 251-266. Springer, Heidelberg (2007)
19. Nipkow, T., Wenzel, M., Paulson, L.C., Voelker, N.: Multiset theory version 1.30 (Isabelle distribution) (2005), http://isabelle.in.tum.de/dist/ library/HOL/Library/Multiset.html
20. Papadimitriou, C.H.: On the complexity of integer programming. J. ACM 28(4), 765-768 (1981)
21. Piskac, R., Kuncak, V.: Decision procedures for multisets with cardinality constraints. In: VMCAI. LNCS, vol. 4905. Springer, Heidelberg (2008)
22. Pottier, L.: Minimal solutions of linear diophantine systems: Bounds and algorithms. In: Book, R.V. (ed.) RTA 1991. LNCS. vol. 488. Springer, Heidelberg (1991)
23. Schwartz, J.T.: On programming: An interim report on the SETL project. Technical report, Courant Institute, New York (1973)
24. Shankar, N.: Using decision procedures with a higher-order logic. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol. 2152. Springer, Heidelberg (2001)
25. Zarba, C.G.: Combining multisets with integers. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, Springer, Heidelberg (2002)