Sciweavers

115 search results - page 4 / 23
» Proof Theory for Kleene Algebra
Sort
View
SOSL
1993
13 years 11 months ago
Verifying Process Algebra Proofs in Type Theory
In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typed -calculus. Inhabitants (terms) of these ty...
M. P. A. Sellink
LPAR
2005
Springer
14 years 28 days ago
Towards Automated Proof Support for Probabilistic Distributed Systems
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...
Annabelle McIver, Tjark Weber
CTCS
1989
Springer
13 years 11 months ago
Temporal Structures
We combine the principles of the Floyd-Warshall-Kleene algorithm, enriched categories, and Birkhoff arithmetic, to yield a useful class of algebras of transitive vertex-labeled s...
Ross Casley, Roger F. Crew, José Meseguer, ...
TPHOL
1999
IEEE
13 years 11 months ago
Universal Algebra in Type Theory
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. ...
Venanzio Capretta
ENTCS
2008
125views more  ENTCS 2008»
13 years 7 months ago
Can Refinement be Automated?
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
Peter Höfner, Georg Struth