Pages that link to "Item:Q5498738"
From MaRDI portal
The following pages link to FDR3 — A Modern Refinement Checker for CSP (Q5498738):
Displaying 32 items.
- Rigorous development of component-based systems using component metadata and patterns (Q333322) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- Revisiting sequential composition in process calculi (Q890611) (← links)
- Tracking CSP computations (Q1633350) (← links)
- Compositional and local livelock analysis for CSP (Q1705697) (← links)
- The symbiosis of concurrency and verification: teaching and case studies (Q1707345) (← links)
- Reducing complex CSP models to traces via priority (Q1744391) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- View abstraction for systems with component identities (Q2024368) (← links)
- Sound reasoning in \textit{tock}-CSP (Q2120813) (← links)
- Temporal reasoning through automatic translation of tock-CSP into timed automata (Q2154047) (← links)
- Translating between models of concurrency (Q2182666) (← links)
- Discovering and correcting a deadlock in a channel implementation (Q2322306) (← links)
- Interactive verification of architectural design patterns in FACTum (Q2335950) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (Q2418047) (← links)
- The expressiveness of CSP with priority (Q2520703) (← links)
- Mitigating Multi-target Attacks in Hash-Based Signatures (Q2798784) (← links)
- Process Algebra and Model Checking (Q3176390) (← links)
- Behavioural Models for FMI Co-simulations (Q3179405) (← links)
- The Automatic Detection of Token Structures and Invariants Using SAT Checking (Q3303932) (← links)
- Refinement-Based Verification of Communicating Unstructured Code (Q4571128) (← links)
- (Q5856411) (← links)
- Compositional Assume-Guarantee Reasoning of Control Law Diagrams Using UTP (Q5861786) (← links)
- Testing using CSP Models: Time, Inputs, and Outputs (Q5886524) (← links)
- Checking opacity and durable opacity with FDR (Q6045053) (← links)
- UTP, \textsf{\textit{Circus}}, and Isabelle (Q6535825) (← links)
- The consensus machine: formalising consensus in the presence of malign agents (Q6535829) (← links)
- Towards a model-checker for \textit{\textsf{Circus}} (Q6535951) (← links)
- \textit{\textsf{Circus2CSP}}: a tool for model-checking \textit{\textsf{Circus}} using FDR (Q6535952) (← links)
- Modelling and verifying robotic software that uses neural networks (Q6605338) (← links)
- Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving (Q6639734) (← links)