Reasoning about parallel architectures
Reasoning about parallel architectures
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verification of FLASH cache coherence protocol by aggregation of distributed transactions
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Verification techniques for cache coherence protocols
ACM Computing Surveys (CSUR)
Lamport clocks: verifying a directory cache-coherence protocol
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A Tutorial on Using PVS for Hardware Verification
TPCD '94 Proceedings of the Second International Conference on Theorem Provers in Circuit Design - Theory, Practice and Experience
Proofs of Correctness of Cache-Coherence Protocols
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Verifying Sequential Consistency on Shared-Memory Multiprocessor Systems
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Mechanizing Proofs of Computation Equivalence
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Automatic Verification of Parameterized Cache Coherence Protocols
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Model-checking of correctness conditions for concurrent objects
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Sequential consistency and the lazy caching algorithm
Distributed Computing - Special issue: Verification of lazy caching
Distributed Computing - Special issue: Verification of lazy caching
Distributed Computing - Special issue: Verification of lazy caching
Using CSP to verify sequential consistency
Distributed Computing - Special issue: Verification of lazy caching
The compositional approach to sequential consistency and lazy caching
Distributed Computing - Special issue: Verification of lazy caching
Proving refinement using transduction
Distributed Computing - Special issue: Verification of lazy caching
Distributed Computing - Special issue: Verification of lazy caching
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
IEEE Transactions on Computers
| Hi-index | 0.00 |
In this paper we propose a methodology for verifying the sequential consistency of caching algorithms. The scheme combines times-tamping and an auxiliary history table to construct a serial execution 'matching' any given execution of the algorithm. We believe that this approach is applicable to an interesting class of sequentially consistent algorithms in which the buffering of cache updates allows stale values to be read from cache. We illustrate this methodology by verifying the high level specifications of the lazy caching and ring algorithms.