scientific article; zbMATH DE number 1982207
From MaRDI portal
Publication:4426384
zbMath1023.68529MaRDI QIDQ4426384
Publication date: 16 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2648/26480213.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Local Symmetry and Compositional Verification ⋮ Compositional Reasoning ⋮ Thread-modular analysis of release-acquire concurrency ⋮ Highly dependable concurrent programming using design for verification ⋮ Static analysis of embedded real-time concurrent software with dynamic priorities ⋮ LCTD: test-guided proofs for C programs on LLVM ⋮ A model checking-based approach for security policy verification of mobile systems ⋮ Counterexample-guided abstraction refinement for symmetric concurrent programs ⋮ Analysis of correct synchronization of operating system components ⋮ Dataflow Analysis for Datarace-Free Programs ⋮ Compositionality Entails Sequentializability ⋮ Verification of Boolean programs with unbounded thread creation ⋮ Unnamed Item ⋮ 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 ⋮ Local proofs for global safety properties ⋮ Testing Systems of Concurrent Black-Boxes—An Automata-Theoretic and Decompositional Approach
This page was built for publication: