Filter by
Statically verified refinements for multiparty protocols.
Fangyi Zhou, Francisco Ferreira, Raymond Hu, Rumyana Neykova, and Nobuko Yoshida.
Proceedings of the ACM on Programming Languages, Volume 4, Issue OOPSLA 2020, Article No.: 148, 1–30. 2020
Type checking beyond type checkers, via slice & run.
Justus Adam and Stephen Kell.
TAPAS 2020: Proceedings of the 11th ACM SIGPLAN International Workshop on Tools for Automatic Program Analysis, November 2020, 23–29. 2020
Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory.
Eleni Bila, Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike Wehrheim.
In: Gotsman, A., Sokolova, A. (eds) Formal Techniques for Distributed Objects, Components, and Systems. FORTE 2020. Lecture Notes in Computer Science, vol 12136. 2020
Featherweight go.
Robert Griesemer, Raymond Hu, Wen Kokke, Julien Lange, Ian Lance Taylor, Bernardo Toninho, Philip Wadler, and Nobuko Yoshida.
Proceedings of the ACM on Programming Languages, Volume 4, Issue OOPSLA, 2020, Article No.: 149, 1–29. 2020
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
Proof-Producing Synthesis of CakeML from Monadic HOL Functions.
Oskar Abrahamsson, Son Ho, Hrutvik Kanabar, Ramana Kumar, Magnus O. Myreen, Michael Norrish, and Yong Kiam Tan.
Journal of Automated Reasoning, 64, 1287–1306, 2020. 2020
Mind the Gap: Bit-vector Interpolation recast over Linear Integer Arithmetic.
Takamasa Okudono and Andy King.
In: Biere, A., Parker, D. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2020. Lecture Notes in Computer Science, vol 12078. 2020
Describing and Simulating Concurrent Quantum Systems.
Richard Bornat, Jaap Boender, Florian Kammueller, Guillaume Poly, and Rajagopal Nagarajan.
In: Biere, A., Parker, D. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2020. Lecture Notes in Computer Science, vol 12079. 2020
Compositional Assume-Guarantee Reasoning of Control Law Diagrams Using UTP.
Kangfeng Ye, Simon Foster, and Jim Woodcock.
In: Adamatzky, A., Kendon, V. (eds) From Astrophysics to Unconventional Computation. Emergence, Complexity and Computation, vol 35. 2020
Strongly Normalizing Higher-Order Relational Queries.
Wilmer Ricciotti and James Cheney.
5th International Conference on Formal Structures for Computation and Deduction, FSCD 2020. 2020
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