Skip Navigation
York U: Redefine the PossibleHOME | Current Students | Faculty & Staff | Research | International
Search »FacultiesLibrariesCampus MapsYork U OrganizationDirectorySite Index
Future Students, Alumni & Visitors
2000 Technical Reports

The Timed Predicative Calculus as a Framework for Comparative Semantics

Jonathan S. Ostroff and Richard F. Paige

Technical Report CS-2000-01

York University

April 17, 2000


Predicates are used in a variety of formal specification languages, though a predicate does not always mean the same thing in each approach. For example, the predicate false in Z means the same thing as true in the predicative calculus of Hehner.

In this paper, we compare the specification languages Z, Morgan's Refinement Calculus, and Parnas's Limited Domain relations, using the timed predicative calculus (TP) of Hehner as an underlying framework. In particular, we show that TP is more expressive than the other languages. We also show that refinement in TP is strictly weaker than the refinement relations associated with the other languages. As a result, refinement laws from the other languages can be reused in TP. We conject that the simplicity of TP makes it a good candidate as a specification language and program development method for the refinement of procedural specifications, as well as real-time object oriented specifications.

Download paper in PDF format.

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.