. In this paper an extension of the IFAD VDM-SL 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 to verify the consistency of a specification. Instead of providing error messages and warnings, the approach of generating proof obligations for the consistency of VDM-SL specifications is taken. The overall goal of this work is to automate the generation of proof obligations for VDM-SL. Proof obligation generation has already been carried out for a number of related notations, but VDM-SL contains a number of challenging constructs (e.g. pattern...
The correct definition and implementation of non-trivial type systems is difficult and requires expe...
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a progr...
This dissertation discusses several problems loosely related, because they all involve a verificatio...
. This paper presents a method for translating a subset of VDM-SL to higher order logic, more specif...
. This paper describes the theorem proving component of a larger software development environment fo...
Type systems for static programming languages are supposed to ensure the absence of type errors in c...
Although consistency of formal models is crucial, consistency proofs should not be a large burden to...
The foundational goal of this work is the development of mechanizable proof rules and a verification...
Decisions about the logic underpinning a formal specification language have important consequences f...
Abstract. TLA+ is a formal specification language that is based on ZF set theory and the Temporal Lo...
A number of industrial software development standards mandate that safetycritical software component...
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a progr...
AbstractThis paper presents a new approach to the problem of guaranteeing that definite logic progra...
The correct definition and implementation of non-trivial type systems is difficult and requires expe...
The correct definition and implementation of non-trivial type systems is difficult and requires expe...
The correct definition and implementation of non-trivial type systems is difficult and requires expe...
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a progr...
This dissertation discusses several problems loosely related, because they all involve a verificatio...
. This paper presents a method for translating a subset of VDM-SL to higher order logic, more specif...
. This paper describes the theorem proving component of a larger software development environment fo...
Type systems for static programming languages are supposed to ensure the absence of type errors in c...
Although consistency of formal models is crucial, consistency proofs should not be a large burden to...
The foundational goal of this work is the development of mechanizable proof rules and a verification...
Decisions about the logic underpinning a formal specification language have important consequences f...
Abstract. TLA+ is a formal specification language that is based on ZF set theory and the Temporal Lo...
A number of industrial software development standards mandate that safetycritical software component...
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a progr...
AbstractThis paper presents a new approach to the problem of guaranteeing that definite logic progra...
The correct definition and implementation of non-trivial type systems is difficult and requires expe...
The correct definition and implementation of non-trivial type systems is difficult and requires expe...
The correct definition and implementation of non-trivial type systems is difficult and requires expe...
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a progr...
This dissertation discusses several problems loosely related, because they all involve a verificatio...