Understanding concurrent systems
DOI10.1007/978-1-84882-258-0zbMATH Open1211.68205OpenAlexW2128510433MaRDI QIDQ2269718FDOQ2269718
Publication date: 10 March 2010
Published in: Texts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-84882-258-0
Recommendations
softwareFDRconcurrent programmingcommunicating sequential processesprogramming techniquesmodels of concurrent systems
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (63)
- Title not available (Why is that?)
- Discovering and correcting a deadlock in a channel implementation
- RiskStructures: a design algebra for risk-aware machines
- Testing using CSP Models: Time, Inputs, and Outputs
- Enabling synchronous and asynchronous communications in CSP for SOC
- Unique solutions of contractions, CCS, and their HOL formalisation
- Specifying termination in CSP
- Translating between models of concurrency
- Title not available (Why is that?)
- The Automatic Detection of Token Structures and Invariants Using SAT Checking
- Reducing complex CSP models to traces via priority
- Static Livelock Analysis in CSP
- Sound reasoning in \textit{tock}-CSP
- Elucidating concurrent algorithms via layers of abstraction and reification
- Refinement checking for privacy policies
- SAT-solving in CSP trace refinement
- Tracking CSP computations
- Process Algebra and Model Checking
- View abstraction for systems with component identities
- Angelic processes for CSP via the UTP
- Denotational semantics of channel mobility in UTP-CSP
- Checking noninterference in timed CSP
- Modelling timed reactive systems from natural-language requirements
- The expressiveness of CSP with priority
- Slow Abstraction via Priority
- Revisiting sequential composition in process calculi
- Temporal reasoning through automatic translation of tock-CSP into timed automata
- Models for CSP with availability information
- Mitigating Multi-target Attacks in Hash-Based Signatures
- Angelicism in the Theory of Reactive Processes
- Towards Algebraic Semantics of Circus Time
- Rigorous development of component-based systems using component metadata and patterns
- Equations, Contractions, and Unique Solutions
- Test selection for traces refinement
- Towards `up to context' reasoning about higher-order processes
- Behavioural Models for FMI Co-simulations
- All congruences below stability-preserving fair testing or CFFD
- Title not available (Why is that?)
- Removing redundant refusals: minimal complete test suites for failure trace semantics
- A Stepwise Approach to Linking Theories
- Title not available (Why is that?)
- Multi-parameterised compositional verification of safety properties
- On constructibility and unconstructibility of LTS operators from other LTS operators
- Compositional Modelling and Reasoning in an Institution for Processes and Data
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
- Computing maximal weak and other bisimulations
- Compositional and local livelock analysis for CSP
- The symbiosis of concurrency and verification: teaching and case studies
- Complete model-based equivalence class testing for nondeterministic systems
- Associative composition of components with double-sided interfaces
- The semantics and verification of timed service choreography
- Safe abstractions of data encodings in formal security protocol models
- Title not available (Why is that?)
- A Unary Semigroup Trace Algebra
- A case study on parametric verification of failure detectors
- Title not available (Why is that?)
- Checking opacity and durable opacity with FDR
- Title not available (Why is that?)
- Correct and efficient antichain algorithms for refinement checking
- Semantics of dynamic hiding in mobile UTP-CSP
- An Implementation Relation for Cyclic Systems with Refusals and Discrete Time
- The consensus machine: formalising consensus in the presence of malign agents
- UTP, \textsf{\textit{Circus}}, and Isabelle
This page was built for publication: Understanding concurrent systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269718)
