Rigorous development of component-based systems using component metadata and patterns
DOI10.1007/S00165-016-0375-1zbMATH Open1348.68167OpenAlexW2345401972WikidataQ121755331 ScholiaQ121755331MaRDI QIDQ333322FDOQ333322
Marcel V. M. Oliveira, Rodrigo A. Ramos, Augusto Sampaio, Pedro Antonino, Alejandro Mota, A. W. Roscoe
Publication date: 28 October 2016
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:8ecc6dbf-5cda-4d40-8b02-db0d2bcec21b
Recommendations
CSPbehavioural patterncomponent-based developmentcorrect by constructiondeadlock analysisdesignsmetadata
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Reo: a channel-based coordination model for component composition
- Compositional Verification for Component-Based Systems and Application
- Title not available (Why is that?)
- Understanding concurrent systems
- Local and global deadlock-detection in component-based systems are NP-hard
- A static analysis framework for livelock freedom in CSP
- Compositional state space reduction using untangled actions
- Title not available (Why is that?)
- A Model of Component-Based Programming
- Title not available (Why is that?)
- Component Publications and Compositions
- Ensuring Properties of Interaction Systems
- Robustness in Interaction Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Confluence Thanks to Extensional Determinism
- An Approach to Modelling and Verification of Component Based Systems
- A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems
- FDR3 — A Modern Refinement Checker for CSP
- Everything Is PSPACE-Complete in Interaction Systems
- rCOS: a refinement calculus of object systems
- Conformance notions for the coordination of interaction components
Cited In (7)
- The Automatic Detection of Token Structures and Invariants Using SAT Checking
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mitigating Multi-target Attacks in Hash-Based Signatures
- Title not available (Why is that?)
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
- Compositional and local livelock analysis for CSP
Uses Software
This page was built for publication: Rigorous development of component-based systems using component metadata and patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q333322)