Abstract. For specifying and reasoning about object-based programs it is often attractive for contracts to be expressed using calls to pure methods. It is useful for pure methods to have contracts, including read effects to support local rea-soning based on frame conditions. This leads to puzzles such as the use of a pure method in its own contract. These ideas have been explored in connection with verification tools based on axiomatic semantics, guided by the need to avoid log-ical inconsistency, and focusing on encodings that cater for first order automated provers. This paper adds pure methods and read effects to region logic, a first-order program logic that features frame-based local reasoning and a proof rule for linking of clients wi...
Framing is important for specification and verification of object-oriented programs. This dissertati...
We propose a novel logic, called Frame Logic (abbr., F-logic), that accounts in a clean, declarative...
This paper proposes the development of a logic for verifying properties of programs in rewriting log...
Abstract. For specifying and reasoning about object-based programs it is often attractive for contra...
Data abstraction is crucial in the construction of modular programs, since it ensures that internal ...
Specification languages have long featured ways to describe what does not change when an imperative ...
Pure methods and model fields are useful and common specification constructs that can be interpreted...
We introduce the notion of local completeness in abstract interpretation and define a logic for prov...
This thesis explores two kinds of program logics that have become important for modern program verif...
An important, challenging problem in the verification of imperative programs with shared, mutable st...
This dissertation deals with the automatic generation of sound specifications from a given program i...
We propose an approach for the modular specification and verification of total correctness propertie...
We propose an approach for the modular specification and verification of total correctness propertie...
We give examples of situations where formal specifications of procedures in the standard pre/postcon...
239 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.Programs are called stateful ...
Framing is important for specification and verification of object-oriented programs. This dissertati...
We propose a novel logic, called Frame Logic (abbr., F-logic), that accounts in a clean, declarative...
This paper proposes the development of a logic for verifying properties of programs in rewriting log...
Abstract. For specifying and reasoning about object-based programs it is often attractive for contra...
Data abstraction is crucial in the construction of modular programs, since it ensures that internal ...
Specification languages have long featured ways to describe what does not change when an imperative ...
Pure methods and model fields are useful and common specification constructs that can be interpreted...
We introduce the notion of local completeness in abstract interpretation and define a logic for prov...
This thesis explores two kinds of program logics that have become important for modern program verif...
An important, challenging problem in the verification of imperative programs with shared, mutable st...
This dissertation deals with the automatic generation of sound specifications from a given program i...
We propose an approach for the modular specification and verification of total correctness propertie...
We propose an approach for the modular specification and verification of total correctness propertie...
We give examples of situations where formal specifications of procedures in the standard pre/postcon...
239 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.Programs are called stateful ...
Framing is important for specification and verification of object-oriented programs. This dissertati...
We propose a novel logic, called Frame Logic (abbr., F-logic), that accounts in a clean, declarative...
This paper proposes the development of a logic for verifying properties of programs in rewriting log...