Automated theorem proving by test set induction
From MaRDI portal
Publication:1355757
DOI10.1006/jsco.1996.0076zbMath0878.68108OpenAlexW1996064523MaRDI QIDQ1355757
Publication date: 28 May 1997
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/85cdc6fadd724d3d81f49ec12576436d403b7866
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Verifying Procedural Programs via Constrained Rewriting Induction ⋮ Tool-assisted specification and verification of typed low-level languages ⋮ On transforming cut- and quantifier-free cyclic proofs into rewriting-induction proofs ⋮ Test sets for the universal and existential closure of regular tree languages. ⋮ Incorporating decision procedures in implicit induction. ⋮ Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities ⋮ Superposition for Fixed Domains ⋮ Automated Induction with Constrained Tree Automata ⋮ Specification and proof in membership equational logic ⋮ A general framework to build contextual cover set induction provers ⋮ Deciding the Inductive Validity of ∀ ∃ * Queries ⋮ Automata-driven automated induction ⋮ Observational proofs by rewriting.
Uses Software
This page was built for publication: Automated theorem proving by test set induction
