We introduce a new way of reasoning about invariance in terms of footprints in a program logic for object-oriented components. A footprint of an object-oriented component is formalized as a monadic predicate that describes which objects on the heap can be affected by the execution of the component. Assuming encapsulation, this amounts to specifying which objects of the component can be called. Adaptation of local specifications into global specifications amounts to showing invariance of assertions, which is ensured by means of a form of bounded quantification which excludes references to a given footprint.</p
O’Hearn, Reynolds and Yang introduced local Hoare reasoning about mutable data structures using sepa...
Object invariants describe the consistency of object states, and are crucial for reasoning about the...
The modular verification of object-oriented code is made dif-ficult by the presence of aliasing. If ...
We introduce a new way of reasoning about invariance in terms of footprints in a program logic for o...
We introduce a new way of reasoning about invariance in terms of footprints in a program logic for o...
We introduce a new way of reasoning about invariance in terms of foot-prints in a Hoare logic for re...
Local reasoning about programs exploits the natural local behaviour common inprograms by focussing o...
This paper explains how a uniform, specification-based approach to reasoning about component-based p...
The object-oriented community is paying increasing attention to techniques for object instance encap...
Abstract: Object-oriented programs [Dahl, Goldberg, Meyer] are notoriously prone to the following ki...
An important feature of object-oriented programming languages is the ability todynamically instantia...
We present a generic framework for the automatic and modular inference of sound class invariants for...
An important feature of object-oriented programming languages is the ability to dynamically instanti...
The program state for object-oriented languages, such as Java or C#, consists of both variables loca...
AbstractThis paper describes a proof outline logic that covers most typical object-oriented language...
O’Hearn, Reynolds and Yang introduced local Hoare reasoning about mutable data structures using sepa...
Object invariants describe the consistency of object states, and are crucial for reasoning about the...
The modular verification of object-oriented code is made dif-ficult by the presence of aliasing. If ...
We introduce a new way of reasoning about invariance in terms of footprints in a program logic for o...
We introduce a new way of reasoning about invariance in terms of footprints in a program logic for o...
We introduce a new way of reasoning about invariance in terms of foot-prints in a Hoare logic for re...
Local reasoning about programs exploits the natural local behaviour common inprograms by focussing o...
This paper explains how a uniform, specification-based approach to reasoning about component-based p...
The object-oriented community is paying increasing attention to techniques for object instance encap...
Abstract: Object-oriented programs [Dahl, Goldberg, Meyer] are notoriously prone to the following ki...
An important feature of object-oriented programming languages is the ability todynamically instantia...
We present a generic framework for the automatic and modular inference of sound class invariants for...
An important feature of object-oriented programming languages is the ability to dynamically instanti...
The program state for object-oriented languages, such as Java or C#, consists of both variables loca...
AbstractThis paper describes a proof outline logic that covers most typical object-oriented language...
O’Hearn, Reynolds and Yang introduced local Hoare reasoning about mutable data structures using sepa...
Object invariants describe the consistency of object states, and are crucial for reasoning about the...
The modular verification of object-oriented code is made dif-ficult by the presence of aliasing. If ...