A weakest precondition semantics for an object-oriented language of refinement

Cavalcanti, Ana; Naumann, David A.

doi:10.1007/3-540-48118-4_26

Cited by 18 publications

(11 citation statements)

References 12 publications

(12 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cavalcanti and Naumann define an object-oriented programming language with subtype and polymorphism using predicate transformer [11,45]. Mikhajlova and Sekerinski [44] design a rich object-oriented language by using a type system and predicate transformers as well.…”

Section: Models Of Object-oriented Programsmentioning

confidence: 99%

Unifying Views of UML

Liu¹,

He²,

Liu³

et al. 2004

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

We present an approach to embedding a formal method into Rational Unified Process (RUP). The purposes are: (a) to unify different views of UML, (b) to enhance UML with the formal method to improve the quality of software systems; and (c) to support effective use of the formal method for system specification and reasoning with the iterative and incremental approach by providing a unified conceptual framework. One of the main features of RUP is that it is use-case driven and supports iterative development more explicit than other process models, such as the waterfall model. Object-orientation also supports better and more explicitly incremental programming than the traditional imperative programming. These together will help to scale up the use of the formal method in software system development. The model is based on Hoare and He's Unifying Theories of Programming (UTP).

show abstract

Section: Models Of Object-oriented Programsmentioning

confidence: 99%

Unifying Views of UML

Liu¹,

He²,

Liu³

et al. 2004

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…Typically, relations (especially "abstraction functions") are used to derive from one version the specification of the other version, which is then proved correct in a program logic. Logics for imperative object-oriented languages are at an early stage of development [Abadi and Leino 1997;Cavalcanti and Naumann 1999;Poetzsch-Heffter and Müller 1999;Huisman and Jacobs 2000;Huisman 2002;Reynolds 2002]. By cases on C and B.…”

Section: Future Challengesmentioning

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

“…There are a number of recent articles on Hoare Logics for object-oriented programming (see, e.g. [30,35,20,31,23,9]). The normal form of a program in our paper is similarly to that of [9,30].…”

Section: Law 21mentioning

confidence: 99%

“…[30,35,20,31,23,9]). The normal form of a program in our paper is similarly to that of [9,30]. However, one major difference of our work is that we also provide a formal characterisation and refinement of the contextual/structural features, i.e.…”

Section: Law 21mentioning

confidence: 99%

“…The notions of different kinds of refinements in our model are very close to those in [9], though the semantics in [9] is defined in terms of the weakest precondition predicate transformer and does not deal with reference types. We take a weak semantic approach meaning that when the pre-condition of a contact is not satisfied in a state, the program will then behave as chaos, and any modification to the program, such as adding exceptional handling, will be a refinement to the program.…”

Section: Law 21mentioning

confidence: 99%

See 1 more Smart Citation

A Relational Model for Object-Oriented Designs

Liu

et al. 2004

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. This paper develops a mathematical characterisation of object-oriented concepts by defining an observation-oriented semantics for an object-oriented language (OOL) with a rich variety of features including subtypes, visibility, inheritance, dynamic binding and polymorphism. The language is expressive enough for the specification of object-oriented designs and programs. We also propose a calculus based on this model to support both structural and behavioural refinement of object-oriented designs. We take the approach of the development of the design calculus based on the standard predicate logic in Hoare and He's Unifying Theories of Programming (UTP). We also consider object reference in terms of object identity as values and mutually dependent methods.

show abstract

A weakest precondition semantics for an object-oriented language of refinement

Cited by 18 publications

References 12 publications

Unifying Views of UML

Unifying Views of UML

Ownership confinement ensures representation independence for object-oriented programs

A Relational Model for Object-Oriented Designs

Contact Info

Product

Resources

About