Pages that link to "Item:Q5464482"

The following pages link to Formal Techniques for Networked and Distributed Systems – FORTE 2004 (Q5464482):

Displaying 10 items.

• Towards formally specifying and verifying transactional memory (Q470040) (← links)
• Proving linearizability with temporal logic (Q539223) (← links)
• A general technique for proving lock-freedom (Q1001810) (← links)
• Trace-based derivation of a scalable lock-free stack algorithm (Q1019022) (← 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)
• Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free (Q2058383) (← links)
• RGITL: a temporal logic framework for compositional reasoning about interleaved programs (Q2251128) (← 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)