Formalizing on chip communications in a functional style

DOI10.4230/OASICS.TRUSTWORTHYSW.2006.700MaRDI QIDQ2917406zbMATH OpenFDO

Authors Julien Schmaltz, Dominique Borrione

Publication date 28 September 2012

Full work available at URL https://doi.org/10.4230/OASICS.TRUSTWORTHYSW.2006.700

zbMATH Keywords

automated theorem provingcommunication architecturesformal methods

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• A functional formalization of on chip communications
• Formal Methods in Computer-Aided Design
• Theorem Proving in Higher Order Logics
• Networks-on-Chips
• The Verification of the On-Chip COMA Cache Coherence Protocol

Cited in

(6)

• Formal development of NoC systems in B
• Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks
• Theorem Proving in Higher Order Logics
• Formal Methods in Computer-Aided Design
• A formalisation of \textsc{xMAS}
• A functional formalization of on chip communications

Describes a project that uses

Uses Software

• ACL2

This page was built for publication: Formalizing on chip communications in a functional style

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