Results 11  20
of
23
On automating process algebra proofs
 Proceedings of the 11th International Symposium on Computer and Information Sciences, ISCIS XI
, 1996
"... In [10] Groote and Springintveld incorporated several modeloriented techniques { such asinvariants, matching criteria, state mappings { in the processalgebraic framework of CRL for structuring and simplifying protocol veri cations. In this paper, we formalise these extensions in Coq, which is a pr ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
In [10] Groote and Springintveld incorporated several modeloriented techniques { such asinvariants, matching criteria, state mappings { in the processalgebraic framework of CRL for structuring and simplifying protocol veri cations. In this paper, we formalise these extensions in Coq, which is a proof development tool based on type theory. In the updated framework, the length of proof constructions is reduced significantly. Moreover, the new approach allows for more automation (proof generation) than was possible in the past. The results are illustrated by an example in which we prove two queue representations equal. 1
Exploiting Parallelism in Interactive Theorem Provers
 Proceedings of TPHOLs, volume 1479 of LNCS
, 1998
"... . This paper reports on the implementation and analysis of the MP refiner, the first parallel interactive theorem prover. The MP refiner is a shared memory multiprocessor implementation of the inference engine of Nuprl. The inference engine of Nuprl is called the refiner. The MP refiner is a co ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
. This paper reports on the implementation and analysis of the MP refiner, the first parallel interactive theorem prover. The MP refiner is a shared memory multiprocessor implementation of the inference engine of Nuprl. The inference engine of Nuprl is called the refiner. The MP refiner is a collection of threads operating as sequential refiners running on separate processors. Concurrent tactics exploit parallelism by spawning tactics to be evaluated by other refiner threads simultaneously. Tests conducted with the MP refiner running on a four processor Sparc shared memory multiprocessor reveal that parallelism at the inference rule level can significantly decrease the elapsed time of constructing proofs interactively. 1 Introduction An interactive theorem prover is a computer program that employs automated deduction to construct proofs with the aid of a user. Many interactive theorem provers require users to supply programs, called tactics, to carry out inference. Tacti...
Final Semantics for the picalculus
, 1998
"... In this paper we discuss final semantics for the calculus, a process algebra which models systems that can dynamically change the topology of the channels. We show that the final semantics paradigm, originated by Aczel and Rutten for CCSlike languages, can be successfully applied also here. This i ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this paper we discuss final semantics for the calculus, a process algebra which models systems that can dynamically change the topology of the channels. We show that the final semantics paradigm, originated by Aczel and Rutten for CCSlike languages, can be successfully applied also here. This is achieved by suitably generalizing the standard techniques so as to accommodate the mechanism of name creation and the behaviour of the binding operators peculiar to the calculus. As a preliminary step, we give a higher order presentation of the calculus using as metalanguage LF , a logical framework based on typed calculus. Such a presentation highlights the nature of the binding operators and elucidates the role of free and bound channels. The final semantics is defined making use of this higher order presentation, within a category of hypersets.
A decision procedure for Direct Predicate Calculus Study and implementation in the system Coq
, 1995
"... The paper of J. Ketonen and R. Weyhrauch[6] defines a decidable fragment of firstorder predicate logic  Direct Predicate Calculus  as the subset which is provable in Gentzen sequent calculus without the contraction rule, and gives an effective decision procedure for it. This report is a detaile ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The paper of J. Ketonen and R. Weyhrauch[6] defines a decidable fragment of firstorder predicate logic  Direct Predicate Calculus  as the subset which is provable in Gentzen sequent calculus without the contraction rule, and gives an effective decision procedure for it. This report is a detailed study of this procedure. We extend the decidability to nonprenex formulas. We prove that the intuitionnistic fragment is still decidable, with a refinement of the same procedure. An intuitionnistic version has been implemented in the system Coq [2] using a translation into natural deduction.
Automated Deductive Verification of Parallel Systems
, 1997
"... This paper describes the use of deductive methods for the verification of invariance properties of parallel systems. We show how a combination of proof rules, invariant generation techniques and abstraction techniques integrated to a theorem prover can be used effectively to prove invariants of syst ..."
Abstract
 Add to MetaCart
This paper describes the use of deductive methods for the verification of invariance properties of parallel systems. We show how a combination of proof rules, invariant generation techniques and abstraction techniques integrated to a theorem prover can be used effectively to prove invariants of systems given as a parallel composition of sequential processes with infinite data types. We present an implementation of these various techniques in our tool the InvariantChecker. The InvariantChecker is build as a frontend for the Pvs theorem prover. The tool is an extension of the Pvs specification language to handle the notion of transition systems describing the parallel composition of sequential processes. The Pvs prover is also extended with a new proof scheme corresponding to the combination of our proof techniques.
SyntaxDirected Amorphous Slicing
"... An amorphous slice of a program is constructed with respect to a set of variables. The amorphous slice is an executable program which preserves the behaviour of the original on the variables of interest. Unlike syntax{preserving slices, amorphous slices need not preserve a projection of the syntax ..."
Abstract
 Add to MetaCart
An amorphous slice of a program is constructed with respect to a set of variables. The amorphous slice is an executable program which preserves the behaviour of the original on the variables of interest. Unlike syntax{preserving slices, amorphous slices need not preserve a projection of the syntax of a program. This makes the task of amorphous slice construction harder, but it also often makes the result thinner and thereby preferable in applications where syntax preservation is unimportant.
A Module Calculus Enjoying the SubjectReduction Property
, 1996
"... The module system of SML is a small typed language of its own. As is, one would expect a proof of its soundness following from a proof of subject reduction, but none exists. As a consequence the theoretical study of reductions is difficult, and for instance, the question of normalization of the m ..."
Abstract
 Add to MetaCart
The module system of SML is a small typed language of its own. As is, one would expect a proof of its soundness following from a proof of subject reduction, but none exists. As a consequence the theoretical study of reductions is difficult, and for instance, the question of normalization of the module calculus can not even be asked. In this paper, we build a variant of the SML module system  inspired from recent works  which enjoys the subject reduction property. This was the initial motivation. Besides our system enjoys other typetheoretic properties: the obtained calculus is strongly normalizing, there are no syntactic restrictions on module paths, it enjoys a purely applicative semantic, every module has a principal type, and type inference is decidable. Moreover we conjecture that type abstraction  achieved through an explicit declaration of the signature of a module at its definition  is preserved. Keywords: Module systems, subjectreduction, normalization,...
Formalising LPOs and Invariants in Coq
"... In the setting of CRL, the notions of `linear process operator (LPO) ' and `invariant' are implemented in Coq, which isa a proof development tool based on type theory. As a rst experiment wehavecomputerchecked a general property of a binary search program in the new framework. 1 ..."
Abstract
 Add to MetaCart
In the setting of CRL, the notions of `linear process operator (LPO) ' and `invariant' are implemented in Coq, which isa a proof development tool based on type theory. As a rst experiment wehavecomputerchecked a general property of a binary search program in the new framework. 1