DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC

Authors:
Edmund M. Clarke;E. Allen Emerson
Affiliations:
Aiken Computation Laboratory, Harvard University, Cambridge, USA Mass. 02138;Aiken Computation Laboratory, Harvard University, Cambridge, USA Mass. 02138
Venue:
25 Years of Model Checking
Year:
2008

Citing 8
Cited 4

On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
"Sometime" is sometimes "not never": on the temporal logic of programs

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of branching time

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Characterizing Correctness Properties of Parallel Programs Using Fixpoints

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Finite Models for Deterministic Propositional Dynamic Logic

Proceedings of the 8th Colloquium on Automata, Languages and Programming
A practical decision method for propositional dynamic logic (Preliminary Report)

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Synthesis of communicating processes from temporal logic specifications

Synthesis of communicating processes from temporal logic specifications
Program invariants as fixed points

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

Experience-based model refinement

SERENE'11 Proceedings of the Third international conference on Software engineering for resilient systems
Performance evaluation of sensor networks by statistical modeling and euclidean model checking

ACM Transactions on Sensor Networks (TOSN)
Program repair without regret

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Generic and Specific Compatibility Criteria for Web Service Composition: Formal Abstraction and Modular Verification Approach1

International Journal of Web Services Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We Propose a method of constructing concurrent programs in which the synchronization skeletonof the program is automatically synthesized from a high-level (branching time) Temporal Logic specification. The synchronization skeleton is an abstraction of the actual program where detail irrelevant to synchronization is suppressed. For example, in the synchronization skeleton for a solution to the critical section problem each process's critical section may be viewed as a single node since the internal structure of the critical section is unimportant. Most solutions to synchronization problems in the literature are in fact given as synchronization skeletons. Because synchronization skeletons are in general finite state, the propositional version of Temporal Logic can be used to specify their properties.