Rigorous development of component-based systems using component metadata and patterns
DOI10.1007/S00165-016-0375-1zbMATH Open1348.68167OpenAlexW2345401972WikidataQ121755331 ScholiaQ121755331MaRDI QIDQ333322FDOQ333322
Authors: Marcel V. M. Oliveira, Augusto Sampaio, A. W. Roscoe, Pedro Antonino, Rodrigo A. Ramos, Alejandro Mota
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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Model of Component-Based Programming
- A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems
- A static analysis framework for livelock freedom in CSP
- An Approach to Modelling and Verification of Component Based Systems
- Component publications and compositions
- Compositional Verification for Component-Based Systems and Application
- Compositional state space reduction using untangled actions
- Confluence thanks to extensional determinism
- Conformance notions for the coordination of interaction components
- Ensuring Properties of Interaction Systems
- Everything Is PSPACE-Complete in Interaction Systems
- FDR3 -- a modern refinement checker for CSP
- Foundations of component-based systems.
- Local and global deadlock-detection in component-based systems are NP-hard
- Reo: a channel-based coordination model for component composition
- Robustness in Interaction Systems
- Understanding concurrent systems
- rCOS: a refinement calculus of object systems
Cited In (7)
- Mitigating multi-target attacks in hash-based signatures
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- The automatic detection of token structures and invariants using SAT checking
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)