A functional formalization of on chip communications

DOI10.1007/S00165-007-0049-0zbMath1147.68698OpenAlexW2126261264MaRDI QIDQ931433

Julien Schmaltz, Dominique Borrione

Publication date: 25 June 2008

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-007-0049-0

zbMATH Keywords

Automated theorem provingFormal methodsCommunication architecturesNetworks on chip

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Related Items (1)

Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks

Uses Software

• Unnamed Item
• PVS
• HOL
• NQTHM

Cites Work

• Unnamed Item
• Unnamed Item
• A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol
• Modeling layered distributed communication systems
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Theorem Proving in Higher Order Logics
• Formal Methods in Computer-Aided Design
• Correct Hardware Design and Verification Methods

This page was built for publication: A functional formalization of on chip communications