Formal verification of a deadlock detection algorithm

DOI10.4204/eptcs.70.8MaRDI QIDQ6586533zbMATH OpenFDO

Authors Freek Verbeek, Julien Schmaltz

Publication date 13 August 2024

Full work available at URL https://doi.org/10.4204/eptcs.70.8

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Formalization of mathematics in connection with theorem provers (68V20)

Recommendations

• scientific article; zbMATH DE number 1670759
• Scaling up livelock verification for network-on-chip routing algorithms
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Verifying deadlock-freedom of communication fabrics
• A formal proof of a necessary and sufficient condition for deadlock-free adaptive networks

Cites work

• Structured theory development for a mechanized logic

This page was built for publication: Formal verification of a deadlock detection algorithm

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