2018-annual-report

8. Andrea Cerone, Alexey Gotsman. Analysing
snapshot isolation. Journal of the ACM, Vol.
65, Num. 2, pages 1–41, ACM Press, March
2018.
9. Pedro López-García, Luthfi Darmawan,
Maximiliano Klemen, Umer Liqat, Francisco
Bueno, Manuel V. Hermenegildo. Intervalbased
Resource Usage Verification by Translation
into Horn Clauses and an Application
to Energy Consumption. Theory and Practice
of Logic Programming, Special Issue on
Computational Logic for Verification, Vol. 18,
pages 167–223, Cambridge U. Press, March
2018. arXiv:1803.04451.
10. Bishoksan Kafle, John P. Gallagher, Pierre
Ganty. Tree dimension in verification of
constrained Horn clauses. TPLP, Vol. 18,
Num. 2, pages 224–251, March 2018.
11. John P. Gallagher, Mai Ajspur, Bishoksan
Kafle. Optimised determinisation and completion
of finite tree automata. Journal of
Logical and Algebraic Methods in Programming,
Vol. 95, pages 1–16, February 2018.
12. Roberto Giacobazzi, Isabella Mastroeni.
Abstract Non-Interference: A Unifying
Framework for Weakening Information-flow.
ACM Trans. Priv. Secur., Vol. 21, Num. 2,
pages 1–31, ACM, February 2018.
13. Hagit Attiya, Alexey Gotsman, Sandeep
Hans, Noam Rinetzky. Characterizing transactional
memory consistency conditions
using observational refinement. Journal of
the ACM, Vol. 65, Num. 1, pages 1–44,
ACM Press, January 2018.
15. Ivan Radicek, Gilles Barthe, Marco Gaboardi,
Deepak Garg, Florian Zuleger. Monadic
refinements for relational cost analysis.
PACMPL, Vol. 2, Num. POPL, pages 1–32,
2018.
16. Gilles Barthe, Thomas Espitau, Benjamin
Grégoire, Justin Hsu, Pierre-Yves Strub.
Proving expected sensitivity of probabilistic
programs. PACMPL, Vol. 2, Num. POPL,
pages 1–29, 2018.
17. Yliès Falcone, César Sánchez. Introduction
to the special issue on runtime verification.
Formal Methods in Systems Design, Vol.
53, Num. 1, pages 1–5, 2018.
18. Laura Bozzelli, César Sánchez. Visibly
Linear Temporal Logic. Journal of Automated
Reasoning, Vol. 60, Num. 2, pages
177–220, 2018.
19. Joaquín Arias, Manuel Carro, Elmer Salazar,
Kyle Marple, Gopal Gupta. Constraint
Answer Set Programming without Grounding.
Theory and Practice of Logic Programming,
Vol. 18, Num. 3-4, pages 337–354,
Cambridge U. Press, 2018.
20. Dario Catalano, Dario Fiore. Practical
Homomorphic Message Authenticators for
Arithmetic Circuits. Journal of Cryptology,
Vol. 31, Num. 1, pages 23–59, Springer,
2018.
21. Luca Aceto, Dario Della Monica, Ignacio
Fábregas, Anna Ingólfsdóttir. When Are
Prime Formulae Characteristic? Theoretical
Computer Science, To Appear, 2018.
77
annual report
20
14. Andreas Abel, Joakim Öhman, Andrea Vezzosi.
Decidability of conversion for type
theory in type theory. Proceedings of the
ACM on Programming Languages (PACM-
PL), Vol. 2, Num. POPL, pages 1–29, ACM,
January 2018.
22. Bishoksan Kafle, John P. Gallagher, Graeme
Gange, Peter Schachte, Harald Søndergaard,
Peter J. Stuckey. An iterative
approach to precondition inference using
constrained Horn clauses. TPLP, Vol. 18,
Num. 3-4, pages 553–570, 2018.