A practical algorithm for exact array dependence analysis
Communications of the ACM
Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms
RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Deciding Boolean Algebra with Presburger Arithmetic
Journal of Automated Reasoning
Theoretical Computer Science - Foundations of software science and computation structures
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
The Why/Krakatoa/Caduceus platform for deductive program verification
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Decision procedures for multisets with cardinality constraints
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Hi-index | 0.00 |
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multisets, and integers. Constraints over collections and integers are connected using the cardinality operator. Our logic is a fragment of logics of popular interactive theorem provers, and MUNCH is the first fully automated reasoner for this logic. MUNCH reduces input formulas to equisatisfiable linear integer arithmetic formulas. MUNCH reasoner is publicly available. It is implemented in the Scala programming language and currently uses the SMT solver Z3 to solve the generated integer linear arithmetic constraints.