A temporal approach to specification and verification of pointer data-structures

Authors:
Marcin Kubica
Affiliations:
Institute of Informatics, Warsaw University, Warsaw, Poland
Venue:
FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
Year:
2003

Citing 13
Cited 0

Introduction to algorithms

Introduction to algorithms
Algebraic specification

Handbook of theoretical computer science (vol. B)
The Z notation: a reference manual

The Z notation: a reference manual
Graph types

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specification of abstract dynamic-data types: a temporal logic approach

Theoretical Computer Science - Special issue: algebraic development techniques
Languages, automata, and logic

Handbook of formal languages, vol. 3
Ten Years of Hoare's Logic: A Survey—Part I

ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming

Communications of the ACM
Verifiable Programming

Verifiable Programming
Fundamentals of Algebraic Specification I

Fundamentals of Algebraic Specification I
On the Proper Treatment or Referencing, Dereferencing and Assignment

Proceedings of the Fourth Colloquium on Automata, Languages and Programming
A Temporal Approach to Algebraic Specifications

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract)

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a formalism for specification of pointer data-structures and programs operating on them, based on temporal specifications of dynamic algebras. It is an extension of first-order logic with temporal branching-time combinators. The use of this formalism is illustrated by examples. We also propose a Hoare-style calculus for verification of while-programs (operating on pointers) against specifications written in the proposed formalism, which is sound and complete in the sense of Cook.