Sciweavers

12774 search results - page 66 / 2555
» A Framework for Proof Systems
Sort
View
SIGSOFT
1993
ACM
14 years 28 days ago
Using Style to Understand Descriptions of Software Architecture
The software architecture of most systems is described informally and diagrammatically. In order for these descriptions to be meaningful at all, gures are understood by interpreti...
Gregory D. Abowd, Robert Allen, David Garlan
LICS
1991
IEEE
14 years 11 days ago
On the Deduction Rule and the Number of Proof Lines
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
Maria Luisa Bonet, Samuel R. Buss
ENTCS
2007
98views more  ENTCS 2007»
13 years 8 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
LPAR
2000
Springer
14 years 13 days ago
A Tactic Language for the System Coq
We propose a new tactic language for the system goq, which is intended to enrich the current tactic combinators (tacticals). This language is based on a functional core with recurs...
David Delahaye
AICOM
2010
127views more  AICOM 2010»
13 years 9 months ago
Interactive verification of concurrent systems using symbolic execution
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
Simon Bäumler, Michael Balser, Florian Nafz, ...