Results 1  10
of
36,424
A Preliminary User's Manual for Isabelle
"... The theorem prover Isabelle and several of its objectlogics are described. Where ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
The theorem prover Isabelle and several of its objectlogics are described. Where
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (49 self)
 Add to MetaCart
Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized
Traces of I/OAutomata in Isabelle/HOLCF
 TAPSOFT'97: THEORY AND PRACTICE OF SOFTWARE DEVELOPMENT, VOLUME 1214 OF LNCS
, 1997
"... This paper presents a formalization of finite and infinite sequences in domain theory carried out in the theorem prover Isabelle. The results ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
This paper presents a formalization of finite and infinite sequences in domain theory carried out in the theorem prover Isabelle. The results
Theorem Prover Support for the Refinement of Stream Processing Functions
, 1997
"... In this paper, we show how to use the theorem prover Isabelle to provide tool support for Focus, a specification and verification framework for the stepwise development of distributed systems. FOCUS is ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper, we show how to use the theorem prover Isabelle to provide tool support for Focus, a specification and verification framework for the stepwise development of distributed systems. FOCUS is
An Encoding of TLA in Isabelle
, 1999
"... This note describes the representation of Lamport's Temporal Logic of Actions that comes with the standard distribution of the generic theorem prover Isabelle. It is based on a simple technique for embedding possibleworlds based logics in Isabelle. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This note describes the representation of Lamport's Temporal Logic of Actions that comes with the standard distribution of the generic theorem prover Isabelle. It is based on a simple technique for embedding possibleworlds based logics in Isabelle.
More ChurchRosser Proofs (in Isabelle/HOL)
 Journal of Automated Reasoning
, 1996
"... The proofs of the ChurchRosser theorems for fi, j and fi [ j reduction in untyped calculus are formalized in Isabelle/HOL, an implementation of Higher Order Logic in the generic theorem prover Isabelle. ..."
Abstract

Cited by 42 (4 self)
 Add to MetaCart
The proofs of the ChurchRosser theorems for fi, j and fi [ j reduction in untyped calculus are formalized in Isabelle/HOL, an implementation of Higher Order Logic in the generic theorem prover Isabelle.
An Isabellebased Theorem Prover for VDMSL
 In Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'97), LNCS
, 1997
"... . This paper describes the theorem proving component of a larger software development environment for the ISO standardized specification language VDMSL. This component is constructed as an instantiation of the generic theorem prover Isabelle with a VDMSL variant of the Logic of Partial Functions ( ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
. This paper describes the theorem proving component of a larger software development environment for the ISO standardized specification language VDMSL. This component is constructed as an instantiation of the generic theorem prover Isabelle with a VDMSL variant of the Logic of Partial Functions
Simplify: A theorem prover for program checking
 J. ACM
, 2003
"... This paper provides a detailed description of the automatic theorem prover Simplify, which is the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula3. Simplify uses the NelsonOppen method to combine decision procedures for several important theories, and also employs a matcher to ..."
Abstract

Cited by 432 (2 self)
 Add to MetaCart
This paper provides a detailed description of the automatic theorem prover Simplify, which is the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula3. Simplify uses the NelsonOppen method to combine decision procedures for several important theories, and also employs a matcher
Java Definite Assignment in Isabelle/HOL
 In Proc. of ECOOP Workshop on Formal Techniques for Javalike Programs, number 408 in Technical Report. ETH
, 2003
"... In Java the compiler guarantees that each local variable is initialised when we attempt to access it at runtime. This prohibits access to uninitialised memory during execution and is a key ingredient for type safety. We have formalised the definite assignment analysis of the Java compiler in the ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
in the theorem prover Isabelle/HOL and proved it correct.
Using Isabelle to Prove Properties of the Kerberos Authentication System
 In Proc. of Workshop on Design and Formal Verification of Security Protocols, Orman and Meadows (eds.), DIMACS
, 1997
"... The Inductive method, previously used to analyse classical, noncebased cryptographic protocols, is here tailored to formalise Kerberos, a realworld, timestampbased protocol. A complete formalisation of the whole protocol is achieved, and several guarantees about its entangled operation are proved ..."
Results 1  10
of
36,424