Proving deadlock freedom in component-based programming

DOI10.1007/3-540-45314-8_6MaRDI QIDQ2764108zbMATH OpenFDO

Authors P. Inverardi, Sebastian Uchitel

Publication date 22 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2029/20290060

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) General topics in artificial intelligence (68T01) Logic in artificial intelligence (68T27) Computing methodologies and applications (68U99)

Recommendations

• Component-Based Construction of Deadlock-Free Systems
• Analyzing component-based systems on the basis of architectural constraints
• Deadlock-freedom in component systems with architectural constraints
• scientific article; zbMATH DE number 7314999
• Checking deadlock-freedom of parametric component-based systems

Cited in

(8)

• On the usability of process algebra: An architectural view
• Deadlock-freedom in component systems with architectural constraints
• Formal deadlock elimination in an object oriented conceptual schema
• scientific article; zbMATH DE number 7314999 (Why is no real title available?)
• An Expressive Framework for Verifying Deadlock Freedom
• Separating Lock-Freedom from Wait-Freedom
• Everything Is PSPACE-Complete in Interaction Systems
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Proving deadlock freedom in component-based programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2764108)