default search action
Freek Verbeek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]João Pascoal Faria, Freek Verbeek, Anna Rita Fasolino:
Report from the 14th International Workshop on Automating Test Case Design, Selection, and Evaluation (A-TEST 2023). ACM SIGSOFT Softw. Eng. Notes 49(2): 22-24 (2024) - [c29]Joshua A. Bockenek, Freek Verbeek, Binoy Ravindran:
Exceptional Interprocedural Control Flow Graphs for x86-64 Binaries. DIMVA 2024: 3-22 - [c28]Daniel Engel
, Freek Verbeek
On the Decidability of Disassembling Binaries. TASE 2024: 127-145 - [i3]Jaidev Shastri, Xiaoguang Wang, Basavesh Ammanaghatta Shivakumar, Freek Verbeek, Binoy Ravindran:
HMTRace: Hardware-Assisted Memory-Tagging based Dynamic Data Race Detection. CoRR abs/2404.19139 (2024) - 2023
- [c27]Daniel Engel
BIRD: A Binary Intermediate Representation for Formally Verified Decompilation of X86-64 Binaries. TAP 2023: 3-20 - [c26]Nico Naus
Low-Level Reachability Analysis Based on Formal Logic. TAP 2023: 21-39 - [d1]Daniel Engel
BIRD: A Binary Intermediate Representation for formally verified Decompilation of x86-64 binaries. Zenodo, 2023 - 2022
- [c25]Xiaoxin An, Freek Verbeek, Binoy Ravindran:
DSV: Disassembly Soundness Validation Without Assuming a Ground Truth. NFM 2022: 636-655 - [c24]Freek Verbeek, Joshua A. Bockenek, Zhoulai Fu, Binoy Ravindran:
Formally verified lifting of C-compiled x86-64 binaries. PLDI 2022: 934-949 - [c23]Nico Naus
A Formal Semantics for P-Code. VSTTE 2022: 111-128 - [i2]Nico Naus, Freek Verbeek, Marc Schoolderman, Binoy Ravindran:
Reachability Logic for Low-Level Programs. CoRR abs/2204.00076 (2022) - 2021
- [j11]Freek Verbeek, Abhijith Bharadwaj, Joshua A. Bockenek, Ian Roessle, Timmy Weerwag, Binoy Ravindran:
X86 instruction semantics and basic block symbolic execution. Arch. Formal Proofs 2021 (2021) - [c22]Jae-Won Jang, Freek Verbeek, Binoy Ravindran:
Verification of Functional Correctness of Code Diversification Techniques. NFM 2021: 160-179 - 2020
- [c21]Freek Verbeek, Pierre Olivier, Binoy Ravindran
Sound C Code Decompilation for a Subset of x86-64 Binaries. SEFM 2020: 247-264 - [c20]Freek Verbeek
Highly Automated Formal Proofs over Memory Usage of Assembly Code. TACAS (2) 2020: 98-117
2010 – 2019
- 2019
- [c19]Ian Roessle
Formally verified big step semantics out of x86-64 binaries. CPP 2019: 181-195 - [c18]Freek Verbeek, Joshua A. Bockenek
Establishing a refinement relation between binaries and abstract code. MEMOCODE 2019: 17:1-17:5 - [c17]Joshua A. Bockenek
Formal Verification of Memory Preservation of x86-64 Binaries. SAFECOMP 2019: 35-49 - [i1]Marko C. J. D. van Eekelen, Daniil Frumin, Herman Geuvers, Léon Gondelman, Robbert Krebbers, Marc Schoolderman
A benchmark for C program verification. CoRR abs/1904.01009 (2019) - 2018
- [j10]Freek Verbeek
A Compositional Approach for Verifying Protocols Running on On-Chip Networks. IEEE Trans. Computers 67(7): 905-919 (2018) - 2017
- [j9]Freek Verbeek
Deadlock Verification of Cache Coherence Protocols and Communication Fabrics. IEEE Trans. Computers 66(2): 272-284 (2017) - [c16]Freek Verbeek, Nike van Vugt:
Estimating worst-case latency of on-chip interconnects with formal simulation. FMCAD 2017: 204-211 - 2016
- [c15]Freek Verbeek, Pooria M. Yaghini, Ashkan Eghbal, Nader Bagherzadeh:
ADVOCAT: Automated deadlock verification for on-chip cache coherence and interconnects. DATE 2016: 1640-1645 - [c14]Ronak Salamat, Masoumeh Ebrahimi, Nader Bagherzadeh
CoBRA: Low cost compensation of TSV failures in 3D-NoC. DFT 2016: 115-120 - 2015
- [c13]Freek Verbeek, Oto Havle, Julien Schmaltz, Sergey Tverdyshev, Holger Blasum, Bruno Langenstein, Werner Stephan, Burkhart Wolff, Yakoub Nemouchi
Formal API Specification of the PikeOS Separation Kernel. NFM 2015: 375-389 - 2014
- [j8]Freek Verbeek, Sergey Tverdyshev, Oto Havle, Holger Blasum, Bruno Langenstein, Werner Stephan, Yakoub Nemouchi, Abderrahmane Feliachi, Burkhart Wolff, Julien Schmaltz:
Formal Specification of a Generic Separation Kernel. Arch. Formal Proofs 2014 (2014) - [j7]Frits W. Vaandrager, Freek Verbeek:
Recreational Formal Methods: Designing Vacuum Cleaning Trajectories. Bull. EATCS 113 (2014) - [j6]Freek Verbeek, Julien Schmaltz:
A Decision Procedure for Deadlock-Free Routing in Wormhole Networks. IEEE Trans. Parallel Distributed Syst. 25(8): 1935-1944 (2014) - [c12]Adrian Garcia Ramirez, Julien Schmaltz, Freek Verbeek, Bruno Langenstein, Holger Blasum:
On Two Models of Noninterference: Rushby and Greve, Wilding, and Vanfleet. SAFECOMP 2014: 246-261 - [c11]Bernard van Gastel, Freek Verbeek, Julien Schmaltz:
Inference of channel types in micro-architectural models of on-chip communication networks. VLSI-SoC 2014: 1-6 - [e1]Freek Verbeek, Julien Schmaltz:
Proceedings Twelfth International Workshop on the ACL2 Theorem Prover and its Applications, Vienna, Austria, 12-13th July 2014. EPTCS 152, 2014 [contents] - 2013
- [c10]Freek Verbeek, Sebastiaan J. C. Joosten, Julien Schmaltz:
Formal Deadlock Verification for Click Circuits. ASYNC 2013: 183-190 - [c9]Freek Verbeek, Julien Schmaltz:
Verification of Building Blocks for Asynchronous Circuits. ACL2 2013: 70-84 - 2012
- [j5]Freek Verbeek, Julien Schmaltz:
Proof Pearl: A Formal Proof of Dally and Seitz' Necessary and Sufficient Condition for Deadlock-Free Routing in Interconnection Networks. J. Autom. Reason. 48(4): 419-439 (2012) - [j4]Freek Verbeek, Julien Schmaltz:
Easy Formal Specification and Validation of Unbounded Networks-on-Chips Architectures. ACM Trans. Design Autom. Electr. Syst. 17(1): 1:1-1:28 (2012) - [j3]Freek Verbeek, Julien Schmaltz:
Towards the formal verification of cache coherency at the architectural level. ACM Trans. Design Autom. Electr. Syst. 17(3): 20:1-20:16 (2012) - [c8]Freek Verbeek, Julien Schmaltz:
Automatic generation of deadlock detection algorithms for a family of microarchitecture description languages of communication fabrics. HLDVT 2012: 25-32 - [c7]Abdulaziz Alhussien, Nader Bagherzadeh, Freek Verbeek, Bernard van Gastel, Julien Schmaltz:
A formally verified deadlock-free routing function in a fault-tolerant NoC architecture. SBCCI 2012: 1-6 - 2011
- [j2]Freek Verbeek, Julien Schmaltz:
A Comment on "A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks". IEEE Trans. Parallel Distributed Syst. 22(10): 1775-1776 (2011) - [j1]Freek Verbeek, Julien Schmaltz:
On Necessary and Sufficient Conditions for Deadlock-Free Routing in Wormhole Networks. IEEE Trans. Parallel Distributed Syst. 22(12): 2022-2032 (2011) - [c6]Freek Verbeek, Julien Schmaltz:
Hunting deadlocks efficiently in microarchitectural models of communication fabrics. FMCAD 2011: 223-231 - [c5]Freek Verbeek, Julien Schmaltz:
Automatic verification for deadlock in networks-on-chips with adaptive routing and wormhole switching. NOCS 2011: 25-32 - [c4]Freek Verbeek, Julien Schmaltz:
A Fast and Verified Algorithm for Proving Store-and-Forward Networks Deadlock-Free. PDP 2011: 3-10 - [c3]Freek Verbeek, Julien Schmaltz:
Formal verification of a deadlock detection algorithm. ACL2 2011: 103-112 - 2010
- [c2]Freek Verbeek, Julien Schmaltz:
Formal specification of networks-on-chips: deadlock and evacuation. DATE 2010: 1701-1706 - [c1]Freek Verbeek, Julien Schmaltz:
A Formal Proof of a Necessary and Sufficient Condition for Deadlock-Free Adaptive Networks. ITP 2010: 67-82
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: