An Experiment in Program Composition and Proof

Authors:
K. Mani Chandy;Michel Charpentier
Affiliations:
California Institute of Technology, Computer Science Department, m/s 256-80, Pasadena, CA 91125, USA. mani@cs.caltech.edu;California Institute of Technology, Computer Science Department, m/s 256-80, Pasadena, CA 91125, USA. charpov@cs.caltech.edu
Venue:
Formal Methods in System Design
Year:
2002

Citing 10
Cited 5

Parallel program design: a foundation

Parallel program design: a foundation
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
An introduction to assertional reasoning for concurrent systems

ACM Computing Surveys (CSUR)
Model checking and modular verification

ACM Transactions on Programming Languages and Systems (TOPLAS)
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Predicate transformers for reasoning about concurrent computation

Science of Computer Programming
The B-book: assigning programs to meanings

The B-book: assigning programs to meanings
Examples of Program Composition Illustrating the Use of Universal Properties

Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Towards a Compositional Approach to the Design and Verification of Distributed Systems

Towards a Compositional Approach to the Design and Verification of Distributed Systems
A method for the specification, composition, and testing of distributed object systems

A method for the specification, composition, and testing of distributed object systems

An Approach to Composition Motivated by wp

FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
An Approach to Compositional Model Checking

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Composing invariants

Science of Computer Programming
Formal design of self-stabilizing programs

Journal of High Speed Networks - Self-Stabilizing Systems, Part 1
A UNITY-based framework towards component based systems

OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper explores a compositional approach to program specification, development and proof. We apply a theory of composition to a problem in distributed computing with the goal of understanding the strengths and weaknesses of this compositional approach. First, we describe the theory briefly. Then we give a specification of a desired system. Next, we propose a design of the desired system as a composition of components and prove its correctness. Finally, we show how the proof can be reused for a slightly different compositional structure by using the concept of observation.