Formalization of Properties of Functional Programs
Journal of the ACM (JACM)
The application of program-proving techniques to the verification of synchronization processes
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Thread-Modular Verification for Shared-Memory Programs
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Model Checking TLA+ Specifications
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Composition: A Way to Make Proofs Harder
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
VCC: A Practical System for Verifying Concurrent C
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Abstract Transformers for Thread Correlation Analysis
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Maintaining the Ranch topology
Journal of Parallel and Distributed Computing
VSTTE'10 Proceedings of the Third international conference on Verified software: theories, tools, experiments
Structured flowcharts for multiprocessing
Computer Languages
| Hi-index | 0.00 |
A simple but general parallel programming language is considered. The semantics of programs is defined in a concise and natural way using relations. ''Verification conditions'' derived from the semantic definitions enable Floyd's method of proving correctness to be applied to the parallel programs. Proofs of properties of programs using the verification conditions are claimed to be more systematic versions of the informal arguments normally used to check parallel programs. A program simulating an elementary airline reservation system is given, and several properties of the program are demonstrated using the technique.