Forward Simulation for Data Refinement of Classes

Cavalcanti, Ana; Naumann, David A.

doi:10.1007/3-540-45614-7_27

Cited by 19 publications

(20 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It should be possible to obtain a suitable simulation theory for Java-like languages by adapting existing work (Cavalcanti and Naumann, 2002;Banerjee and Naumann, 2005a,c). We conjecture that the extension to concurrency is also straightforward, given suitable control of atomicity.…”

Section: Resultsmentioning

confidence: 99%

Observational Purity and Encapsulation

Naumann

2005

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

Practical specification languages for imperative and object-oriented programs, such as JML, Eiffel, and Spec#, allow the use of program expressions including method calls in specification formulas. For coherent semantics of specifications, and to avoid anomalies with runtime assertion checking, expressions in specifications and assertions are typically required to be weakly pure in the sense that their evaluation has no effect on the state of preexisting objects. For specification of large systems using standard libraries this restriction is impractical: it disallows many standard methods that mutate state for purposes such as caching or lazy initialization. Calls of such methods can sensibly be used for specifications and annotations in contexts where their effects cannot be observed. This paper formalizes a notion of observational purity, justifies the use of weakly and observationally pure methods in specifications, and shows that a method is observationally pure if it simulates a weakly pure method.

show abstract

Section: Resultsmentioning

confidence: 99%

Observational Purity and Encapsulation

Naumann

2005

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…This is basically in direct correspondence with the perhaps more familiar predicative definition; a similar set-based formulation is used in [CN02]. The definition of universal quantification is as follows.…”

Section: Designsmentioning

confidence: 98%

Angelic nondeterminism in the unifying theories of programming

2006

Self Cite

View full text Add to dashboard Cite

Abstract. Hoare and He's unifying theories of programming (UTP) is a model of alphabetised relations expressed as predicates; it supports development in several programming paradigms. The aim of Hoare and He's work is the unification of languages and techniques, so that we can benefit from results in different contexts. In this paper, we investigate the integration of angelic nondeterminism in the UTP; we propose the unification of a model of binary multirelations, which is isomorphic to the monotonic predicate transformers model and can express angelic and demonic nondeterminism.

show abstract

“…Representation independence results are known for general transition systems [Milner 1971;Lynch and Vaandrager 1995], first order imperative languages [He et al 1986;de Roever and Engelhardt 1998], higher order functional [Reynolds 1984;Mitchell 1986;Power and Robinson 2000] and higher order imperative languages [O'Hearn and Tennent 1995;Naumann 2002], and sequential objectoriented programs without heap allocation ( [Cavalcanti and Naumann 2002] treats a language with class-based visibility and [Reddy 1998] treats one with instancebased visibility). As far as we know, our results are the first for shared references to mutable state, a ubiquitous feature in object-oriented and imperative programs.…”

Section: Related Workmentioning

confidence: 99%

Ownership confinement ensures representation independence for object-oriented programs

Banerjee

Naumann

2005

J. ACM

Self Cite

114

View full text Add to dashboard Cite

Dedicated to the memory of Edsger W. Dijkstra.Representation independence or relational parametricity formally characterizes the encapsulation provided by language constructs for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mutable state; indeed it fails in general for such languages. This paper formulates representation independence for classes, in an imperative, object-oriented language with pointers, subclassing and dynamic dispatch, class oriented visibility control, recursive types and methods, and a simple form of module. An instance of a class is considered to implement an abstraction using private fields and so-called representation objects. Encapsulation of representation objects is expressed by a restriction, called confinement, on aliasing. Representation independence is proved for programs satisfying the confinement condition. A static analysis is given for confinement that accepts common designs such as the observer and factory patterns. The formalization takes into account not only the usual interface between a client and a class that provides an abstraction but also the interface (often called "protected") between the class and its subclasses.

show abstract

Forward Simulation for Data Refinement of Classes

Cited by 19 publications

References 22 publications

Observational Purity and Encapsulation

Observational Purity and Encapsulation

Angelic nondeterminism in the unifying theories of programming

Ownership confinement ensures representation independence for object-oriented programs

Contact Info

Product

Resources

About