Speeding up the Constraint-Based Method in Difference Logic

DOI10.1007/978-3-319-40970-2_18zbMath1475.68076OpenAlexW2505184053MaRDI QIDQ2818021

Daniel Larraz, Albert Rubio, Lorenzo Candeago, Enric Rodríguez-Carbonell, Albert Oliveras

Publication date: 5 September 2016

Published in: Theory and Applications of Satisfiability Testing – SAT 2016 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/102254

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computational aspects of satisfiability (68R07)

Uses Software

• vZ
• OptiMathSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boolean lexicographic optimization: algorithms \& applications
• SAT modulo linear arithmetic for solving polynomial constraints
• The octagon abstract domain
• Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
• Temporal constraint networks
• Constructing invariants for hybrid systems
• Solving Non-linear Arithmetic
• SMT-Based Array Invariant Generation
• Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions
• Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants
• Automatic modular abstractions for linear constraints
• Verification: Theory and Practice
• Invariant Synthesis for Combined Theories
• Frontiers of Combining Systems
• A Quantifier Elimination Algorithm for Linear Real Arithmetic
• Theory and Applications of Satisfiability Testing
• On SAT Modulo Theories and Optimization Problems
• Computer Aided Verification
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Speeding up the Constraint-Based Method in Difference Logic