Is the interesting part of process logic uninteresting?: a translation from PL to PDL

Authors:
R. Sherman;A. Pnueli;D. Harel
Affiliations:
The Weizmann Institute of Science, Israel;The Weizmann Institute of Science, Israel;The Weizmann Institute of Science, Israel
Venue:
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1982

Citing 4
Cited 1

An axiomatic basis for computer programming

Communications of the ACM
A Discipline of Programming

A Discipline of Programming
Process logic: preliminary report

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Equations between regular terms and an application to process logic

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

Interactive verification of concurrent systems using symbolic execution

AI Communications - Practical Aspects of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the (necessary) condition that atomic programs in PL be binary, we present an algorithm for the translation of a PL formula X into a PDL program τ (X) such that a finite path satisfies X iff it belongs to τ (X). This reduction has two immediate corollaries: 1) validity in this PL can be tested by testing validity of formulas in PDL; 2) all finite-path program properties expressible in this PL are expressible in PDL.The translation, however, seems to be of non-elementary time complexity. The significance of the result to the search for natural and powerful logics of programs is discussed.