Distributed Computing
From MaRDI portal
Recommendations
- On implementations and semantics of a concurrent programming language
- Specification and verification of concurrent programs through refinements
- On verifying that a concurrent program satisfies a nondeterministic specification
- Concurrent specifications beyond linearizability
- Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
- A formal system for specification analysis of concurrent programs
- scientific article; zbMATH DE number 3898214
- On the Implementation of Speculative Constraint Processing
- Implementations of the CSP Notation for Concurrent Systems
- On the complexity of verifying concurrent transition systems
Cited in
(11)- On the complexity of verifying concurrent transition systems
- On the Implementation of Speculative Constraint Processing
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- Implement of synchronization of concurrent objects
- Implementations of the CSP Notation for Concurrent Systems
- Toward a theory of maximally concurrent programs (shortened version)
- On the succinctness of idioms for concurrent programming
- A resolution calculus for the branching-time temporal logic CTL
- Complexity of Decision Problems for Mixed and Modal Specifications
- Maximally concurrent programs
- A consistency analysis of a class of concurrent transient implicit/explicit algorithms
This page was built for publication: Distributed Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897405)
