Fractional collections with cardinality bounds, and mixed linear arithmetic with stars

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

Volumn 5213 LNCS, Issue , 2008, Pages 124-138

  Piskac, Ruzica ^a   Kuncak, Viktor ^a  

^a EPFL   (Switzerland)

Author keywords

Cardinality operator; Fuzzy sets; Mixed linear integer rational arithmetic; Multisets; Sets; Verification and program analysis

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTABILITY AND DECIDABILITY; COMPUTERS; CRYSTAL LATTICES; FUZZY SETS; TECHNICAL PRESENTATIONS; VERIFICATION;

CARDINALITY OPERATOR; CHARACTERISTIC FUNCTIONS; DECISION PROCEDURES; FINITE UNIVERSES; LINEAR ARITHMETICS; LOGICAL CONSTRAINTS; MIXED INTEGERS; MIXED LINEAR INTEGER-RATIONAL ARITHMETIC; MULTISETS; QUANTIFIER ELIMINATIONS; RATIONAL NUMBERS; REACHABILITY PROBLEMS; SATISFIABILITY; SETS; SOFTWARE VERIFICATIONS; SOLUTION SETS; TRANSITION SYSTEMS; VECTOR ADDITIONS;

MATHEMATICAL OPERATORS;

EID: 57849137473     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87531-411     Document Type: Conference Paper

References (20)

1. Berezin, S., Ganesh, V., Dill, D.L.: An online proof-producing decision procedure for mixed-integer linear arithmetic. In: TACAS (2003)
2. Bradley, A.R., Manna, Z.: The Calculus of Computation. Springer, Heidelberg (2007)
3. Dutertre, B., de Moura, L.: A Fast Linear-Arithmetic Solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006)
4. Dutertre, B., de Moura, L.: Integrating Simplex with DPLL(T). Technical Report SRI-CSL-06-01, SRI International (2006)
5. 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
6. Feferman, S., Vauglit, R.L.: The first order properties of products of algebraic systems. Fundamenta Mathematicae 47, 57-103 (1959)
7. Ginsburg, S.. Spanier, E.: Semigroups, Pressburger formulas and languages. Pacific Journal of Mathematics 16(2), 285-296 (1966)
8. Kuncak, V., Nguyen, H.H., Rinard, M.: Deciding Boolean Algebra with Presburger Arithmetic. J. of Automated Reasoning (2006), http://dx.doi.org/10. 1007/s10817-006-9042-1
9. 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)
10. Lugiez, D.: Multitree automata that count. Theor. Comput. Sci. 333(1-2), 225-263 (2005)
11. 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-2002.html
12. 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)
13. 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)
14. Piskac. R., Kuncak, V.: On linear arithmetic with stars. Technical Report LARA-REPORT-2008-005, EPFL (2008)
15. Pottier, L.: Minimal solutions of linear diophantine systems: Bounds and algorithms. In: Book, R. V. (ed.) RTA 1991. LNCS, vol. 488. Springer, Heidelberg (1991)
16. Pugh, W.: The Omega test: a fast and practical integer programming algorithm for dependence analysis. In: ACM/IEEE conf. Supercomputing (1991)
17. Schrijver. A.: Theory of Linear and Integer Programming. John Wiley & Sons, Chichester (1998)
18. Weispfenning, V.: Mixed real-integer linear quantifier elimination. In: ISSAC, pp. 129-136 (1999)
19. Zadeh, L.A.: Fuzzy sets. Information and Control 8, 338-353 (1965)
20. Zarba, C.G.: Combining multisets with integers. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI). vol. 2392. Springer. Heidelberg (2002)