Sciweavers

290 search results - page 20 / 58
» Theorem Proving Using Lazy Proof Explication
Sort
View
73
Voted
JSYML
2007
79views more  JSYML 2007»
14 years 9 months ago
Models of non-well-founded sets via an indexed final coalgebra theorem
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of ...
Federico De Marchi, Benno van den Berg
ENTCS
2007
98views more  ENTCS 2007»
14 years 9 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow
88
Voted
CORR
2007
Springer
125views Education» more  CORR 2007»
14 years 9 months ago
Common knowledge logic in a higher order proof assistant?
This paper presents experiments on common knowledge logic, conducted with the help of the proof assistant Coq. The main feature of common knowledge logic is the eponymous modality...
Pierre Lescanne
JSC
2010
96views more  JSC 2010»
14 years 8 months ago
On a generalization of Stickelberger's Theorem
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
Peter Scheiblechner
DSD
2002
IEEE
102views Hardware» more  DSD 2002»
15 years 2 months ago
Formal Verification of a DSP Chip Using an Iterative Approach
In this paper we describe a methodology for the formal verification of a DSP chip using the HOL theorem prover. We used an iterative method to specify both the behavioral and stru...
Ali Habibi, Sofiène Tahar, Adel Ghazel