Filter by
Guarded Kleene Algebra with Tests: Automata Learning.
Stefan Zetzsche, Alexandra Silva, and Matteo Sammartino.
Electronic Notes in Theoretical Informatics and Computer Science, Volume 1 – Proceedings of MFPS XXXVIII, February 28, 2023, entics:10505. 2023
Generators and Bases for Monadic Closures.
Stefan Zetzsche, Alexandra Silva and Matteo Sammartino.
In 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 270, pp. 11:1-11:19, 2023
Foundations of Persistent Programming.
Hans-J. Boehm, Ori Lahav, and Azalea Raad.
In Dagstuhl Reports, Volume 11, Issue 10, pp. 94-110, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) 2022
View-Based Owicki–Gries Reasoning for Persistent x86-TSO.
Eleni Vafeiadi Bila, Brijesh Dongol, Ori Lahav, Azalea Raad, and John Wickerson
In: Sergey, I. (eds) Programming Languages and Systems. ESOP 2022. Lecture Notes in Computer Science, vol 13240. 2022
Away From Linear Models of Concurrent Programs
Daniel Wright.
PhD Thesis, University of Kent. 2022
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
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
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
Modularising Verification Of Durable Opacity.
Eleni Bila, John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim.
Logical Methods in Computer Science, July 28, 2022, Volume 18, Issue 3. 2022
A Formalization of SQL with Nulls.
Wilmer Ricciotti and James Cheney.
Journal of Automated Reasoning 66, 989–1030. 2022
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
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
Connecting software build with maintaining consistency between models: towards sound, optimal, and flexible building from megamodels.
Perdita Stevens.
Softw Syst Model 19, 935–958, 2020. 2020
Putting Randomized Compiler Testing into Production (Experience Report).
Alastair F. Donaldson, Hugues Evrard, and Paul Thomson.
34th European Conference on Object-Oriented Programming, ECOOP 2020. 2020
by