Adequate proof principles for invariance and liveness properties of concurrent programs
Science of Computer Programming
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Modeling concurrency with partial orders
International Journal of Parallel Programming
On proving communication closedness of distributed layers
Proc. of the sixth conference on Foundations of software technology and theoretical computer science
Interleaving set temporal logic
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Parallel program design: a foundation
Parallel program design: a foundation
Understanding and verifying distributed algorithms using stratified decomposition
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
A superimposition control construct for distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the 3rd International Workshop on Distributed Algorithms
Superposition Refinement of Parallel Algorithms
FORTE '91 Proceedings of the IFIP TC6/WG6.1 Fourth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, IV
Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Modular Completeness for Communication Closed Layers
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Weak Sequential Composition in Process Algebras
CONCUR '94 Proceedings of the Concurrency Theory
Protocol Design by Layered Decomposition: A Compositional Approach
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Layering of Real-Time Distributed Processes
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
A Derivation of a Broadcasting Protocol Using Sequentially Phased Reasoning
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Layering and Action Refinement for Timed Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Partial Order Based Design of Concurrent Systems
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Verification of distributed programs using representative interleaving sequences
Distributed Computing
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Transition Refinement for Deriving a Distributed Minimum Weight Spanning Tree Algorithm
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
| Hi-index | 0.00 |
Partial order based techniques are incorporated in a interleaving semantics, based on coding partial order information in linear time temporal logic. An example of development is given.