Publications : 2021

[BDJ+21]
D. Baelde, S. Delaune, C. Jacomme, A. Koutsos, and S. Moreau. An Interactive Prover for Protocol Verification in the Computational Model. In Proceedings of the 42nd IEEE Symposium on Security and Privacy (S&P'21), online, May 2021. IEEE Press. To appear.
BibTex | Web page | PDF ]
[GH21]
S. Göller and M. Hilaire. Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete. In Proceedings of the 38th Annual Symposium on Theoretical Aspects of Computer Science (STACS'21), volume 187 of Leibniz International Proceedings in Informatics, Saarbrücken, Germany, March 2021. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2021.36.
BibTex | DOI | Web page | PDF ]
[Bae21]
D. Baelde. Contributions to the Verification of Cryptographic Protocols. Mémoire d'habilitation, École Normale Supérieure Paris-Saclay, France, February 2021.
BibTex | Web page | PDF ]
[DLM21a]
S. Demri, É. Lozes, and A. Mansutti. A Complete Axiomatisation for Quantifier-Free Separation Logic. Research Report 2006.05156v2, Computing Research Repository, February 2021. 63 pages.
BibTex | Web page | PDF ]
[BCC21b]
M. Boltenhagen, T. Chatain, and J. Carmona. Optimized SAT encoding of conformance checking artefacts. Computing, 103(1):29--50, 2021.
doi: 10.1007/s00607-020-00831-8.
BibTex | DOI | Web page ]
[BCC21a]
M. Boltenhagen, T. Chatain, and J. Carmona. Anti-alignments—Measuring the precision of process models and event logs. Information Systems, 98, 2021. To appear.
doi: https://doi.org/10.1016/j.is.2020.101708.
BibTex | DOI | Web page ]
[BLRPR21]
V. Bruyère, S. Le Roux, A. Pauly, and J. Raskin. On the existence of weak subgame perfect equilibria. 276, 2021.
doi: https://doi.org/10.1016/j.ic.2020.104553.
BibTex | DOI | Web page ]
[BBF+21]
G. Bacci, P. Bouyer, U. Fahrenberg, K. Larsen, N. Markey, and P. Reynier. Optimal and robust controller synthesis using energy timed automata with uncertainty. Formal Aspects of Computing, 33:3--25, 2021.
doi: 10.1007/s00165-020-00521-4.
BibTex | DOI | Web page ]
[DFM21]
S. Demri, R. Fervari, and A. Mansutti. Internal proof calculi for modal logics with separating conjunction. Journal of Logic and Computation, 2021. Accepted for publication to the Special issue of JLC on External and Internal Calculi for Non Classical Logics.
BibTex | Web page | PDF ]
[DLM21b]
S. Demri, É. Lozes, and A. Mansutti. The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic. ACM Transactions on Computational Logic, 2021. To appear.
BibTex | Web page | PDF ]
[DM21]
B. Dinis and É. Miquey. Realizability with stateful computations for nonstandard analysis. In Proceedings of the 29th Annual EACSL Conference on Computer Science Logic (CSL'21), Leibniz International Proceedings in Informatics, pages 19:1--19:23, Ljubljana, Slovenia, January 2021. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2021.19.
BibTex | DOI | Web page | PDF ]
[Lop21]
A. Lopez. Preservation Theorems Through the Lens of Topology. In Proceedings of the 29th Annual EACSL Conference on Computer Science Logic (CSL'21), Leibniz International Proceedings in Informatics, pages 32:1--32:17, Ljubljana, Slovenia, January 2021. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2021.32.
BibTex | DOI | Web page | PDF ]
[Sch21]
Ph. Schnoebelen. On flat lossy channel machines. In Proceedings of the 29th Annual EACSL Conference on Computer Science Logic (CSL'21), Leibniz International Proceedings in Informatics, pages 37:1--37:22, Ljubljana, Slovenia, January 2021. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2021.37.
BibTex | DOI | Web page | PDF ]
[BRS21]
B. Bollig, F. Ryabinin, and A. Sangnier. Reachability in Distributed Memory Automata. In Proceedings of the 29th Annual EACSL Conference on Computer Science Logic (CSL'21), Leibniz International Proceedings in Informatics, pages 13:1--13:16, Ljubljana, Slovenia, January 2021. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2021.13.
BibTex | DOI | Web page | PDF ]
[LRP21]
S. Le Roux and A. Pauly. Equilibria in multi-player multi-outcome infinite sequential games. Information and Computation, 276, 2021.
doi: https://doi.org/10.1016/j.ic.2020.104557.
BibTex | DOI | Web page ]

This file was generated by bibtex2html 1.98.

About LSV