swMATH12387MaRDI QIDQ24316FDOQ24316
Author name not available (Why is that?)
Official website: https://www.cs.ox.ac.uk/projects/fdr/
Cited In (67)
- Discovering and correcting a deadlock in a channel implementation
- Process algebra and model checking
- Testing using CSP Models: Time, Inputs, and Outputs
- Title not available (Why is that?)
- Symbolic analysis tools for CSP
- Translating between models of concurrency
- Extended dependency graphs and efficient distributed fixed-point computation
- Reducing complex CSP models to traces via priority
- Principled software development. Essays dedicated to Arnd Poetzsch-Heffter on the occasion of his 60th birthday. Selected papers based on the presentations at the symposium, Kaiserslautern, Germany, November 2018
- Interactive verification of architectural design patterns in FACTum
- Sound reasoning in \textit{tock}-CSP
- Tracking CSP computations
- Refinement-Based Verification of Communicating Unstructured Code
- Behavioural models for FMI co-simulations
- SafeJML
- CSP and Kripke Structures
- The expressiveness of CSP with priority
- Revisiting sequential composition in process calculi
- CCSP
- D-Finder
- StateFlow
- CADP
- KRoC
- CZT
- Casper
- Fiacre
- ProB
- LTSmin
- CAESAR_SOLVE
- Z
- FDR2
- Handel-C
- MARCIE
- SOFA 2.0
- ProBE
- Xtext
- NAT2TEST
- PACC starter kit
- HOL-TestGen
- Rigorous development of component-based systems using component metadata and patterns
- Jaza
- LNT2LOTOS
- SPHIN
- Isabelle/UTP
- Circus
- RailCNL
- Murphi
- ZRC
- NOrec
- DeltaJ
- JCSP
- DarwinSPL
- DeltaEcore
- JOANA
- SCCharts
- SCEst
- Dynamic Architectures
- FACTum
- Architectural_Design_Patterns
- Compositional verification of asynchronous concurrent systems using CADP
- 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
- Ensuring liveness properties of distributed systems: open problems
- FDR3 -- a modern refinement checker for CSP
- The automatic detection of token structures and invariants using SAT checking
- The symbiosis of concurrency and verification: teaching and case studies
This page was built for software: FDR3
