The following pages link to FDR2 (Q23408):
Displaying 45 items.
- Verification of \(\mathrm{EB}^3\) specifications using CADP (Q282110) (← links)
- On the diversity of asynchronous communication (Q315311) (← links)
- Rigorous development of component-based systems using component metadata and patterns (Q333322) (← links)
- Information flow in systems with schedulers. II: Refinement (Q383362) (← links)
- Specifying termination in CSP (Q407510) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Refinement checking for privacy policies (Q436427) (← links)
- Enabling synchronous and asynchronous communications in CSP for SOC (Q530849) (← links)
- Formalisations and applications of BPMN (Q541678) (← links)
- Property specifications for workflow modelling (Q549695) (← links)
- Using data-independence in the analysis of intrusion detection systems (Q557891) (← links)
- Test generation from state based use case models (Q736788) (← links)
- The behavioural semantics of Event-B refinement (Q736910) (← links)
- On using data abstractions for model checking refinements (Q878378) (← links)
- Revisiting sequential composition in process calculi (Q890611) (← links)
- Formalization of an architectural model for exception handling coordination based on CA action concepts (Q967556) (← links)
- Conformance notions for the coordination of interaction components (Q967558) (← links)
- Revivals, stuckness and the hierarchy of CSP models (Q1007236) (← links)
- FDR explorer (Q1019020) (← links)
- A CSP model with flexible parallel termination semantics (Q1037248) (← links)
- Planning proofs of equations in CCS (Q1857269) (← links)
- Source code verification of a secure payment applet (Q1881671) (← links)
- On the limits of refinement-testing for model-checking CSP (Q1941896) (← links)
- Model transformations across views (Q2266947) (← links)
- Efficient symbolic computation of process expressions (Q2389343) (← links)
- Integrating a formal method into a software engineering process with UML and Java (Q2481209) (← links)
- Process algebras as specification language (work in progress) (Q2842868) (← links)
- Compositional state space reduction using untangled actions (Q2866342) (← links)
- Symbolic Analysis Tools for CSP (Q2938170) (← links)
- Directed Model Checking for B: An Evaluation and New Techniques (Q2999306) (← links)
- Simulating Truly Concurrent CSP (Q2999314) (← links)
- Unifying Theories of Undefinedness in UTP (Q3455642) (← links)
- Property Specifications for Workflow Modelling (Q3605458) (← links)
- CSP with Hierarchical State (Q3605464) (← links)
- Model Checking LTL Formulae in RAISE with FDR (Q3605469) (← links)
- Behavioral Constraints for Visual Models1 1Research partially supported by the ESPRIT Working Group APPLIGRAPH and the TMR network GETGRATS. (Q4921553) (← links)
- On Refinement-Closed Security Properties and Nondeterministic Compositions (Q5178974) (← links)
- Compositional CSP Traces Refinement Checking (Q5178982) (← links)
- On the Decidability of the Safety Problem for Access Control Policies (Q5178997) (← links)
- Assumption-Commitment Support for CSP Model Checking (Q5178998) (← links)
- A Relative Timed Semantics for BPMN (Q5179205) (← links)
- Multiple Synchrony in MSC (Q5179361) (← links)
- Refactoring Object-Oriented Specifications with Data and Processes (Q5428914) (← links)
- (Q5431924) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703799) (← links)
