Filter by
Static Race Detection and Mutex Safety and Liveness for Go Programs.
Julia Gabet and Nobuko Yoshida.
34th European Conference on Object-Oriented Programming, ECOOP 2020. 2020
Learning Weighted Automata over Principal Ideal Domains. FoSSaCS 2020. Lecture Notes in Computer Science, vol 12077.
Gerco van Heerdt, Clemens Kupke, Jurriaan Rot, and Alexandra Silva.
In: Goubault-Larrecq, J., König, B. (eds) Foundations of Software Science and Computation Structures. 2020
Modular Relaxed Dependencies in Weak Memory Concurrency.
Marco Paviotti, Simon Cooksey, Anouk Paradis, Daniel Wright, Scott Owens, and Mark Batty.
In: Müller, P. (eds) Programming Languages and Systems. ESOP 2020. Lecture Notes in Computer Science, vol 12075. 2020
The Taint Rabbit: Optimizing Generic Taint Analysis with Dynamic Fast Path Generation.
John Galea and Daniel Kroening.
ASIA CCS ’20: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security, October 2020, 622–636. 2020
Logic in Computer ScienceOn the Quest for an Acyclic Graph.
Mikolas Janota, Radu Grigore, and Vasco Manquinho.
arXiv: Logic in Computer Science. 2017
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
Blockchain Superoptimizer.
Julian Nagele and Maria A Schett.
Preproceedings of the 29th International Symposium on Logic-based Program Synthesis and Transformation, LOPSTR 2019, 166-180. 2019
A Key-Value store for Ocaml.
Tom Ridge.
24th ACM SIGPLAN International Conference on Functional Programming, ICFP 2019. 2019
PrideMM: A Solver for Relaxed Memory Models.
Simon Cooksey, Sarah Harris, Mark Batty, Radu Grigore, and Mikoláš Janota.
arXiv: Logic in Computer Science. 2019
Structuring the synthesis of heap-manipulating programs.
Nadia Polikarpova and Ilya Sergey.
Proceedings of the ACM on Programming Languages, Volume 3, Issue POPL, 2019, Article No.: 72, 1–30. 2019
Distributed Protocol Combinators.
Kristoffer J. A. Andersen and Ilya Sergey.
In: Alferes, J., Johansson, M. (eds) Practical Aspects of Declarative Languages. PADL 2019. Lecture Notes in Computer Science, vol 11372. 2019
Sound regular expression semantics for dynamic symbolic execution of JavaScript.
Blake Loring, Duncan Mitchell, and Johannes Kinder.
PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 425–438. 2019
A Formal Model for Checking Cryptographic API Usage in JavaScript.
Duncan Mitchell and Johannes Kinder.
In: Sako, K., Schneider, S., Ryan, P. (eds) Computer Security – ESORICS 2019. Lecture Notes in Computer Science, vol 11735. 2019
Program Verification in the Presence of I/O.
Hugo Férée, Johannes Å. Pohjola, Ramana Kumar, Scott Owens, Magnus O. Myreen, and Son Ho.
In: Piskac, R., Rümmer, P. (eds) Verified Software. Theories, Tools, and Experiments. VSTTE 2018. Lecture Notes in Computer Science, vol 11294. 2018
Checking cryptographic API usage with composable annotations (short paper).
Duncan Mitchell, L. Thomas van Binsbergen, Blake Loring, and Johannes Kinder.
PEPM ’18: Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, December 2017, 53–59. 2018
A B-tree library for Ocaml.
Tom Ridge.
ICFP 2017. 2017
Problem Book 2024
VeTSS, 2024.
Semantics of Remote Direct Memory Access: Operational and Declarative Models of RDMA on TSO Architectures.
Guillaume Ambal, Brijesh Dongol, Haggai Eran, Vasileios Klimis, Ori Lahav, Azalea Raad.
Proceedings of the ACM on Programming Languages, Volume 8, Issue OOPSLA2
Article No.: 341, Pages 1982 – 2009. OOPSLA 2024.
by