(Enter summary)
Abstract: Using a set-theoretic model of predicate transformers and ordered data types, we give a total-correctness semantics for a typed higher-order imperative programming language that includes record extension, local variables, and procedure-type variables and parameters. The language includes infeasible specification constructs, for a calculus of refinement. Procedures may have global variables, subject to mild syntactic restrictions to avoid the semantic complications of Algol-like languages. The... (Update)
Context of citations to this paper: More
.... Related Work in Formalization of Object Oriented Concepts Related work in formalization of object oriented concepts includes [13, 33, 34, 36, 2]. William Cook and Jens Palsberg in [13] give a denotational semantics of inheritance and prove its correctness with respect to an...
...of its subclasses) from x and the value of the parameters from the arguments. This new semantics combines elements from [CN00a] and [Nau00] 3 Class Re nement Algorithmic re nement of programs and commands is de ned in the usual way as the pointwise order on predicate...
Cited by: More
Basic Laws of ROOL: an Object-Oriented Language - Borba, Sampaio (2000)
(Correct)
On the Semantics of Refinement Calculi - Yang, Reddy (2000)
(Correct)
Patterns and Lax Lambda Laws for Relational and Imperative.. - Naumann
(Correct)
Similar documents (at the sentence level):
15.2%: Predicate Transformer Semantics of a Higher Order Imperative.. - Naumann (1998)
(Correct)
Active bibliography (related documents): More All
1.3: A Weakest Precondition Semantics for Refinement of.. - Cavalcanti, Naumann (2000)
(Correct)
0.9: Preventing Cross-Type Aliasing for More Practical Reasoning - Dhara, Leavens (2001)
(Correct)
0.8: Soundness of Data Refinement for a Higher Order Imperative Language - Naumann (1999)
(Correct)
Similar documents based on text: More All
0.2: A Static Analysis for Instance-based Confinement in Java - Banerjee, Naumann
(Correct)
0.1: Beyond Fun: Order and Membership in Polytypic Imperative.. - Naumann (1997)
(Correct)
0.1: Towards Squiggly Refinement Algebra - Naumann (1998)
(Correct)
Related documents from co-citation: More All
8: Programming from Specications (context) - Morgan - 1990
6: An algebraic construction of predicate transformers
- Gardiner, Martin et al. - 1994
6: A categorical model for higher order imperative programming
- Naumann - 1996
BibTeX entry: (Update)
Naumann, D.A. 1996. Predicate transformer semantics of a higher order imperative language with record subtypes. Submitted for publication. http://citeseer.ist.psu.edu/naumann98predicate.html More
@article{ naumann01predicate,
author = "David A. Naumann",
title = "Predicate transformer semantics of a higher-order imperative language with record subtyping",
journal = "Science of Computer Programming",
volume = "41",
number = "1",
pages = "1--51",
year = "2001",
url = "citeseer.ist.psu.edu/naumann98predicate.html" }
Citations (may not include all citations):
141
Predicate Calculus and Program Semantics (context) - Dijkstra, Scholten - 1990
134
A Theory of Objects (context) - Abadi, Cardelli - 1996
131
The essence of Algol (context) - Reynolds - 1981
70
A logic of object-oriented programs
- Abadi, Leino - 1997
63
A lambda calculus of objects and method specialization
- Fisher, Honsell et al. - 1994
52
Programming from Specications (context) - Morgan - 1994
45
Algol-like Languages (context) - O'Hearn, Tennent - 1997
32
Operational semantics of a parallel objectoriented language (context) - America, de Bakker et al. - 1986
30
Verication of Sequential and Concurrent Programs (context) - Apt, Olderog - 1991
28
Reasoning about local variables with operationally-based log..
- Pitts - 1996
28
The Craft of Programming (context) - Reynolds - 1981
26
Programming: the Derivation of Algorithms (context) - Kaldewaij - 1990
26
The development of type systems for object-oriented language..
- Fisher, Mitchell - 1995
22
Programming language constructs for which it is impossible t.. (context) - Clarke - 1979
21
Reasoning about dynamically evolving process structures (context) - America, de Boer - 1994
20
Two semantic models of object-oriented languages (context) - Kamin, Reddy - 1994
20
Predicate transformer semantics of an Oberon-like language (context) - Naumann - 1994
20
Full abstraction for the second order subset of an ALGOL-lik..
- Sieber - 1995
19
Parametricity and local variables
- O'Hearn, Tennent - 1995
13
An approach to object-orientation in action systems
- Bonsangue, Kok et al. - 1998
12
Predicate transformer semantics of a higher order imperative..
- Naumann - 1998
12
A categorical model for higher order imperative programming
- Naumann - 1998
11
Forcing behavioral subtyping through specication inheritance (context) - Dhara, Leavens - 1996
10
Verifying object-oriented programs that use subtypes (context) - Leavens - 1989
9
Covariance and contravariance: Con ict without a cause (context) - Castagna - 1995
9
Preordered categories and predicate transformers (context) - Martin - 1991
8
Predicate transformers and higher order programs (context) - Naumann - 1995
8
A sharp proof rule for procedures in wp semantics (context) - Bijlsma, Matthews et al. - 1989
7
Object-Oriented Specication Case Studies (context) - Lano, Haughton - 1994
6
Specication and verication of object-oriented programs using.. (context) - Leavens, Weihl - 1995
6
Program Verication (context) - Francez - 1992
6
Ten years of Hoare's logic (context) - Apt - 1981
6
Towards squiggly renement algebra (context) - Naumann - 1998
5
Calculating with procedure calls (context) - Bijlsma - 1993
5
Calculating with pointers (context) - Bijlsma - 1989
4
Correctness of data representations in Algol-like languages (context) - Tennant - 1994
4
Isomorphisms between predicate and state transformers
- Bonsangue, Kok - 1993
4
Class renement and interface renement in object-oriented pro.. (context) - Mikhajlova, Sekerinski - 1997
4
and Unbounded Choice (context) - Hesselink, Recursion - 1993
3
A sound and relatively complete Hoare-logic for a language w.. (context) - Damm, Josko - 1983
3
the essence of Oberon (context) - Naumann - 1994
3
Reasoning about procedures as parameters in the language L (context) - German, Clarke et al. - 1989
3
Soundness of data renement for a higher order imperative lan..
- Naumann - 2000
3
A partial correctness logic for procedures (context) - Sieber - 1985
3
Modular reasoning in an object-oriented renement calculus (context) - Utting, Robinson - 1992
2
A calculus for higher order procedures with global variables
- Stephan, Wolpers - 1993
2
Semantical analysis of specication logic (context) - Tennant - 1990
1
Correctness of programs with Pascal-like procedures without .. (context) - Olderog - 1984
1
A denotational model of inheritance and its correctnesss (context) - Cook, Palsberg - 1994
1
Hoare's logic for programs with procedures | what has been a.. (context) - Olderog - 1983
1
Exploring summation and product operators in the renement ca.. (context) - Back, Butler - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://guinness.cs.stevens-tech.edu/~naumann/publications.html): More
Predicate Transformer Semantics of a Higher Order Imperative.. - Naumann (1998)
(Correct)
Two-Categories and Program Structure - Naumann
(Correct)
A Categorical Model for Higher Order Imperative Programming - Naumann (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC