The following pages link to Gerhard Schellhorn (Q539220):
Displayed 36 items.
- Proving linearizability with temporal logic (Q539223) (← links)
- Completeness of fair ASM refinement (Q541210) (← links)
- ASM refinement and generalizations of forward simulation in data refinement: a comparison (Q555790) (← links)
- Automated flaw detection in algebraic specifications (Q616853) (← links)
- Relational concurrent refinement. II: Internal operations and outputs (Q1019018) (← links)
- Mechanized proofs of opacity: a comparison of two techniques (Q1673658) (← links)
- Verifying correctness of persistent concurrent data structures: a sound and complete method (Q1982636) (← links)
- Flashix: modular verification of a concurrent and crash-safe flash file system (Q2117600) (← links)
- RGITL: a temporal logic framework for compositional reasoning about interleaved programs (Q2251128) (← links)
- Atomic actions, and their refinements to isolated protocols (Q2268472) (← links)
- (Q2702600) (← links)
- (Q2702602) (← links)
- (Q2709812) (← links)
- Towards a Thread-Local Proof Technique for Starvation Freedom (Q2814127) (← links)
- A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures (Q2946743) (← links)
- Formal Verification of a Lock-Free Stack with Hazard Pointers (Q3105753) (← links)
- Verifying Concurrent Systems with Symbolic Execution (Q3146300) (← links)
- (Q3174968) (← links)
- (Q3539946) (← links)
- Automating Algebraic Specifications of Non-freely Generated Data Types (Q3540070) (← links)
- Interactive verification of concurrent systems using symbolic execution (Q3568235) (← links)
- Temporal Logic Verification of Lock-Freedom (Q3575281) (← links)
- Proving Linearizability Via Non-atomic Refinement (Q3608884) (← links)
- (Q4281573) (← links)
- (Q4520493) (← links)
- (Q4524764) (← links)
- (Q4524769) (← links)
- (Q4539647) (← links)
- (Q4858951) (← links)
- Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory (Q5041273) (← links)
- (Q5101340) (← links)
- Formal Fault Tree Analysis - Practical Experiences (Q5178999) (← links)
- Verifying Opacity of a Transactional Mutex Lock (Q5206950) (← links)
- Completeness of ASM Refinement (Q5403462) (← links)
- Bounded Relational Analysis of Free Data Types (Q5458813) (← links)
- (Q6083440) (← links)