Results 11  20
of
4,835
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 ..."
Automatic support to mobile systems specification in Mob_adtl
"... This paper reports on preliminary experiences with the theorem prover Isabelle [7], that we are evaluating as a candidate technology to build a designer's assistant for the development of mobile systems in Mob adtl ..."
Abstract
 Add to MetaCart
This paper reports on preliminary experiences with the theorem prover Isabelle [7], that we are evaluating as a candidate technology to build a designer's assistant for the development of mobile systems in Mob adtl
Proving the Soundness of a Java Bytecode Verifier in Isabelle/HOL
, 1998
"... We have formalized large parts of the Java Virtual Machine (JVM) with the theorem prover Isabelle/HOL. Based on the work by Qian[Qia98], we have then formalized a specification for a Java bytecode verifier and formally proved the soundness of the specification. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We have formalized large parts of the Java Virtual Machine (JVM) with the theorem prover Isabelle/HOL. Based on the work by Qian[Qia98], we have then formalized a specification for a Java bytecode verifier and formally proved the soundness of the specification.
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 467 (48 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
Locales: A sectioning concept for Isabelle
 IN BERTOT ET AL
, 1999
"... Locales are a means to define local scopes for the interactive proving process of the theorem prover Isabelle. They delimit a range in which fixed assumption are made, and theorems are proved that depend on these assumptions. A locale may also contain constants defined locally and associated with pr ..."
Abstract

Cited by 45 (10 self)
 Add to MetaCart
Locales are a means to define local scopes for the interactive proving process of the theorem prover Isabelle. They delimit a range in which fixed assumption are made, and theorems are proved that depend on these assumptions. A locale may also contain constants defined locally and associated
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
Encoding ObjectZ in Isabelle/HOL
 International Conference of Z and B Users (ZB 2002), volume 2272 of LNCS
, 2002
"... In this paper, we present a formalisation of the reference semantics of ObjectZ in the higherorder logic (HOL) instantiation of the generic theorem prover Isabelle, Isabelle/HOL. This formalisation has the e#ect of both clarifying the semantics and providing the basis for a theorem prover for ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
In this paper, we present a formalisation of the reference semantics of ObjectZ in the higherorder logic (HOL) instantiation of the generic theorem prover Isabelle, Isabelle/HOL. This formalisation has the e#ect of both clarifying the semantics and providing the basis for a theorem prover
Hoare Logics in Isabelle/HOL
 PROOF AND SYSTEMRELIABILITY
, 2002
"... This paper describes Hoare logics for a number of imperative language constructs, from whileloops via exceptions to mutually recursive procedures. Both partial and total correctness are treated. In particular a proof system for total correctness of recursive procedures in the presence of unbounded ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
of unbounded nondeterminism is presented. All systems are formalized and shown to be sound and complete in the theorem prover Isabelle/HOL.
Gries/Owicki in Isabelle/HOL
"... We present a formalization of the Gries/Owicki method for correctness proofs of concurrent imperative programs with shared variables in the theorem prover Isabelle/HOL. Syntax, semantics and proof rules are defined in higherorder logic. The correctness of the proof rules w.r.t. the semantics is pro ..."
Abstract
 Add to MetaCart
We present a formalization of the Gries/Owicki method for correctness proofs of concurrent imperative programs with shared variables in the theorem prover Isabelle/HOL. Syntax, semantics and proof rules are defined in higherorder logic. The correctness of the proof rules w.r.t. the semantics
Formal Verification of Dead Code Elimination in Isabelle/HOL
"... Correct compilers are a vital precondition to ensure software correctness. Optimizations are the most errorprone phases in compilers. In this paper, we formally verify dead code elimination (DCE) within the theorem prover Isabelle/HOL. DCE is a popular optimization in compilers which is typically p ..."
Abstract
 Add to MetaCart
Correct compilers are a vital precondition to ensure software correctness. Optimizations are the most errorprone phases in compilers. In this paper, we formally verify dead code elimination (DCE) within the theorem prover Isabelle/HOL. DCE is a popular optimization in compilers which is typically
Results 11  20
of
4,835