Results 1  10
of
36
Labelled Propositional Modal Logics: Theory and Practice
, 1996
"... We show how labelled deductive systems can be combined with a logical framework to provide a natural deduction implementation of a large and wellknown class of propositional modal logics (including K, D, T , B, S4, S4:2, KD45, S5). Our approach is modular and based on a separation between a base lo ..."
Abstract

Cited by 34 (8 self)
 Add to MetaCart
We show how labelled deductive systems can be combined with a logical framework to provide a natural deduction implementation of a large and wellknown class of propositional modal logics (including K, D, T , B, S4, S4:2, KD45, S5). Our approach is modular and based on a separation between a base logic and a labelling algebra, which interact through a fixed interface. While the base logic stays fixed, different modal logics are generated by plugging in appropriate algebras. This leads to a hierarchical structuring of modal logics with inheritance of theorems. Moreover, it allows modular correctness proofs, both with respect to soundness and completeness for semantics, and faithfulness and adequacy of the implementation. We also investigate the tradeoffs in possible labelled presentations: We show that a narrow interface between the base logic and the labelling algebra supports modularity and provides an attractive prooftheory (in comparision to, e.g., semantic embedding) but limits th...
Mechanical proofs about a nonrepudiation protocol
 Theorem Proving in Higher Order Logics: TPHOLs 2001, LNCS 2152
, 2001
"... Abstract. A nonrepudiation protocol of Zhou and Gollmann [18] has been mechanically verified. A nonrepudiation protocol gives each party evidence that the other party indeed participated, evidence sufficient to present to a judge in the event of a dispute. We use the theoremprover Isabelle [10] a ..."
Abstract

Cited by 27 (3 self)
 Add to MetaCart
Abstract. A nonrepudiation protocol of Zhou and Gollmann [18] has been mechanically verified. A nonrepudiation protocol gives each party evidence that the other party indeed participated, evidence sufficient to present to a judge in the event of a dispute. We use the theoremprover Isabelle [10] and model the security protocol by an inductive definition, as described elsewhere [1, 12]. We prove the protocol goals of validity of evidence and of fairness using simple strategies. A typical theorem states that a given piece of evidence can only exist if a specific event took place involving the other party. 1
Structured Specifications and Interactive Proofs with KIV
, 1998
"... The aim of this chapter is to describe the integrated specification and theorem proving environment of KIV. KIV is an advanced tool for developing high assurance systems. It supports:  hierarchical formal specification of software and system designs  specification of safety/security models  ..."
Abstract

Cited by 27 (23 self)
 Add to MetaCart
The aim of this chapter is to describe the integrated specification and theorem proving environment of KIV. KIV is an advanced tool for developing high assurance systems. It supports:  hierarchical formal specification of software and system designs  specification of safety/security models  proving properties of specifications  modular implementation of specification components  modular verification of implementations  incremental verification and error correction  reuse of specifications, proofs, and verified components KIV supports the entire design process from formal specifications to verified code. It supports functional as well as statebased modeling. KIV is ready for use, and has been tested in a number of indu...
Integrating HolCasl into the Development Graph Manager
 In A. Armando (Ed.) Frontiers of Combining Systems (FroCoS '02), Santa Margherita Ligure, Italy, Springer LNAI
"... For the recently developed specification language Casl, there exist two different kinds of proof support: while HOLCasl has its strength in proofs about specifications inthesmall, Maya has been designed for management of proofs in (Casl) specifications inthelarge, within an evolutionary formal ..."
Abstract

Cited by 18 (13 self)
 Add to MetaCart
For the recently developed specification language Casl, there exist two different kinds of proof support: while HOLCasl has its strength in proofs about specifications inthesmall, Maya has been designed for management of proofs in (Casl) specifications inthelarge, within an evolutionary formal software development process involving changes of specifications. In this work, we discuss our integration of HOLCasl and Maya into a powerful system providing tool support for Casl, which will also serve as a basis for the integration of further proof tools.
A generic theorem prover of CSP refinement
 In TACAS 2005, LNCS 3440
, 2005
"... Abstract. We describe a new tool called CspProver which is an interactive theorem prover dedicated to refinement proofs within the process algebra Csp. It aims specifically at proofs for infinite state systems, which may also involve infinite nondeterminism. Semantically, CspProver supports both ..."
Abstract

Cited by 17 (11 self)
 Add to MetaCart
Abstract. We describe a new tool called CspProver which is an interactive theorem prover dedicated to refinement proofs within the process algebra Csp. It aims specifically at proofs for infinite state systems, which may also involve infinite nondeterminism. Semantically, CspProver supports both the theory of complete metric spaces as well as the theory of complete partial orders. Both these theories are implemented for infinite product spaces. Technically, CspProver is based on the theorem prover Isabelle. It provides a deep encoding of Csp. The tool’s architecture follows a generic approach which makes it easy to adapt it for various Csp models besides those studied here: the stable failures model F and the traces model T. 1
Labelled Modal Logics: Quantifiers
, 1998
"... . In previous work we gave an approach, based on labelled natural deduction, for formalizing proof systems for a large class of propositional modal logics that includes K, D, T, B, S4, S4:2, KD45, and S5. Here we extend this approach to quantified modal logics, providing formalizations for logic ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
. In previous work we gave an approach, based on labelled natural deduction, for formalizing proof systems for a large class of propositional modal logics that includes K, D, T, B, S4, S4:2, KD45, and S5. Here we extend this approach to quantified modal logics, providing formalizations for logics with varying, increasing, decreasing, or constant domains. The result is modular with respect to both properties of the accessibility relation in the Kripke frame and the way domains of individuals change between worlds. Our approach has a modular metatheory too; soundness, completeness and normalization are proved uniformly for every logic in our class. Finally, our work leads to a simple implementation of a modal logic theorem prover in a standard logical framework. 1 Introduction Motivation Modal logic is an active area of research in computer science and artificial intelligence: a large number of modal logics have been studied and new ones are frequently proposed. Each new log...
The Development Graph Manager MAYA
, 2002
"... on inthelarge to exploit the structure of the speci cation, and maintains the veri cation work already done when changing the speci cation. Maya relies on development graphs as a uniform representation of structured speci cations, which enables the use of various (structured) speci cation lan ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
on inthelarge to exploit the structure of the speci cation, and maintains the veri cation work already done when changing the speci cation. Maya relies on development graphs as a uniform representation of structured speci cations, which enables the use of various (structured) speci cation languages like Casl [3] and VseSl [10] to formalise the software development. To this end Maya provides a generic interface to plug in additional parsers for the support of other speci cation languages. Moreover, Maya allows the integration of dierent theorem provers to deal with the actual proof obligations arising from the speci cation, i.e. to perform veri cation inthesmall. Textual speci cations are translated into a structured logical representation called a development graph [1, 4], which is based on the notions of consequence relations and morphisms and makes arising proof obligations explicit. The user can tackle these proof obligations with the help of theorem provers connecte
Natural Deduction for NonClassical Logics
, 1996
"... We present a framework for machine implementation of families of nonclassical logics with Kripkestyle semantics. We decompose a logic into two interacting parts, each a natural deduction system: a base logic of labelled formulae, and a theory of labels characterizing the properties of the Kripke m ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We present a framework for machine implementation of families of nonclassical logics with Kripkestyle semantics. We decompose a logic into two interacting parts, each a natural deduction system: a base logic of labelled formulae, and a theory of labels characterizing the properties of the Kripke models. By appropriate combinations we capture both partial and complete fragments of large families of nonclassical logics such as modal, relevance, and intuitionistic logics. Our approach is modular and supports uniform proofs of correctness and proof normalization. We have implemented our work in the Isabelle Logical Framework.
TAS and IsaWin: Tools for transformational program developkment and theorem proving
 FUNDAMENTAL APPROACHES TO SOFTWARE ENGINEERING FASE’99, NUMBER 1577 IN LECTURE NOTES IN COMPUTER SCIENCE
, 1999
"... ..."