Results 1  10
of
37,400
Construction of abstract state graphs with PVS
, 1997
"... We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a reasonab ..."
Abstract

Cited by 741 (10 self)
 Add to MetaCart
. This successor m 0 can be determined exactly if for each predicate ' i it can be determined if ' i or :' i is a postcondition of m for ø . In order to do this, we use the Pvs theorem prover [SOR93] and our Pvsinterface defined in [GS96]. If the tactic used for the proof of the verification
The Matita Interactive Theorem Prover
"... Abstract. Matita is an interactive theorem prover being developed by the Helm team at the University of Bologna. Its stable version 0.5.x may be downloaded at ..."
Abstract

Cited by 21 (9 self)
 Add to MetaCart
Abstract. Matita is an interactive theorem prover being developed by the Helm team at the University of Bologna. Its stable version 0.5.x may be downloaded at
Program Refinement by Theorem Prover
 In BCS FACS Sixth Refinement Workshop  Theory and Practise of Formal Software Development. 5th  7th January
, 1994
"... We describe a prototype tool for developing programs by stepwise refinement in a weakest precondition framework, based on the HOL theorem proving system. Our work is based on a mechanisation of the refinement calculus, which is a theory of correctness preserving program transformations. We also use ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
We describe a prototype tool for developing programs by stepwise refinement in a weakest precondition framework, based on the HOL theorem proving system. Our work is based on a mechanisation of the refinement calculus, which is a theory of correctness preserving program transformations. We also use
The Mark2 Theorem Prover
"... ABSTRACT1 @ ?x: ?x = 68 Id @ ?x ["ID"] *)  s "?x";  rri "ID";ex();  p "ABSTRACT1@?x"; (* ABSTRACT2 @ ?x: ?f @ ?a = COMP != ?f @ (ABSTRACT @ ?x) =? ?a ["COMP"] *)  s "?f@?a";  rri "COMP";  right(); right(); r ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
"REDUCE";  s "?f@?x";  ri "ID";  ari "(RIGHT@REDUCE)*?COMP";  arri "(RL@REDUCE)*?RAISE0";  arri "ABSTRACT4@?x";  prove "REDUCE"; (* old approach to hypotheses *) (* equational forms of tactics given without proof
On Theorem Proverbased Testing
 UNDER CONSIDERATION FOR PUBLICATION IN FORMAL ASPECTS OF COMPUTING
, 2012
"... HOLTestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. As such, HOLTestGen allows for an integrated workflow supporting interactive theorem proving, test case generation, and test data generation. The HOLTestGen method is twostag ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
HOLTestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. As such, HOLTestGen allows for an integrated workflow supporting interactive theorem proving, test case generation, and test data generation. The HOLTestGen method is two
The ASMKeY Theorem Prover
"... Abstract. In [8], we presented a logic for Abstract State Machines (ASMs). In this technical report, we present an interactive theorem prover call ASMKeY where we implemented this logic. We also present a small case study to show the effectivness of our approach. 1 ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. In [8], we presented a logic for Abstract State Machines (ASMs). In this technical report, we present an interactive theorem prover call ASMKeY where we implemented this logic. We also present a small case study to show the effectivness of our approach. 1
Theorem Provers of LCF
, 1997
"... This paper describes the core of an interactive theorem prover, "HOL Light", and a derivative work for the personal computer called "Diet HOL". This theorem prover descended from a line of theorem proving tools in a family of "LCFstyle" provers. This paper also explain ..."
Abstract
 Add to MetaCart
This paper describes the core of an interactive theorem prover, "HOL Light", and a derivative work for the personal computer called "Diet HOL". This theorem prover descended from a line of theorem proving tools in a family of "LCFstyle" provers. This paper also
Theorem Prover Usability
, 2001
"... Introduction There is a large research group in the Cornell CS department on automated reasoning and theorem proving. They have developed a system of formal mathematics and a program called Nuprl[5] that allows users to state and prove theorems about mathematical and computational systems in a full ..."
Abstract
 Add to MetaCart
Introduction There is a large research group in the Cornell CS department on automated reasoning and theorem proving. They have developed a system of formal mathematics and a program called Nuprl[5] that allows users to state and prove theorems about mathematical and computational systems in a
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
Results 1  10
of
37,400