AbstractWe describe an approach to verifying concurrent data structures based on simulation between two Input/Output Automata (IOAs), modelling the specification and the implementation. We explain how we used this approach in mechanically verifying a simple lock-free stack implementation using forward simulation, and briefly discuss our experience in verifying three other lock-free algorithms which all required the use of backward simulation
Concurrent data structure algorithms have traditionally been designed using locks to regulate the be...
Concurrent data structure algorithms have traditionally been designed using locks to regulate the be...
Abstract. Simulation-based assertional techniques and process algebraic tech-niques are two of the m...
We describe an approach to verifying concurrent data structures based on simulation between two Inpu...
Efficient implementations of data structures such as queues, stacks or hash-tables allow for concurr...
AbstractIn recent years, we extended the theory of Abadi and Lamport (1991) on the existence of refi...
Concurrent data structures with fine-grained synchronization are notoriously difficult to implement ...
Abstract: "A concurrent object is a data structure shared by concurrent processes. This paper descri...
Concurrent data structures with fine-grained synchronization are notoriously difficult to implement ...
In recent years, we extended an older theory on the existence of refinement mappings. The present pa...
In this thesis, we formally verify a simplified version of the non-blocking linearizable binary sear...
Concurrent data structures with fine-grained synchronization are notoriously difficult to implement ...
We show that correctness criteria of concurrent algorithms are mathematically equivalent to the exis...
AbstractA unified, comprehensive presentation of simulation techniques for verification of concurren...
Abstract. We present a technique for automatically verifying safety properties of concurrent program...
Concurrent data structure algorithms have traditionally been designed using locks to regulate the be...
Concurrent data structure algorithms have traditionally been designed using locks to regulate the be...
Abstract. Simulation-based assertional techniques and process algebraic tech-niques are two of the m...
We describe an approach to verifying concurrent data structures based on simulation between two Inpu...
Efficient implementations of data structures such as queues, stacks or hash-tables allow for concurr...
AbstractIn recent years, we extended the theory of Abadi and Lamport (1991) on the existence of refi...
Concurrent data structures with fine-grained synchronization are notoriously difficult to implement ...
Abstract: "A concurrent object is a data structure shared by concurrent processes. This paper descri...
Concurrent data structures with fine-grained synchronization are notoriously difficult to implement ...
In recent years, we extended an older theory on the existence of refinement mappings. The present pa...
In this thesis, we formally verify a simplified version of the non-blocking linearizable binary sear...
Concurrent data structures with fine-grained synchronization are notoriously difficult to implement ...
We show that correctness criteria of concurrent algorithms are mathematically equivalent to the exis...
AbstractA unified, comprehensive presentation of simulation techniques for verification of concurren...
Abstract. We present a technique for automatically verifying safety properties of concurrent program...
Concurrent data structure algorithms have traditionally been designed using locks to regulate the be...
Concurrent data structure algorithms have traditionally been designed using locks to regulate the be...
Abstract. Simulation-based assertional techniques and process algebraic tech-niques are two of the m...