scientific article; zbMATH DE number 2087551
From MaRDI portal
Publication:4738361
zbMath1077.68606MaRDI QIDQ4738361
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2305/23050262.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (9)
Optimistic synchronization-based state-space reduction ⋮ Rely-guarantee termination and cost analyses of loops with concurrent interleavings ⋮ Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning ⋮ Dataflow Analysis for Datarace-Free Programs ⋮ Compositionality Entails Sequentializability ⋮ Modular verification of multithreaded programs ⋮ Compositional reasoning for shared-variable concurrent programs ⋮ Fine-grained complexity of safety verification ⋮ Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free
This page was built for publication:
