Results 1  10
of
566
On the Spreadsheet Presentation of Proof Obligations
"... . A compact and structured format for presenting proof obligations is described. The format places the formulas and proof obligations in the form of a spreadsheet, where rows are formulas, columns are obligations, and cells record whether and how a formula appears in an obligation. This spreadsheet ..."
Abstract
 Add to MetaCart
. A compact and structured format for presenting proof obligations is described. The format places the formulas and proof obligations in the form of a spreadsheet, where rows are formulas, columns are obligations, and cells record whether and how a formula appears in an obligation. This spreadsheet
Proof Obligations for Monomorphicity
, 1995
"... In certain applications of formal methods to development of correct software one wants the requirement specification to be monomorphic, i.e. that every two termgenerated models of it are isomorphic. Consequently, the question arises how to guarantee monomorphicity (which is not decidable in general ..."
Abstract
 Add to MetaCart
verification. We prove correctness and completeness of our method. Contents 1 Introduction 2 2 Basic Definitions 3 3 Monomorphicity Criteria 18 4 Proof Obligations in Dynamic Logic 22 5 Conclusion and Future Work 32 A An Instructive Example 34 This work was supported under grants no. Me 672
Proof Obligations for Monomorphicity
, 1995
"... In certain applications of formal methods to development of correct software one wants the requirement specification to be monomorphic, i.e. that every two termgenerated models of it are isomorphic. Consequently, the question arises how to guarantee monomorphicity (which is not decidable in general ..."
Abstract
 Add to MetaCart
verification. We prove correctness and completeness of our method. Contents 1 Introduction 2 2 Basic Definitions 3 3 Monomorphicity Criteria 18 4 Proof Obligations in Dynamic Logic 22 5 Conclusion and Future Work 32 A An Instructive Example 34 This work was supported under grants no. Me 672
Generating Proof Obligations
"... Swiss Federal Institute of Technology Zurich Software Component Technology Group Semester Project ..."
Abstract
 Add to MetaCart
Swiss Federal Institute of Technology Zurich Software Component Technology Group Semester Project
Architectural Specifications, Proof Obligations, and Decomposition
, 1997
"... Architectural specifications can express correctness requirements of concurrent systems at a high level without any reference to component functionality. Then proof obligations derived from such specifications can be discharged as model checking tasks in a suitable behavioral model where components ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Architectural specifications can express correctness requirements of concurrent systems at a high level without any reference to component functionality. Then proof obligations derived from such specifications can be discharged as model checking tasks in a suitable behavioral model where components
Configurable Proof Obligations in the Frog Toolkit
 IN PROC. FIFTH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND FORMAL METHODS, IEEE COMPUTER
, 2007
"... In model based formal methods, incompatible tools for different techniques is the norm. However, greater applicability to industrial scale systems increasingly requires combining the strengths of different techniques, in line with the Verification Grand Challenge. The Frog tool embodies a construct ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
based specification syntax, and its metalanguage FrogCCL allows the generic configuration of both a construct’s syntax and its proof obligations. For a specific system, Frog generates the system’s verification conditions mechanically from the generic ones. Relationships between systems such as refinement
Proof Obligations for RealTime Refinement
 In 6th Refinement Workshop, edited by D. Till, BCS
, 1993
"... Existing "algorithm design" rules, for refining Z specifications to structured highlevel language code, are extended with proof obligations that preserve specified realtime, as well as functional, behaviour. 1 Introduction Existing refinement methods provide a means of developing progra ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Existing "algorithm design" rules, for refining Z specifications to structured highlevel language code, are extended with proof obligations that preserve specified realtime, as well as functional, behaviour. 1 Introduction Existing refinement methods provide a means of developing
A Proof Obligation Generator for VDMSL
 In FME'97, LNCS 1313
, 1997
"... . In this paper an extension of the IFAD VDMSL Toolbox with a proof obligation generator is described. Static type checking in VDM is undecidable in general and therefore the type checker must be incomplete. Hence, for the "difficult" parts introducing undecidability, it is up to the user ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
. In this paper an extension of the IFAD VDMSL Toolbox with a proof obligation generator is described. Static type checking in VDM is undecidable in general and therefore the type checker must be incomplete. Hence, for the "difficult" parts introducing undecidability, it is up
Formal specification of Proof Obligation Generation in CARE
, 1995
"... The Care method and toolset have been described elsewhere. This report gives a formal specification of the process of generating the proof obligations which check the correctness of programs written in the Care language. ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
The Care method and toolset have been described elsewhere. This report gives a formal specification of the process of generating the proof obligations which check the correctness of programs written in the Care language.
Minimal Proof Obligations for Ordered Sets
"... We show how the smallest set of lemmas can be generated that is sufficient to prove an assumed partialorder relation on a finite set. This idea is developed from a mathematical formulation up to an algorithm implemented in ML. The process of establishing a Hasse diagram from a set of subsets serves ..."
Abstract
 Add to MetaCart
We show how the smallest set of lemmas can be generated that is sufficient to prove an assumed partialorder relation on a finite set. This idea is developed from a mathematical formulation up to an algorithm implemented in ML. The process of establishing a Hasse diagram from a set of subsets serves as an applicative example.
Results 1  10
of
566