Formal techniques for specifying performance properties of programs (e.g., execution time) and for verifying the correctness of these specifications are developed. These techniques are extensions of well-known predicate transformer techniques for specifying and verifying purely functional properties of programs.</p
A methodology for deriving programs from specifications of observable behaviour is described. The cl...
The use of predicate transformers to model the action of sequential programs has allowed the constru...
The theoretical works on program testing by Goodenough and Gerhart, Howden, and Geller are unified a...
The invariant based programming is a technique of constructing correct programs by first identifying...
Reasoning about programs that use effects can be much harder than reasoning about their pure counter...
Symbolic execution provides a mechanism for formally proving programs correct. A notation is introdu...
The rapid increase in the significance of software systems has made software assurance a critical re...
Software practitioners have not widely adopted formal verification techniques in spite of the abilit...
Deductive program verification is an intricate and time-consuming task, in spite of significant adva...
International audienceSoftware development usually involves a collection of properties, programs and...
In order to contribute to the software reliability problem, tools have beend esigned inord er to ana...
This dissertation discusses several problems loosely related, because they all involve a verificatio...
Before distributing a program, programmers would like to know for certain that it does what it is in...
In this paper we will discuss one approach to achieving software reliability. In particular, where s...
Classifications: Software The research involves developing a theory of real-time process types for t...
A methodology for deriving programs from specifications of observable behaviour is described. The cl...
The use of predicate transformers to model the action of sequential programs has allowed the constru...
The theoretical works on program testing by Goodenough and Gerhart, Howden, and Geller are unified a...
The invariant based programming is a technique of constructing correct programs by first identifying...
Reasoning about programs that use effects can be much harder than reasoning about their pure counter...
Symbolic execution provides a mechanism for formally proving programs correct. A notation is introdu...
The rapid increase in the significance of software systems has made software assurance a critical re...
Software practitioners have not widely adopted formal verification techniques in spite of the abilit...
Deductive program verification is an intricate and time-consuming task, in spite of significant adva...
International audienceSoftware development usually involves a collection of properties, programs and...
In order to contribute to the software reliability problem, tools have beend esigned inord er to ana...
This dissertation discusses several problems loosely related, because they all involve a verificatio...
Before distributing a program, programmers would like to know for certain that it does what it is in...
In this paper we will discuss one approach to achieving software reliability. In particular, where s...
Classifications: Software The research involves developing a theory of real-time process types for t...
A methodology for deriving programs from specifications of observable behaviour is described. The cl...
The use of predicate transformers to model the action of sequential programs has allowed the constru...
The theoretical works on program testing by Goodenough and Gerhart, Howden, and Geller are unified a...
DOI
Add to ORKG