Publications : 2017

[CMvR+17]
W. Czerwiński, W. Martens, L. van Rooijen, M. Zeitoun, and G. Zetzsche. A Characterization for Decidable Separability by Piecewise Testable Languages. Discrete Mathematics & Theoretical Computer Science, 19(4), December 2017.
doi: 10.23638/DMTCS-19-4-1.
BibTex | DOI | Web page | PDF ]
[HKZ17]
M. Huschenbett, D. Kuske, and G. Zetzsche. The Monoid of Queue Actions. Semigroup Forum, 95(3):475--508, December 2017.
doi: 10.1007/s00233-016-9835-4.
BibTex | DOI ]
[BHL17a]
B. Bérard, S. Haddad, and E. Lefaucheux. Probabilistic Disclosure: Maximisation vs. Minimisation. In Proceedings of the 37th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'17), volume 93 of Leibniz International Proceedings in Informatics, pages 13:1--13:14, Kanpur, India, December 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2017.13.
BibTex | DOI | Web page | PDF ]
[BFG17]
M. Blondin, A. Finkel, and J. Goubault-Larrecq. Forward Analysis for WSTS, Part III: Karp-Miller Trees. In Proceedings of the 37th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'17), volume 93 of Leibniz International Proceedings in Informatics, pages 16:1--16:15, Kanpur, India, December 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2017.16.
BibTex | DOI | Web page | PDF ]
[DLL17]
S. Demri, É. Lozes, and D. Lugiez. On Symbolic Heaps Modulo Permission Theories. In Proceedings of the 37th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'17), volume 93 of Leibniz International Proceedings in Informatics, pages 25:1--25:14, Kanpur, India, December 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2017.25.
BibTex | DOI | Web page | PDF ]
[CHKP17]
K. Chatzikokolakis, S. Haddad, A. Kassem, and C. Palamidessi. Trading Optimality for Performance in Location Privacy. In Proceedings of the 11th International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS'17), pages 221--222, Venice, Italy, December 2017.
doi: 10.1145/3150928.3150962.
BibTex | DOI | Web page | PDF ]
[Thi17]
F. Thiré. Exporting an Arithmetic Library from Dedukti to HOL. Research Report hal-01668250, HAL Research Report, December 2017.
BibTex | Web page | PDF ]
[Car17]
P. Carlier. Verification of Stochastic Timed Automata. Thèse de doctorat, Ecole Normale Supérieure de Cachan (ENS Paris-Saclay) and Université de Mons, December 2017.
BibTex | Web page | PDF ]
[FS17]
D. Figueira and L. Segoufin. Bottom-up automata on data trees and vertical XPath. Logical Methods in Computer Science, 13(4:5), November 2017.
doi: 10.23638/LMCS-13(4:5)2017.
BibTex | DOI ]
[Sch17a]
S. Schmitz. Algorithmic Complexity of Well-Quasi-Orders. Mémoire d'habilitation, École Normale Supérieure Paris-Saclay, France, November 2017.
BibTex | Web page ]
[GN17]
J. Goubault-Larrecq and K. M. Ng. A Few Notes on Formal Balls. Logical Methods in Computer Science, 13(4):1--34, November 2017. Special Issue of the Domains XII Workshop.
doi: 10.23638/LMCS-13(4:18)2017.
BibTex | DOI | Web page | PDF ]
[CCvD17]
Th. Chatain, J. Carmona, and B. van Dongen. Alignment-Based Trace Clustering. In Proceedings of the 36th International Conference on Conceptual Modeling (ER'17), volume 10650 of Lecture Notes in Computer Science, pages 295--308, Valencia, Spain, November 2017. Springer. To appear.
doi: 10.1007/978-3-319-69904-2_24.
BibTex | DOI | Web page | PDF ]
[BHL17b]
N. Bertrand, S. Haddad, and E. Lefaucheux. Diagnostic et contrôle de la dégradation des systèmes probabilistes. In Actes du 11ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'17), Marseille, France, November 2017. HAL.
BibTex | PDF ]
[DGG17]
J. Dubut, É. Goubault, and J. Goubault-Larrecq. Directed homology theories and Eilenberg-Steenrod axioms. Applied Categorical Structures, 25(5):775--807, October 2017.
doi: doi:10.1007/s10485-016-9438-y.
BibTex | DOI | Web page | PDF ]
[CDD17b]
V. Cortier, A. Dallon, and S. Delaune. A typing result for trace inclusion (for pair and symmetric encryption only). Research Report hal-01615265, HAL, October 2017.
BibTex | Web page | PDF ]
[FNS17]
M. Függer, Th. Nowak, and M. Schwarz. Brief Announcement: Lower Bounds for Asymptotic Consensus in Dynamic Networks. In Proceedings of the 31st International Symposium on Distributed Computing (DISC'17), Leibniz International Proceedings in Informatics, pages 51:1--51:3, Vienna, Austria, October 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.DISC.2017.51.
BibTex | DOI | Web page | PDF ]
[Gou17a]
J. Goubault-Larrecq. Isomorphism theorems between models of mixed choice. Mathematical Structures in Computer Science, 27(6):1032--1067, September 2017.
doi: 10.1017/S0960129515000547.
BibTex | DOI | Web page | PDF ]
[Gil17b]
F. Gilbert. Proof Certificates in PVS. In Proceedings of the 8th International Conference on Interactive Theorem Proving (ITP'17), volume 10499 of Lecture Notes in Computer Science, pages 262--268, Brasília, Brazil, September 2017. Springer.
doi: 10.1007/978-3-319-66107-0_17.
BibTex | DOI | Web page | PDF ]
[Bur17]
G. Bury. mSAT: An OCaml SAT Solver. In OCaml Users and Developers Workshop, Oxford, UK, September 2017. Poster.
BibTex | Web page | PDF ]
[BFM17]
M. Blondin, A. Finkel, and P. McKenzie. Well Behaved Transition Systems. Logical Methods in Computer Science, 13(3):1--19, September 2017.
doi: 10.23638/LMCS-13(3:24)2017.
BibTex | DOI | Web page ]
[MHP17]
H. Mandon, S. Haar, and L. Paulevé. Temporal Reprogramming of Boolean Networks. In Proceedings of the 15th Conference on Computational Methods in System Biology (CMSB'17), volume 10545 of Lecture Notes in Bioinformatics, pages 179--195, Darmstadt, Germany, September 2017. Springer-Verlag.
doi: 10.1007/978-3-319-67471-1_11.
BibTex | DOI | PDF ]
[Doy17]
L. Doyen. The Multiple Dimensions of Mean-Payoff Games. In Proceedings of the 11th Workshop on Reachability Problems in Computational Models (RP'17), volume 10506 of Lecture Notes in Computer Science, pages 1--8, London, UK, September 2017. Springer.
doi: 10.1007/978-3-319-67089-8_1.
BibTex | DOI | Web page | PDF ]
[Fri17]
L. Fribourg. Euler's Method Applied to the Control of Switched Systems. In Proceedings of the 15th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'17), volume 10419, pages 3--21, Berlin, Germany, September 2017. Springer.
doi: 10.1007/978-3-319-65765-3_1.
BibTex | DOI | Web page | PDF ]
[BLL17]
F. Bruse, M. Lange, and É. Lozes. Space-Efficient Fragments of Higher-Order Fixpoint Logic. In Proceedings of the 11th Workshop on Reachability Problems in Computational Models (RP'17), volume 10506 of Lecture Notes in Computer Science, pages 26--41, London, UK, September 2017. Springer.
doi: 10.1007/978-3-319-67089-8_3.
BibTex | DOI | Web page ]
[LAC+17]
A. Le Coënt, J. Alexandre dit Sandretto, A. Chapoutot, L. Fribourg, F. De Vuyst, and L. Chamoin. Distributed Control Synthesis Using Euler's Method. In Proceedings of the 11th Workshop on Reachability Problems in Computational Models (RP'17), volume 10506 of Lecture Notes in Computer Science, pages 118--131, London, UK, September 2017. Springer.
doi: 10.1007/978-3-319-67089-8_9.
BibTex | DOI | Web page | PDF ]
[Dub17]
J. Dubut. Directed homotopic and homologic theories for geometric models of true concurrency. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2017.
BibTex | Web page | PDF ]
[GBB+17]
M. González, O. Beaude, P. Bouyer, S. Lasaulce, and N. Markey. Stratégies d'ordonnancement de consommation d'énergie en présence d'information imparfaite de prévision. In Actes du XXVIème colloque GRETSI, Juan-les-Pins, France, September 2017.
BibTex | Web page | PDF ]
[CP17]
Th. Chatain and L. Paulevé. Goal-Driven Unfolding of Petri Nets. In Proceedings of the 28th International Conference on Concurrency Theory (CONCUR'17), volume 85 of Leibniz International Proceedings in Informatics, pages 18:1--18:16, Berlin, Germany, September 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2017.18.
BibTex | DOI | Web page | PDF ]
[BHJ17]
P. Bouyer, S. Haddad, and V. Jugé. Unbounded product-form Petri nets. In Proceedings of the 28th International Conference on Concurrency Theory (CONCUR'17), volume 85 of Leibniz International Proceedings in Informatics, pages 31:1--31:16, Berlin, Germany, September 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2017.31.
BibTex | DOI | Web page | PDF ]
[AGKS17]
S. Akshay, P. Gastin, S. N. Krishna, and I. Sarkar. Towards an Efficient Tree Automata based technique for Timed Systems. In Proceedings of the 28th International Conference on Concurrency Theory (CONCUR'17), volume 85 of Leibniz International Proceedings in Informatics, pages 39:1--39:15, Berlin, Germany, September 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2017.39.
BibTex | DOI | Web page | PDF ]
[BQS17]
B. Bollig, K. Quaas, and A. Sangnier. The Complexity of Flat Freeze LTL. In Proceedings of the 28th International Conference on Concurrency Theory (CONCUR'17), volume 85 of Leibniz International Proceedings in Informatics, pages 33:1--33:16, Berlin, Germany, September 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2017.33.
BibTex | DOI | Web page | PDF ]
[BJM17]
P. Bouyer, S. Jaziri, and N. Markey. On the Determinization of Timed Systems. In Proceedings of the 15th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'17), volume 10419, pages 25--41, Berlin, Germany, September 2017. Springer.
doi: 10.1007/978-3-319-65765-3_2.
BibTex | DOI | Web page ]
[Sub17]
C. L. Subramaniam. Cubical Type Theory in Dedukti. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2017.
BibTex ]
[Gen17]
G. Genestier. Termination checking in the λΠ-calculus modulo theory. Rapport de Master, Université Paris 7, Paris, France, September 2017.
BibTex | Web page | PDF ]
[Def17]
A. Defourné. Proof Tactics in Dedukti. Rapport de Master, Inria Saclay, September 2017.
BibTex | Web page | PDF ]
[Dow17a]
G. Dowek. Analyzing Individual Proofs as the Basis of Interoperability between Proof Systems. In Proceedings of the 5th Workshop on Proof eXchange for Theorem Proving (PxTP'17), volume 262 of Electronic Proceedings in Theoretical Computer Science, pages 3--12, Brasília, Brazil, September 2017.
doi: 10.4204/EPTCS.262.1.
BibTex | DOI | Web page | PDF ]
[Rie17]
M. Riesner. Regularity of deterministic pushdown automata. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, August 2017.
BibTex ]
[Sch17b]
Ph. Schnoebelen. Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk). In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS'17), volume 83 of Leibniz International Proceedings in Informatics, pages 85:1--85:4, Aalborg, Denmark, August 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2017.85.
BibTex | DOI | Web page | PDF ]
[CDH17]
K. Chatterjee, L. Doyen, and Th. A. Henzinger. The Cost of Exactness in Quantitative Reachability. In Models, Algorithms, Logics and Tools: Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday, volume 10460 of Lecture Notes in Computer Science, pages 367--381. Springer, August 2017.
doi: 10.1007/978-3-319-63121-9_18.
BibTex | DOI | PDF ]
[BDGK17]
D. Baelde, S. Delaune, I. Gazeau, and S. Kremer. Symbolic Verification of Privacy-Type Properties for Security Protocols with XOR. In Proceedings of the 30th IEEE Computer Security Foundations Symposium (CSF'17), pages 234--248, Santa Barbara, California, USA, August 2017. IEEE Computer Society Press.
doi: 10.1109/CSF.2017.22.
BibTex | DOI | Web page | PDF ]
[CDD17a]
V. Cortier, A. Dallon, and S. Delaune. SAT-Equiv: An Efficient Tool for Equivalence Properties. In Proceedings of the 30th IEEE Computer Security Foundations Symposium (CSF'17), pages 481--494, Santa Barbara, California, USA, August 2017. IEEE Computer Society Press.
doi: 10.1109/CSF.2017.15.
BibTex | DOI | Web page | PDF ]
[GMS17]
N. Grosshans, P. McKenzie, and L. Segoufin. The power of programs over monoids in DA. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS'17), volume 83 of Leibniz International Proceedings in Informatics, pages 2:1--2:20, Aalborg, Denmark, August 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2017.2.
BibTex | DOI | Web page | PDF ]
[CK17]
H. Comon and A. Koutsos. Formal Computational Unlinkability Proofs of RFID Protocols. In Proceedings of the 30th IEEE Computer Security Foundations Symposium (CSF'17), pages 100--114, Santa Barbara, California, USA, August 2017. IEEE Computer Society Press.
doi: 10.1109/CSF.2017.9.
BibTex | DOI | Web page | PDF ]
[CGKM17]
S. Calzavara, I. Grishchenko, A. Koutsos, and M. Maffei. A Sound Flow-Sensitive Heap Abstraction for the Static Analysis of Android Applications. In Proceedings of the 30th IEEE Computer Security Foundations Symposium (CSF'17), pages 22--36, Santa Barbara, California, USA, August 2017. IEEE Computer Society Press.
doi: 10.1109/CSF.2017.19.
BibTex | DOI | Web page | PDF ]
[BLM+17]
P. Bouyer, F. Laroussinie, N. Markey, J. Ouaknine, and J. Worrell. Timed temporal logics. In Models, Algorithms, Logics and Tools: Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday, volume 10460 of Lecture Notes in Computer Science, pages 211--230. Springer, August 2017.
doi: 10.1007/978-3-319-65764-6_11.
BibTex | DOI | Web page | PDF ]
[Seg17]
L. Segoufin. A survey on guarded negation. SIGLOG News, 4(3):12--26, July 2017.
doi: 10.1145/3129173.3129178.
BibTex | DOI ]
[FL17]
A. Finkel and É. Lozes. Synchronizability of Communicating Finite State Machines is not Decidable. In Proceedings of the 44th International Colloquium on Automata, Languages and Programming (ICALP'17), volume 80 of Leibniz International Proceedings in Informatics, pages 122:1--122:14, Warsaw, Poland, July 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2017.122.
BibTex | DOI | Web page | PDF ]
[Dow17c]
G. Dowek. Models and termination of proof reduction in the λΠ-calculus modulo theory. In Proceedings of the 44th International Colloquium on Automata, Languages and Programming (ICALP'17), volume 80 of Leibniz International Proceedings in Informatics, pages 109:1--109:14, Warsaw, Poland, July 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2017.109.
BibTex | DOI | Web page | PDF ]
[FMW17]
M. Fortin, A. Muscholl, and I. Walukiewicz. Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems. In Proceedings of the 29th International Conference on Computer Aided Verification (CAV'17), volume 10427 of Lecture Notes in Computer Science, pages 155--175, Heidelberg, Germany, July 2017. Springer.
doi: 10.1007/978-3-319-63390-9_9.
BibTex | DOI | Web page ]
[BR17]
D. Berwanger and R. Ramanujam. Deviator Detection under Imperfect Monitoring. In Proceedings of the 5th International Workshop on Strategic Reasoning (SR'17), Liverpool, UK, July 2017.
BibTex | Web page | PDF ]
[BFRR17]
V. Bruyère, E. Filiot, M. Randour, and J.-F. Raskin. Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. Information and Computation, 254(2):259--295, June 2017. To appear.
doi: 10.1016/j.ic.2016.10.011.
BibTex | DOI ]
[BMV17b]
P. Bouyer, N. Markey, and S. Vester. Nash Equilibria in Symmetric Graph Games with Partial Observation. Information and Computation, 254(2):238--258, June 2017.
doi: 10.1016/j.ic.2016.10.010.
BibTex | DOI | Web page | PDF ]
[KGH+17]
F. Kordon, H. Garavel, L. M. Hillah, F. Hulin-Hubard, B. Berthomieu, G. Ciardo, M. Colange, S. Dal Zilio, E. Amparore, M. Beccuti, T. Liebke, J. Meijer, A. Miner, C. Rohr, J. Srba, Y. Thierry-Mieg, J. van de Pol, and K. Wolf. Complete Results for the 2017 Edition of the Model Checking Contest, June 2017.
BibTex | Web page ]
[Dou17a]
A. Doumane. Constructive completeness for the linear-time μ-calculus. In Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'17), pages 1--12, Reykjavik, Iceland, June 2017. IEEE Press.
doi: 10.1109/LICS.2017.8005075.
BibTex | DOI ]
[Dou17b]
A. Doumane. On the infinitary proof theory of logics with fixed points. Thèse de doctorat, Université Paris-Diderot, Paris, France, June 2017.
BibTex | Web page | PDF ]
[Gar17]
P. Gardy. Semantics of Strategy Logic. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2017.
BibTex | Web page | PDF ]
[Had17]
S. Haddad. Memoryless Determinacy of Finite Parity Games: Another Simple Proof. Research Report hal-01541508, HAL-inria, June 2017. 7 pages.
BibTex | Web page | PDF ]
[KV17]
A. Koutsos and V. Vianu. Process-centric views of data-driven business artifacts. Journal of Computer and System Sciences, 86(1):82--107, June 2017.
doi: 10.1016/j.jcss.2016.11.012.
BibTex | DOI | Web page | PDF ]
[HSZ17]
S. Halfon, Ph. Schnoebelen, and G. Zetzsche. Decidability, complexity, and expressiveness of first-order logic over the subword ordering. In Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'17), pages 1--12, Reykjavik, Iceland, June 2017. IEEE Press.
doi: 10.1109/LICS.2017.8005141.
BibTex | DOI | Web page ]
[CJLS17]
Th. Colcombet, M. Jurdziński, R. Lazić, and S. Schmitz. Perfect Half Space Games. In Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'17), pages 1--11, Reykjavik, Iceland, June 2017. IEEE Press.
doi: 10.1109/LICS.2017.8005105.
BibTex | DOI | Web page ]
[vCCT17]
B. van Dongen, J. Carmona, Th. Chatain, and F. Taymouri. Aligning Modeled and Observed Behavior: A Compromise Between Complexity and Quality. In Proceedings of the 29th International Conference on Advanced Information Systems Engineering (CAiSE'17), volume 10253 of Lecture Notes in Computer Science, pages 94--109, Essen, Germany, June 2017. Springer.
doi: 10.1007/978-3-319-59536-8_7.
BibTex | DOI | PDF ]
[BHSS17]
B. Bérard, S. Haar, S. Schmitz, and S. Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. In Proceedings of the 38th International Conference on Applications and Theory of Petri Nets (PETRI NETS'17), volume 10258 of Lecture Notes in Computer Science, pages 200--220, Zaragoza, Spain, June 2017. Springer.
doi: 10.1007/978-3-319-57861-3_13.
BibTex | DOI | Web page ]
[BM17]
D. Berwanger and A. B. Mathew. Infinite games with finite knowledge gaps. Information and Computation, 254:217--237, June 2017.
doi: 10.1016/j.ic.2016.10.009.
BibTex | DOI | Web page | PDF ]
[BMv17a]
D. Berwanger, A. B. Mathew, and M. van den Bogaard. Hierarchical information and the synthesis of distributed strategies. Acta Informatica, June 2017.
doi: 10.1007/s00236-017-0306-5.
BibTex | DOI | Web page | PDF ]
[JS17]
J.-P. Jouannaud and P.-Y. Strub. Coq without Type Casts: A Complete Proof of Coq Modulo Theory. In Proceedings of the 21st International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'17), volume 46 of EPiC Series in Computing, pages 474--489, Maun, Botswana, May 2017. EasyChair.
BibTex | Web page | PDF ]
[TFL17]
G. Tarawneh, M. Függer, and C. Lenzen. Metastability Tolerant Computing. In Proceedings of the 23rd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'17), pages 25--32, San Diego, California, USA, May 2017. IEEE Computer Society.
doi: 10.1109/ASYNC.2017.9.
BibTex | DOI | Web page | PDF ]
[FKLP17]
M. Függer, A. Kinali, C. Lenzen, and T. Polzer. Metastability-Aware Memory-Efficient Time-to-Digital Converter. In Proceedings of the 23rd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'17), pages 49--56, San Diego, California, USA, May 2017. IEEE Computer Society.
doi: 10.1109/ASYNC.2017.12.
BibTex | DOI | Web page | PDF ]
[OBH17]
P. O'Hanlon, R. Borgaonkar, and L. Hirschi. Mobile subscriber WiFi privacy. In Proceedings of Mobile Security Technologies (MoST'17), held as part of the IEEE Computer Society Security and Privacy Workshops, San Jose, CA, USA, May 2017.
BibTex | PDF ]
[BJ17]
P. Bouyer and V. Jugé. Dynamic Complexity of the Dyck Reachability. In Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'17), Lecture Notes in Computer Science, pages 265--280, Uppsala, Sweden, April 2017. Springer.
doi: 10.1007/978-3-662-54458-7_16.
BibTex | DOI | Web page | PDF ]
[BHM+17]
P. Bouyer, P. Hofman, N. Markey, M. Randour, and M. Zimmermann. Bounding Average-energy Games. In Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'17), Lecture Notes in Computer Science, pages 179--195, Uppsala, Sweden, April 2017. Springer.
doi: 10.1007/978-3-662-54458-7_11.
BibTex | DOI | Web page | PDF ]
[ZKL17]
G. Zetzsche, D. Kuske, and M. Lohrey. On Boolean closed full trios and rational Kripke frames. Theory of Computing Systems, 60(3):438--472, April 2017.
doi: 10.1007/s00224-016-9694-0.
BibTex | DOI ]
[Gil17a]
F. Gilbert. Automated Constructivization of Proofs. In Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'17), Lecture Notes in Computer Science, pages 480--495, Uppsala, Sweden, April 2017. Springer.
doi: 10.1007/978-3-662-54458-7_28.
BibTex | DOI | Web page | PDF ]
[LDCF17]
A. Le Coënt, F. De Vuyst, L. Chamoin, and L. Fribourg. Control Synthesis of Nonlinear Sampled Switched Systems using Euler's Method. In Proceedings of the 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR'17), volume 247 of Electronic Proceedings in Theoretical Computer Science, pages 18--33, Uppsala, Sweden, April 2017.
doi: 10.4204/EPTCS.247.2.
BibTex | DOI | Web page | PDF ]
[Hir17]
L. Hirschi. Automated Verification of Privacy in Security Protocols: Back and Forth Between Theory & Practice. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, April 2017.
BibTex | Web page | PDF ]
[BGHH17]
S. Böhm, S. Göller, S. Halfon, and P. Hofman. On Büchi one-counter automata. In Proceedings of the 34th Annual Symposium on Theoretical Aspects of Computer Science (STACS'17), Leibniz International Proceedings in Informatics, pages 14:1--14:13, Hannover, Germany, March 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2017.14.
BibTex | DOI | Web page | PDF ]
[CG17]
A. Carayol and S. Göller. On long words avoiding Zimin patterns. In Proceedings of the 34th Annual Symposium on Theoretical Aspects of Computer Science (STACS'17), Leibniz International Proceedings in Informatics, pages 19:1--19:13, Hannover, Germany, March 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2017.19.
BibTex | DOI | Web page | PDF ]
[LZ17]
M. Lohrey and G. Zetzsche. The Complexity of Knapsack in Graph Groups. In Proceedings of the 34th Annual Symposium on Theoretical Aspects of Computer Science (STACS'17), Leibniz International Proceedings in Informatics, pages 52:1--52:14, Hannover, Germany, March 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2017.52.
BibTex | DOI ]
[Mon17]
D. Montoya. Une base de connaissance personnelle intégrant les données d'un utilisateur et une chronologie de ses activités. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, March 2017.
BibTex | Web page | PDF ]
[SV17]
L. Segoufin and A. Vigny. Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion. In Proceedings of the 18th International Conference on Database Theory (ICDT'17), volume 68 of Leibniz International Proceedings in Informatics, pages 20:1--20:16, Venice, Italy, March 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICDT.2017.20.
BibTex | DOI | Web page | PDF ]
[Sta17]
D. Stan. Randomized Strategies in Concurrent Games. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, March 2017.
BibTex | Web page | PDF ]
[BBDH17]
B. Barbot, B. Bérard, Y. Duplouy, and S. Haddad. Statistical Model-Checking for Autonomous Vehicle Safety Validation. In SIA Simulation Numérique, Montigny-le-Bretonneux, France, March 2017.
BibTex | Web page | PDF ]
[CFNS17]
B. Charron-Bost, M. Függer, Th. Nowak, and M. Schwarz. New transience bounds for max-plus linear systems. Discrete Applied Mathematics, 219:83--99, March 2017.
doi: 10.1016/j.dam.2016.11.003.
BibTex | DOI | Web page | PDF ]
[Dow17b]
G. Dowek. Lineal: A linear-algebraic Lambda-calculus. Logical Methods in Computer Science, 13(1):1--33, March 2017.
doi: 10.23638/LMCS-13(1:8)2017.
BibTex | DOI | Web page | PDF ]
[Jug17]
V. Jugé. The Relaxation Normal Form of Braids is Regular. International Journal of Algebra and Computation, 27(1):61--106, February 2017.
doi: 10.1142/S0218196717500059.
BibTex | DOI | Web page ]
[BMJ17]
P. Bouyer, N. Markey, and V. Jugé. Courcelle's Theorem Made Dynamic. Research Report 1702.05183, Computing Research Repository, February 2017. 14 pages.
BibTex | Web page | PDF ]
[HHMS17]
S. Haar, S. Haddad, T. Melliti, and S. Schwoon. Optimal constructions for active diagnosis. Journal of Computer and System Sciences, 83(1):101--120, 2017.
doi: 10.1016/j.jcss.2016.04.007.
BibTex | DOI | PDF ]
[BKM17]
B. Bollig, D. Kuske, and R. Mennicke. The Complexity of Model Checking Multi-Stack Systems. Theory of Computing Systems, 60(4):695--736, 2017.
doi: 10.1007/s00224-016-9700-6.
BibTex | DOI | Web page ]
[BMPS17]
P. Bouyer, N. Markey, N. Perrin, and P. Schlehuber-Caissier. Timed automata abstraction of switched dynamical systems using control funnels. Real-Time Systems, 53(3):327--353, 2017.
doi: 10.1007/s11241-016-9262-3.
BibTex | DOI | Web page | PDF ]
[DGLWM17]
S. Demri, D. Galmiche, D. Larchey-Wendling, and D. Mery. Separation Logic with One Quantified Variable. Theory of Computing Systems, 61(2):371--461, 2017.
doi: 10.1007/s00224-016-9713-1.
BibTex | DOI | Web page | PDF ]
[Gou17b]
J. Goubault-Larrecq. A Non-Hausdorff Minimax Theorem. Minimax Theory and its Applications, 3(1):73--80, 2017.
BibTex ]
[DDS17]
S. Demri, A. Dhar, and A. Sangnier. Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic. Theoretical Computer Science, 735:2--23, 2017.
BibTex | PDF ]
[CDFR17]
K. Chatterjee, L. Doyen, E. Filiot, and J. Raskin. Doomsday equilibria for omega-regular games. Information and Computation, 254:296--315, 2017.
doi: 10.1016/j.ic.2016.10.012.
BibTex | DOI | PDF ]
[BCMW17]
D. Baelde, A. Carayol, R. Matthes, and I. Walukiewicz. Preface: Special Issue of Fixed Points in Computer Science (FICS'13). Fundamenta Informaticae, 150(3-4):i--ii, 2017.
doi: 10.3233/FI-2017-1468.
BibTex | DOI | Web page ]
[BDH17]
D. Baelde, S. Delaune, and L. Hirschi. A Reduced Semantics for Deciding Trace Equivalence. Logical Methods in Computer Science, 13(2:8):1--48, 2017.
doi: 10.23638/LMCS-13(2:8)2017.
BibTex | DOI | Web page | PDF ]
[BFHH17]
M. Blondin, A. Finkel, C. Haase, and S. Haddad. The Logical View on Continuous Petri Nets. ACM Transactions on Computational Logic, 18(3):24:1--24:28, 2017.
doi: 10.1145/3105908.
BibTex | DOI | Web page | PDF ]
[HPV17]
S. Haar, S. Perchy, and F. Valencia. D-SPACES: Implementing Declarative Semantics for Spatially Structured Information. In Proceedings of the 11th International Conference on Semantic Computing (ICSC'17), volume 11 of IEEE ICSC, pages 227--233, San Diego, CA, USA, January 2017. IEEE Press.
doi: 10.1109/ICSC.2017.34.
BibTex | DOI | Web page | PDF ]
[GHP+17]
M. Guzmán, S. Haar, S. Perchy, C. Rueda, and F. Valencia. Belief, Knowledge, Lies and Other Utterances in an Algebra for Space and Extrusion. Journal of Logic and Algebraic Methods in Programming, 86(1):107--133, January 2017.
doi: 10.1016/j.jlamp.2016.09.001.
BibTex | DOI | Web page | PDF ]
[ABH17]
M. F. Atig, B. Bollig, and P. Habermehl. Emptiness of ordered multi-pushdown automata is 2ETIME-complete. International Journal of Foundations of Computer Science, 28(8):945--975, 2017.
doi: 10.1142/S0129054117500332.
BibTex | DOI | Web page | PDF ]
[DKW17]
S. Demri, D. Kapur, and C. Weidenbach. Special Issue of Selected Extended Papers of IJCAR 2014. Journal of Automated Reasoning, 58(1), 2017.
BibTex | Web page ]
[ACR17]
É. André, Th. Chatain, and C. Rodríguez. Preserving Partial-Order Runs in Parametric Time Petri Nets. ACM Transactions in Embedded Computing Systems, 16(2):43:1--43:26, 2017.
doi: 10.1145/3012283.
BibTex | DOI | PDF ]
[AM17]
P. Arrighi and S. Martiel. Quantum causal graph dynamics. Physical Review D, 96(2), 2017.
BibTex | PDF ]
[AD17]
S. Abiteboul and G. Dowek. Le temps des algorithmes. Editions Le Pommier, 2017.
BibTex | Web page ]
[CCD17]
V. Cheval, H. Comon-Lundh, and S. Delaune. A procedure for deciding symbolic equivalence between sets of constraint systems. Information and Computation, 255:94--125, 2017.
doi: 10.1016/j.ic.2017.05.004.
BibTex | DOI | Web page ]
[DD17]
A. Díaz-Caro and G. Dowek. Typing Quantum Superpositions and Measurement. In Proceedings of the 6th International Conference on Theory and Practice of Natural Computing (TPNC'17), volume 10687 of Lecture Notes in Computer Science, pages 281--293, Prague, Czech Republic, 2017. Springer.
doi: 10.1007/978-3-319-71069-3_22.
BibTex | DOI | Web page ]
[Dow17d]
G. Dowek. Rules and derivations in an elementary logic course. IfCoLoG Journal of Logics and their Applications, 4(1):21--32, 2017. Special Issue: Tools for Teaching Logic.
BibTex | PDF ]

This file was generated by bibtex2html 1.98.

About LSV