Theoretical Aspects of Computing – ICTAC 2005

DOI10.1007/11560647zbMath1169.68509OpenAlexW4300984554MaRDI QIDQ5395131

Duc-Khanh Tran, Silvio Ranise, Christophe Ringeissen, Hélène Kirchner

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11560647

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

Superposition for Bounded Domains ⋮ Automatic decidability and combinability ⋮ Variant-Based Satisfiability in Initial Algebras ⋮ Satisfiability Procedures for Combination of Theories Sharing Integer Offsets ⋮ Data Structures with Arithmetic Constraints: A Non-disjoint Combination ⋮ Combination of convex theories: modularity, deduction completeness, and explanation

Uses Software

• SIMPLIFY
• E Theorem Prover

This page was built for publication: Theoretical Aspects of Computing – ICTAC 2005