next up previous
Next: About this document ... Up: Monotonicity and Lattices as Previous: 10 Acknowledgment

References

Abr96
J-R. Abrial.
The B-Book.
Cambridge University Pressy, 1996.

Ame90
Pierre America.
Designing an object-oriented programming lanugage with behavioural subtyping.
In REX School/Workshop, volume 489 of LNCS, pages 60-90, 1990.

Bac78
R. J. Back.
On the correctness of refinement in program development.
PhD thesis, University of Helsinki, 1978.

BBN95
Marie Larsson Bror Bjerner and Bengt Nordström, editors.
7th Nordic Workshop on Programming Theory, volume 86 of Göteborg University and Chalmers University, November 1995.

BS94
R.J.R. Back and K. Sere.
From action systems to modular systems.
Technical Report Ser. A. No 154, Åbo Akademi, 1994.

BvW97
Ralph-Johan Back and Joakim von Wright.
Refinement Calculus.
to appear, 1997.
Manuscripts, June 26th 1996 and February 18th, 1997.

CM88
K. M. Chandy and J. Misra.
Parallel Program Design: A Foundation.
Addison-Wesley, Reading, Massachusetts, 1988.

Dij76
Edsger W. Dijkstra.
A Discipline of Programming.
Prentice Hall, 1976.

DL95
Drishna Kishore Dhara and Gary T. Leavens.
Forcing behavioral subtyping through specification inheritance.
Technical Report TR 95-20a, Iowa State University, 1995.

DP90
B. A. Davey and H. A. Priestley.
Introduction to Lattices and Order.
Cambridge University Press, 1990.

DS89
Edsger W. Dijkstra and Carel S. Scholten.
Predicate Calculus and Program Semantics.
Springer-Verlag, 1989.

GH93
John V. Guttag and James J. Horning, editors.
Larch: Languages and Tools for Formal Specification.
Texts and Monographs in Computer Science. Springer-Verlag, 1993.
With Stephen J. Garland, Kevin D. Jones, Andrés Modet, and Jeannette M. Wing.

Hes92
Wim H. Hesselink.
Programs, Recursion and Unbounded Choice.
Cambridge Tracts in Theoretical Computer Science, 1992.

Heu91
Philipp Heuberger.
A constructive approach to sweep algorithms for voronoi diagrams.
Master's thesis, University of Victoria, May 1991.

Heu95a
Philipp Heuberger.
Building correct and reusable software components in oberon using the refinement calculus.
Swiss TMR-project 83EU-045389, May 1995.

Heu95b
Philipp Heuberger.
Embedding oberon type extension into refinement calculus.
In Bror Bjerner and Nordström [BBN95], pages 145-155.

Heu96a
Philipp Heuberger.
Exercise: Equivalence relation.
In Specification Case Studies with B, volume Ser. B, No 26 of Reports on Computer Science and Mathematics. Åbo Akademi, 1996.

Heu96b
Philipp Heuberger.
Proving on a reasonable level of abstraction with programmer-designed theories.
In Henri Habrias, editor, 1st B International Conference: Putting into Practice Methods and Tools for Information System Design, volume 86, pages 297-302. Institut de Recherches en Informatique de Nantes, November 1996.

Heu97a
Philipp Heuberger.
Application types and the definition of software components.
submitted draft, May 1997.

Heu97b
Philipp Heuberger.
A lattice-theoretical subtype definition and the calculation of an abstract common superclass in a global state space.
submitted draft, March 1997.

Heu97c
Philipp Heuberger.
The minimal user-interface of a simple refinement tool.
In Yves Bertot, editor, User Interfaces for Theorem Provers. Sophia Antipolis, France, September 1997.
to appear.

Heu97d
Philipp Heuberger.
Notational convenience of the ``everywhere'' operator in structural induction proofs.
submitted draft, March 1997.

Heu97e
Philipp Heuberger.
Oberon and refinement calculus.
In Jukka Paakki, editor, Fifth Symposium on Programming Languages and Software Tools, C-1997-37, pages 49-60. University of Helsinki, June 1997.

Heu97f
Philipp Heuberger.
Strategies for data-refining an equivalence.
submitted draft, March 1997.

HH95
Philipp Heuberger and David Hofmann.
The refinement tool: RefStep.
In Bror Bjerner and Nordström [BBN95], pages 565-570.

Lal94
Spyridon Lalis.
Hermes - Supporting Distributed Programming in a Network of Personal Workstations.
PhD thesis, Swiss Institute of Technology in Zurich, 1994.

LW94
Barbara Liskov and Jeannette M. Wing.
A behavioral notion of subtyping.
ACM TOPLAS, 1994.

Mor88
Carroll Morgan.
The specification statement.
ACM Transactions on Programming Languages and Systems, 10:403-419, 1988.

Mor94
Carroll Morgan.
Programming from Specifications.
Prentice Hall, 1994.

NW89
J. Gutknecht N. Wirth.
The Oberon system.
Software Practice and Experience, 19(9):857-893, september 1989.

SH89
Beverly A. Sanders and Philipp A. Heuberger.
Distributed deadlock detection and resolution with probes.
In Proceedings of the 3rd International Workshop on Distributed Algorithms, volume 392 of LNCS, pages 207-218, 1989.

Szy92
C. A. Szyperski.
Write-ing applications: Designing an extensible text-editor as an application framework.
In Proceedings of the Seventh International Conference on Technology of Object-Oriented Languages and Systems, 1992.

WG92
Niklaus Wirth and Jürg Gutknecht.
Project Oberon - The Design of an Operating System and Compiler.
Addison Wesley, 1992.

Wir71
Niklaus Wirth.
Program development by stepwise refinement.
CACM, 14:221-227, 1971.

Wir88
Niklaus Wirth.
From Modula to Oberon.
Software Practice and Experience, 18(7), july 1988.



Philipp Heuberger
Sep. 12 1997