FDR2

swMATH11466MaRDI QIDQ23408FDOQ23408

Author name not available (Why is that?)

Cited In (45)

• Enabling synchronous and asynchronous communications in CSP for SOC
• On the decidability of the safety problem for access control policies
• Multiple synchrony in MSC
• Symbolic analysis tools for CSP
• Specifying termination in CSP
• Formalization of an architectural model for exception handling coordination based on CA action concepts
• Formalisations and applications of BPMN
• Compositional state space reduction using untangled actions
• Tools and Algorithms for the Construction and Analysis of Systems
• Source code verification of a secure payment applet
• Property specifications for workflow modelling
• Verification of \(\mathrm{EB}^3\) specifications using CADP
• Model Checking LTL Formulae in RAISE with FDR
• A CSP model with flexible parallel termination semantics
• Using data-independence in the analysis of intrusion detection systems
• Refinement checking for privacy policies
• SAT-solving in CSP trace refinement
• Refactoring Object-Oriented Specifications with Data and Processes
• Planning proofs of equations in CCS
• Revivals, stuckness and the hierarchy of CSP models
• A relative timed semantics for BPMN
• On using data abstractions for model checking refinements
• Simulating truly concurrent CSP
• On the diversity of asynchronous communication
• On process-algebraic verification of asynchronous circuits
• Revisiting sequential composition in process calculi
• FDR explorer
• Model transformations across views
• Test generation from state based use case models
• Rigorous development of component-based systems using component metadata and patterns
• Integrating a formal method into a software engineering process with UML and Java
• On refinement-closed security properties and nondeterministic compositions
• Compositional CSP traces refinement checking
• Efficient symbolic computation of process expressions
• The behavioural semantics of Event-B refinement
• Assumption-commitment support for CSP model checking
• Conformance notions for the coordination of interaction components
• Property Specifications for Workflow Modelling
• CSP with Hierarchical State
• Unifying theories of undefinedness in UTP
• Information flow in systems with schedulers. II: Refinement
• On the limits of refinement-testing for model-checking CSP
• Process algebras as specification language (work in progress)
• Directed Model Checking for B: An Evaluation and New Techniques
• Behavioral constraints for visual models

This page was built for software: FDR2