Sciweavers

1818 search results - page 67 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
CAV
2003
Springer
107views Hardware» more  CAV 2003»
15 years 11 months ago
Theorem Proving Using Lazy Proof Explication
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
Cormac Flanagan, Rajeev Joshi, Xinming Ou, James B...
MKM
2009
Springer
16 years 5 days ago
A Logically Saturated Extension of
This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Autexier [4] on ¯λµ˜µ, a calculus introduced by Curien and Herbelin [5,6]. Jus...
Lionel Elie Mamane, Herman Geuvers, James McKinna
DIAGRAMS
2004
Springer
15 years 11 months ago
Automatic Proofs for Scalecharts
A scalechart is a set of statecharts, operating in a dense time domain, whose behavior is self-similar at different scales. The simplicity of extracting proofs of behavior from sc...
Richard Bosworth
151
Voted
CADE
2006
Springer
16 years 6 months ago
Geometric Resolution: A Proof Procedure Based on Finite Model Search
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...
Hans de Nivelle, Jia Meng
IPL
2007
105views more  IPL 2007»
15 years 5 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk