Publications


Chapitres de livres

[1] Parallel Model Checking Algorithms for Linear-Time Temporal Logic
J. Barnat and V. Bloemen and A. Duret-Lutz and A. Laarman and L. Petrucci and J. van de Pol and E. Renault
Handbook of Parallel Constraint Reasoning, 12, 457–507, L. Sais and Y. Hamadi, SV, 2018

Articles dans des revues internationales avec comité de lecture

[1] A correspondence between maximal abelian sub-algebras and linear logic fragments
Thomas Seiller
Mathematical Structures in Computer Science, 77–139, 1, 28, 2018

[2] Polyadic Approximations, Fibrations and Intersection Types
Damiano Mazza and Luc Pellissier and Pierre Vial
Proceedings of the ACM on Programming Languages, POPL:6, 2, 2018

[3] Specialisation and Generalisation of Processes
C. Choppy and J. Desel and L. Petrucci
Enterprise Modelling and Information Systems Architectures, 35–46, GI – German Informatics Society, 1, 13, 02, 2018

[4] Study of Behaviours via Visitable Paths
Fouqueré, Christophe and Quatrini, Myriam
Logical Methods in Computer Science, Volume 14, Issue 2, 2018

Communications dans des conférences internationales avec comité de lecture

[1] Layered and Collecting NDFS with Subsumption for Parametric Timed Automata
Nguyen, H. G. and Petrucci, L. and van de Pol, J.
23rd IEEE International Conference on Engineering of Complex Computer Systems (ICECCS’18), Melbourne, Australia, Anthony Widjaja Lin and Jun Sun, IEEE, 12, 2018

[2] One-Sided Communications for more Efficient Parallel State Space Exploration over RDMA Clusters
Coti, C. and Evangelista, S. and Petrucci, L.
24th International European Conference on Parallel and Distributed Computing (Euro-Par’18), Torino, Italy, 432–446, SV, lncs, 11014, 08, 2018

[3] Parameter Synthesis Algorithms for Parametric Interval Markov Chains
Petrucci, L. and van de Pol, J.
38th IFIP International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE’18), Madrid, Spain, 121–140, Christel Baier and Luis Caires, SV, lncs, 10854, 06, 2018

[4] Quasi-Optimal Partial Order Reduction
Nguyen, H. T. T. and Rodríguez, C. and Sousa, M. and Coti, C. and Petrucci, L.
30th International Conference on Computer Aided Verification (CAV’18), Oxford, UK, 354–371, Hana Chockler and Georg Weissenbacher, SV, lncs, 10982, 07, 2018

[5] State Compression Based on One-Sided Communications for Distributed Model Checking
Coti, C. and Evangelista, S. and Petrucci, L.
23rd IEEE International Conference on Engineering of Complex Computer Systems (ICECCS’18), Melbourne, Australia, Anthony Widjaja Lin and Jun Sun, IEEE, 12, 2018

[6] Unique perfect matchings and proof nets
Nguyen, Lê Thành Dung
3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018), 26:1-26:20, Leibniz International Proceedings in Informatics, 108, 07, 2018

Autres conférences

[1] A semantic conjecture on second-order MLL and its complexity consequences (work in progress)
Nguyen, Lê Thành Dung and Seiller, Thomas
2018

[2] Coherent Interaction Graphs: A Non-Deterministic Geometry of Interaction for MLL
Nguyen, Lê Thành Dung and Seiller, Thomas
2018

[3] Entropy and Complexity Lower Bounds
Pellissier, Luc and Seiller, Thomas
2018

[4] Entropy and Complexity Lower Bounds
Pellissier, Luc and Seiller, Thomas
2018

[5] Ludics for modelling the role of a judge during legal debates
Christophe Fouqueré and Myriam Quatrini
Proceedings of the Workshop Logic, Law and Legal Reasoning at UNILOG’2018, 155, 2018

[6] On some tractable constraints on paths in graphs and in proofs
Nguyen, Lê Thành Dung
Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2018), 06, 2018

[7] On the complexity of finding cycles in proof nets
Nguyen, Lê Thành Dung
Developments in Implicit Computational Complexity (DICE 2018), 04, 2018

Travaux en cours de soumission

[1] Interaction Graphs: Non-Deterministic Automata
Seiller, Thomas
To appear in ACM Transactions in Computational Logic, 2018