Filter by
Intensional datatype refinement: with application to scalable verification of pattern-match safety.
Eddie Jones and Steven Ramsay.
Proceedings of the ACM on Programming Languages, Volume 5, Issue POPL, 2021, Article No.: 55, 1–29. 2021
Formal verification of high-level synthesis.
Yann Herklotz, James D. Pollard, Nadesh Ramanathan, and John Wickerson.
Proceedings of the ACM on Programming Languages, Volume 5, Issue OOPSLA, 2021, Article No.: 117, 1–30. 2021
An Empirical Study of the Reliability of High-Level Synthesis Tools.
Yann Herklotz, Zewei Du, Nadesh Ramanathan, and John Wickerson.
IEEE 29th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), 2021, 219-223. 2021
Verifying correctness of persistent concurrent data structures: a sound and complete method.
John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim.
Formal Aspects of Computing, Volume 33, Issue 4-5, 547–573. 2021
Canonical Automata via Distributive Law Homomorphisms.
Stefan Zetzsche, Gerco van Heerdt, Matteo Sammartino, and Alexandra Silva.
EPTCS 351, 2021, 296-313. 2021
C4: the C compiler concurrency checker.
Matt Windsor, Alastair F. Donaldson, and John Wickerson.
ISSTA 2021: Proceedings of the 30th ACM SIGSOFT International Symposium on Software Testing and Analysis, July 2021, 670–673. 2021
Query Lifting: Language-integrated query for heterogeneous nested collections.
Wilmer Ricciotti & James Cheney.
In: Yoshida, N. (eds) Programming Languages and Systems. ESOP 2021, vol 12648, 579–606. 2021
Protocol combinators for modeling, testing, and execution of distributed systems.
Kristoffer Just Arndal Andersen and Ilya Sergey.
Journal of Functional Programming, 31, E3, 2021. 2021
PISTIS: An Event-Triggered Real-Time Byzantine-Resilient Protocol Suite.
David Kozhaya, Jérémie Decouchant, Vincent Rahli, and Paulo Esteves-Verissimo.
IEEE Transactions on Parallel and Distributed Systems, vol. 32, no. 9, 2277-2290. 2021
Two Mechanisations of WebAssembly 1.0.
Conrad Watt, Xiaojia Rao, Jean Pichon-Pharabod, Martin Bodin, and Philippa Gardner.
In Huisman, M., Păsăreanu, C., Zhan, N. (eds) Formal Methods. FM 2021. Lecture Notes in Computer Science, vol 13047. 2021
CoSMed: A Confidentiality-Verified Social Media Platform.
Thomas Bauereiss and Andrei Popescu.
Arch. Formal Proofs 2021. 2021
Test-case reduction and deduplication almost for free with transformation-based compiler testing.
Alastair F. Donaldson, Paul Thomson, Vasyl Teliman, Stefano Milizia, André Perez Maselco, and Antoni Karpiński.
PLDI 2021: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, June 2021, 1017–1032. 2021
Annual Report 2020/2021
VeTSS
2021
ExpoSE: practical symbolic execution of standalone JavaScript.
Blake Loring, Duncan Mitchell, and Johannes Kinder.
SPIN 2017: Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, July 2017, 196–199. 2017
A B-tree library for Ocaml.
Tom Ridge.
ICFP 2017. 2017
Logic in Computer ScienceOn the Quest for an Acyclic Graph.
Mikolas Janota, Radu Grigore, and Vasco Manquinho.
arXiv: Logic in Computer Science. 2017
Symbolic Abstract Heaps for Polymorphic Information-Flow Guard Inference.
Nicolas Berthier and Narges Khakpour.
In the 23rd International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2023), 66-90. 2023.
Omega-Regular Reward Machines.
Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi and Dominik Wojtczak.
In Proc. 26th European Conference on Artificial Intelligence (ECAI 2023), pp. 972–979. 2023.
by