A compositional trace logic for behavioural interface specifications

Authors:
Marcel kyas;Frank S. de Boer;Willem-paul de Roever
Affiliations:
University of Kiel, Department of Computer Science, Kiel, Germany;CWI, Amsterdam, The Netherlands;University of Kiel, Department of Computer Science, Kiel, Germany
Venue:
Nordic Journal of Computing
Year:
2005

Citing 10
Cited 0

Axiomatic semantics of communicating sequential processes

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
From sequential layers to distributed processes: deriving a distributed minimum weight spanning tree algorithm

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Inheritance is not subtyping

Theoretical aspects of object-oriented programming
Abstract interpretation of reactive systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Languages, automata, and logic

Handbook of formal languages, vol. 3
A model and proof system for asynchronous networks

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Interface automata

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
On Message Specifications in OCL

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a compositional trace logic for behavioural interface specifications and corresponding proof rules for compositional reasoning. The trace logic is defined in terms of axioms in higher-order logic. This trace logic is applicable to any object-oriented programming language. We treat object creation without observing the explicit act of creation.We prove a soundness result of this approach using the theory of Galois connections. We show the correctness of a specification of the Sieve of Eratosthenes using the proposed method. This notion of compositionality allows the verification of systems during the early stages of a design.