scientific article; zbMATH DE number 5198531
From MaRDI portal
Publication:5309032
zbMath1129.68022MaRDI QIDQ5309032
Clark Barrett, Igor Shikanian, Cesare Tinelli
Publication date: 9 October 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (20)
A decision procedure for (co)datatypes in SMT solvers ⋮ Satisfiability Modulo Theories ⋮ A Decision Procedure for (Co)datatypes in SMT Solvers ⋮ Symbolic automatic relations and their applications to SMT and CHC solving ⋮ Metalevel algorithms for variant satisfiability ⋮ Reasoning about vectors: satisfiability modulo a theory of sequences ⋮ Combining stable infiniteness and (strong) politeness ⋮ Synthesising programs with non-trivial constants ⋮ Solving constrained Horn clauses over algebraic data types ⋮ A Rewriting Approach to the Combination of Data Structures with Bridging Theories ⋮ Verification of component-based systems with recursive architectures ⋮ Unnamed Item ⋮ Variant-Based Satisfiability in Initial Algebras ⋮ Refutation-based synthesis in SMT ⋮ Politeness and combination methods for theories with bridging functions ⋮ Politeness and stable infiniteness: stronger together ⋮ Metalevel Algorithms for Variant Satisfiability ⋮ Polite combination of algebraic datatypes ⋮ Politeness for the theory of algebraic datatypes ⋮ Reasoning in the theory of heap: satisfiability and interpolation
Uses Software
This page was built for publication:
