Sciweavers

Share
22 search results - page 1 / 5
» Common subproofs in proof pairs
Sort
View
ENGL
2007
94views more  ENGL 2007»
9 years 1 months ago
Common subproofs in proof pairs
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
Guillermo Morales-Luna
CADE
2004
Springer
9 years 6 months ago
Improved Modular Termination Proofs Using Dependency Pairs
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
René Thiemann, Jürgen Giesl, Peter Sch...
TACAS
2005
Springer
113views Algorithms» more  TACAS 2005»
9 years 6 months ago
Applications of Craig Interpolants in Model Checking
Abstract. A Craig interpolant for a mutually inconsistent pair of formulas (A, B) is a formula that is (1) implied by A, (2) inconsistent with B, and (3) expressed over the common ...
Kenneth L. McMillan
TPHOL
2008
IEEE
9 years 7 months ago
Certifying a Termination Criterion Based on Graphs, without Graphs
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
Pierre Courtieu, Julien Forest, Xavier Urbain
books