Cover Algorithms and Their Combination

DOI10.1007/978-3-540-78739-6_16MaRDI QIDQ5458397zbMATH OpenOpenAlexFDO

Authors Sumit Gulwani, Madan Musuvathi

Publication date 11 April 2008

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78739-6_16

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Deciding Combinations of Theories
• Efficient symbolic analysis of programs
• Model-based theory combination
• Unions of non-disjoint theories and combinations of satisfiability procedures
• On Shostak's decision procedure for combinations of theories

Cited in

(12)

• Conditional congruence closure over uninterpreted and interpreted symbols
• Model completeness, uniform interpolants and superposition calculus. (With applications to verification of data-aware processes)
• Combination of uniform interpolants via Beth definability
• Combined covers and Beth definability
• CTL* model checking for data-aware dynamic systems with arithmetic
• Model completeness, covers and superposition
• Two simple algorithms for bin covering
• Uniform interpolants in \(\mathcal{EUF}\): algorithms using DAG-representations
• Interpolation and Symbol Elimination
• On symbol elimination and uniform interpolation in theory extensions
• Interpolating parametric array theories
• Angle covers: algorithms and complexity

This page was built for publication: Cover Algorithms and Their Combination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458397)