Frontiers of Combining Systems
From MaRDI portal
Publication:5491898
DOI10.1007/11559306zbMath1171.68715OpenAlexW4205914269MaRDI QIDQ5491898
Madanlal Musuvathi, Shuvendu K. Lahiri
Publication date: 10 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11559306
Related Items
Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness ⋮ Optimal length resolution refutations of difference constraint systems ⋮ On a generalization of Horn constraint systems ⋮ A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints ⋮ Reachability in choice networks ⋮ On the parallel complexity of constrained read-once refutations in UTVPI constraint systems ⋮ Integer feasibility and refutations in UTVPI constraints using bit-scaling ⋮ Neighborhood persistency of the linear optimization relaxation of integer linear optimization ⋮ A faster algorithm for determining the linear feasibility of systems of BTVPI constraints ⋮ The octatope abstract domain for verification of neural networks ⋮ Trichotomy for integer linear systems based on their sign patterns ⋮ A certifying algorithm for lattice point feasibility in a system of UTVPI constraints ⋮ Combining decision procedures by (model-)equality propagation ⋮ Analyzing fractional Horn constraint systems ⋮ Incremental closure for systems of two variables per inequality ⋮ Trichotomy for the reconfiguration problem of integer linear systems ⋮ Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints ⋮ A combinatorial certifying algorithm for linear feasibility in UTVPI constraints ⋮ Combining Decision Procedures by (Model-)Equality Propagation ⋮ Exact join detection for convex polyhedra and other numerical abstractions ⋮ Interpolant Generation for UTVPI ⋮ On integer closure in a system of unit two variable per inequality constraints ⋮ An Improved Tight Closure Algorithm for Integer Octagonal Constraints ⋮ An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints ⋮ On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems ⋮ Colors Make Theories Hard ⋮ Speeding up the Constraint-Based Method in Difference Logic ⋮ A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints ⋮ Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis ⋮ On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls ⋮ Theory decision by decomposition ⋮ Incrementally closing octagons ⋮ Feasibility checking in Horn constraint systems through a reduction based approach
Uses Software
