A New Approach to Proving the Correctness of Multiprocess Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Ten Years of Hoare's Logic: A Survey—Part I
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
The ``Hoare Logic'' of CSP, and All That
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
A Discipline of Programming
Reasoning about nonatomic operations
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Local and temporal predicates in distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
How to Make a Correct Multiprocess Program Execute Correctly on a Multiprocessor
IEEE Transactions on Computers
Lamport on mutual exclusion: 27 years of planting seeds
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A Light-Weight Framework for Hardware Verification
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Distributed Computing
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Formal Analysis of the Bakery Protocol with Consideration of Nonatomic Reads and Writes
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Multiple Viewpoint Contract-Based Specification and Design
Formal Methods for Components and Objects
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems
Weakest precondition based modelling and verification of a class of concurrent systems
International Journal of Artificial Intelligence and Soft Computing
Predicate transformers in the context of symbolic modeling of transition systems
Cybernetics and Systems Analysis
Properties of a predicate transformer of the VRS system
Cybernetics and Systems Analysis
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
| Hi-index | 0.00 |
The weakest liberal precondition and strongest postcondition predicate transformers are generalized to the weakest invariant and strongest invariant. These new predicate transformers are useful for reasoning about concurrent programs containing operations in which the grain of atomicity is unspecified. They can also be used to replace behavioral arguments with more rigorous assertional ones.