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)
Recommendations
Cited in
(67)- Safe abstractions of data encodings in formal security protocol models
- RiskStructures: a design algebra for risk-aware machines
- Discovering and correcting a deadlock in a channel implementation
- scientific article; zbMATH DE number 7447778 (Why is no real title available?)
- Process algebra and model checking
- Enabling synchronous and asynchronous communications in CSP for SOC
- Testing using CSP Models: Time, Inputs, and Outputs
- Unique solutions of contractions, CCS, and their HOL formalisation
- scientific article; zbMATH DE number 7327941 (Why is no real title available?)
- Specifying termination in CSP
- A Unary Semigroup Trace Algebra
- Translating between models of concurrency
- Divergence and unique solution of equations
- A case study on parametric verification of failure detectors
- scientific article; zbMATH DE number 1995155 (Why is no real title available?)
- Reducing complex CSP models to traces via priority
- Equations, contractions, and unique solutions
- Towards hardware-intrinsic security. Foundations and practice. Foreword by Pim Tuyls.
- Static Livelock Analysis in CSP
- Sound reasoning in \textit{tock}-CSP
- Slow abstraction via priority
- Elucidating concurrent algorithms via layers of abstraction and reification
- Refinement checking for privacy policies
- SAT-solving in CSP trace refinement
- Checking opacity and durable opacity with FDR
- Tracking CSP computations
- Mitigating multi-target attacks in hash-based signatures
- Angelicism in the theory of reactive processes
- View abstraction for systems with component identities
- Angelic processes for CSP via the UTP
- Denotational semantics of channel mobility in UTP-CSP
- Modelling timed reactive systems from natural-language requirements
- Behavioural models for FMI co-simulations
- Checking noninterference in timed CSP
- Simulating truly concurrent CSP
- The expressiveness of CSP with priority
- Revisiting sequential composition in process calculi
- Temporal reasoning through automatic translation of tock-CSP into timed automata
- scientific article; zbMATH DE number 7453962 (Why is no real title available?)
- A stepwise approach to linking theories
- Correct and efficient antichain algorithms for refinement checking
- Introduction to concurrency theory. Transition systems and CCS
- Models for CSP with availability information
- Rigorous development of component-based systems using component metadata and patterns
- Towards Algebraic Semantics of Circus Time
- Compositional modelling and reasoning in an institution for processes and data
- Test selection for traces refinement
- Towards `up to context' reasoning about higher-order processes
- Semantics of dynamic hiding in mobile UTP-CSP
- An Implementation Relation for Cyclic Systems with Refusals and Discrete Time
- Local analysis of determinism for CSP
- All congruences below stability-preserving fair testing or CFFD
- Removing redundant refusals: minimal complete test suites for failure trace semantics
- Multi-parameterised compositional verification of safety properties
- scientific article; zbMATH DE number 1979286 (Why is no real title available?)
- Divergence and unique solution of equations
- On constructibility and unconstructibility of LTS operators from other LTS operators
- Computing maximal weak and other bisimulations
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
- Compositional and local livelock analysis for CSP
- The automatic detection of token structures and invariants using SAT checking
- The consensus machine: formalising consensus in the presence of malign agents
- UTP, \textsf{\textit{Circus}}, and Isabelle
- Complete model-based equivalence class testing for nondeterministic systems
- The symbiosis of concurrency and verification: teaching and case studies
- Associative composition of components with double-sided interfaces
- The semantics and verification of timed service choreography
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)
