FDR3

swMATH12387MaRDI QIDQ24316FDOQ24316

Author name not available (Why is that?)

Cited In (26)

• Discovering and correcting a deadlock in a channel implementation
• Testing using CSP Models: Time, Inputs, and Outputs
• Title not available (Why is that?)
• Translating between models of concurrency
• Extended dependency graphs and efficient distributed fixed-point computation
• The Automatic Detection of Token Structures and Invariants Using SAT Checking
• Reducing complex CSP models to traces via priority
• Interactive verification of architectural design patterns in FACTum
• Sound reasoning in \textit{tock}-CSP
• Tracking CSP computations
• Process Algebra and Model Checking
• Symbolic Analysis Tools for CSP
• Refinement-Based Verification of Communicating Unstructured Code
• CSP and Kripke Structures
• The expressiveness of CSP with priority
• Revisiting sequential composition in process calculi
• Rigorous development of component-based systems using component metadata and patterns
• FDR3 — A Modern Refinement Checker for CSP
• Compositional verification of asynchronous concurrent systems using CADP
• Behavioural Models for FMI Co-simulations
• Principled Software Development
• 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
• The symbiosis of concurrency and verification: teaching and case studies

This page was built for software: FDR3