Name
Papers
Collaborators
GERHARD SCHELLHORN
90
97
Citations 
PageRank 
Referers 
769
56.43
655
Referees 
References 
796
1234
Search Limit
100796
Title
Citations
PageRank
Year
Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement00.342022
Brief Announcement - On Strong Observational Refinement and Forward Simulation.00.342021
Verifying correctness of persistent concurrent data structures: a sound and complete method00.342021
Flashix - Modular Verification of a Concurrent and Crash-Safe Flash File System.00.342021
Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory00.342020
Adding Concurrency to a Sequential Refinement Tower.00.342020
Modular Integration of Crashsafe Caching into a Verified Virtual File System Switch.00.342020
Verifying Correctness of Persistent Concurrent Data Structures.00.342019
Mechanized proofs of opacity: a comparison of two techniques.10.362018
FastLane Is Opaque - a Case Study in Mechanized Proofs of Opacity.00.342018
Symbolic execution for a clash-free subset of ASMs.10.362018
Modular Verification of Order-Preserving Write-Back Caches.10.352017
A Relational Encoding for a Clash-Free Subset of ASMs.10.362016
Proving Opacity of a Pessimistic STM.00.342016
Modular, crash-safe refinement for ASMs with submachines.20.372016
Towards a Thread-Local Proof Technique for Starvation Freedom.00.342016
KIV: overview and VerifyThis competition.160.742015
Inside a Verified Flash File System: Transactions and Garbage Collection.60.442015
Verifying opacity of a transactional Mutex lock70.562015
Verification of B$$^+$$ trees by integration of shape analysis and interactive theorem proving00.342015
Two approaches for proving linearizability of multiset.10.352014
Modular Refinement for Submachines of ASMs.40.412014
Quiescent Consistency: Defining and Verifying Relaxed Linearizability.80.442014
Development of a Verified Flash File System.120.562014
A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures230.822014
RGITL: A temporal logic framework for compositional reasoning about interleaved programs100.612014
Formal Specification of an Erase Block Management Layer for Flash Memory.50.442013
Verification of a Virtual Filesystem Switch.150.712013
Compositional Verification of a Lock-Free Stack with RGITL.20.372013
How to prove algorithms linearisable230.812012
A Formal Model Of A Virtual Filesystem Switch70.572012
Proving Linearizability of Multiset with Local Proof Obligations.30.372012
Formal verification of a lock-free stack with hazard pointers110.592011
Verifying linearisability with potential linearisation points220.942011
The COST IC0701 verification competition 2011120.582011
Completeness of fair ASM refinement100.512011
Selected papers of the Refinement Workshop Turku (2008)00.342011
Proving linearizability with temporal logic160.712011
Mondex: Engineering a Provable Secure Electronic Purse.20.372011
Mechanically verified proof obligations for linearizability280.982011
Extending ITL with Interleaved Programs for Interactive Verification00.342011
Interleaved Programs and Rely-Guarantee Reasoning with ITL160.722011
Simulating a Flash File System with CoreASM and Eclipse.00.342011
Automated Flaw Detection in Algebraic Specifications30.402010
Interactive verification of concurrent systems using symbolic execution170.762010
Temporal logic verification of lock-freedom100.562010
Atomic actions, and their refinements to isolated protocols70.472010
Relational concurrent refinement part II: Internal operations and outputs130.592009
Abstract Specification of the UBIFS File System for Flash Memory191.152009
Formal Verification of Lock-Free Algorithms00.342009
  • 1
  • 2