Decision procedures for multisets with cardinality constraints

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

Volumn 4905 LNCS, Issue , 2008, Pages 218-232

  Piskac, Ruzica ^a   Kuncak, Viktor ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CASE BASED REASONING; CONSTRAINT THEORY; DATA STRUCTURES; DECISION MAKING; POLYNOMIALS; THEOREM PROVING; VERIFICATION;

CONSTRAINT LANGUAGES; DECISION PROCEDURES; SOFTWARE VERIFICATION;

COMPUTER SOFTWARE;

EID: 40549114266     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78163-9_20     Document Type: Conference Paper

References (25)

1. Aiken, A.: Introduction to set constraint-based program analysis. Science of Computer Programming 35, 79-111 (1999)
2. Banâtre, J.-P., Le Métayer, D.: Programming by multiset transformation. Commun. ACM 36(1), 98-111 (1993)
3. Bès, A.: Definability and decidability results related to the elementary theory of ordinal multiplication. Fund.Math. 171, 197-211 (2002)
4. Domenjoud, E.: Solving systems of linear diophantine equations: An algebraic approach. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol. 520, pp. 141-150. Springer, Heidelberg (1991)
5. Durand, A., Hermann, M., Kolaitis, P.G.: Subtractive reductions and complete problems for counting complexity classes. Theor. Comput. Sci. 340(3), 496-513 (2005)
6. Eisenbrand, F., Shmonin, G.: Carathéodory bounds for integer cones. Operations Research Letters 34(5), 564-568 (2006)
7. Feferman, S., Vaught, R.,L.: The first order properties of products of algebraic systems. Fundamenta Mathematicae 47, 57-103 (1959)
8. Ginsburg, S., Spanier, E.: Semigroups, Pressburger formulas and languages. Pacific Journal of Mathematics 16(2), 285-296 (1966)
9. Kuncak, V.: Modular Data Structure Verification. PhD thesis, EECS Department, Massachusetts Institute of Technology (February 2007)
10. Kuncak, V., Nguyen, H.H., Rinard, M.: Deciding Boolean Algebra, with Presburger Arithmetic. J. of Automated Reasoning (2006)
11. Kuncak, V., Rinard, M.: On the theory of structural subtyping. Technical Report 879, LCS, Massachusetts Institute of Technology (2003)
12. Kuncak, V., Rinard, M.: Towards efficient satisfiability checking for Boolean Algebra with Presburger Arithmetic. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, Springer, Heidelberg (2007)
13. Lugiez, D.: Multitree automata that count. Theor. Comput. Sci. 333(1-2), 225-263 (2005)
14. Lugiez, D., Zilio, S.D.: Multitrees Automata, Presburger's Constraints and Tree Logics. Research report 08-2002, LIF, Marseille, France (June 2002), http://www.lif-sud.univ-mrs.fr/Rapports/08-08-2002.html
15. Marnette, B., Kuncak, V., Rinard, M.: On algorithms and complexity for sets with cardinality constraints. Technical report, MIT CSAIL (August 2005)
16. Matiyasevich, Y. V.: Enumerable sets are Diophantine. Soviet Math. Doklady 11(2), 354-357 (1970)
17. Misra, J.: A logic for concurrent programming (in two parts): Safety and progress. Journal of Computer and Software Engineering 3(2), 239-300 (1995)
18. Nguyen, H.H., et al.: Automated verification of shape, size and bag properties via, separation logic. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, Springer, Heidelberg (2007)
19. Nipkow, T., Paulson, L.C., Wenzel, M.T. (eds.): Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
20. Nipkow, T., et al.: Multiset theory version 1.30 (Isabelle distribution) (2005), http://isabelle.in.tum.de/dist/library/HOL/Library/Multiset.html
21. Papadimitriou, C.H.: On the complexity of integer programming. J. ACM 28(4), 765-768 (1981)
22. Paulson, L.C.: Mechanizing a theory of program composition for UNITY. ACM Trans. Program. Lang. Syst. 23(5), 626-656 (2001)
23. Pottier, L.: Minimal solutions of linear diophantine systems: Bounds and algorithms. In: Book, R.V. (ed.) RTA 1991. LNCS, vol. 488, Springer, Heidelberg (1991)
24. Schwartz, J.T.: On programming: An interim report on the SETL project. Technical report, Courant Institute, New York (1973)
25. Zarba, C.G.: Combining multisets with integers. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, Springer, Heidelberg (2002)