An Extension of Dynamic Logic for Modelling OCL's @pre Operator

Authors:
Thomas Baar;Bernhard Beckert;Peter H. Schmitt
Affiliations:
-;-;-
Venue:
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Year:
2001

Citing 5
Cited 1

Ten Years of Hoare's Logic: A Survey—Part I

ACM Transactions on Programming Languages and Systems (TOPLAS)
Dynamic Logic

Dynamic Logic
The KeY Approach: Integrating Object Oriented Design and Formal Verification

JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
A Dynamic Logic for the Formal Verification of Java Card Programs

JavaCard '00 Revised Papers from the First International Workshop on Java on Smart Cards: Programming and Security
Interpreting the Object Constraint Language

APSEC '98 Proceedings of the Fifth Asia Pacific Software Engineering Conference

Verification of object-oriented software: The KeY approach

Verification of object-oriented software: The KeY approach

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider first-order Dynamic Logic (DL) with non-rigid functions, which can be used to model certain features of programming languages such as array variables and object attributes. We extend this logic by introducing, for each non-rigid function symbol f, a new function symbol f@pre that after program execution refers to the old value of f before program execution. We show that DL formulas with @pre can be transformed into equivalent formulas without @pre. We briefly describe the motivation for this extension coming from a related concept in the Object Constraint Language (OCL).