Ordered sets in the calculus of data structures

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

Volumn 6247 LNCS, Issue , 2010, Pages 34-48

  Kuncak, Viktor ^a   Piskac, Ruzica ^a   Suter, Philippe ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT REDUCTION; CARDINALITIES; CONSTRAINT SOLVERS; LINEAR ARITHMETIC; LOGICAL CONSTRAINTS; MIXED INTEGER; MONADIC SECOND-ORDER LOGIC; NEW MEMBERS; NP COMPLETE; OBSERVABLE BEHAVIOR; ORDERED SET; PRESBURGER ARITHMETIC; PRIORITY QUEUES; QUANTIFIER ELIMINATION; REAL NUMBER; SATISFIABILITY; SOFTWARE VERIFICATION; SUPREMUM; SYNTHESIS PROBLEMS;

BOOLEAN ALGEBRA; CALCULATIONS; COMPUTER SCIENCE; DATA REDUCTION; DATA STRUCTURES; NUMBER THEORY; REAL VARIABLES; TECHNICAL PRESENTATIONS; VERIFICATION;

COMPUTABILITY AND DECIDABILITY;

EID: 77956581621     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15205-4_5     Document Type: Conference Paper

References (26)

1. Eisenbrand, F., Shmonin, G.: Carath́eodory bounds for integer cones. Operations Research Letters 34(5), 564-568 (2006), http://dx.doi.org/10. 1016/j.orl.2005.09.008
2. Feferman, S., Vaught, R.L.: The first order properties of products of algebraic systems. Fundamenta Mathematicae 47, 57-103 (1959)
3. Ghilardi, S.: Model theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning 33(3-4), 221-249 (2005)
4. Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: DPLL(T): Fast decision procedures. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.3114, pp. 175-188. Springer, Heidelberg (2004)
5. Kuncak, V., Mayer, M., Piskac, R., Suter, P.: Complete functional synthesis. In: PLDI (2010)
6. Kuncak, V., Nguyen, H.H., Rinard, M.: Deciding Boolean Algebra with Presburger Arithmetic. J. of Automated Reasoning (2006)
7. Kuncak, V., Piskac, R., Suter, P., Wies, T.: Building a calculus of data structures. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol.5944, pp. 26-44. Springer, Heidelberg (2010)
8. 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)
9. Laeuchli, H.: A decision procedure for the weak second order theory of linear order. Studies in Logic and the Foundat. of Math. 50, 189-197 (1968)
10. Manna, Z., Waldinger, R.: A deductive approach to program synthesis. ACM Trans. Program. Lang. Syst. 2(1), 90-121 (1980)
11. Odersky, M., Spoon, L., Venners, B.: Programming in Scala: a comprehensive step-by-step guide. Artima Press (2008)
12. Pratt-Hartmann, I.: Complexity of the two-variable fragment with counting quantifiers. Journal of Logic, Language and Information 14(3), 369-395 (2005)
13. Piskac, R., Kuncak, V.: Decision procedures for multisets with cardinality constraints. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol.4905, pp. 218-232. Springer, Heidelberg (2008)
14. Piskac, R., Kuncak, V.: Fractional collections with cardinality bounds. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.5213, pp. 124-138. Springer, Heidelberg (2008)
15. Piskac, R., Kuncak, V.: Linear arithmetic with stars. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.5123, pp. 268-280. Springer, Heidelberg (2008)
16. Pacholski, L., Szwast, W., Tendera, L.: Complexity results for first-order two-variable logic with counting. SIAM J. on Computing 29(4), 1083-1117 (2000)
17. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1-35 (1969)
18. Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc. s2-30, 264-286 (1930), doi:10.1112/plms/s2-30.1.264
19. Ranise, S., Ringeissen, C., Zarba, C.G.: Combining data structures with nonstably infinite theories using many-sorted logic. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol.3717, pp. 48-64. Springer, Heidelberg (2005)
20. Suter, P., Dotta, M., Kuncak, V.: Decision procedures for algebraic data types with abstractions. In: POPL (2010)
21. Shelah, S.: The monadic theory of order. The Annals of Mathematics of Mathematics 102(3), 379-419 (1975)
22. Sofronie-Stokkermans, V.: Hierarchical and modular reasoning in complex theories: The case of local theory extensions. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS (LNAI), vol.4720, pp. 47-71. Springer, Heidelberg (2007)
23. Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory 2(1), 57-81 (1968)
24. Weispfenning, V.: Mixed real-integer linear quantifier elimination. In: ISSAC, pp. 129-136 (1999)
25. Wies, T., Piskac, R., Kuncak, V.: Combining theories with shared set operations. In: Frontiers in Combining Systems (2009)
26. Yessenov, K., Piskac, R., Kuncak, V.: Collections, cardinalities, and relations. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol.5944, pp. 380-395. Springer, Heidelberg (2010)