Freek Verbeek

From MaRDI portal
Person:437038

Available identifiers

zbMath Open verbeek.freekMaRDI QIDQ437038

List of research outcomes





PublicationDate of PublicationType
Formal verification of a deadlock detection algorithm2024-08-13Paper
Verification of building blocks for asynchronous circuits2024-08-13Paper
Low-level reachability analysis based on formal logic2023-12-12Paper
Highly Automated Formal Proofs over Memory Usage of Assembly Code2021-11-10Paper
https://portal.mardi4nfdi.de/entity/Q49671652019-07-03Paper
A Compositional Approach for Verifying Protocols Running on On-Chip Networks2018-09-20Paper
Deadlock Verification of Cache Coherence Protocols and Communication Fabrics2017-06-08Paper
Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks2012-07-17Paper
A formal proof of a necessary and sufficient condition for deadlock-free adaptive networks2010-09-14Paper

Research outcomes over time

This page was built for person: Freek Verbeek

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:437038&oldid=7531689"
Powered by MediaWiki