Publications : LSV

[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 ]
[HB21]: G. Hondet and F. Blanqui. Encoding of Predicate Subtyping with Proof Irrelevance in the ΛΠ-Calculus Modulo Theory. In Proceedings of the 26th International Conference on Types for Proofs and Programs (TYPES'20), volume 188 of Leibniz International Proceedings in Informatics, pages 6:1--6:18, Turin, Italy, 2021. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.TYPES.2020.6.
[ BibTex | DOI | 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 ]
[Thi20]: F. Thiré. Meta-theory of Cumulative Types Systems and their embeddings to the ΛΠ-calculus modulo theory. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, December 2020.
[ BibTex | Web page | PDF ]
[Man20b]: A. Mansutti. Reasoning with Separation Logics: Complexity, Expressive Power, Proof Systems. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, December 2020.
[ BibTex | Web page | PDF ]
[Gen20a]: G. Genestier. Dependently-Typed Termination and Embedding of Extensional Universe-Polymorphic Type Theory using Rewriting. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, December 2020.
[ BibTex ]
[HHSY20]: S. Haar, S. Haddad, S. Schwoon, and L. Ye. Active Prediction for Discrete Event Systems. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, pages 48:1--48:16, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.48.
[ BibTex | DOI | Web page | PDF ]
[BBM20]: N. Bertrand, P. Bouyer, and A. Majumdar. Synthesizing safe coalition strategies. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, pages 39:1--39:17, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.39.
[ BibTex | DOI | Web page | PDF ]
[GMS20]: P. Gastin, S. Mukherjee, and B. Srivathsan. Reachability for updatable timed automata made faster and more effective. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, pages 47:1--47:17, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.47.
[ BibTex | DOI | Web page | PDF ]
[AG20]: C. Aiswarya and P. Gastin. Weighted Tiling Systems for Graphs: Evaluation Complexity. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.34.
[ BibTex | DOI | Web page | PDF ]
[For20]: M. Fortin. Expressivity of first-order logic, star-free propositional dynamic logic and communicating automata. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, November 2020.
[ BibTex | Web page | PDF ]
[CJS20b]: H. Comon, C. Jacomme, and G. Scerri. Oracle simulation: a technique for protocol composition with long term shared secrets. In Proceedings of the 27th ACM Conference on Computer and Communications Security (CCS'20), pages 1427--1444, Orlando, USA, November 2020. ACM Press.
doi: 10.1145/3372297.3417229.
[ BibTex | DOI ]
[BCH20]: M. Boltenhagen, B. Chetioui, and L. Huber. Cost-Based Classification of Log Traces Using Machine-Learning. In Process Mining Workshops (ICPM'20), pages 136--148, Padua, Italy, October 2020. SPRINGER.
doi: https://doi.org/10.1007/978-3-030-72693-5_11.
[ BibTex | DOI | Web page | PDF ]
[FP20]: A. Finkel and M. Praveen. Verification of Flat FIFO Systems. Logical Methods in Computer Science, 20(4), October 2020.
doi: 10.23638/LMCS-16(4:4)2020.
[ BibTex | DOI | Web page ]
[CFH⁺20]: D. Cho, M. Függer, C. Hopper, M. Kushwaha, T. Nowak, and Q. Soubeyran. Distributed Computation with Continual Population Growth. In Proceedings of the 34th International Symposium on Distributed Computing (DISC'20), Leibniz International Proceedings in Informatics, pages 7:1--7:17, Freiburg, Germany, October 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.DISC.2020.7.
[ BibTex | DOI | Web page | PDF ]
[BKM⁺20]: P. Bouyer, O. Kupferman, N. Markey, B. Maubert, A. Murano, and G. Perelli. Reasoning About Quality and Fuzziness of Strategic Behaviours. In Proceedings of the 24th European Conference on Artificial Intelligence (ECAI'20), pages 2887--2888, Santiago de Compostela, Spain, September 2020. IOS Press.
doi: 10.3233/FAIA200437.
[ BibTex | DOI | Web page | PDF ]
[SBvdA20]: M. F. Sani, M. Boltenhagen, and W. M. van der Aalst. Prototype Selection using Clustering and Conformance Metrics for Process Discovery. In Business Process Management Workshops (BPM'20), Revised Selected Papers, volume 397 of Lecture Notes in Business Information Processing, pages 281--294, Sevilla, Spain, September 2020. Springer.
doi: https://doi.org/10.1007/978-3-030-66498-5_21.
[ BibTex | DOI | Web page | PDF ]
[KNR⁺20]: I. Khmelnitsky, D. Neider, R. Roy, B. Barbot, B. Bollig, A. Finkel, S. Haddad, M. Leucker, and L. Ye. Property-Directed Verification of Recurrent Neural Networks. Research Report 2009.10610, Computing Research Repository, September 2020.
[ BibTex | Web page | PDF ]
[HPS20]: S. Haar, L. Paulevé, and S. Schwoon. Drawing the Line: Basin Boundaries in Safe Petri Nets. In Proceedings of the 18th Conference on Computational Methods in System Biology (CMSB'20), volume 12314 of Lecture Notes in Bioinformatics, pages 321--336, held online, September 2020. Springer-Verlag.
doi: 10.1007/978-3-030-60327-4_17.
[ BibTex | DOI ]
[BBR⁺20]: P. Bouyer, T. Brihaye, M. Randour, C. Rivière, and P. Vandenhove. Decisiveness of Stochastic Systems and its Application to Hybrid Models. In Proceedings of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'20), volume 326 of Electronic Proceedings in Theoretical Computer Science, page 149?165, Brussels, Belgium, September 2020.
doi: 10.4204/EPTCS.326.10.
[ BibTex | DOI | Web page | PDF ]
[BBB⁺20]: B. Bérard, B. Bollig, P. Bouyer, M. Függer, and N. Sznajder. Synthesis in Presence of Dynamic Links. In Proceedings of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'20), volume 326 of Electronic Proceedings in Theoretical Computer Science, page 33?49, Brussels, Belgium, September 2020.
doi: 10.4204/EPTCS.326.3.
[ BibTex | DOI | Web page | PDF ]
[DH20b]: S. Donatelli and S. Haddad. Guarded Autonomous Transitions Increase Conciseness and Expressiveness of Timed Automata. In Proceedings of the 18th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'20), Lecture Notes in Computer Science, pages 215--230, Vienna, Austria, September 2020. Springer.
[ BibTex | Web page ]
[BLRO⁺20]: P. Bouyer, S. Le Roux, Y. Oualhadj, M. Randour, and P. Vandenhove. Games Where You Can Play Optimally with Arena-Independent Finite Memory. In Proceedings of the 31st International Conference on Concurrency Theory (CONCUR'20), volume 171 of Leibniz International Proceedings in Informatics, pages 24:1--24:22, Vienna, Austria, September 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2020.24.
[ BibTex | DOI | Web page ]
[AGSW20]: B. Adsul, P. Gastin, S. Sarkar, and P. Weil. Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces. In Proceedings of the 31st International Conference on Concurrency Theory (CONCUR'20), volume 171 of Leibniz International Proceedings in Informatics, pages 19:1--19:17, Vienna, Austria, September 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2020.19.
[ BibTex | DOI | Web page ]
[BFS20]: B. Bollig, A. Finkel, and A. Suresh. Bounded Reachability Problems are Decidable in FIFO Machines. In Proceedings of the 31st International Conference on Concurrency Theory (CONCUR'20), volume 171 of Leibniz International Proceedings in Informatics, pages 49:1--49:17, Vienna, Austria, September 2020. Leibniz-Zentrum für Informatik.
[ BibTex | Web page ]
[BD20a]: F. Belardinelli and S. Demri. Reasoning with a Bounded Number of Resources in ATL+. In Proceedings of the 24th European Conference on Artificial Intelligence (ECAI'20), pages 624--631, Santiago de Compostela, Spain, September 2020. IOS Press.
doi: 10.3233/FAIA200147.
[ BibTex | DOI | Web page | PDF ]
[PKCH20]: L. Paulevé, J. Kolcák, T. Chatain, and S. Haar. Reconciling qualitative, abstract, and scalable modeling of biological networks. Nature Communications, 11(4256), August 2020.
doi: 10.1038/s41467-020-18112-5.
[ BibTex | DOI | Web page ]
[DTFG20]: G. Douéneau-Tabot, E. Filiot, and P. Gastin. Register transducers are marble transducers. In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS'20), volume 170 of Leibniz International Proceedings in Informatics, pages 29:1--29:14, Prague, Czech Republic, August 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.MFCS.2020.29.
[ BibTex | DOI | Web page | PDF ]
[DD20]: A. Díaz-Caro and G. Dowek. Extensional proofs in a propositional logic modulo isomorphisms. Research Report 2002.03762v3, Computing Research Repository, July 2020.
[ BibTex | Web page | PDF ]
[BDM20a]: D. Baelde, S. Delaune, and S. Moreau. A Method for Proving Unlinkability of Stateful Protocols. In Proceedings of the 33rd IEEE Computer Security Foundations Symposium (CSF'20), pages 169--183, Boston, MA, USA, July 2020. IEEE Computer Society Press.
[ BibTex | Web page ]
[BDFM20]: B. Bednarczyk, S. Demri, R. Fervari, and A. Mansutti. Modal Logics with Composition on Finite Forests: Expressivity and Complexity. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'20), pages 167--180, Saarbrucken, Germany, July 2020. IEEE Press.
doi: https://dl.acm.org/doi/10.1145/3373718.3394787.
[ BibTex | DOI | PDF ]
[HM20]: H. Herbelin and É. Miquey. A calculus of expandable stores. Continuation-and-environment-passing style translations. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'20), pages 564--577, Saarbrucken, Germany, July 2020. IEEE Press.
[ BibTex | Web page ]
[JKB20]: C. Jacomme, S. Kremer, and G. Barthe. Universal equivalence and majority on probabilistic programs over finite fields. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'20), pages 155--166, Saarbrucken, Germany, July 2020. IEEE Press.
[ BibTex | Web page ]
[BDM20b]: B. Bednarczyk, S. Demri, and A. Mansutti. A Framework for Reasoning about Dynamic Axioms in Description Logics. In Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI'20). IJCAI organization, July 2020.
[ BibTex | Web page ]
[HK20]: S. Haddad and I. Khmelnitsky. Dynamic Recursive Petri Nets. In Proceedings of the 41st International Conference on Applications and Theory of Petri Nets (PETRI NETS'20), volume 12152 of Lecture Notes in Computer Science, pages 345--366, Paris, France, June 2020. Springer.
doi: 10.1007/978-3-030-51831-8_17.
[ BibTex | DOI | Web page ]
[Bla20]: F. Blanqui. Type safety of rewriting rules in dependent types. In Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction (FSCD'20), Leibniz International Proceedings in Informatics, Paris, France, June 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSCD.2020.13.
[ BibTex | DOI | Web page | PDF ]
[Gen20b]: G. Genestier. Encoding Agda Programs using Rewriting. In Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction (FSCD'20), Leibniz International Proceedings in Informatics, Paris, France, June 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSCD.2020.31.
[ BibTex | DOI | Web page | PDF ]
[HB20]: G. Hondet and F. Blanqui. The new rewriting engine of Dedukti (System Description). In Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction (FSCD'20), Leibniz International Proceedings in Informatics, pages 35:1--35:16, Paris, France, June 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSCD.2020.35.
[ BibTex | DOI | Web page | PDF ]
[CFLS20]: S. Carpov, C. Fontaine, D. Ligier, and R. Sirdey. Illuminating the Dark or how to recover what should not be seen in FE-based classifiers. 2020:1--35, May 2020.
doi: 10.2478/popets-2020-0015.
[ BibTex | DOI | Web page ]
[BFL⁺20]: J. Bund, M. Függer, C. Lenzen, M. Medina, and W. Rosenbaum. PALS: Plesiochronous and Locally Synchronous Systems. In Proceedings of the 26th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'20), Publication only, May 2020. IEEE Computer Society.
[ BibTex | PDF ]
[KDH⁺20]: J. Kolcák, J. Dubut, I. Hasuo, S.-Y. Katsumata, D. Sprunger, and A. Yamada. Relational Differential Dynamic Logic. In Proceedings of the 26th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'20), volume 12078 of Lecture Notes in Computer Science, pages 191--208, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45190-5_11.
[ BibTex | DOI | Web page ]
[AGKR20]: S. Akshay, P. Gastin, S. N. Krishna, and S. Roychoudhary. Revisiting Underapproximate Reachability for Multipushdown Systems. In Proceedings of the 26th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'20), volume 12078 of Lecture Notes in Computer Science, pages 387--404, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45190-5_21.
[ BibTex | DOI | Web page | PDF ]
[Man20a]: A. Mansutti. An auxiliary logic on trees: on the Tower-hardness of logics featuring reachability and submodel reasoning. In Proceedings of the 23rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'20), Lecture Notes in Computer Science, pages 462--481, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45231-5_24.
[ BibTex | DOI ]
[FHK20b]: A. Finkel, S. Haddad, and I. Khmelnitsky. Minimal coverability tree construction made complete and efficient. In Proceedings of the 23rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'20), Lecture Notes in Computer Science, pages 237--256, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45231-5_13.
[ BibTex | DOI ]
[BBLS20]: B. Bérard, B. Bollig, M. Lehaut, and N. Sznajder. Parameterized Synthesis for Fragments of First-Order Logic over Data Words. In Proceedings of the 23rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'20), Lecture Notes in Computer Science, pages 97--118, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45231-5_6.
[ BibTex | DOI ]
[AVL⁺20]: N. Alexopoulos, E. Vasilomanolakis, S. Le Roux, S. Rowe, and M. Mühlhäuser. TRIDEnT: Towards a Decentralized Threat Indicator Marketplace. In Proceedings of the 35th ACM/SIGAPP Symposium on Applied Computing (SAC'20), pages 332--341, Brno, Czech Republic, March 2020. ACM Press.
doi: 10.1145/3341105.3374020.
[ BibTex | DOI | Web page ]
[DH20a]: S. Donatelli and S. Haddad. Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models. In Proceedings of the 14th International Conference on Language and Automata Theory and Applications (LATA'20), volume 12038 of Lecture Notes in Computer Science, pages 170--183, Milan, Italy, March 2020. Springer.
[ BibTex ]
[BD20b]: D. Berwanger and L. Doyen. Observation and Distinction. Representing Information in Infinite Games. In Proceedings of the 37th Annual Symposium on Theoretical Aspects of Computer Science (STACS'20), Leibniz International Proceedings in Informatics, pages 48:1--48:17, Montpellier, France, March 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2020.48.
[ BibTex | DOI ]
[ADL20]: N. Alechina, S. Demri, and B. Logan. Parameterised Resource-Bounded ATL. In Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI'20), pages 7040--7046. AAAI Press, February 2020.
doi: https://doi.org/10.1609/aaai.v34i05.6189.
[ BibTex | DOI | Web page ]
[GM20]: J. Goubault-Larrecq and F. Mynard. Convergence without Points. Houston Journal of Mathematics, 46(1):227--282, 2020.
[ BibTex | PDF ]
[DLM20]: S. Demri, É. Lozes, and A. Mansutti. Internal Calculi for Separation Logics. In Proceedings of the 28th Annual EACSL Conference on Computer Science Logic (CSL'20), Leibniz International Proceedings in Informatics, Barcelona, Spain, January 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2020.19.
[ BibTex | DOI | Web page ]
[CHK⁺20]: Th. Chatain, S. Haar, J. Kolcák, L. Paulevé, and A. Thakkar. Concurrency in Boolean networks. Natural Computing, 19:91--109, 2020.
[ BibTex | Web page | PDF ]
[GBM20]: P. Gardy, P. Bouyer, and N. Markey. Dependences in Strategy Logic. Theory of Computing Systems, 64(3), 2020.
[ BibTex | Web page | PDF ]
[CJS20a]: T. Chatain, R. Janicki, and N. Sidorova, editors. Proceedings of the 41st Conference on Petri Nets (PN'20), Paris, France, 2020. Springer.
[ BibTex | Web page ]
[JMS20]: L. Jezequel, A. Madalinski, and S. Schwoon. Distributed computation of vector clocks in Petri net unfoldings for test selection. Discrete Event Dynamic Systems: Theory and Applications, 30(3):441--464, 2020.
[ BibTex ]
[AMP20]: P. Arrighi, S. Martiel, and S. Perdrix. Reversible causal graph dynamics: invertibility, block representation, vertex-preservation. Natural Computing, 19(1):157--178, 2020.
doi: 10.1007/s11047-019-09768-0.
[ BibTex | DOI | Web page | PDF ]
[JFA20a]: J. Jerray, L. Fribourg, and É. André. Guaranteed phase synchronization of hybrid oscillators using symbolic Euler's method: The Brusselator and biped examples. Research Report 2006.09993, Computing Research Repository, 2020.
[ BibTex | Web page | PDF ]
[JFA20b]: J. Jerray, L. Fribourg, and É. André. Robust optimal control using dynamic programming and guaranteed Euler's method. Research Report 2007.13644, Computing Research Repository, 2020.
[ BibTex | Web page | PDF ]
[JF20]: J. Jerray and L. Fribourg. Generation of bounded invariants via stroboscopic set-valued maps: Application to the stability analysis of parametric time-periodic systems. Research Report 2012.09310, Computing Research Repository, 2020.
[ BibTex | Web page | PDF ]
[Lop20]: A. Lopez. Preservation Theorems Through the Lens of Topology. Research Report 2007.07879, Computing Research Repository, 2020.
[ BibTex | Web page | PDF ]
[BCC20]: M. Boltenhagen, T. Chatain, and J. Carmona. Model-based trace variant analysis of event logs. Information Systems, 2020. To appear.
doi: https://doi.org/10.1016/j.is.2020.101675.
[ BibTex | DOI | Web page ]
[BM20]: B. Barras and V. Maestracci. Implementation of Two Layers Type Theory in Dedukti and Application to Cubical Type Theory. In Proceedings of the 15th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'20), pages 54--67, Paris, France, 2020. ACM Press.
doi: 10.4204/EPTCS.332.4.
[ BibTex | DOI | Web page | PDF ]
[Fin20]: A. Finkel. From Well Structured Transition Systems to Program Verification. In Proceedings of 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis (VPT/HCVS@ETAPS 2020), pages 44--49, Dublin, Ireland, 2020. Electronic Proceedings in Theoretical Computer Science.
doi: 10.4204/EPTCS.320.3.
[ BibTex | DOI | Web page | PDF ]
[LR20]: S. Le Roux. Time-Aware Uniformization of Winning Strategies. In Proceedings of the 16th Conference on Computability in Europe (CiE 2020), volume 12098 of Lecture Notes in Computer Science, pages 193--204, Fisciano, Italy, 2020. Springer-Verlag.
doi: https://doi.org/10.1007/978-3-030-51466-2_17.
[ BibTex | DOI | Web page | PDF ]
[GMG20]: P. Gastin, A. Manuel, and R. Govind. Reversible Regular Languages: Logical and Algebraic Characterisations. Fundamenta Informaticae, 2020. To appear.
[ BibTex ]
[FHK20a]: A. Finkel, S. Haddad, and I. Khmelnitsky. Commodification of accelerations for the Karp and Miller Construction. Discrete Event Dynamic Systems: Theory and Applications, 2020.
doi: 10.1007/s10626-020-00331-z.
[ BibTex | DOI | Web page ]
[BHL20]: N. Bertrand, S. Haddad, and E. Lefaucheux. Diagnosis and Degradation Control for Probabilistic Systems. Discrete Event Dynamic Systems: Theory and Applications, 30:695–723, 2020.
doi: 10.1007/s10626-020-00320-2.
[ BibTex | DOI | Web page ]
[FG20]: A. Finkel and J. Goubault-Larrecq. Forward analysis for WSTS, part I: completions. Mathematical Structures in Computer Science, 30(7):752--832, 2020.
doi: 10.1017/S0960129520000195.
[ BibTex | DOI | Web page | PDF ]
[GK20]: J. Goubault-Larrecq and B. König, editors. Proceedings of the 23rd Conference on Foundations of Software Science and Computation Structures (FoSSaCS'20), Dublin, Ireland, 2020. Springer.
[ BibTex | Web page ]
[BJO20]: F. Blanqui, J. Jouannaud, and M. Okada. Corrigendum to Inductive-data-type systems [Theoret. Comput. Sci. 272 (1-2) (2002) 41-68]. Theoretical Computer Science, 817:81--82, 2020.
doi: 10.1016/j.tcs.2018.01.010.
[ BibTex | DOI | Web page ]
[BFG20a]: M. Blondin, A. Finkel, and J. Goubault-Larrecq. Forward Analysis for WSTS, Part III: Karp-Miller Trees. Logical Methods in Computer Science, 16(2), 2020.
doi: 10.23638/LMCS-16(2:13)2020.
[ BibTex | DOI | Web page ]
[DGK20]: V. Dave, P. Gastin, and S. N. Krishna. Regular Transducer Expressions for Regular Transformations. Information and Computation, 2020.
[ BibTex | Web page | PDF ]
[BFG20b]: B. Bollig, M. Fortin, and P. Gastin. Communicating Finite-State Machines, First-Order Logic, and Star-Free Propositional Dynamic Logic. Journal of Computer and System Sciences, pages 22--53, 2020.
doi: 10.1016/j.jcss.2020.06.006.
[ BibTex | DOI | PDF ]
[Gou20b]: J. Goubault-Larrecq. Some Topological Properties of Spaces of Lipschitz Continuous Maps on Quasi-Metric Spaces. Topology and its Applications, 282, 2020.
doi: 10.1016/j.topol.2020.107281.
[ BibTex | DOI | Web page ]
[LRP20]: S. Le Roux and A. Pauly. A Semi-Potential for Finite and Infinite Games in Extensive Form. Dynamic Games and Applications, 10(1):120--144, 2020.
doi: 10.1007/s13235-019-00301-7.
[ BibTex | DOI | Web page ]
[BFLM20]: J. Bund, M. Függer, C. Lenzen, and M. Medina. Synchronizer-free Digital Link Controller. IEEE Transactions on Circuits and Systems I, 67(10):3562--3573, 2020.
doi: 10.1109/TCSI.2020.2989552.
[ BibTex | DOI | Web page ]
[FKN20]: M. Függer, M. Kushwaha, and T. Nowak. Digital Circuit Design for Biological and Silicon Computers. In Advances in Synthetic Biology. Springer, 2020. To appear.
[ BibTex ]
[FNW20]: M. Függer, T. Nowak, and K. Winkler. On the radius of nonsplit graphs and information dissemination in dynamic networks. Discrete Applied Mathematics, 282:257--264, 2020.
doi: 10.1016/j.dam.2020.02.013.
[ BibTex | DOI | Web page ]
[ABF20]: P. Arrighi, C. Bény, and T. Farrelly. A quantum cellular automaton for one-dimensional QED. Quantum Information Processing, 19(88), 2020.
doi: 10.1007/s11128-019-2555-4.
[ BibTex | DOI | Web page ]
[MA20]: G. D. Molfetta and P. Arrighi. A quantum walk with both a continuous-time limit and a continuous-spacetime limit. Quantum Information Processing, 19(47), 2020.
doi: 10.1007/s11128-019-2549-2.
[ BibTex | DOI | Web page ]
[BFNS20]: D. Baelde, A. P. Felty, G. Nadathur, and A. Saurin. A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller's 60th birthday. Mathematical Structures in Computer Science, 29(8):1007--1008, 2020.
doi: 10.1017/S0960129519000136.
[ BibTex | DOI ]
[BGHLR20]: T. Brihaye, G. Geeraerts, M. Hallet, and S. Le Roux. On the termination of dynamics in sequential games. Information and Computation, 272, 2020.
doi: 10.1016/j.ic.2019.104505.
[ BibTex | DOI ]
[JLDJ20]: Y. Jiang, J. Liu, G. Dowek, and K. Ji. Towards Combining Model Checking and Proof Checking. The Computer Journal, 62(9):1365--1402, 2020.
doi: 10.1093/comjnl/bxy112.
[ BibTex | DOI | PDF ]
[BBC⁺20]: G. Burel, G. Bury, R. Cauderlier, D. Delahaye, P. Halmagrand, and O. Hermant. First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice. Journal of Automated Reasoning, 64:1001--1050, 2020.
doi: 10.1007/s10817-019-09533-z.
[ BibTex | DOI | Web page | PDF ]
[GHK⁺20]: J. Goubault-Larrecq, S. Halfon, P. Karandikar, K. Narayan Kumar, and Ph. Schnoebelen. The Ideal Approach to Computing Closed Subsets in Well-Quasi-Orderings. In Well-Quasi Orders in Computation, Logic, Language and Reasoning, volume 53 of Trends In Logic, pages 55--105. Springer, 2020.
doi: 10.1007/978-3-030-30229-0_3.
[ BibTex | DOI ]
[DSS20]: M. Džamonja, S. Schmitz, and Ph. Schnoebelen. On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders. In Well-Quasi Orders in Computation, Logic, Language and Reasoning, volume 53 of Trends In Logic, pages 2--54. Springer, 2020.
doi: 10.1007/978-3-030-30229-0_2.
[ BibTex | DOI ]
[Gou20a]: J. Goubault-Larrecq. Π⁰₂ Subsets of Domain-Complete Spaces and Countably Correlated Spaces. Topology Proceedings, 58:13--22, 2020. E-published on March 24, 2020.
[ BibTex | PDF ]
[BHL19]: N. Bertrand, S. Haddad, and E. Lefaucheux. A Tale of Two Diagnoses in Probabilistic Systems. Information and Computation, 269, December 2019.
doi: 10.1016/j.ic.2019.104441.
[ BibTex | DOI | PDF ]
[GF19]: E. Gupta and A. Finkel. The well structured problem for Presburger counter machines. In Proceedings of the 39th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'19), Leibniz International Proceedings in Informatics, pages 41:1--41:15, Bombay, India, December 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2019.41.
[ BibTex | DOI | Web page | PDF ]
[BBM19a]: N. Bertrand, P. Bouyer, and A. Majumdar. Concurrent parameterized games. In Proceedings of the 39th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'19), Leibniz International Proceedings in Informatics, pages 31:1--31:15, Bombay, India, December 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2019.31.
[ BibTex | DOI | Web page | PDF ]
[Man19]: H. Mandon. Algorithms for Cell Reprogramming Strategies in Boolean Networks. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, December 2019.
[ BibTex | Web page | PDF ]
[LF19a]: A. Le Coënt and L. Fribourg. Guaranteed Control of Sampled Switched Systems using Semi-Lagrangian Schemes and One-Sided Lipschitz Constants. In Proceedings of the 58th IEEE Conference on Decision and Control (CDC'19), pages 599--604, Nice, France, December 2019. IEEE Control System Society.
doi: 10.1109/CDC40024.2019.9029376.
[ BibTex | DOI | Web page | PDF ]
[CG19]: A. Chattopadhyay and P. Gastin, editors. Proceedings of the 39th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'19), Leibniz International Proceedings in Informatics, Bombay, India, December 2019. Leibniz-Zentrum für Informatik.
[ BibTex | Web page ]
[Gon19]: M. González. Stochastic Games on Graphs with Applications to Smart-Grids Optimization. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, November 2019.
[ BibTex | Web page | PDF ]
[FHK19b]: A. Finkel, S. Haddad, and I. Khmelnitsky. Réification des accélérations pour la construction de Karp et Miller. In Actes du 12ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'19), Angers, France, November 2019. HAL.
[ BibTex | Web page | PDF ]
[DH19b]: S. Donatelli and S. Haddad. Autonomous Transitions Enhance CSLTA Expressiveness and Conciseness. Research Report hal-02306021, HAL, October 2019. 23 pages.
[ BibTex | Web page | PDF ]
[Sao19]: A. Saoud. Compositional and Efficient Controller Synthesis for Cyber-Physical Systems. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, October 2019.
[ BibTex | Web page | PDF ]
[LF19b]: A. Le Coënt and L. Fribourg. Guaranteed Optimal Reachability Control of Reaction-Diffusion Equations Using One-Sided Lipschitz Constants and Model Reduction. In 9th International Workshop on Cyber Physical Systems (CyPhy'19) and 15th International Workshop on Model-Based Design (WESE'19), Revised Selected Papers, volume 11971 of Lecture Notes in Computer Science, pages 181--202, New York City, NY, USA, October 2019. Springer.
doi: 10.1007/978-3-030-41131-2_9.
[ BibTex | DOI | Web page ]
[Bou19a]: P. Bouyer. A Note on Game Theory and Verification (Invited Talk). In Proceedings of the 17th International Symposium on Automated Technology for Verification and Analysis (ATVA'19), volume 11781 of Lecture Notes in Computer Science, pages 3--22, Taipei, Taiwan, October 2019. Springer.
doi: 10.1007/978-3-030-31784-3_1.
[ BibTex | DOI ]
[Bou19b]: P. Bouyer. On the Computation of Nash Equilibria in Games on Graphs (Invited Talk). In Proceedings of the 26th International Symposium on Temporal Representation and Reasoning (TIME'19), Leibniz International Proceedings in Informatics, pages 3:1--3:3, Málaga, Spain, October 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.TIME.2019.3.
[ BibTex | DOI ]
[MSH⁺19]: H. Mandon, C. Su, S. Haar, J. Pang, and L. Paulevé. Sequential Reprogramming of Boolean Networks Made Practical. In Proceedings of the 17th Conference on Computational Methods in System Biology (CMSB'19), volume 11773 of Lecture Notes in Bioinformatics, pages 3--19, Trieste, Italy, September 2019. Springer-Verlag.
doi: 10.1007/978-3-030-31304-3_1.
[ BibTex | DOI ]
[SZ19]: S. Schmitz and G. Zetzsche. Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets. In Proceedings of the 13th Workshop on Reachability Problems in Computational Models (RP'19), volume 11674 of Lecture Notes in Computer Science, pages 193--201, Brussels, Belgium, September 2019. Springer.
doi: 10.1007/978-3-030-30806-3_15.
[ BibTex | DOI | Web page | PDF ]
[DT19]: G. Douéneau-Tabot. Register Models for Pebble Transducers and Applications to Optimization. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2019.
[ BibTex ]
[Gri19]: E. Grienenberger. Concept alignment in Logipedia - Alignement of logical connectives between HOL Light and Dedukti. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2019.
[ BibTex ]
[Lop19]: A. Lopez. Théorèmes de préservation. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2019.
[ BibTex ]
[Sur19]: A. Suresh. Termination, boundedness and reachability for input-bounded FIFO Machines. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2019.
[ BibTex ]
[Jaz19]: S. Jaziri. Automata on Timed Structures. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, September 2019.
[ BibTex | Web page | PDF ]
[Kou19c]: A. Koutsos. Preuves symboliques de propriétés d'indistinguabilité calculatoire. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, September 2019.
[ BibTex | Web page | PDF ]
[BCC19a]: M. Boltenhagen, T. Chatain, and J. Carmona. Encoding Conformance Checking Artefacts in SAT. In Business Process Management Workshops (BPM'19), Revised Selected Papers, volume 362 of Lecture Notes in Business Information Processing, pages 160--171, Vienna, Austria, September 2019. Springer.
doi: 10.1007/978-3-030-37453-2_14.
[ BibTex | DOI | Web page | PDF ]
[EHBB19]: M. El Haddad, G. Burel, and F. Blanqui. Ekstrakto: A tool to reconstruct Dedukti proofs from TSTP files (extended abstract). In Proceedings of the 6th Workshop on Proof eXchange for Theorem Proving (PxTP'19), volume 301 of Electronic Proceedings in Theoretical Computer Science, pages 27--35, Natal, Brazil, August 2019.
[ BibTex | Web page | PDF ]
[GMG19]: P. Gastin, A. Manuel, and R. Govind. Logics for Reversible Regular Languages and Semigroups with Involution. In Proceedings of the 23th International Conference on Developments in Language Theory (DLT'19), volume 11647 of Lecture Notes in Computer Science, pages 182--191, Warsaw, Poland, August 2019. Springer.
doi: 10.1007/978-3-030-24886-4_13.
[ BibTex | DOI | Web page | PDF ]
[DG19]: M. Droste and P. Gastin. Aperiodic Weighted Automata and Weighted First-Order Logic. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS'19), volume 138 of Leibniz International Proceedings in Informatics, pages 76:1--76:15, Aachen, Germany, August 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2019.76.
[ BibTex | DOI | Web page | PDF ]
[BT19]: P. Bouyer and N. Thomasset. Nash equilibria in games over graphs equipped with a communication mechanism. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS'19), volume 138 of Leibniz International Proceedings in Informatics, pages 9:1--9:14, Aachen, Germany, August 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2019.9.
[ BibTex | DOI | Web page | PDF ]
[BBM19b]: N. Bertrand, P. Bouyer, and A. Majumdar. Reconfiguration and message losses in parameterized broadcast networks. In Proceedings of the 30th International Conference on Concurrency Theory (CONCUR'19), volume 140 of Leibniz International Proceedings in Informatics, pages 32:1--32:15, Amsterdam, The Netherlands, August 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2019.32.
[ BibTex | DOI | Web page | PDF ]
[FP19]: A. Finkel and M. Praveen. Verification of Flat FIFO Systems. In Proceedings of the 30th International Conference on Concurrency Theory (CONCUR'19), volume 140 of Leibniz International Proceedings in Informatics, pages 12:1--12:17, Amsterdam, The Netherlands, August 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2019.12.
[ BibTex | DOI | Web page | PDF ]
[DFKN19]: J. Danger, L. Fribourg, U. Kühne, and M. Naceur. LAOCOÖN: A Run-Time Monitoring and Verification Approach for Hardware Trojan Detection. In Proceedings of the 22nd Euromicro Conference on Digital System Design (DSD'19), pages 269--276, Kallithea, Greece, August 2019. IEEE Press.
doi: 10.1109/DSD.2019.00047.
[ BibTex | DOI | Web page ]
[Kou19b]: A. Koutsos. Decidability of a Sound Set of Inference Rules for Computational Indistinguishability. In Proceedings of the 32nd IEEE Computer Security Foundations Symposium (CSF'19), pages 48--61, Hoboken, NJ, USA, July 2019. IEEE Computer Society Press.
doi: 10.1109/CSF.2019.00011.
[ BibTex | DOI | PDF ]
[GMS19]: P. Gastin, S. Mukherjee, and B. Srivathsan. Fast algorithms for handling diagonal constraints in timed automata. In Proceedings of the 31st International Conference on Computer Aided Verification (CAV'19), volume 11561 of Lecture Notes in Computer Science, pages 41--59, New York, USA, July 2019. Springer.
doi: 10.1007/978-3-030-25540-4_3.
[ BibTex | DOI | Web page | PDF ]
[BKM⁺19]: P. Bouyer, O. Kupferman, N. Markey, B. Maubert, A. Murano, and G. Perelli. Reasoning about Quality and Fuzziness of Strategic Behaviours. In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI'19), pages 1588--1594. IJCAI organization, July 2019.
doi: 10.24963/ijcai.2019/220.
[ BibTex | DOI | Web page | PDF ]
[Sch19]: S. Schmitz. The Parametric Complexity of Lossy Counter Machines. In Proceedings of the 46th International Colloquium on Automata, Languages and Programming (ICALP'19), volume 132 of Leibniz International Proceedings in Informatics, pages 129:1--129:15, Patras, Greece, July 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2019.129.
[ BibTex | DOI | Web page | PDF ]
[For19]: M. Fortin. FO = FO3 for linear orders with monotone binary relations. In Proceedings of the 46th International Colloquium on Automata, Languages and Programming (ICALP'19), volume 132 of Leibniz International Proceedings in Informatics, pages 116:1--116:13, Patras, Greece, July 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2019.116.
[ BibTex | DOI | Web page | PDF ]
[BGJ⁺19]: G. Barthe, B. Grégoire, C. Jacomme, S. Kremer, and P.-Y. Strub. Symbolic methods in computational cryptography proofs. In Proceedings of the 32nd IEEE Computer Security Foundations Symposium (CSF'19), pages 136--151, Hoboken, NJ, USA, July 2019. IEEE Computer Society Press.
doi: 10.1109/CSF.2019.00017.
[ BibTex | DOI | Web page | PDF ]
[Lic19]: A. Lick. XPath-like Query Logics: Proof Systems and Real-World Applicability. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, July 2019.
[ BibTex | Web page | PDF ]
[ÖMFS19]: D. Öhlinger, J. Maier, M. Függer, and U. Schmid. The Involution Tool for Accurate Digital Timingand Power Analysis. In Proceedings of the 29th International Symposium on Power and Timing Modeling, Optimization and Simulation (PATMOS'19), pages 1--8, Rhodes, Greece, July 2019. IEEE Press.
doi: 10.1109/PATMOS.2019.8862165.
[ BibTex | DOI | Web page ]
[BLS19]: D. Baelde, A. Lick, and S. Schmitz. Decidable XPath Fragments in the Real World. In Proceedings of the 38th Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'19), pages 285--302, Amsterdam, Netherlands, June-July 2019. ACM Press.
doi: 10.1145/3294052.3319685.
[ BibTex | DOI | Web page ]
[Gen19]: G. Genestier. SizeChangeTool: A Termination Checker for Rewriting Dependent Types. In Proceedings of the 10th International Workshop on Higher-Order Rewriting (HOR'19), pages 14--19, Dortmund, Germany, June 2019.
[ BibTex | PDF ]
[dBGJL19]: M. de Brecht, J. Goubault-Larrecq, X. Jia, and Z. Lyu. Domain-complete and LCS-complete Spaces. In Proceedings of the International Symposium on Domain Theory (ISDT'19), volume 345 of Electronic Notes in Theoretical Computer Science, pages 3--35, Yangzhou, China, June 2019. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2019.07.014.
[ BibTex | DOI ]
[GJ19]: J. Goubault-Larrecq and X. Jia. Algebras of the Extended Probabilistic Powerdomain Monad. In Proceedings of the International Symposium on Domain Theory (ISDT'19), volume 345 of Electronic Notes in Theoretical Computer Science, pages 37--61, Yangzhou, China, June 2019. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2019.07.015.
[ BibTex | DOI ]
[BGH19]: F. Blanqui, G. Genestier, and O. Hermant. Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting. In Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction (FSCD'19), volume 131 of Leibniz International Proceedings in Informatics, pages 9:1--9:21, Dortmund, Germany, June 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSCD.2019.9.
[ BibTex | DOI | Web page | PDF ]
[DD19]: A. Díaz-Caro and G. Dowek. Proof Normalisation in a Logic Identifying Isomorphic Propositions. In Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction (FSCD'19), volume 131 of Leibniz International Proceedings in Informatics, pages 14:1--14:23, Dortmund, Germany, June 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSCD.2019.14.
[ BibTex | DOI | Web page | PDF ]
[Gas19]: P. Gastin. Modular Descriptions of Regular Functions. In Proceedings of the 8th International Conference on Algebraic Informatics (CAI'19), volume 11545 of Lecture Notes in Computer Science, pages 3--9, Nis, Serbia, June 2019. Springer. Invited talk.
doi: 10.1007/978-3-030-21363-3_1.
[ BibTex | DOI | PDF ]
[Kou19a]: A. Koutsos. The 5G-AKA Authentication Protocol Privacy. In Proceedings of the 4th IEEE European Symposium on Security and Privacy (EuroS&P'19), pages 464--479, Stockholm, Sweden, June 2019. IEEE Press.
doi: 10.1109/EuroSP.2019.00041.
[ BibTex | DOI | PDF ]
[BCC19b]: M. Boltenhagen, T. Chatain, and J. Carmona. Generalized Alignment-Based Trace Clustering of Process Behavior. In Proceedings of the 40th International Conference on Applications and Theory of Petri Nets (PETRI NETS'19), volume 11522 of Lecture Notes in Computer Science, pages 237--257, Aachen, Germany, June 2019. Springer.
doi: 10.1007/978-3-030-21571-2_14.
[ BibTex | DOI | Web page | PDF ]
[BD19b]: F. Belardinelli and S. Demri. Resource-bounded ATL: the Quest for Tractable Fragments. In Proceedings of the 18th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'19), pages 206--214, Montreal, Canada, June 2019. ACM Press.
[ BibTex | Web page | PDF ]
[DFM19]: S. Demri, R. Fervari, and A. Mansutti. Axiomatising logics with separating conjunctions and modalities. In Proceedings of the 16th European Conference on Logics in Artificial Intelligence (JELIA'19), volume 11468 of Lecture Notes in Artificial Intelligence, pages 692--708, Rende, Italy, June 2019. Springer.
doi: 10.1007/978-3-030-19570-0_45.
[ BibTex | DOI | Web page | PDF ]
[FHK19a]: A. Finkel, S. Haddad, and I. Khmelnitsky. Coverability and Termination in Recursive Petri Nets. In Proceedings of the 40th International Conference on Applications and Theory of Petri Nets (PETRI NETS'19), volume 11522 of Lecture Notes in Computer Science, pages 429--448, Aachen, Germany, June 2019. Springer.
doi: 10.1007/978-3-030-21571-2_23.
[ BibTex | DOI | Web page | PDF ]
[Gou19c]: J. Goubault-Larrecq. A Probabilistic and Non-Deterministic Call-by-Push-Value Language. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--13, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785809.
[ BibTex | DOI ]
[AGJK19]: S. Akshay, P. Gastin, V. Jugé, and S. N. Krishna. Timed systems through the lens of logic. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--13, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785684.
[ BibTex | DOI | Web page | PDF ]
[BD19a]: B. Bednarczyk and S. Demri. Why propositional quantification makes modal logics on trees robustly hard ? In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--13, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785656.
[ BibTex | DOI | PDF ]
[CD19]: K. Chatterjee and L. Doyen. Graph Planning with Expected Finite Horizon. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--13, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785706.
[ BibTex | DOI ]
[LS19b]: J. Leroux and S. Schmitz. Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--13, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785796.
[ BibTex | DOI | Web page ]
[JS19]: P. Jančar and S. Schmitz. Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--12, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785848.
[ BibTex | DOI | Web page ]
[ZSGF19]: D. Zonetti, A. Saoud, A. Girard, and L. Fribourg. A symbolic approach to voltage stability and power sharing in time-varyingDC microgrids. In Proceedings of the 18th European Control Conference (ECC'19), pages 903--909, Naples, Italy, June 2019. IEEE Press.
doi: 10.23919/ECC.2019.8796095.
[ BibTex | DOI | Web page ]
[ACF⁺19]: É. André, E. Coquard, L. Fribourg, J. Jerray, and D. Lesens. Parametric Schedulability Analysis of a Launcher Flight Control System Under Reactivity Constraints. In Proceedings of the 19th International Conference on Application of Concurrency to System Design (ACSD'19), pages 13--22, Aachen, Germany, June 2019. IEEE Computer Society Press.
doi: 10.1109/ACSD.2019.00006.
[ BibTex | DOI | Web page ]
[DH19a]: S. Donatelli and S. Haar, editors. Proceedings of the 40th International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS'19), volume 11522 of Lecture Notes in Computer Science, Aachen, Germany, June 2019. Springer.
doi: 10.1007/978-3-030-21571-2.
[ BibTex | DOI | Web page ]
[MFNS19]: J. Maier, M. Függer, T. Nowak, and U. Schmid. Transistor-Level Analysis of Dynamic Delay Models. In Proceedings of the 25th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'19), pages 76--85, Hirosaki, Japan, May 2019. IEEE Computer Society.
doi: 10.1109/ASYNC.2019.00019.
[ BibTex | DOI ]
[Bur19]: G. Bury. Integrating rewriting, tableau and superposition into SMT. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, May 2019.
[ BibTex | Web page | PDF ]
[KS19]: P. Karandikar and Ph. Schnoebelen. The height of piecewise-testable languages and the complexity of the logic of subwords. Logical Methods in Computer Science, 15(2):6:1--6:27, April 2019.
[ BibTex | Web page | PDF ]
[BBR19]: B. Bollig, P. Bouyer, and F. Reiter. Identifiers in Registers - Describing Network Algorithms with Logic. In Proceedings of the 22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'19), volume 11425 of Lecture Notes in Computer Science, pages 115--132, Prague, Czech Republic, April 2019. Springer.
doi: 10.1007/978-3-030-17127-8.
[ BibTex | DOI | Web page | PDF ]
[CLS19]: S. Colin, R. Lepigre, and G. Scherer. Unboxing Mutually Recursive Type Definitions. In Actes des 30èmes Journées Francophones sur les Langages Applicatifs (JFLA'19), Lamoura, France, January 2019. To appear.
[ BibTex | PDF ]
[AFMS19]: É. André, L. Fribourg, J.-M. Mota, and R. Soulat. Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking. In Proceedings of the 20th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'19), Lecture Notes in Computer Science, pages 409--424, Cascais/Lisbon, Portugal, January 2019. Springer.
[ BibTex | PDF ]
[HKP19]: S. Haar, J. Kolcák, and L. Paulevé. Combining Refinement of Parametric Models with Goal-Oriented Reduction of Dynamics. In Proceedings of the 20th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'19), Lecture Notes in Computer Science, pages 555--576, Cascais/Lisbon, Portugal, January 2019. Springer.
[ BibTex | Web page | PDF ]
[Gou19d]: J. Goubault-Larrecq. A semantics for nabla. Mathematical Structures in Computer Science, 29:1250--1274, 2019.
doi: 10.1017/S0960129518000063.
[ BibTex | DOI | Web page ]
[KŠHP19]: J. Kolcák, D. Šafránek, S. Haar, and L. Paulevé. Parameter Space Abstraction and Unfolding Semantics of Discrete Regulatory Networks. Theoretical Computer Science, 765:120--144, 2019.
doi: 10.1016/j.tcs.2018.03.009.
[ BibTex | DOI | Web page | PDF ]
[Gou19a]: J. Goubault-Larrecq. Fooling the Parallel or Tester with Probability 8/27. In The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy---Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday, volume 11760 of Lecture Notes in Computer Science, pages 313--328. Springer, 2019. Updated version on arXiv:1903.12653.
[ BibTex | Web page ]
[BQS19]: B. Bollig, K. Quaas, and A. Sangnier. The Complexity of Flat Freeze LTL. Logical Methods in Computer Science, 15(3):32:1--32:26, 2019.
doi: 10.23638/LMCS-15(3:32)2019.
[ BibTex | DOI | Web page | PDF ]
[DF19]: S. Demri and R. Fervari. The power of modal separation logics. Journal of Logic and Computation, 29(8):1139--1184, 2019.
[ BibTex | PDF ]
[Gou19b]: J. Goubault-Larrecq. Formal Ball Monads. Topology and its Applications, 263:372--391, 2019.
doi: 10.1016/j.topol.2019.06.044.
[ BibTex | DOI | Web page ]
[HBD19]: L. Hirschi, D. Baelde, and S. Delaune. A method for unbounded verification of privacy-type properties. Journal of Computer Security, 27(3):277--342, 2019.
doi: 10.3233/JCS-171070.
[ BibTex | DOI | Web page | PDF ]
[MSP⁺19]: H. Mandon, C. Su, J. Pang, S. Paul, S. Haar, and L. Paulevé. Algorithms for the Sequential Reprogramming of Boolean Networks. IEEE/ACM Transaction on Computational Biology and Bioinformatics, 16(5):1610--1619, 2019.
[ BibTex | Web page | PDF ]
[HS19]: S. Halfon and Ph. Schnoebelen. On shuffle products, acyclic automata and piecewise-testable languages. Information Processing Letters, 145:68--73, 2019.
doi: 10.1016/j.ipl.2019.01.012.
[ BibTex | DOI ]
[LS19a]: R. Lazić and S. Schmitz. The Ideal View on Rackoff's Coverability Technique. Information and Computation, 2019. To appear.
[ BibTex | Web page ]
[DDR19]: A. Díaz-Caro, G. Dowek, and J. P. Rinaldi. Two linearities for quantum computing in the lambda calculus. Biosystems, 186, 2019.
doi: 10.1016/j.biosystems.2019.104012.
[ BibTex | DOI | Web page ]
[vdACCvD19]: W. M. P. van der Aalst, J. Carmona, T. Chatain, and B. F. van Dongen. A Tour in Process Mining: From Practice to Algorithmic Challenges. Transactions on Petri Nets and Other Models of Concurrency, 14:1--35, 2019.
doi: 10.1007/978-3-662-60651-3_1.
[ BibTex | DOI | Web page ]
[FNNS19]: M. Függer, R. Najvirt, T. Nowak, and U. Schmid. A faithful binary circuit model. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2019.
doi: 10.1109/TCAD.2019.2937748.
[ BibTex | DOI | Web page ]
[LPSS19]: J. Leroux, M. Praveen, G. Sutre, and Ph. Schnoebelen. On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. Logical Methods in Computer Science, 15(4), 2019.
doi: 10.23638/LMCS-15(4:15)2019.
[ BibTex | DOI | PDF ]
[LPR18]: S. Le Roux, A. Pauly, and M. Randour. Extending finite-memory determinacy to Boolean combinations of winning conditions. In Proceedings of the 38th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'18), volume 122 of Leibniz International Proceedings in Informatics, pages 38:1--38:20, Ahmedabad, India, December 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2018.38.
[ BibTex | DOI | Web page | PDF ]
[Man18]: A. Mansutti. Extending propositional separation logic for robustness properties. In Proceedings of the 38th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'18), volume 122 of Leibniz International Proceedings in Informatics, pages 42:1--42:23, Ahmedabad, India, December 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2018.42.
[ BibTex | DOI | Web page | PDF ]
[BHH18]: B. Bérard, S. Haar, and L. Hélouët. Hyper Partial Order Logic. In Proceedings of the 38th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'18), volume 122 of Leibniz International Proceedings in Informatics, pages 20:1--20:21, Ahmedabad, India, December 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2018.20.
[ BibTex | DOI | Web page | PDF ]
[FLS18]: A. Finkel, J. Leroux, and G. Sutre. Reachability for Two-Counter Machines with One Test and One Reset. In Proceedings of the 38th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'18), volume 122 of Leibniz International Proceedings in Informatics, pages 31:1--31:14, Ahmedabad, India, December 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2018.31.
[ BibTex | DOI | Web page | PDF ]
[BLS18b]: D. Baelde, A. Lick, and S. Schmitz. A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. In Proceedings of the 38th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'18), volume 122 of Leibniz International Proceedings in Informatics, pages 15:1--15:19, Ahmedabad, India, December 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2018.15.
[ BibTex | DOI | Web page | PDF ]
[Dal18]: A. Dallon. Verification of indistinguishability properties in cryptographic protocols -- Small attacks and efficient decision with SAT-Equiv. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, November 2018.
[ BibTex | Web page | PDF ]
[Dup18]: Y. Duplouy. Applying Formal Methods to Autonomous Vehicle Control. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, November 2018.
[ BibTex | Web page ]
[BJM18]: P. Bouyer, S. Jaziri, and N. Markey. Efficient Timed Diagnosis Using Automata with Timed Domains. In Proceedings of the 18th Workshop on Runtime Verification (RV'18), volume 11237 of Lecture Notes in Computer Science, pages 205--221, Limassol, Cyprus, November 2018. Springer.
doi: 10.1007/978-3-030-03769-7_12.
[ BibTex | DOI | Web page | PDF ]
[Dem18a]: S. Demri. On temporal and separation logics. In Proceedings of the 25th International Symposium on Temporal Representation and Reasoning (TIME'18), Leibniz International Proceedings in Informatics, pages 1:1--1:4, Warsaw, Poland, October 2018. Leibniz-Zentrum für Informatik.
[ BibTex | Web page ]
[CHK⁺18]: Th. Chatain, S. Haar, J. Kolcák, A. Thakkar, and L. Paulevé. Concurrency in Boolean networks. Research Report hal-01893106, HAL, October 2018. 33 pages.
[ BibTex | Web page | PDF ]
[BFG⁺18a]: G. Barthe, X. Fan, J. Gancher, B. Grégoire, C. Jacomme, and E. Shi. Symbolic Proofs for Lattice-Based Cryptography. In Proceedings of the 25th ACM Conference on Computer and Communications Security (CCS'18), pages 538--555, Toronto, Canada, October 2018. ACM Press.
[ BibTex | Web page | PDF ]
[FN18]: M. Függer and Th. Nowak. Fast Multidimensional Asymptotic and Approximate Consensus. In Proceedings of the 32nd International Symposium on Distributed Computing (DISC'18), volume 121 of Leibniz International Proceedings in Informatics, pages 27:1--27:15, New Orleans, USA, October 2018. Leibniz-Zentrum für Informatik.
[ BibTex | Web page ]
[BLS18c]: B. Bollig, M. Lehaut, and N. Sznajder. Round-Bounded Control of Parameterized Systems. In Proceedings of the 16th International Symposium on Automated Technology for Verification and Analysis (ATVA'18), volume 11138 of Lecture Notes in Computer Science, pages 370--386, Los Angeles, California, USA, October 2018. Springer.
doi: 10.1007/978-3-030-01090-4_22.
[ BibTex | DOI | Web page ]
[BBBC18]: N. Bertrand, P. Bouyer, T. Brihaye, and P. Carlier. When are Stochastic Transition Systems Tameable? Journal of Logic and Algebraic Methods in Programming, 99:41--96, October 2018.
doi: 10.1016/j.jlamp.2018.03.004.
[ BibTex | DOI | Web page | PDF ]
[BGMR18]: P. Bouyer, M. González, N. Markey, and M. Randour. Multi-weighted Markov Decision Processes with Reachability Objectives. In Proceedings of the 9th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'18), volume 277 of Electronic Proceedings in Theoretical Computer Science, pages 250--264, Saarbrücken, Germany, September 2018.
doi: 10.4204/EPTCS.277.18.
[ BibTex | DOI | Web page | PDF ]
[BDH18]: D. Baelde, S. Delaune, and L. Hirschi. POR for Security Protocol Equivalences - Beyond Action-Determinism. In Proceedings of the 23rd European Symposium on Research in Computer Security (ESORICS'18), volume 11098 of Lecture Notes in Computer Science, pages 385--405, Barcelona, Spain, September 2018. Springer.
doi: 10.1007/978-3-319-99073-6_19.
[ BibTex | DOI | Web page ]
[CDD18]: V. Cortier, A. Dallon, and S. Delaune. Efficiently Deciding Equivalence for Standard Primitives and Phases. In Proceedings of the 23rd European Symposium on Research in Computer Security (ESORICS'18), volume 11098 of Lecture Notes in Computer Science, pages 491--511, Barcelona, Spain, September 2018. Springer.
doi: 10.1007/978-3-319-99073-6_24.
[ BibTex | DOI | Web page | PDF ]
[Hil18]: M. Hilaire. Complexity of the reachability problem for parametric timed automata. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2018.
[ BibTex | PDF ]
[Lef18]: E. Lefaucheux. Controlling Information in Probabilistic Systems. Thèse de doctorat, Université Rennes 1, Rennes, France, September 2018.
[ BibTex | Web page | PDF ]
[Gro18]: N. Grosshans. The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, September 2018.
[ BibTex | Web page | PDF ]
[BBJ18]: B. Bérard, P. Bouyer, and V. Jugé. Finite bisimulations for dynamical systems with overlapping trajectories. In Proceedings of the 27th Annual EACSL Conference on Computer Science Logic (CSL'18), Leibniz International Proceedings in Informatics, Birmingham, UK, September 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2018.26.
[ BibTex | DOI | Web page | PDF ]
[GMS18]: P. Gastin, S. Mukherjee, and B. Srivathsan. Reachability in timed automata with diagonal constraints. In Proceedings of the 29th International Conference on Concurrency Theory (CONCUR'18), volume 118 of Leibniz International Proceedings in Informatics, pages 28:1--28:17, Beijing, China, September 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2018.28.
[ BibTex | DOI | Web page | PDF ]
[BFG18c]: B. Bollig, M. Fortin, and P. Gastin. It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with ”Happened Before”. In Proceedings of the 29th International Conference on Concurrency Theory (CONCUR'18), volume 118 of Leibniz International Proceedings in Informatics, pages 7:1--7:17, Beijing, China, September 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2018.7.
[ BibTex | DOI | Web page | PDF ]
[GL18]: J. Goubault-Larrecq and J.-P. Lachance. On the Complexity of Monitoring Orchids Signatures, and Recurrence Equations. Formal Methods in System Design, 53(1):6--32, August 2018. Special issue of RV'16.
doi: 10.1007/s10703-017-0303-x.
[ BibTex | DOI | Web page ]
[Bur18a]: G. Burel. Linking Focusing and Resolution with Selection. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS'18), volume 117 of Leibniz International Proceedings in Informatics, pages 9:1--9:14, Liverpool, UK, August 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2018.9.
[ BibTex | DOI | Web page | PDF ]
[CHP18b]: Th. Chatain, S. Haar, and L. Paulevé. Most Permissive Semantics of Boolean Networks. Research Report 1808.10240, Computing Research Repository, August 2018. 15 pages.
[ BibTex | Web page | PDF ]
[BLS18a]: D. Baelde, A. Lick, and S. Schmitz. A Hypersequent Calculus with Clusters for Linear Frames. In Proceedings of the 10th Conference on Advances in Modal Logics (AiML'18), pages 36--55, Bern, Switzerland, August 2018. College Publications.
[ BibTex | Web page ]
[DF18]: S. Demri and R. Fervari. On the complexity of modal separation logics. In Proceedings of the 10th Conference on Advances in Modal Logics (AiML'18), pages 179--198, Bern, Switzerland, August 2018. College Publications.
[ BibTex | Web page | PDF ]
[FFL18]: S. Friedrichs, M. Függer, and C. Lenzen. Metastability-Containing Circuits. IEEE Transactions on Computers, 67(8):1167--1183, August 2018.
doi: 10.1109/TC.2018.2808185.
[ BibTex | DOI | Web page ]
[BMR⁺18]: P. Bouyer, N. Markey, M. Randour, K. G. Larsen, and S. Laursen. Average-energy games. Acta Informatica, 55(2):91--127, July 2018.
doi: 10.1007/s00236-016-0274-1.
[ BibTex | DOI | Web page | PDF ]
[HM18]: S. Haddad and B. Monmege. Interval iteration algorithm for MDPs and IMDPs. Theoretical Computer Science, 735:111--131, July 2018.
doi: 10.1016/j.tcs.2016.12.003.
[ BibTex | DOI | Web page ]
[BG18]: F. Blanqui and G. Genestier. Termination of λΠ modulo rewriting using the size-change principle. In Proceedings of the 16th International Workshop on Termination (WST'18), pages 10--14, Oxford, UK, July 2018.
[ BibTex | PDF ]
[Thi18]: F. Thiré. Sharing a Library between Proof Assistants: Reaching out to the HOL Family *. In Proceedings of the 13th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'18), pages 57--71, Oxford, UK, July 2018. ACM Press.
doi: 10.4204/EPTCS.274.4.
[ BibTex | DOI | Web page | PDF ]
[LR18a]: R. Lepigre and C. Raffalli. Abstract Representation of Binders in OCaml using the Bindlib Library. In Proceedings of the 13th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'18), pages 42--56, Oxford, UK, July 2018. ACM Press.
doi: 10.4204/EPTCS.274.4.
[ BibTex | DOI | Web page | PDF ]
[FNS18]: M. Függer, Th. Nowak, and M. Schwarz. Tight Bounds for Asymptotic and Approximate Consensus. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC'18), pages 325--334, Egham, UK, July 2018. ACM Press.
doi: 10.1145/3212734.3212762.
[ BibTex | DOI | Web page ]
[BBF⁺18a]: G. Bacci, P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and P.-A. Reynier. Optimal and Robust Controller Synthesis Using Energy Timed Automata with Uncertainty. In Proceedings of the 22nd International Symposium on Formal Methods (FM'18), Lecture Notes in Computer Science, pages 203--221, Oxford, UK, July 2018. Springer. Best paper award.
doi: 10.1007/978-3-319-95582-7_12.
[ BibTex | DOI | Web page | PDF ]
[JK18]: C. Jacomme and S. Kremer. An extensive formal analysis of multi-factor authentication protocols. In Proceedings of the 31st IEEE Computer Security Foundations Symposium (CSF'18), pages 1--15, Oxford, UK, July 2018. IEEE Computer Society Press.
doi: 10.1109/CSF.2018.00008.
[ BibTex | DOI | Web page | PDF ]
[DGK18]: V. Dave, P. Gastin, and S. N. Krishna. Regular Transducer Expressions for Regular Transformations. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'18), pages 315--324, Oxford, UK, July 2018. ACM Press.
doi: 10.1145/3209108.3209182.
[ BibTex | DOI | Web page | PDF ]
[LFV18]: A. Le Coënt, L. Fribourg, and J. Vacher. Control Synthesis for Stochastic Switched Systems using the Tamed Euler Method. In Proceedings of the 6th IFAC Conference on Analysis and Design of Hybrid Systems (ADHS'18), volume 51 of IFAC-PapersOnLine, pages 259--264, Oxford, UK, July 2018. Elsevier Science Publishers.
doi: 10.1016/j.ifacol.2018.08.044.
[ BibTex | DOI | Web page | PDF ]
[FHLM18]: É. Fabre, L. Hélouët, E. Lefaucheux, and H. Marchand. Diagnosability of Repairable Faults. Discrete Event Dynamic Systems: Theory and Applications, 28(2):183--213, June 2018.
doi: 10.1007/s10626-017-0255-8.
[ BibTex | DOI | PDF ]
[Hal18]: S. Halfon. On Effective Representations of Well Quasi-Orderings. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, June 2018.
[ BibTex | Web page | PDF ]
[CGR18]: O. Carton, B. Guillon, and F. Reiter. Counter Machines and Distributed Automata. In Proceedings of the 24th Annual International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA'18), volume 10875 of Lecture Notes in Computer Science, pages 13--28, Ghent, Belgium, June 2018. Springer.
doi: 10.1007/978-3-319-92675-9_2.
[ BibTex | DOI | PDF ]
[CHP18a]: Th. Chatain, S. Haar, and L. Paulevé. Boolean Networks: Beyond Generalized Asynchronicity. In Proceedings of the 24th Annual International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA'18), volume 10875 of Lecture Notes in Computer Science, pages 29--42, Ghent, Belgium, June 2018. Springer.
doi: 10.1007/978-3-319-92675-9_3.
[ BibTex | DOI | Web page ]
[LGS18]: E. Lefaucheux, A. Giua, and C. Seatzu. Basis Coverability Graph for Partially Observable Petri Nets with Application to Diagnosability Analysis. In Proceedings of the 39th International Conference on Applications and Theory of Petri Nets (PETRI NETS'18), volume 10877 of Lecture Notes in Computer Science, pages 164--183, Bratislava, Slovakia, June 2018. Springer.
[ BibTex | PDF ]
[BBDH18]: B. Barbot, B. Bérard, Y. Duplouy, and S. Haddad. Integrating Simulink Models into the Model Checker Cosmos. In Proceedings of the 39th International Conference on Applications and Theory of Petri Nets (PETRI NETS'18), volume 10877 of Lecture Notes in Computer Science, pages 363--373, Bratislava, Slovakia, June 2018. Springer.
doi: 10.1007/978-3-319-91268-4_19.
[ BibTex | DOI | Web page | PDF ]
[SGF18b]: A. Saoud, A. Girard, and L. Fribourg. On the Composition of Discrete and Continuous-time Assume-Guarantee Contracts for Invariance. In Proceedings of the European Control Conference (ECC'18), pages 435--440, Limassol, Cyprus, June 2018. IEEE Press.
doi: 10.23919/ECC.2018.8550622.
[ BibTex | DOI | Web page | PDF ]
[AGK18]: S. Akshay, P. Gastin, and S. N. Krishna. Analyzing Timed Systems Using Tree Automata. Logical Methods in Computer Science, 14(2):1--35, May 2018.
doi: 10.23638/LMCS-14(2:8)2018.
[ BibTex | DOI | Web page | PDF ]
[FKLW18]: M. Függer, A. Kinali, C. Lenzen, and B. Wiederhake. Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance. In Proceedings of the 24th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'18), pages 68--77, Vienna, Austria, May 2018. IEEE Computer Society.
doi: 10.1109/ASYNC.2018.00025.
[ BibTex | DOI | Web page ]
[JMS18]: L. Jezequel, A. Madalinski, and S. Schwoon. Distributed computation of vector clocks in Petri nets unfolding for test selection. In Proceedings of the 14th Workshop on Discrete Event Systems (WODES'18), volume 51(7) of IFAC-PapersOnLine, pages 106--111, Sorrento Coast, Italy, May-June 2018. Elsevier Science Publishers.
[ BibTex | PDF ]
[ABG18]: C. Aiswarya, B. Bollig, and P. Gastin. An Automata-Theoretic Approach to the Verification of Distributed Algorithms. Information and Computation, 259:305--327, April 2018.
doi: 10.1016/j.ic.2017.05.006.
[ BibTex | DOI | PDF ]
[Gil18]: F. Gilbert. Extending higher-order logic with predicate subtyping. Thèse de doctorat, Université Paris 7, Paris, France, April 2018.
[ BibTex | PDF ]
[Bur18b]: G. Burel. Linking Focusing and Resolution with Selection. Research Report hal-01670476, HAL Research Report, April 2018.
[ BibTex | Web page | PDF ]
[SGF18a]: A. Saoud, A. Girard, and L. Fribourg. Contract based Design of Symbolic Controllers for Vehicle Platooning. In Proceedings of the 21st ACM International Conference on Hybrid Systems: Computation and Control (HSCC'18), pages 277--278, Porto, Portugal, April 2018. ACM Press. Poster.
doi: 10.1145/3178126.3187001.
[ BibTex | DOI | PDF ]
[Bla18]: F. Blanqui. Size-based termination of higher-order rewriting. Journal of Functional Programming, 28, April 2018.
doi: 10.1017/S0956796818000072.
[ BibTex | DOI | Web page | PDF ]
[JKS18]: C. Jacomme, S. Kremer, and G. Scerri. Symbolic Models for Isolated Execution Environments. In Proceedings of the 2nd IEEE European Symposium on Security and Privacy (EuroS&P'17), pages 530--545, Paris, France, April 2018. IEEE Press.
doi: 10.1109/EuroSP.2017.16.
[ BibTex | DOI | Web page ]
[Had18]: S. Haddad. Memoryless determinacy of finite parity games: Another simple proof. Information Processing Letters, 132:19--21, April 2018.
doi: 10.1016/j.ipl.2017.11.012.
[ BibTex | DOI | PDF ]
[CCD⁺18]: Th. Chatain, M. Comlan, D. Delfieu, L. Jezequel, and O. H. Roux. Pomsets and Unfolding of Reset Petri Nets. In Proceedings of the 12th International Conference on Language and Automata Theory and Applications (LATA'18), volume 10792 of Lecture Notes in Computer Science, pages 258--270, Bar-Ilan, Israel, April 2018. Springer.
doi: 10.1007/978-3-319-77313-1_20.
[ BibTex | DOI | Web page ]
[DLM18]: S. Demri, É. Lozes, and A. Mansutti. The Effects of Adding Reachability Predicates in Propositional Separation Logic. In Proceedings of the 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'18), volume 10803 of Lecture Notes in Computer Science, pages 476--493, Thessaloniki, Greece, April 2018. Springer.
[ BibTex | PDF ]
[Bou18]: P. Bouyer. Games on graphs with a public signal monitoring. In Proceedings of the 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'18), volume 10803 of Lecture Notes in Computer Science, pages 530--547, Thessaloniki, Greece, April 2018. Springer.
doi: 10.1007/978-3-319-89366-2_29.
[ BibTex | DOI | Web page | PDF ]
[FMN⁺18]: M. Függer, J. Maier, R. Najvirt, Th. Nowak, and U. Schmid. A Faithful Binary Circuit Model with Adversarial Noise. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE'18), pages 1327--1332, Dresden, Germany, March 2018. IEEE Computer Society Press.
doi: 10.23919/DATE.2018.8342219.
[ BibTex | DOI | Web page | PDF ]
[BBF⁺18b]: B. Barbot, M. Beccuti, G. Franceschinis, S. Haddad, and C. Picaronny. Bounds Computation for Symmetric Nets. Research Report hal-01726011, HAL-Inria, March 2018.
[ BibTex | Web page | PDF ]
[GBM18]: P. Gardy, P. Bouyer, and N. Markey. Dependences in Strategy Logic. In Proceedings of the 35th Annual Symposium on Theoretical Aspects of Computer Science (STACS'18), volume 96 of Leibniz International Proceedings in Informatics, pages 34:1--34:15, Caen, France, February 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2018.34.
[ BibTex | DOI | Web page | PDF ]
[BFG18b]: B. Bollig, M. Fortin, and P. Gastin. Communicating Finite-State Machines and Two-Variable Logic. In Proceedings of the 35th Annual Symposium on Theoretical Aspects of Computer Science (STACS'18), volume 96 of Leibniz International Proceedings in Informatics, pages 17:1--17:14, Caen, France, February 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2018.17.
[ BibTex | DOI | Web page | PDF ]
[GKLZ18]: M. Ganardi, D. König, M. Lohrey, and G. Zetzsche. Knapsack problems for wreath products. In Proceedings of the 35th Annual Symposium on Theoretical Aspects of Computer Science (STACS'18), volume 96 of Leibniz International Proceedings in Informatics, pages 32:1--32:13, Caen, France, February 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2018.32.
[ BibTex | DOI | Web page | PDF ]
[Bv18]: D. Berwanger and M. van den Bogaard. Consensus Game Acceptors and Iterated Transductions. International Journal of Foundations of Computer Science, 29(02):165--185, February 2018.
doi: 10.1142/S0129054118400026.
[ BibTex | DOI | Web page | PDF ]
[GM18]: P. Gastin and B. Monmege. A unifying survey on weighted logics and weighted automata. Soft Computing, 22(4):1047--1065, February 2018.
doi: 10.1007/s00500-015-1952-6.
[ BibTex | DOI | Web page | PDF ]
[BFL⁺18]: P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, J. Ouaknine, and J. Worrell. Model Checking Real-Time Systems. In Handbook of Model Checking, pages 1001--1046. Springer, 2018.
doi: 10.1007/978-3-319-10575-8_29.
[ BibTex | DOI | Web page | PDF ]
[BFM18]: M. Blondin, A. Finkel, and P. McKenzie. Handling Infinitely Branching Well-structured Transition Systems. Information and Computation, 258:28--49, 2018.
doi: 10.1016/j.ic.2017.11.001.
[ BibTex | DOI ]
[BGH18]: B. Bollig, M.-L. Grindei, and P. Habermehl. Realizability of Concurrent Recursive Programs. Formal Methods in System Design, 53(3):339--362, 2018.
doi: 10.1007/s10703-017-0282-y.
[ BibTex | DOI ]
[LR18b]: R. Lepigre and C. Raffalli. Practical Subtyping for Curry-Style Languages. ACM Transactions on Programming Languages and Systems, 41(1):5:1--5:58, 2018.
doi: 10.1145/3285955.
[ BibTex | DOI | PDF ]
[Lep18]: R. Lepigre. PML_2: Integrated Program Verification in ML. In Proceedings of the 23rd International Conference on Types for Proofs and Programs (TYPES'17, volume 104 of Leibniz International Proceedings in Informatics, pages 4:1--4:27, Budapest, Hungary, 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.TYPES.2017.4.
[ BibTex | DOI | Web page | PDF ]
[Dem18b]: S. Demri. Reasoning about reversal-bounded counter machines. In Ewa Orlowska on Relational Methods in Logic and Computer Science, volume 17 of Outstanding Contributions to Logic, pages 441--479. Springer, 2018.
[ BibTex | Web page | PDF ]
[BLMP18]: V. Brattka, S. Le Roux, J. S. Miller, and A. Pauly. Connected Choice and Brouwer's Fixed Point Theorem. Journal of Mathematical Logic, 2018. To appear.
[ BibTex ]
[CYFFMF18]: R. Chane-Yack-Fa, M. Frappier, A. Mammar, and A. Finkel. Parameterized Verification of Monotone Information Systems. Formal Aspects of Computing, 30(3-4):463--489, 2018.
doi: 10.1007/s00165-018-0460-8.
[ BibTex | DOI | Web page ]
[Zet18]: G. Zetzsche. The Emptiness Problem for Valence Automata over Graph Monoids. Information and Computation, 2018. To appear.
[ BibTex ]
[LZ18]: M. Lohrey and G. Zetzsche. Knapsack in Graph Groups. Theory of Computing Systems, 62(1):192--246, January 2018.
doi: 10.1007/s00224-017-9808-3.
[ BibTex | DOI ]
[BHSS18]: B. Bérard, S. Haar, S. Schmitz, and S. Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. Fundamenta Informaticae, 161(4):317--349, 2018.
doi: 10.3233/FI-2018-1706.
[ BibTex | DOI | Web page ]
[LFM⁺18]: A. Le Coënt, L. Fribourg, N. Markey, F. De Vuyst, and L. Chamoin. Compositional synthesis of state-dependent switching control. Theoretical Computer Science, 750:53--68, 2018.
doi: 10.1016/j.tcs.2018.01.021.
[ BibTex | DOI | Web page | PDF ]
[LACF18]: A. Le Coënt, J. Alexandre dit Sandretto, A. Chapoutot, and L. Fribourg. An improved algorithm for the control synthesis of nonlinear sampled switched systems. Formal Methods in System Design, 53(3):363--383, 2018.
doi: 10.1007/s10703-017-0305-8.
[ BibTex | DOI | Web page | PDF ]
[ABDL18]: N. Alechina, N. Bulling, S. Demri, and B. Logan. On the Complexity of Resource-Bounded Logics. Theoretical Computer Science, 750:69--100, 2018.
doi: 10.1016/j.tcs.2018.01.019.
[ BibTex | DOI | PDF ]
[HGLJX18]: W. K. Ho, J. Goubault-Larrecq, A. Jung, and X. Xi. The Ho-Zhao Problem. Logical Methods in Computer Science, 14(1):1--19, January 2018.
doi: 10.23638/LMCS-14(1:7)2018.
[ BibTex | DOI | Web page | PDF ]
[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), volume 91 of 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 of Lecture Notes in Computer Science, 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 of Lecture Notes in Computer Science, 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 ]
[BKM16]: M. Blondin, A. Krebs, and P. McKenzie. The Complexity of Intersecting Finite Automata Having Few Final States. Computational Complexity, 25(4):775--814, December 2016. To appear.
doi: 10.1007/s00037-014-0089-9.
[ BibTex | DOI | Web page | PDF ]
[The16]: S. Theissing. Supervision in Multi-Modal Transportation System. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, December 2016.
[ BibTex | Web page | PDF ]
[Bol16]: B. Bollig. One-Counter Automata with Counter Observability. In Proceedings of the 36th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'16), volume 65 of Leibniz International Proceedings in Informatics, pages 20:1--20:14, Chennai, India, December 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2016.20.
[ BibTex | DOI | Web page ]
[Gou16d]: J. Goubault-Larrecq. A semantics for . Invited talk, Dale Miller Festschrift, Paris Diderot University, Paris, December 2016.
[ BibTex ]
[AD16b]: P. Arrighi and G. Dowek. What is the Planck constant the magnitude of? preprint, December 2016.
[ BibTex | Web page | PDF ]
[Hal16a]: P. Halmagrand. Automated Deduction and Proof Certification for the B Method. Thèse de doctorat, Conservatoire National Des Arts et Métiers, Paris, December 2016.
[ BibTex | Web page ]
[BGMS16b]: P. Beame, N. Grosshans, P. McKenzie, and L. Segoufin. Nondeterminism and An Abstract Formulation of Nečiporuk's Lower Bound Method. ACM Transactions on Computation Theory, 9(1):5:1--5:34, December 2016.
doi: 10.1145/3013516.
[ BibTex | DOI ]
[Van16]: M. Van den Bogaard. Motifs de Flot d'Information dans les Jeux à Information Imparfaite. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2016.
[ BibTex | Web page | PDF ]
[MPTAS16]: D. Montoya, T. Pellissier Tanon, S. Abiteboul, and F. Suchanek. Thymeflow, A Personal Knowledge Base with Spatio-temporal Data. In Proceedings of the 25th ACM International Conference on Information and Knowledge Management (CIKM'16), pages 2477--2480, Indianapolis, Indiana, USA, October 2016. ACM.
doi: 10.1145/2983323.2983337.
[ BibTex | DOI | PDF ]
[Moh16]: S. Mohamed. Une méthode topologique pour la recherche d'ensembles invariants de systèmes continus et à commutation. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2016.
[ BibTex | Web page | PDF ]
[Cau16b]: R. Cauderlier. Object-Oriented Mechanisms for Interoperability between Proof Systems. Thèse de doctorat, Conservatoire National Des Arts et Métiers, Paris, October 2016.
[ BibTex | Web page | PDF ]
[DGL16]: S. Demri, V. Goranko, and M. Lange. Temporal Logics in Computer Science, volume 58 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, October 2016.
[ BibTex | Web page ]
[Hal16b]: P. Halmagrand. Soundly Proving B Method Formulae Using Typed Sequent Calculus. In Proceedings of the 13th International Colloquium on Theoretical Aspects of Computing (ICTAC'16), volume 9965 of Lecture Notes in Computer Science, pages 196--213, Taipei, Taiwan, October 2016. Springer.
doi: 10.1007/978-3-319-46750-4_12.
[ BibTex | DOI | Web page | PDF ]
[vDCC16a]: B. van Dongen, J. Carmona, and Th. Chatain. Alignment-based Quality Metrics in Conformance Checking. In Proceedings of the 7th Int. Workshop on Enterprise Modelling and Information Systems Architectures (EMISA'16), volume 1701 of CEUR Workshop Proceedings, pages 87--90, Vienna, Austria, October 2016. CEUR-WS.org.
[ BibTex | DOI | Web page | PDF ]
[MHP16]: H. Mandon, S. Haar, and L. Paulevé. Relationship between the Reprogramming Determinants of Boolean Networks and their Interaction Graph. In Proceedings of the 5th International Workshop on Hybrid Systems Biology, Lecture Notes in Computer Science, pages 113--127, Grenoble France, October 2016. Springer.
doi: 10.1007/978-3-319-47151-8_8.
[ BibTex | DOI | Web page | PDF ]
[BMJ16]: P. Bouyer, N. Markey, and V. Jugé. Dynamic Complexity of Parity Games with Bounded Tree-Width. Research Report 1610.00571, Computing Research Repository, October 2016. 33 pages.
[ BibTex | Web page | PDF ]
[CD16a]: R. Cauderlier and C. Dubois. ML Pattern-Matching, Recursion, and Rewriting: From FoCaLiZe to Dedukti. In Proceedings of the 13th International Colloquium on Theoretical Aspects of Computing (ICTAC'16), volume 9965 of Lecture Notes in Computer Science, pages 459--468, Taipei, Taiwan, October 2016. Springer.
[ BibTex | Web page | PDF ]
[Haa16]: S. Haar. Cyclic Ordering through Partial Orders. Journal of Multiple-Valued Logic and Soft Computing, 27(2-3):209--228, September 2016.
[ BibTex | Web page | PDF ]
[Jac16]: C. Jacomme. Automated applications of Cryptographic Assumptions. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2016.
[ BibTex | PDF ]
[HHK⁺16a]: M. Hutagalung, N. Hundeshagen, D. Kuske, M. Lange, and É. Lozes. Multi-Buffer Simulations for Trace Language Inclusion. In Proceedings of the 7th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'16), volume 226 of Electronic Proceedings in Theoretical Computer Science, pages 213--227, Catania, Italy, September 2016.
doi: 10.4204/EPTCS.226.15.
[ BibTex | DOI | Web page | PDF ]
[GL16]: J. Goubault-Larrecq and J. Lachance. On the Complexity of Monitoring Orchids Signatures. In Proceedings of the 16th Conference on Runtime Verification (RV'16), volume 10012 of Lecture Notes in Computer Science, pages 169--164, Madrid, Spain, September 2016. Springer.
doi: 10.1007/978-3-319-46982-9_11.
[ BibTex | DOI ]
[KŠHP16]: J. Kolcák, D. Šafránek, S. Haar, and L. Paulevé. Unfolding of Parametric Logical Regulatory Networks. In Proceedings of The Seventh International Workshop on Static Analysis and Systems Biology (SASB 2016), Electronic Notes in Theoretical Computer Science, Edinburgh, UK, September 2016. Elsevier Science Publishers. To appear.
[ BibTex | Web page | PDF ]
[BDM16]: L. Beklemishev, S. Demri, and A. Maté, editors. Proceedings of the 11th Conference on Advances in Modal Logic (AiML'16), Budapest, Hungary, September 2016. College Publications.
[ BibTex | Web page ]
[BMS16]: P. Bouyer, N. Markey, and D. Stan. Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games. In Proceedings of the 7th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'16), volume 226 of Electronic Proceedings in Theoretical Computer Science, pages 61--75, Catania, Italy, September 2016.
doi: 10.4204/EPTCS.226.5.
[ BibTex | DOI | Web page | PDF ]
[Fin16]: A. Finkel. The Ideal Theory for WSTS. In Proceedings of the 10th Workshop on Reachability Problems in Computational Models (RP'16), volume 9899 of Lecture Notes in Computer Science, pages 1--22, Aalborg, Denmark, September 2016. Springer.
doi: 10.1007/978-3-319-45994-3_1.
[ BibTex | DOI | Web page | PDF ]
[ABDL16]: N. Alechina, N. Bulling, S. Demri, and B. Logan. On the Complexity of Resource-Bounded Logics. In Proceedings of the 10th Workshop on Reachability Problems in Computational Models (RP'16), volume 9899 of Lecture Notes in Computer Science, pages 36--50, Aalborg, Denmark, September 2016. Springer.
doi: 10.1007/978-3-319-45994-3_3.
[ BibTex | DOI | Web page | PDF ]
[LFS16]: A. Le Coënt, L. Fribourg, and R. Soulat. Compositional analysis of Boolean networks using local fixed-point iterations. In Proceedings of the 10th Workshop on Reachability Problems in Computational Models (RP'16), volume 9899 of Lecture Notes in Computer Science, pages 134--147, Aalborg, Denmark, September 2016. Springer.
doi: 10.1007/978-3-319-45994-3_10.
[ BibTex | DOI | Web page | PDF ]
[LFM⁺16]: A. Le Coënt, L. Fribourg, N. Markey, F. De Vuyst, and L. Chamoin. Distributed Synthesis of State-Dependent Switching Control. In Proceedings of the 10th Workshop on Reachability Problems in Computational Models (RP'16), volume 9899 of Lecture Notes in Computer Science, pages 119--133, Aalborg, Denmark, September 2016. Springer.
doi: 10.1007/978-3-319-45994-3_9.
[ BibTex | DOI | Web page | PDF ]
[vDCC16b]: B. F. van Dongen, J. Carmona, and Th. Chatain. A Unified Approach for Measuring Precision and Generalization Based on Anti-Alignments. In Proceedings of the 14th International Conference on Business Process Management (BPM'16), volume 9850 of Lecture Notes in Computer Science, pages 39--56, Rio de Janeiro, Brazil, September 2016. Springer.
doi: 10.1007/978-3-319-45348-4_3.
[ BibTex | DOI | Web page | PDF ]
[KS16]: P. Karandikar and Ph. Schnoebelen. The height of piecewise-testable languages with applications in logical complexity. In Proceedings of the 25th Annual EACSL Conference on Computer Science Logic (CSL'16), volume 62 of Leibniz International Proceedings in Informatics, pages 37:1--37:22, Marseille, France, September 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2016.37.
[ BibTex | DOI | Web page | PDF ]
[GGL16]: M. Ganardi, S. Göller, and M. Lohrey. On the Parallel Complexity of Bisimulation over Finite Systems. In Proceedings of the 25th Annual EACSL Conference on Computer Science Logic (CSL'16), volume 62 of Leibniz International Proceedings in Informatics, pages 12:1--12:17, Marseille, France, September 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2016.12.
[ BibTex | DOI ]
[DGG16b]: J. Dubut, É. Goubault, and J. Goubault-Larrecq. The Directed Homotopy Hypothesis. In Proceedings of the 25th Annual EACSL Conference on Computer Science Logic (CSL'16), volume 62 of Leibniz International Proceedings in Informatics, pages 9:1--9:16, Marseille, France, September 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2016.9.
[ BibTex | DOI | Web page | PDF ]
[DBS16]: A. Doumane, D. Baelde, and A. Saurin. Infinitary proof theory: the multiplicative additive case. In Proceedings of the 25th Annual EACSL Conference on Computer Science Logic (CSL'16), volume 62 of Leibniz International Proceedings in Informatics, pages 42:1--42:17, Marseille, France, September 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2016.42.
[ BibTex | DOI ]
[BLS16]: D. Baelde, S. Lunel, and S. Schmitz. A Sequent Calculus for a Modal Logic on Finite Data Trees. In Proceedings of the 25th Annual EACSL Conference on Computer Science Logic (CSL'16), volume 62 of Leibniz International Proceedings in Informatics, pages 32:1--32:16, Marseille, France, September 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2016.32.
[ BibTex | DOI | Web page ]
[Leh16]: M. Lehaut. PDL on infinite alphabet. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, August 2016. 19 pages.
[ BibTex | Web page | PDF ]
[BGMS16a]: P. Beame, N. Grosshans, P. McKenzie, and L. Segoufin. Nondeterminism and an abstract formulation of Neciporuk's lower bound method. Research Report 1608.01932, Computing Research Repository, August 2016. 34 pages.
[ BibTex | Web page | PDF ]
[Lic16]: A. Lick. Systèmes de preuves pour logiques modales. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, August 2016. 20 pages.
[ BibTex | Web page | PDF ]
[BFM16]: M. Blondin, A. Finkel, and P. McKenzie. Well Behaved Transition Systems. Research Report 1608.02636, Computing Research Repository, August 2016. 18 pages.
[ BibTex | Web page | PDF ]
[FM16]: M. Fränzle and N. Markey, editors. Proceedings of the 14th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'16), volume 9884 of Lecture Notes in Computer Science, Québec City, Canada, August 2016. Springer.
doi: 10.1007/978-3-319-44878-7.
[ BibTex | DOI | Web page ]
[HT16b]: S. Haar and S. Theissing. Decoupling Passenger Flows for Improved Load Prediction. In Proceedings of the 13th International Conference on Quantitative Evaluation of Systems (QEST'16), volume 9826 of Lecture Notes in Computer Science, pages 364--379, Québec City, Canada, August 2016. Springer.
doi: 10.1007/978-3-319-43425-4_24.
[ BibTex | DOI | Web page | PDF ]
[Bou16]: P. Bouyer. Optimal Reachability in Weighted Timed Automata and Games. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS'16), volume 58 of Leibniz International Proceedings in Informatics, pages 3:1--3:3, Krakow, Poland, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2016.3.
[ BibTex | DOI | Web page | PDF ]
[ABK⁺16]: S. Akshay, P. Bouyer, S. N. Krishna, L. Manasa, and A. Trivedi. Stochastic Timed Games Revisited. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS'16), volume 58 of Leibniz International Proceedings in Informatics, pages 8:1--8:14, Krakow, Poland, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2016.8.
[ BibTex | DOI | Web page | PDF ]
[NPR16]: R. Niskanen, I. Potapov, and J. Reichert. Undecidability of Two-dimensional Robot Games. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS'16), volume 58 of Leibniz International Proceedings in Informatics, pages 73:1--73:13, Krakow, Poland, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2016.73.
[ BibTex | DOI | Web page | PDF ]
[DGG16a]: J. Dubut, É. Goubault, and J. Goubault-Larrecq. Bisimulations and unfolding in P-accessible categorical models. In Proceedings of the 27th International Conference on Concurrency Theory (CONCUR'16), volume 59 of Leibniz International Proceedings in Informatics, pages 25:1--25:14, Québec City, Canada, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2016.25.
[ BibTex | DOI | Web page | PDF ]
[AGK16]: S. Akshay, P. Gastin, and S. N. Krishna. Analyzing Timed Systems Using Tree Automata. In Proceedings of the 27th International Conference on Concurrency Theory (CONCUR'16), volume 59 of Leibniz International Proceedings in Informatics, pages 27:1--27:14, Québec City, Canada, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2016.27.
[ BibTex | DOI | Web page | PDF ]
[BHL16b]: N. Bertrand, S. Haddad, and E. Lefaucheux. Diagnosis in Infinite-State Probabilistic Systems. In Proceedings of the 27th International Conference on Concurrency Theory (CONCUR'16), volume 59 of Leibniz International Proceedings in Informatics, pages 37:1--37:15, Québec City, Canada, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2016.37.
[ BibTex | DOI | Web page | PDF ]
[DLM16]: A. David, F. Laroussinie, and N. Markey. On the expressiveness of QCTL. In Proceedings of the 27th International Conference on Concurrency Theory (CONCUR'16), volume 59 of Leibniz International Proceedings in Informatics, pages 28:1--28:15, Québec City, Canada, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2016.28.
[ BibTex | DOI | Web page | PDF ]
[DFP16]: S. Demri, D. Figueira, and M. Praveen. Reasoning about Data Repetitions with Counter Systems. Logical Methods in Computer Science, 12(3):1:1--1:55, August 2016.
doi: 10.2168/LMCS-12(3:1)2016.
[ BibTex | DOI | Web page | PDF ]
[Gou16a]: J. Goubault-Larrecq. A few things on Noetherian spaces. Invited talk (plenary speaker), Summer Topology Conference, Leicester, UK, August 2016.
[ BibTex ]
[Gou16b]: J. Goubault-Larrecq. An introduction to asymmetric topology and domain theory: why, what, and how. Invited talk, Galway Symposium, Leicester, UK, August 2016.
[ BibTex ]
[Thi16]: F. Thiré. Reverse engineering on arithmetic proofs. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, August 2016. 26 pages.
[ BibTex | Web page | PDF ]
[BDJ⁺16]: Th. Brihaye, B. Delahaye, L. Jezequel, N. Markey, and J. Srba, editors. Proceedings of the Cassting Workshop on Games for the Synthesis of Complex Systems (Cassting'16) and of the 3rd International Workshop on Synthesis of Complex Parameters (SynCoP'16), volume 220 of Electronic Proceedings in Theoretical Computer Science, Eindhoven, The Netherlands, July 2016.
doi: 10.4204/EPTCS.220.
[ BibTex | DOI | Web page ]
[HT16d]: S. Haar and S. Theissing. Predicting Traffic Load in Public Transportation Networks. In Proceedings of the 35th American Control Conference (ACC'16), pages 821--826, Boston, Massachusetts, USA, July 2016. IEEE Control System Society.
doi: 10.1109/ACC.2016.7525015.
[ BibTex | DOI | Web page | PDF ]
[BBBC16]: N. Bertrand, P. Bouyer, Th. Brihaye, and P. Carlier. Analysing Decisive Stochastic Processes. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz International Proceedings in Informatics, pages 101:1--101:14, Rome, Italy, July 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2016.101.
[ BibTex | DOI | Web page | PDF ]
[CH16]: D. Chistikov and C. Haase. The Taming of the Semi-Linear Set. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz International Proceedings in Informatics, pages 128:1--128:14, Rome, Italy, July 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2016.128.
[ BibTex | DOI | Web page | PDF ]
[Zet16]: G. Zetzsche. The complexity of downward closure comparisons. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz International Proceedings in Informatics, pages 123:1--123:14, Rome, Italy, July 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2016.123.
[ BibTex | DOI | Web page | PDF ]
[CD16b]: K. Chatterjee and L. Doyen. Computation Tree Logic for Synchronization Properties. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz International Proceedings in Informatics, pages 98:1--98:14, Rome, Italy, July 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2016.98.
[ BibTex | DOI | Web page | PDF ]
[GS16]: J. Goubault-Larrecq and S. Schmitz. Deciding Piecewise Testable Separability for Regular Tree Languages. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz International Proceedings in Informatics, pages 97:1--97:15, Rome, Italy, July 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2016.97.
[ BibTex | DOI | Web page ]
[GHLT16]: S. Göller, C. Haase, R. Lazić, and P. Totzke. A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz International Proceedings in Informatics, pages 105:1--105:13, Rome, Italy, July 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2016.105.
[ BibTex | DOI | Web page ]
[BCM16]: P. Bouyer, M. Colange, and N. Markey. Symbolic Optimal Reachability in Weighted Timed Automata. In Proceedings of the 28th International Conference on Computer Aided Verification (CAV'16) -- Part I, volume 9779 of Lecture Notes in Computer Science, pages 513--530, Toronto, Canada, July 2016. Springer.
doi: 10.1007/978-3-319-41528-4_28.
[ BibTex | DOI | Web page ]
[BMR⁺16]: P. Bouyer, N. Markey, M. Randour, A. Sangnier, and D. Stan. Reachability in Networks of Register Protocols under Stochastic Schedulers. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz International Proceedings in Informatics, pages 106:1--106:14, Rome, Italy, July 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2016.106.
[ BibTex | DOI | Web page ]
[LS16a]: R. Lazić and S. Schmitz. The Complexity of Coverability in ν-Petri Nets. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'16), pages 467--476, New York City, USA, July 2016. ACM Press.
doi: 10.1145/2933575.2933593.
[ BibTex | DOI | Web page ]
[DBHS16]: A. Doumane, D. Baelde, L. Hirschi, and A. Saurin. Towards Completeness via Proof Search in the Linear Time μ-calculus. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'16), pages 377--386, New York City, USA, July 2016. ACM Press.
doi: 10.1145/2933575.2933598.
[ BibTex | DOI | Web page | PDF ]
[CG16]: Th. Colcombet and S. Göller. Games with bound guess actions. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'16), pages 257--266, New York City, USA, July 2016. ACM Press.
doi: 10.1145/2933575.2934502.
[ BibTex | DOI | Web page | PDF ]
[CD16c]: K. Chatterjee and L. Doyen. Perfect-information Stochastic Games with Generalized Mean-Payoff Objectives. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'16), pages 247--256, New York City, USA, July 2016. ACM Press.
doi: 10.1145/2933575.2934513.
[ BibTex | DOI | Web page ]
[DMZ16]: E. D'Osualdo, R. Meyer, and G. Zetzsche. First-order logic with reachability for infinite-state systems. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'16), pages 457--466, New York City, USA, July 2016. ACM Press.
doi: 10.1145/2933575.2934552.
[ BibTex | DOI | Web page | PDF ]
[ACH⁺16]: M. F. Atig, D. Chistikov, P. Hofman, K. N. Kumar, P. Saivasan, and G. Zetzsche. Complexity of regular abstractions of one-counter languages. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'16), pages 207--216, New York City, USA, July 2016. ACM Press.
doi: 10.1145/2933575.2934561.
[ BibTex | DOI | Web page | PDF ]
[CFS16]: P. Chambart, A. Finkel, and S. Schmitz. Forward Analysis and Model Checking for Trace Bounded WSTS. Theoretical Computer Science, 637:1--29, July 2016.
doi: 10.1016/j.tcs.2016.04.020.
[ BibTex | DOI | Web page ]
[AMP16]: P. Arrighi, S. Martiel, and S. Perdrix. Reversible Causal Graph Dynamics. In 8th Conference on Reversible Computation (RC'16), volume 9720 of Lecture Notes in Computer Science, pages 73--88, Bologna, Italy, July 2016. Springer.
doi: 10.1007/978-3-319-40578-0_5.
[ BibTex | DOI | Web page ]
[PHL16]: H. Ponce de León, S. Haar, and D. Longuet. Model-based Testing for Concurrent Systems: Unfolding-based Test Selection. International Journal on Software Tools for Technology Transfer, 18(3):305--318, June 2016.
doi: 10.1007/s10009-014-0353-y.
[ BibTex | DOI | Web page | PDF ]
[Sch16c]: S. Schmitz. Implicational Relevance Logic is 2-ExpTime-Complete. Journal of Symbolic Logic, 81(2):641--661, June 2016.
doi: 10.1017/jsl.2015.7.
[ BibTex | DOI | Web page | PDF ]
[DLV16]: A. Deutsch, Y. Li, and V. Vianu. Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS'16). In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS'16), pages 179--194, San Francisco, California, USA, June 2016. ACM Press.
doi: 10.1145/2902251.2902275.
[ BibTex | DOI ]
[Blo16]: M. Blondin. Algorithmique et complexité des systèmes à compteurs. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France and Université de Montréal, June 2016.
[ BibTex | Web page ]
[PS16]: T. Place and L. Segoufin. Decidable Characterization of FO2(<, +1) and locality of DA. Research Report 1606.03217, Computing Research Repository, June 2016. 8 pages.
[ BibTex | Web page | PDF ]
[DG16a]: S. Delaune and I. Gazeau. Combination issues. Deliverable VIP 4.2 (ANR-11-JS02-0006), June 2016. 5 pages.
[ BibTex | Web page | PDF ]
[DG16b]: S. Delaune and I. Gazeau. Results on the case studies. Deliverable VIP 2.2 (ANR-11-JS02-0006), June 2016. 8 pages.
[ BibTex | Web page | PDF ]
[BBCM16]: P. Bouyer, Th. Brihaye, P. Carlier, and Q. Menet. Compositional Design of Stochastic Timed Automata. In Proceedings of the 11th International Computer Science Symposium in Russia (CSR'16), volume 9691 of Lecture Notes in Computer Science, pages 117--130, St Petersburg, Russia, June 2016. Springer.
doi: 10.1007/978-3-319-34171-2_9.
[ BibTex | DOI | Web page | PDF ]
[CC16]: J. Carmona and Th. Chatain. Anti-Alignments in Conformance Checking -- The Dark Side of Process Models. In Proceedings of the 37th International Conference on Applications and Theory of Petri Nets (PETRI NETS'16), volume 9698 of Lecture Notes in Computer Science, pages 240--258, Torún, Poland, June 2016. Springer.
doi: 10.1007/978-3-319-39086-4_15.
[ BibTex | DOI | Web page | PDF ]
[KGH⁺16a]: F. Kordon, H. Garavel, L. M. Hillah, F. Hulin-Hubard, G. Chiardo, A. Hamez, L. Jezequel, A. Miner, J. Meijer, E. Paviot-Adet, D. Racordon, C. Rodriguez, C. Rohr, J. Srba, Y. Thierry-Mieg, G. Trinh, and K. Wolf. Complete Results for the 2016 Edition of the Model Checking Contest, June 2016.
[ BibTex | Web page ]
[Cau16a]: R. Cauderlier. A Rewrite System for Proof Constructivization. In Proceedings of the 11th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'16), pages 2:1--2:7, Porto, Portugal, June 2016. ACM Press.
doi: 10.1007/978-3-319-40578-0_5.
[ BibTex | DOI | Web page | PDF ]
[LBB⁺16]: A. Linard, B. Barbot, D. Buchs, M. Colange, C. Démoulins, L. Hillah, and A. Martin. Layered Data: A Modular Formal Definition without Formalisms. In Proceedings of the 10th International Workshop on Petri Nets and Software Engineering (PNSE'16), volume 1591 of CEUR Workshop Proceedings, pages 287--306, Torun, Poland, June 2016. CEUR-WS.org.
[ BibTex | Web page | PDF ]
[BCEZ16]: T. Brough, L. Ciobanu, M. Elder, and G. Zetzsche. Permutations of context-free, ET0L and indexed languages. Discrete Mathematics & Theoretical Computer Science, 17(3):167--178, May 2016.
[ BibTex | Web page | PDF ]
[HT16a]: S. Haar and S. Theissing. A Passenger-centric Multi-agent System Model for Multimodal Public Transportation. Research Report hal-01322956, HAL-inria, May 2016. 12 pages.
[ BibTex | Web page | PDF ]
[FHLM16]: É. Fabre, L. Hélouët, E. Lefaucheux, and H. Marchand. Diagnosability of Repairable Faults. In Proceedings of the 13th Workshop on Discrete Event Systems (WODES'16), pages 230--236, Xi'an, China, May-June 2016. IEEE Control System Society.
doi: 10.1109/WODES.2016.7497853.
[ BibTex | DOI | Web page | PDF ]
[GR16]: G. Grefenstette and K. Rafes. Transforming Wikipedia into an Ontology-based Information Retrieval Search Engine for Local Experts using a Third-Party Taxonomy. In Proceedings of the Joint 2nd Workshop on Language and Ontology & Terminology and Knowledge Structures (LangOnto+TermiKS'16), Portorož, Slovenia, May 2016. To appear.
[ BibTex | Web page | PDF ]
[HBD16]: L. Hirschi, D. Baelde, and S. Delaune. A method for verifying privacy-type properties: the unbounded case. In Proceedings of the 37th IEEE Symposium on Security and Privacy (S&P'16), pages 564--581, San Jose, California, USA, May 2016. IEEECSP.
doi: 10.1109/SP.2016.40.
[ BibTex | DOI | Web page | PDF ]
[GLSHHM16]: J. Goubault-Larrecq, P.-A. Sentucq, F. Hulin-Hubard, and F. Majorczyk. Etat final des travaux engagés sur Orchids. Rapport final et fourniture 4 du contrat DGA-INRIA Orchids, May 2016.
[ BibTex ]
[GLM16]: J. Goubault-Larrecq and F. Majorczyk. Génération de signatures pour le suivi de flux d'informations. Fourniture 3 du contrat DGA-INRIA Orchids, May 2016.
[ BibTex ]
[HHK⁺16b]: M. Hutagalung, N. Hundeshagen, D. Kuske, M. Lange, and É. Lozes. Two-Buffer Simulation Games. In Proceedings of the Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters (Cassting/SYNCOP'16), volume 220 of Electronic Proceedings in Theoretical Computer Science, pages 213--227, Eindhoven, The Netherlands, April 2016.
doi: 10.4204/EPTCS.220.3.
[ BibTex | DOI | Web page | PDF ]
[HT16c]: S. Haar and S. Theissing. Forecasting Passenger Loads in Transportation Networks. In Proceedings of the 8th International Workshop on Practical Applications of Stochastic Modelling (PASM'16), volume 327 of Electronic Notes in Theoretical Computer Science, pages 49--69, Münster, Germany, April 2016. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2016.09.023.
[ BibTex | DOI | Web page | PDF ]
[LACF16]: A. Le Coënt, J. Alexandre dit Sandretto, A. Chapoutot, and L. Fribourg. Control of Nonlinear Switched Systems Based on Validated Simulation. In Proceedings of the 2nd International Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR'16), pages 1--6, Vienna, Austria, April 2016. IEEE Computer Society Press.
[ BibTex | Web page | PDF ]
[FGMP16]: L. Fribourg, É. Goubault, S. Mohamed, and S. Putot. A Topological Method for Finding Invariant Sets of Switched Systems. In Proceedings of the 19th ACM International Conference on Hybrid Systems: Computation and Control (HSCC'16), pages 61--70, Vienna, Austria, April 2016. ACM Press.
doi: 10.1145/2883817.2883822.
[ BibTex | DOI | Web page | PDF ]
[CCH⁺16]: D. Chistikov, W. Czerwiński, P. Hofman, M. Pilipczuk, and M. Wehar. Shortest paths in one-counter systems. In Proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'16), volume 9634 of Lecture Notes in Computer Science, pages 462--478, Eindhoven, The Netherlands, April 2016. Springer.
doi: 10.1007/978-3-662-49630-5_27.
[ BibTex | DOI | Web page | PDF ]
[HLL⁺16]: P. Hofman, S. Lasota, R. Lazić, J. Leroux, S. Schmitz, and P. Totzke. Coverability Trees for Petri Nets with Unordered Data. In Proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'16), volume 9634 of Lecture Notes in Computer Science, pages 445--461, Eindhoven, The Netherlands, April 2016. Springer.
doi: 10.1007/978-3-662-49630-5_26.
[ BibTex | DOI | Web page ]
[FG16]: M. Fortin and P. Gastin. Verification of parameterized communicating automata via split-width. In Proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'16), volume 9634 of Lecture Notes in Computer Science, pages 197--213, Eindhoven, The Netherlands, April 2016. Springer.
doi: 10.1007/978-3-662-49630-5_12.
[ BibTex | DOI | Web page | PDF ]
[CDD16]: V. Cortier, A. Dallon, and S. Delaune. Bounding the number of agents, for equivalence too. In Proceedings of the 5th International Conference on Principles of Security and Trust (POST'16), volume 9635 of Lecture Notes in Computer Science, pages 211--232, Eindhoven, The Netherlands, April 2016. Springer.
doi: 10.1007/978-3-662-49635-0_11.
[ BibTex | DOI | Web page | PDF ]
[BFHH16a]: M. Blondin, A. Finkel, C. Haase, and S. Haddad. Approaching the Coverability Problem Continuously. In Proceedings of the 22th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'16), volume 9636 of Lecture Notes in Computer Science, pages 480--496, Eindhoven, The Netherlands, April 2016. Springer.
doi: 10.1007/978-3-662-49674-9_28.
[ BibTex | DOI | Web page | PDF ]
[BHJL16]: B. Bérard, S. Haddad, A. Jovanović, and D. Lime. Interrupt Timed Automata with Auxiliary Clocks and Parameters. Fundamenta Informaticae, 143(3-4):235--259, March 2016.
doi: 10.3233/FI-2016-1313.
[ BibTex | DOI | Web page | PDF ]
[BHL16a]: N. Bertrand, S. Haddad, and E. Lefaucheux. Accurate Approximate Diagnosability of Stochastic Systems. In Proceedings of the 10th International Conference on Language and Automata Theory and Applications (LATA'16), volume 9618 of Lecture Notes in Computer Science, pages 549--561, Prague, Czech Republic, March 2016. Springer.
doi: 10.1007/978-3-319-30000-9_42.
[ BibTex | DOI | Web page | PDF ]
[DD16a]: S. Demri and M. Deters. Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction. ACM Transactions on Computational Logic, 17(2):12:1--12:44, March 2016.
doi: 10.1145/2835490.
[ BibTex | DOI | Web page | PDF ]
[AD16a]: P. Arrighi and G. Dowek. Free fall and cellular automata. In Proceedings of the 11th International Workshop on Developments in Computational Models (DCM'15), volume 204 of Electronic Proceedings in Theoretical Computer Science, pages 1--10, Cali, Colombia, March 2016.
doi: 10.4204/EPTCS.204.1.
[ BibTex | DOI | Web page ]
[BGM16]: P. Bouyer, P. Gardy, and N. Markey. On the semantics of Strategy Logic. Information Processing Letters, 116(2):75--79, February 2016.
doi: 10.1016/j.ipl.2015.10.004.
[ BibTex | DOI | Web page | PDF ]
[HK16]: C. Haase and S. Kiefer. The Complexity of the Kth Largest Subset Problem and Related Problems. Information Processing Letters, 116(2):111--115, February 2016.
doi: 10.1016/j.ipl.2015.09.015.
[ BibTex | DOI | Web page | PDF ]
[LS16b]: J. Leroux and S. Schmitz. Ideal Decompositions for Vector Addition Systems. In Proceedings of the 33rd Annual Symposium on Theoretical Aspects of Computer Science (STACS'16), volume 47 of Leibniz International Proceedings in Informatics, pages 1:1--1:13, Orléans, France, February 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2016.1.
[ BibTex | DOI | Web page ]
[Sch16b]: S. Schmitz. Complexity Hierarchies Beyond Elementary. ACM Transactions on Computation Theory, 8(1:3), February 2016.
doi: 10.1145/2858784.
[ BibTex | DOI | Web page ]
[HH16]: C. Haase and P. Hofman. Tightening the Complexity of Equivalence Problems for Commutative Grammars. In Proceedings of the 33rd Annual Symposium on Theoretical Aspects of Computer Science (STACS'16), volume 47 of Leibniz International Proceedings in Informatics, pages 41:1--14, Orléans, France, February 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2016.41.
[ BibTex | DOI | Web page | PDF ]
[KNS16]: P. Karandikar, M. Niewerth, and Ph. Schnoebelen. On the state complexity of closures and interiors of regular languages with subwords and superwords. Theoretical Computer Science, 610(A):91--107, January 2016.
doi: 10.1016/j.tcs.2015.09.028.
[ BibTex | DOI | Web page | PDF ]
[DD16b]: S. Demri and M. Deters. Temporal Logics on Strings with Prefix Relation. Journal of Logic and Computation, 26(3):989--1017, 2016.
doi: 10.1093/logcom/exv028.
[ BibTex | DOI | Web page | PDF ]
[BFHH16b]: M. Blondin, A. Finkel, C. Haase, and S. Haddad. QCover: an efficient coverability verifier for discrete and continuous Petri nets, 2016.
[ BibTex | Web page ]
[DH16]: S. Delaune and L. Hirschi. A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols. Journal of Logic and Algebraic Methods in Programming, 87:127--144, 2016. To appear.
doi: 10.1016/j.jlamp.2016.10.005.
[ BibTex | DOI | Web page | PDF ]
[JSD16]: F. Jacquemard, L. Segoufin, and J. Dimino. FO2(<, +1,) on data trees, data tree automata and branching vector addition systems. Logical Methods in Computer Science, 12(2):1--28, 2016.
doi: 10.2168/LMCS-12(2:3)2016.
[ BibTex | DOI | Web page | PDF ]
[GSSW16]: J. Goubault-Larrecq, M. Seisenberger, V. Selivanov, and A. Weiermann. Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). Dagstuhl Reports, 6(1):69--98, January 2016.
doi: 10.4230/DagRep.6.1.69.
[ BibTex | DOI | Web page | PDF ]
[KGH⁺16b]: F. Kordon, H. Garavel, L. Hillah, E. Paviot-Adet, L. Jezequel, C. Rodríguez, and F. Hulin-Hubard. MCC'2015 - The Fifth Model Checking Contest. Transactions on Petri Nets and Other Models of Concurrency, 11:262--273, 2016.
doi: 10.1007/978-3-662-53401-4_12.
[ BibTex | DOI | Web page | PDF ]
[ADF⁺16]: P. A. Abdulla, S. Demri, A. Finkel, J. Leroux, and I. Potapov. Selected papers of Reachability Problems Workshop 2012 (Bordeaux) and 2013 (Uppsala). Fundamenta Informaticae, 143(3--4), 2016.
[ BibTex | Web page ]
[LDR⁺16]: A. Le Coënt, F. De Vuyst, C. Rey, L. Chamoin, and L. Fribourg. Control of mechanical systems using set-based methods. International Journal of Dynamics and Control, pages 1--17, 2016.
doi: 10.1007/s40435-016-0245-y.
[ BibTex | DOI | Web page | PDF ]
[DD16c]: A. Díaz-Caro and G. Dowek. Quantum superpositions and projective measurement in the lambda calculus. Research Report 1601.04294, Computing Research Repository, January 2016. 22 pages.
[ BibTex | Web page | PDF ]
[Chr16]: R. Chrétien. Analyse automatique de propriétés d'équivalence pour les protocoles cryptographiques. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2016.
[ BibTex | Web page | PDF ]
[Sch16a]: S. Schmitz. Automata column: The complexity of reachability in vector addition systems. SIGLOG News, 3(1):3--21, January 2016.
doi: 10.1145/2893582.2893585.
[ BibTex | DOI | Web page ]
[HOW16]: C. Haase, J. Ouaknine, and J. Worrell. Relating Reachability Problems in Timed and Counter Automata. Fundamenta Informaticae, 143(3-4):317--338, January 2016.
doi: 10.3233/FI-2016-1316.
[ BibTex | DOI | Web page | PDF ]
[Gou16c]: J. Goubault-Larrecq. Les méthodes formelles: l'autre arme de la cybersécurité. Encart dans l'article ”S'adapter à la cyberguerre”, de Karen Elazari, Pour La Science 459, January 2016.
[ BibTex ]
[ADJL16a]: A. Assaf, G. Dowek, J.-P. Jouannaud, and J. Liu. Encoding Proofs in Dedukti: the case of Coq proofs. In Preliminary Proceedings of the 1st International Workshop on Hammers for Type Theories (HaTT'16), Coimbra, Portugal, 2016.
[ BibTex | Web page | PDF ]
[ADJL16b]: A. Assaf, G. Dowek, J.-P. Jouannaud, and J. Liu. Untyped Confluence in Dependent Type Theories. In Proceedings of the 8th International Workshop on Higher-Order Rewriting (HOR'16), Porto, Portugal, 2016.
[ BibTex | Web page | PDF ]
[ABC⁺16]: A. Assaf, G. Burel, R. Cauderlier, D. Delahaye, G. Dowek, C. Dubois, F. Gilbert, P. Halmagrand, O. Hermant, and R. Saillard. Expressing theories in the λΠ-calculus modulo theory and in the Dedukti system. In Proceedings of the 22nd International Conference on Types for Proofs and Programs (TYPES'16), volume 97 of Leibniz International Proceedings in Informatics, Novi Sad, Serbia, 2016. Leibniz-Zentrum für Informatik. To appear.
[ BibTex ]
[Dow16]: G. Dowek. Rules and derivations in an elementary logic course. preprint, January 2016.
[ BibTex | Web page | PDF ]
[CDGH15]: K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger. Randomness for free. Information and Computation, 245:3--16, December 2015.
doi: 10.1016/j.ic.2015.06.003.
[ BibTex | DOI | Web page | PDF ]
[LM15]: F. Laroussinie and N. Markey. Augmenting ATL with strategy contexts. Information and Computation, 245:98--123, December 2015.
doi: 10.1016/j.ic.2014.12.020.
[ BibTex | DOI | Web page | PDF ]
[GHKS15]: V. Germanos, S. Haar, V. Khomenko, and S. Schwoon. Diagnosability under Weak Fairness. ACM Transactions in Embedded Computing Systems, 14(4:69), December 2015.
doi: 10.1145/2832910.
[ BibTex | DOI | Web page | PDF ]
[BGH⁺15]: Th. Brihaye, G. Geeraerts, A. Haddad, E. Lefaucheux, and B. Monmege. Simple Priced Timed Games Are Not That Simple. In Proceedings of the 35th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), volume 45 of Leibniz International Proceedings in Informatics, pages 278--292, Bangalore, India, December 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2015.278.
[ BibTex | DOI | Web page | PDF ]
[BHH⁺15]: S. Böhm, S. Haar, S. Haddad, P. Hofman, and S. Schwoon. Active Diagnosis with Observable Quiescence. In Proceedings of the 54th IEEE Conference on Decision and Control (CDC'15), pages 1663--1668, Osaka, Japan, December 2015. IEEE Control System Society.
doi: 10.1109/CDC.2015.7402449.
[ BibTex | DOI | Web page | PDF ]
[BV15b]: D. Berwanger and M. Van den Bogaard. Games with Delays. A Frankenstein Approach. In Proceedings of the 35th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), volume 45 of Leibniz International Proceedings in Informatics, pages 307--319, Bangalore, India, December 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2015.307.
[ BibTex | DOI | Web page | PDF ]
[KS15a]: P. Karandikar and Ph. Schnoebelen. Decidability in the logic of subsequences and supersequences. In Proceedings of the 35th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), volume 45 of Leibniz International Proceedings in Informatics, pages 84--97, Bangalore, India, December 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2015.84.
[ BibTex | DOI | Web page | PDF ]
[BGM15]: P. Bouyer, P. Gardy, and N. Markey. Weighted strategy logic with boolean goals over one-counter games. In Proceedings of the 35th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), volume 45 of Leibniz International Proceedings in Informatics, pages 69--83, Bangalore, India, December 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2015.69.
[ BibTex | DOI | Web page | PDF ]
[Fra15b]: N. Francis. View-based Query Determinacy and Rewritings over Graph Databases. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2015.
[ BibTex | Web page ]
[FSS15]: N. Francis, L. Segoufin, and C. Sirangelo. Datalog Rewritings of Regular Path Queries using Views. Logical Methods in Computer Science, 11(4:14), December 2015.
doi: 10.2168/LMCS-11(4:14)2015.
[ BibTex | DOI | Web page | PDF ]
[Gon15]: M. González. Constructions d'Information Parfaite pour certains Jeux à Information Imparfaite. Quelques Algorithmes. Rapport de Master, Université Pierre et Marie Curie, Paris, France, December 2015.
[ BibTex ]
[ABV15]: S. Abiteboul, P. Bourhis, and V. Vianu. Highly Expressive Query Languages for Unordered Data Trees. Theory of Computing Systems, 57(4):927--966, November 2015.
doi: 10.1007/s00224-015-9617-5.
[ BibTex | DOI | Web page | PDF ]
[AAD⁺15]: S. Abiteboul, Y. Amsterdamer, D. Deutch, T. Milo, and P. Senellart. Optimal Probabilistic Generation of XML Documents. Theory of Computing Systems, 57(4):806--842, November 2015.
doi: 10.1007/s00224-014-9581-5.
[ BibTex | DOI | Web page | PDF ]
[MAS15]: D. Montoya, S. Abiteboul, and P. Senellart. Hup-Me: Inferring and Reconciling a Timeline of User Activity with Smartphone and Personal Data. In Proceedings of the 23rd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS'15), pages 62:1--4, Seattle, Washington, USA, November 2015.
doi: 10.1145/2820783.2820852.
[ BibTex | DOI | Web page | PDF ]
[CHH15]: D. Chistikov, C. Haase, and S. Halfon. Context-Free Commutative Grammars with Integer Counters and Resets. Research Report 1511-04893, Computing Research Repository, November 2015. 31 pages.
[ BibTex | Web page | PDF ]
[HT15]: S. Haar and S. Theissing. A Hybrid-Dynamical Model for Passenger-flow in Transportation Systems. In Proceedings of the 5th IFAC Conference on Analysis and Design of Hybrid Systems (ADHS'15), volume 48 of IFAC-PapersOnLine, pages 236--241, Atlanta, Georgia, USA, October 2015. Elsevier Science Publishers.
doi: 10.1016/j.ifacol.2015.11.181.
[ BibTex | DOI | Web page | PDF ]
[BMV15]: D. Berwanger, A. B. Mathew, and M. Van den Bogaard. Hierarchical Information Patterns and Distributed Strategy Synthesis. In Proceedings of the 13th International Symposium on Automated Technology for Verification and Analysis (ATVA'15), volume 9364 of Lecture Notes in Computer Science, pages 378--393, Shanghai, China, October 2015. Springer.
doi: 10.1007/978-3-319-24953-7_28.
[ BibTex | DOI | Web page | PDF ]
[PRC⁺15]: H. Ponce de León, C. Rodríguez, J. Carmona, K. Heljanko, and S. Haar. Unfolding-Based Process Discovery. In Proceedings of the 13th International Symposium on Automated Technology for Verification and Analysis (ATVA'15), volume 9364 of Lecture Notes in Computer Science, Shanghai, China, October 2015. Springer.
doi: 10.1007/978-3-319-24953-7_4.
[ BibTex | DOI | Web page | PDF ]
[Loz15]: É. Lozes. A Type-Directed Negation Elimination. In Proceedings of the 10th Workshop on Fixed Points in Computer Science (FICS'15), volume 191 of Electronic Proceedings in Theoretical Computer Science, pages 132--142, Berlin, Germany, September 2015.
doi: 10.4204/EPTCS.191.12.
[ BibTex | DOI | Web page | PDF ]
[Dal15]: A. Dallon. Verification of Cryptographic Protocols : a bound on the number of agents. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2015. 38 pages.
[ BibTex | Web page | PDF ]
[MDB15]: N. Markey, L. Doyen, and D. Berwanger. Models for large-scale systems. Cassting deliverable D1.3 (FP7-ICT-601148), September 2015. 17 pages.
[ BibTex | Web page | PDF ]
[MLB⁺15b]: A. Methni, M. Lemerre, B. Ben Hedia, S. Haddad, and K. Barkaoui. State Space Reduction Strategie for Model Checking Concurrent C Programs. In Proceedings of the 9th Workshop on Verification and Evaluation of Computer and Communication Systems(VECoS'15), volume 1431 of CEUR Workshop Proceedings, pages 65--76, Bucharest, Romania, September 2015. RWTH Aachen, Germany.
[ BibTex | Web page | PDF ]
[CCD15c]: R. Chrétien, V. Cortier, and S. Delaune. From security protocols to pushdown automata. ACM Transactions on Computational Logic, 17(1:3), September 2015.
doi: 10.1145/2811262.
[ BibTex | DOI | Web page | PDF ]
[CCD15a]: R. Chrétien, V. Cortier, and S. Delaune. Checking trace equivalence: How to get rid of nonces? In Proceedings of the 20th European Symposium on Research in Computer Security (ESORICS'15), Lecture Notes in Computer Science, pages 230--251, Vienna, Austria, September 2015. Springer.
doi: 10.1007/978-3-319-24177-7_12.
[ BibTex | DOI | Web page | PDF ]
[FGM⁺15]: L. Fribourg, É. Goubault, S. Mohamed, M. Mrozek, and S. Putot. A Topological Method for Finding Invariants of Continuous Systems. In Proceedings of the 9th Workshop on Reachability Problems in Computational Models (RP'15), volume 9328 of Lecture Notes in Computer Science, pages 63--75, Warsaw, Poland, September 2015. Springer.
doi: 10.1007/978-3-319-24537-9_7.
[ BibTex | DOI | Web page | PDF ]
[LS15a]: R. Lazić and S. Schmitz. The Ideal View on Rackoff's Coverability Technique. In Proceedings of the 9th Workshop on Reachability Problems in Computational Models (RP'15), volume 9328 of Lecture Notes in Computer Science, pages 76--88, Warsaw, Poland, September 2015. Springer.
doi: 10.1007/978-3-319-24537-9_8.
[ BibTex | DOI | Web page | PDF ]
[BHP⁺15]: B. Bérard, S. Haddad, C. Picaronny, M. Safey El Din, and M. Sassolas. Polynomial Interrupt Timed Automata. In Proceedings of the 9th Workshop on Reachability Problems in Computational Models (RP'15), volume 9328 of Lecture Notes in Computer Science, pages 20--32, Warsaw, Poland, September 2015. Springer.
doi: 10.1007/978-3-319-24537-9_3.
[ BibTex | DOI | Web page | PDF ]
[BFM15]: P. Bouyer, E. Fang, and N. Markey. Permissive strategies in timed automata and games. In Proceedings of the 15th International Workshop on Automated Verification of Critical Systems (AVoCS'15), volume 72 of Electronic Communications of the EASST, Edinburgh, UK, September 2015. European Association of Software Science and Technology.
doi: 10.14279/tuj.eceasst.72.1015.
[ BibTex | DOI | Web page | PDF ]
[Bol15c]: B. Bollig. Towards Formal Verification of Distributed Algorithms. In Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning (TIME'15), page 3, Kassel, Germany, September 2015. IEEE Computer Society Press.
doi: 10.1109/TIME.2015.23.
[ BibTex | DOI | Web page | PDF ]
[RG15]: K. Rafes and C. Germain. A platform for scientific data sharing. In Actes de la 31ème Conférence sur la Gestion de Données -- Principes, Technologies et Applications (BDA'15), Île de Porquerolles, France, September 2015.
[ BibTex | Web page | PDF ]
[BMR⁺15]: P. Bouyer, N. Markey, M. Randour, K. G. Larsen, and S. Laursen. Average-energy games. In Proceedings of the 6th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'15), volume 193 of Electronic Proceedings in Theoretical Computer Science, pages 1--15, Genova, Italy, September 2015.
doi: 10.4204/EPTCS.193.1.
[ BibTex | DOI | Web page | PDF ]
[LMS15]: F. Laroussinie, N. Markey, and A. Sangnier. ATL_sc with partial observation. In Proceedings of the 6th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'15), volume 193 of Electronic Proceedings in Theoretical Computer Science, pages 43--57, Genova, Italy, September 2015.
doi: 10.4204/EPTCS.193.4.
[ BibTex | DOI | Web page | PDF ]
[BDS15]: D. Baelde, A. Doumane, and A. Saurin. Least and Greatest Fixed Points in Ludics. In Proceedings of the 24th Annual EACSL Conference on Computer Science Logic (CSL'15), volume 41 of Leibniz International Proceedings in Informatics, pages 549--566, Berlin, Germany, September 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2015.549.
[ BibTex | DOI | Web page | PDF ]
[BMPS15]: P. Bouyer, N. Markey, N. Perrin, and P. Schlehuber. Timed automata abstraction of switched dynamical systems using control funnels. In Proceedings of the 13th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'15), volume 9268 of Lecture Notes in Computer Science, pages 60--75, Madrid, Spain, September 2015. Springer.
doi: 10.1007/978-3-319-22975-1_5.
[ BibTex | DOI | Web page | PDF ]
[AM15]: É. André and N. Markey. Language Preservation Problems in Parametric Timed Automata. In Proceedings of the 13th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'15), volume 9268 of Lecture Notes in Computer Science, pages 27--43, Madrid, Spain, September 2015. Springer.
doi: 10.1007/978-3-319-22975-1_3.
[ BibTex | DOI | Web page | PDF ]
[ABG15]: C. Aiswarya, B. Bollig, and P. Gastin. An Automata-Theoretic Approach to the Verification of Distributed Algorithms. In Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), volume 42 of Leibniz International Proceedings in Informatics, pages 340--353, Madrid, Spain, September 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2015.340.
[ BibTex | DOI | Web page | PDF ]
[BDH15]: D. Baelde, S. Delaune, and L. Hirschi. Partial Order Reduction for Security Protocols. In Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), volume 42 of Leibniz International Proceedings in Informatics, pages 497--510, Madrid, Spain, September 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2015.497.
[ BibTex | DOI | Web page | PDF ]
[BJM15]: P. Bouyer, S. Jaziri, and N. Markey. On the Value Problem in Weighted Timed Games. In Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), volume 42 of Leibniz International Proceedings in Informatics, pages 311--324, Madrid, Spain, September 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2015.311.
[ BibTex | DOI | Web page | PDF ]
[BDK15]: D. Baelde, S. Delaune, and S. Kremer. Decision procedures for equivalence based properties (part II). Deliverable VIP 3.2 (ANR-11-JS02-0006), September 2015. 9 pages.
[ BibTex | Web page | PDF ]
[DK15]: S. Delaune and S. Kremer. Composition results for equivalence-based security properties. Deliverable VIP 3.1 (ANR-11-JS02-0006), September 2015. 6 pages.
[ BibTex | Web page | PDF ]
[PS15]: Th. Place and L. Segoufin. Deciding definability in FO^2(<_h,<_v) on trees. Logical Methods in Computer Science, 11(3:5), September 2015.
doi: 10.2168/LMCS-11(3:5)2015.
[ BibTex | DOI | Web page | PDF ]
[DS15]: A. Dawar and L. Segoufin. Capturing MSO with one quantifier. In Fields of Logic and Computation II -- Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday, volume 9300 of Lecture Notes in Computer Science, pages 142--152. Springer, September 2015.
doi: 10.1007/978-3-319-23534-9_8.
[ BibTex | DOI | Web page | PDF ]
[Abi15]: S. Abiteboul. The Story of Webdamlog. In Proceedings of the 19th East-European Conference on Advances in Databases and Information Systems (ADBIS'15), Poitiers, France, September 2015.
[ BibTex | Web page | PDF ]
[For15]: M. Fortin. Verification of distributed systems with parameterized network topology. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2015.
[ BibTex ]
[LL15]: M. Lange and É. Lozes. Conjunctive Visibly-Pushdown Path Queries. In Proceedings of the 20th International Symposium on Fundamentals of Computation Theory (FCT'15), volume 9210 of Lecture Notes in Computer Science, pages 327--338, Gdańsk, Poland, August 2015. Springer.
doi: 10.1007/978-3-319-22177-9_25.
[ BibTex | DOI | Web page | PDF ]
[AGMK15]: S. Akshay, P. Gastin, M. Mukund, and K. N. Kumar. Checking conformance for time-constrained scenario-based specifications. Theoretical Computer Science, 594:24--43, August 2015.
doi: 10.1016/j.tcs.2015.03.030.
[ BibTex | DOI | Web page | PDF ]
[Bou15]: P. Bouyer. On the optimal reachability problem in weighted timed automata and games. In Proceedings of the 7th Workshop on Non-Classical Models of Automata and Applications (NCMA'15), volume 318 of books@ocg.at, pages 11--36, Porto, Portugal, August 2015. Austrian Computer Society.
[ BibTex | Web page | PDF ]
[Bol15a]: B. Bollig. Automata and Logics for Concurrent Systems: Five Models in Five Pages. In Proceedings of the 20th International Conference on Implementation and Application of Automata (CIAA'15), volume 9223 of Lecture Notes in Computer Science, pages 3--12, Umeå, Sweden, August 2015. Springer-Verlag.
doi: 10.1007/978-3-319-22360-5_1.
[ BibTex | DOI | Web page | PDF ]
[BBD⁺15]: P. Ballarini, B. Barbot, M. Duflot, S. Haddad, and N. Pekergin. HASL: A New Approach for Performance Evaluation and Model Checking from Concepts to Experimentation. Performance Evaluation, 90:53--77, August 2015.
doi: 10.1016/j.peva.2015.04.003.
[ BibTex | DOI | Web page | PDF ]
[Gou15b]: J. Goubault-Larrecq. Formal balls. Invited talk, Domains XII workshop, Cork, Ireland, August 2015.
[ BibTex ]
[Rei15]: J. Reichert. Décidabilité et complexité de jeux d'accessibilité sur des systèmes à compteurs. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2015.
[ BibTex | Web page | PDF ]
[BV15a]: D. Berwanger and M. Van den Bogaard. Consensus Game Acceptors. In Proceedings of the 19th International Conference on Developments in Language Theory (DLT'15), volume 9168 of Lecture Notes in Computer Science, pages 108--119, Liverpool, UK, July 2015. Springer.
doi: 10.1007/978-3-319-21500-6_8.
[ BibTex | DOI | Web page | PDF ]
[HPRV15]: S. Haar, S. Perchy, C. Rueda, and F. Valencia. An Algebraic View of SpaceashBelief and ExtrusionashUtterance for ConcurrencyashEpistemic Logic. In Proceedings of the 17th International Conference on Principles and Practice of Declarative Programming (PPDP'15), pages 161--172, Siena, Italy, July 2015. ACM Press.
doi: 10.1007/978-3-319-19488-2_6.
[ BibTex | DOI | Web page | PDF ]
[CDV15]: K. Chatterjee, L. Doyen, and M. Vardi. The Complexity of Synthesis from Probabilistic Components. In Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP'15) -- Part II, volume 9135 of Lecture Notes in Computer Science, pages 108--120, Kyoto, Japan, July 2015. Springer.
doi: 10.1007/978-3-662-47666-6_9.
[ BibTex | DOI | Web page | PDF ]
[JLS15]: M. Jurdziński, R. Lazić, and S. Schmitz. Fixed-Dimensional Energy Games are in Pseudo Polynomial Time. In Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP'15) -- Part II, volume 9135 of Lecture Notes in Computer Science, pages 260--272, Kyoto, Japan, July 2015. Springer.
doi: 10.1007/978-3-662-47666-6_21.
[ BibTex | DOI | Web page | PDF ]
[CCD15b]: R. Chrétien, V. Cortier, and S. Delaune. Decidability of trace equivalence for protocols with nonces. In Proceedings of the 28th IEEE Computer Security Foundations Symposium (CSF'15), pages 170--184, Verona, Italy, July 2015. IEEE Computer Society Press.
doi: 10.1109/CSF.2015.19.
[ BibTex | DOI | Web page | PDF ]
[RRS15a]: M. Randour, J.-F. Raskin, and O. Sankur. Percentile Queries in Multi-Dimensional Markov Decision Processes. In Proceedings of the 27th International Conference on Computer Aided Verification (CAV'15) -- Part I, volume 9206 of Lecture Notes in Computer Science, pages 123--139, San Francisco, CA, USA, July 2015. Springer.
doi: 10.1007/978-3-319-21690-4_8.
[ BibTex | DOI | Web page | PDF ]
[HK15]: C. Haase and S. Kiefer. The Odds of Staying on Budget. In Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP'15) -- Part II, volume 9135 of Lecture Notes in Computer Science, pages 234--246, Kyoto, Japan, July 2015. Springer.
doi: 10.1007/978-3-662-47666-6_19.
[ BibTex | DOI | Web page | PDF ]
[DGG15]: J. Dubut, É. Goubault, and J. Goubault-Larrecq. Natural Homology. In Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP'15) -- Part II, volume 9135 of Lecture Notes in Computer Science, pages 171--183, Kyoto, Japan, July 2015. Springer.
doi: 10.1007/978-3-662-47666-6_14.
[ BibTex | DOI | Web page | PDF ]
[LS15c]: J. Leroux and S. Schmitz. Demystifying Reachability in Vector Addition Systems. In Proceedings of the 30th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'15), pages 56--67, Kyoto, Japan, July 2015. IEEE Press.
doi: 10.1109/LICS.2015.1.
[ BibTex | DOI | Web page | PDF ]
[BFG⁺15]: M. Blondin, A. Finkel, S. Göller, C. Haase, and P. McKenzie. Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-Complete. In Proceedings of the 30th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'15), pages 32--43, Kyoto, Japan, July 2015. IEEE Press.
doi: 10.1109/LICS.2015.14.
[ BibTex | DOI | Web page | PDF ]
[LS15b]: R. Lazić and S. Schmitz. Non-Elementary Complexities for Branching VASS, MELL, and Extensions. ACM Transactions on Computational Logic, 16(3:20), July 2015.
doi: 10.1145/2733375.
[ BibTex | DOI | Web page | PDF ]
[APS15]: K. Athanasiou, H. Ponce de León, and S. Schwoon. Test Case Generation for Concurrent Systems Using Event Structures. In Proceedings of the 9th International Conference on Tests and Proofs (TAP'15), volume 9154 of Lecture Notes in Computer Science, pages 19--37, L'Aquila, Italy, July 2015. Springer.
doi: 10.1007/978-3-319-21215-9_2.
[ BibTex | DOI | Web page | PDF ]
[BBMU15]: P. Bouyer, R. Brenguier, N. Markey, and M. Ummels. Pure Nash Equilibria in Concurrent Games. Logical Methods in Computer Science, 11(2:9), June 2015.
doi: 10.2168/LMCS-11(2:9)2015.
[ BibTex | DOI | Web page | PDF ]
[CLMT15]: K. Chatterjee, S. Lafortune, N. Markey, and W. Thomas. Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061). Dagstuhl Reports, 5(2):1--25, June 2015.
doi: 10.4230/DagRep.5.2.1.
[ BibTex | DOI | Web page | PDF ]
[Bol15b]: B. Bollig. Automata and Logics for Concurrent Systems: Realizability and Verification. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, June 2015.
[ BibTex | Web page | PDF ]
[BHHP15]: B. Barbot, S. Haddad, M. Heiner, and C. Picaronny. Rare Event Handling in Signalling Cascades. International Journal on Advances in Systems and Measurements, 8(1-2):69--79, June 2015.
[ BibTex | Web page | PDF ]
[RNG15]: K. Rafes, J. Nauroy, and C. Germain. Certifying the interoperability of RDF database systems. In Proceedings of the 2nd Workshop on Linked Data Quality (LDQ'15), volume 1376 of CEUR Workshop Proceedings, Portorož, Slovenia, June 2015. RWTH Aachen, Germany.
[ BibTex | Web page | PDF ]
[ACR15]: É. André, Th. Chatain, and C. Rodríguez. Preserving Partial Order Runs in Parametric Time Petri Nets. In Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD'15), pages 120--129, Brussels, Belgium, June 2015. IEEE Computer Society Press.
doi: 10.1109/ACSD.2015.16.
[ BibTex | DOI | Web page | PDF ]
[CHKS15]: Th. Chatain, S. Haar, M. Koutny, and S. Schwoon. Non-Atomic Transition Firing in Contextual Nets. In Proceedings of the 36th International Conference on Applications and Theory of Petri Nets (PETRI NETS'15), volume 9115 of Lecture Notes in Computer Science, pages 117--136, Brussels, Belgium, June 2015. Springer.
doi: 10.1007/978-3-319-19488-2_6.
[ BibTex | DOI | Web page | PDF ]
[DDS15]: S. Demri, A. K. Dhar, and A. Sangnier. Taming Past LTL and Flat Counter Systems. Information and Computation, 242:306--339, June 2015.
doi: 10.1016/j.ic.2015.03.007.
[ BibTex | DOI | Web page | PDF ]
[CDRR15]: K. Chatterjee, L. Doyen, M. Randour, and J.-F. Raskin. Looking at Mean-Payoff and Total-Payoff through Windows. Information and Computation, 242:25--52, June 2015.
doi: 10.1016/j.ic.2015.03.010.
[ BibTex | DOI | Web page | PDF ]
[BtCS15]: V. Bárány, B. ten Cate, and L. Segoufin. Guarded nagation. Journal of the ACM, 62(3:22), June 2015.
doi: 10.1145/2701414.
[ BibTex | DOI | Web page | PDF ]
[HM15]: S. Haar and R. Meyer, editors. Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD'15), Brussels, Belgium, June 2015. IEEE Computer Society Press.
[ BibTex | Web page ]
[KGH⁺15]: F. Kordon, H. Garavel, L. M. Hillah, F. Hulin-Hubard, A. Linard, M. Beccuti, A. Hamez, E. Lopez-Bobeda, L. Jezequel, J. Meijer, E. Paviot-Adet, C. Rodriguez, C. Rohr, J. Srba, Y. Thierry-Mieg, and K. Wolf. Complete Results for the 2015 Edition of the Model Checking Contest, June 2015.
[ BibTex | Web page ]
[FL15]: A. Finkel and J. Leroux. Recent and simple algorithms for Petri nets. Software & System Modeling, 14(2):719--725, May 2015.
doi: 10.1007/s10270-014-0426-0.
[ BibTex | DOI | Web page | PDF ]
[KS15b]: P. Karandikar and Ph. Schnoebelen. Generalized Post Embedding Problems. Theory of Computing Systems, 56(4):697--716, May 2015.
doi: 10.1007/s00224-014-9561-9.
[ BibTex | DOI | Web page | PDF ]
[MD15]: N. Markey and A. Delaborde. Annual report for Year 2. Cassting deliverable D6.3 (FP7-ICT-601148), May 2015. 34 pages.
[ BibTex ]
[ADE⁺15]: S. Abiteboul, X. L. Dong, O. Etzioni, D. Srivastava, G. Weikum, J. Stoyanovich, and F. M. Suchanek. The elephant in the room: getting value from Big Data. In Proceedings of the 18th International Workshop on the Web and Databases (WebDB'15), pages 1--5, Melbourne, Australia, May 2015. ACM Press.
doi: 10.1145/2767109.2770014.
[ BibTex | DOI | Web page | PDF ]
[MSAM15]: V. Z. Moffitt, J. Stoyanovich, S. Abiteboul, and G. Miklau. Collaborative Access Control in WebdamLog. In Proceedings of the ACM SIGMOD Internaitonal Conference on Management of Data (SIGMOD'15), pages 197--211, Melbourne, Australia, May-June 2015. ACM Press.
doi: 10.1109/DSAA.2015.7344775.
[ BibTex | DOI | Web page | PDF ]
[AAK15]: S. Abiteboul, B. André, and D. Kaplan. Managing your digital life. Communications of the ACM, 58(5):32--35, May 2015.
doi: 10.1145/2670528.
[ BibTex | DOI | Web page | PDF ]
[GLSM15]: J. Goubault-Larrecq, P.-A. Sentucq, and F. Majorczyk. Etat d'avancement intermédiaire des travaux engagés sur OrchIDS. Rapport intermédiaire du contrat DGA-INRIA Orchids, May 2015.
[ BibTex ]
[JKS15]: P. Jancar, P. Karandikar, and Ph. Schnoebelen. On Reachability for Unidirectional Channel Systems Extended with Regular Tests. Logical Methods in Computer Science, 11(2:2), April 2015.
doi: 10.2168/LMCS-11(2:2)2015.
[ BibTex | DOI | Web page | PDF ]
[KKS15]: P. Karandikar, M. Kufleitner, and Ph. Schnoebelen. On the index of Simon's congruence for piecewise testability. Information Processing Letters, 15(4):515--519, April 2015.
doi: 10.1016/j.ipl.2014.11.008.
[ BibTex | DOI | Web page | PDF ]
[FKM15]: L. Fribourg, U. Kühne, and N. Markey. Game-based Synthesis of Distributed Controllers for Sampled Switched Systems. In Proceedings of the 2nd International Workshop on Synthesis of Continuous Parameters (SYNCOP'15), volume 44 of Open Access Series in Informatics, pages 47--61, London, UK, April 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.SynCoP.2015.47.
[ BibTex | DOI | Web page | PDF ]
[LDR⁺15]: A. Le Coënt, F. De Vuyst, Ch. Rey, L. Chamoin, and L. Fribourg. Guaranteed control of switched control systems using model order reduction and state-space bisection. In Proceedings of the 2nd International Workshop on Synthesis of Continuous Parameters (SYNCOP'15), volume 44 of Open Access Series in Informatics, pages 32--46, London, UK, April 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.SynCoP.2015.32.
[ BibTex | DOI | Web page | PDF ]
[ACD15]: M. Arapinis, V. Cheval, and S. Delaune. Composing security protocols: from confidentiality to privacy. In Proceedings of the 4th International Conference on Principles of Security and Trust (POST'15), volume 9036 of Lecture Notes in Computer Science, pages 324--343, London, UK, April 2015. Springer.
doi: 10.1007/978-3-662-46666-7_17.
[ BibTex | DOI | Web page | PDF ]
[VCD⁺15]: Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. M. Rabinovich, and J.-F. Raskin. The complexity of multi-mean-payoff and multi-energy games. Information and Computation, 241:177--196, April 2015.
doi: 10.1016/j.ic.2015.03.001.
[ BibTex | DOI | Web page | PDF ]
[LV15]: É. Lozes and J. Villard. Shared contract-obedient channels. Science of Computer Programming, 100:28--60, March 2015.
doi: 10.1016/j.scico.2014.09.008.
[ BibTex | DOI | Web page | PDF ]
[GDML15]: G. Geeraerts, S. Dehouck, N. Markey, and K. G. Larsen. Efficient algorithms for multi-player games with quantitative aspects. Cassting deliverable D2.1 (FP7-ICT-601148), March 2015. 22 pages.
[ BibTex | Web page | PDF ]
[DD15b]: S. Demri and M. Deters. Two-variable separation logic and its inner circle. ACM Transactions on Computational Logic, 16(2:15), March 2015.
doi: 10.1145/2724711.
[ BibTex | DOI | Web page | PDF ]
[KV15]: A. Koutsos and V. Vianu. Process-Centric Views of Data-Driven Business Artifacts. In Proceedings of the 18th International Conference on Database Theory (ICDT'15), volume 31 of Leibniz International Proceedings in Informatics, pages 247--264, Brussels, Belgium, March 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICDT.2015.247.
[ BibTex | DOI | Web page | PDF ]
[Fra15a]: N. Francis. Asymptotic Determinacy of Path Queries using Union-of-Paths Views. In Proceedings of the 18th International Conference on Database Theory (ICDT'15), volume 31 of Leibniz International Proceedings in Informatics, pages 44--59, Brussels, Belgium, March 2015. Leibniz-Zentrum für Informatik. Best student paper award.
doi: 10.4230/LIPIcs.ICDT.2015.44.
[ BibTex | DOI | Web page | PDF ]
[GJL15]: S. Göller, J. C. Jung, and M. Lohrey. The Complexity of Decomposing Modal and First-Order Theories. ACM Transactions on Computational Logic, 16(1:9), March 2015.
doi: 10.1145/2699918.
[ BibTex | DOI | Web page | PDF ]
[Seg15]: L. Segoufin. Constant Delay Enumeration for Conjunctive Queries. SIGMOD Records, 44(1):10--17, March 2015.
doi: 10.1145/2783888.2783894.
[ BibTex | DOI | Web page | PDF ]
[Kar15]: P. Karandikar. Subwords: automata, embedding problems, and verification. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France and Chennai Mathematical Institute, India, February 2015.
[ BibTex | Web page | PDF ]
[Gou15c]: J. Goubault-Larrecq. Full Abstraction for Non-Deterministic and Probabilistic Extensions of PCF I: the Angelic Cases. Journal of Logic and Algebraic Methods in Programming, 84(1):155--184, January 2015.
doi: 10.1016/j.jlamp.2014.09.003.
[ BibTex | DOI | Web page | PDF ]
[BMS15]: P. Bouyer, N. Markey, and O. Sankur. Robust Reachability in Timed Automata and Games: A Game-based Approach. Theoretical Computer Science, 563:43--74, January 2015.
doi: 10.1016/j.tcs.2014.08.014.
[ BibTex | DOI | Web page | PDF ]
[Gou15a]: J. Goubault-Larrecq. A short proof of the Schröder-Simpson theorem. Mathematical Structures in Computer Science, 25(1):1--5, January 2015.
doi: 10.1017/S0960129513000467.
[ BibTex | DOI | Web page | PDF ]
[KDH15]: M. Koutny, J. Desel, and S. Haddad, editors. Transactions on Petri Nets and Other Models of Concurrency X, volume 9410 of Lecture Notes in Computer Science. Springer, 2015.
[ BibTex | Web page ]
[MLB⁺15a]: A. Methni, M. Lemerre, B. Ben Hedia, S. Haddad, and K. Barkaoui. Specifying and Verifying Concurrent C Programs with TLA+. In Proceedings of the 3rd International Workshop on Formal Techniques for Safety-Critical Systems, Nov. 2014 (FTSCS'14), volume 476 of Communications in Computer and Information Science, pages 206--222, Luxembourg, 2015. Springer.
doi: 10.1007/978-3-319-17581-2_14.
[ BibTex | DOI | Web page | PDF ]
[FH15]: E. Fraca and S. Haddad. Complexity Analysis of Continuous Petri Nets. Fundamenta Informaticae, 137(1):1--28, 2015.
doi: 10.3233/FI-2015-1168.
[ BibTex | DOI | Web page | PDF ]
[BH15]: N. Bertrand and S. Haddad. Contrôle, probabilités et observation partielle. In Informatique Mathématique. Une photographie en 2015, chapter 5, pages 177--227. CNRS Éditions, 2015.
[ BibTex | Web page | PDF ]
[Sce15]: G. Scerri. Proofs of security protocols revisited. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2015.
[ BibTex | Web page | PDF ]
[DD15a]: S. Demri and M. Deters. Separation Logics and Modalities: A Survey. Journal of Applied Non-Classical Logics, 25(1):50--99, 2015.
doi: 10.1080/11663081.2015.1018801.
[ BibTex | DOI | Web page | PDF ]
[RRS15b]: M. Randour, J.-F. Raskin, and O. Sankur. Variations on the Stochastic Shortest Path Problem. In Proceedings of the 16th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'15), volume 8931 of Lecture Notes in Computer Science, pages 1--18, Mumbai, India, January 2015. Springer.
doi: 10.1007/978-3-662-46081-8_1.
[ BibTex | DOI | Web page | PDF ]
[BFCH14]: M. Beccuti, G. Franceschinis, D. Codetta-Raiteri, and S. Haddad. Computing Optimal Repair Strategies by Means of NdRFT Modeling and Analysis. The Computer Journal, 57(12):1870--1892, December 2014.
doi: 10.1093/comjnl/bxt134.
[ BibTex | DOI | Web page | PDF ]
[GLS14]: A. Gheerbrant, L. Libkin, and C. Sirangelo. Naïve Evaluation of Queries over Incomplete Databases. ACM Transactions on Database Systems, 39(4:31), December 2014.
doi: 10.1145/2691190.2691194.
[ BibTex | DOI | Web page | PDF ]
[Sir14]: C. Sirangelo. Representing and querying incomplete information: a data interoperability perspective. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, December 2014.
[ BibTex | Web page | PDF ]
[LLV14]: M. Lange, É. Lozes, and M. Vargas Guzmán. Model-checking process equivalences. Theoretical Computer Science, 560(3):326--347, December 2014.
doi: 10.1016/j.tcs.2014.08.020.
[ BibTex | DOI | Web page | PDF ]
[BHLM14]: B. Bollig, P. Habermehl, M. Leucker, and B. Monmege. A Robust Class of Data Languages and an Application to Learning. Logical Methods in Computer Science, 10(4:19), December 2014.
doi: 10.2168/LMCS-10(4:19)2014.
[ BibTex | DOI | Web page | PDF ]
[HSS14]: C. Haase, S. Schmitz, and Ph. Schnoebelen. The Power of Priority Channel Systems. Logical Methods in Computer Science, 10(4:4), December 2014.
doi: 10.2168/LMCS-10(4:4)2014.
[ BibTex | DOI | Web page | PDF ]
[AG14]: C. Aiswarya and P. Gastin. Reasoning about distributed systems: WYSIWYG. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 11--30, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.11.
[ BibTex | DOI | Web page | PDF ]
[BHL14]: N. Bertrand, S. Haddad, and E. Lefaucheux. Foundation of Diagnosis and Predictability in Probabilistic Systems. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 417--429, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.417.
[ BibTex | DOI | Web page | PDF ]
[BGK14]: B. Bollig, P. Gastin, and A. Kumar. Parameterized Communicating Automata: Complementation and Model Checking. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 625--637, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.625.
[ BibTex | DOI | Web page | PDF ]
[CMS14]: R. Chadha, U. Mathur, and S. Schwoon. Computing Information Flow Using Symbolic Model-Checking. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 505--516, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.505.
[ BibTex | DOI | Web page | PDF ]
[DFM14]: C. David, N. Francis, and F. Murlak. Consistency of injective tree patterns. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 279--290, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.279.
[ BibTex | DOI | Web page | PDF ]
[DJL⁺14]: L. Doyen, L. Juhl, K. G. Larsen, N. Markey, and M. Shirmohammadi. Synchronizing words for weighted and timed automata. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 121--132, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.121.
[ BibTex | DOI | Web page | PDF ]
[BMS14]: P. Bouyer, N. Markey, and D. Stan. Mixed Nash Equilibria in Concurrent Games. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 351--363, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.351.
[ BibTex | DOI | Web page | PDF ]
[BBB⁺14]: N. Bertrand, P. Bouyer, Th. Brihaye, Q. Menet, C. Baier, M. Größer, and M. Jurdziński. Stochastic Timed Automata. Logical Methods in Computer Science, 10(4:6), December 2014.
doi: 10.2168/LMCS-10(4:6)2014.
[ BibTex | DOI | Web page | PDF ]
[BCGZ14]: B. Bollig, A. Cyriac, P. Gastin, and M. Zeitoun. Temporal logics for concurrent recursive programs: Satisfiability and model checking. Journal of Applied Logic, 12(4):395--416, December 2014.
doi: 10.1016/j.jal.2014.05.001.
[ BibTex | DOI | Web page | PDF ]
[CDR14]: V. Cheval, S. Delaune, and M. D. Ryan. Tests for establishing security properties. In Revised Selected Papers of the 9th Symposium on Trustworthy Global Computing (TGC'14), volume 8902 of Lecture Notes in Computer Science, pages 82--96, Rome, Italy, December 2014. Springer.
doi: 10.1007/978-3-662-45917-1_6.
[ BibTex | DOI | Web page | PDF ]
[FKS14]: L. Fribourg, U. Kühne, and R. Soulat. Finite Controlled Invariants for Sampled Switched Systems. Formal Methods in System Design, 45(3):303--329, December 2014.
doi: 10.1007/s10703-014-0211-2.
[ BibTex | DOI | Web page | PDF ]
[LM14]: F. Laroussinie and N. Markey. Quantified CTL: Expressiveness and Complexity. Logical Methods in Computer Science, 10(4:17), December 2014.
doi: 10.2168/LMCS-10(4:17)2014.
[ BibTex | DOI | Web page | PDF ]
[Shi14]: M. Shirmohammadi. Qualitative Analysis of Synchronizing Probabilistic Systems. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France and Université Libre de Bruxelles, Belgium, December 2014.
[ BibTex | Web page | PDF ]
[Gou14a]: J. Goubault-Larrecq. Détection d'intrusions avec OrchIDS. Matinale de l'innovation Logiciels Libres et Sécurité, Paris, France, December 2014.
[ BibTex ]
[GPPS14]: C. Gardent, G. Perrier, Y. Parmentier, and S. Schmitz. Lexical Disambiguation in LTAG using Left Context. In Proceedings of the 5th Language & Technology Conference (LTC'11), volume 8387 of Lecture Notes in Artificial Intelligence, Poznań, Poland, November 2014. Springer.
[ BibTex | Web page ]
[BC14]: G. Bana and H. Comon-Lundh. A Computationally Complete Symbolic Attacker for Equivalence Properties. In Proceedings of the 21st ACM Conference on Computer and Communications Security (CCS'14), pages 609--620, Scottsdale, Arizona, USA, November 2014. ACM Press.
doi: 10.1145/2660267.2660276.
[ BibTex | DOI | Web page | PDF ]
[Pon14]: H. Ponce de León. Testing Concurrent Systems Through Event Structures. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2014.
[ BibTex | Web page | PDF ]
[Bar14]: B. Barbot. Acceleration for Statistical Model Checking. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2014.
[ BibTex | Web page | PDF ]
[CHJ⁺14]: Th. Chatain, S. Haar, L. Jezequel, L. Paulevé, and S. Schwoon. Characterization of Reachable Attractors Using Petri Net Unfoldings. In Proceedings of the 12th Conference on Computational Methods in System Biology (CMSB'14), volume 8859 of Lecture Notes in Bioinformatics, pages 129--142, Manchester, UK, November 2014. Springer-Verlag.
doi: 10.1007/978-3-319-12982-2_10.
[ BibTex | DOI | Web page | PDF ]
[PHL14b]: H. Ponce de León, S. Haar, and D. Longuet. Model-Based Testing for Concurrent Systems with Labeled Event Structures. Software Testing, Verification and Reliability, 24(7):558--590, November 2014.
doi: 10.1002/stvr.1543.
[ BibTex | DOI | Web page | PDF ]
[AGNK14]: C. Aiswarya, P. Gastin, and K. Narayan Kumar. Verifying Communicating Multi-pushdown Systems via Split-width. In Proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis (ATVA'14), volume 8837 of Lecture Notes in Computer Science, pages 1--17, Sydney, Australia, November 2014. Springer.
doi: 10.1007/978-3-319-11936-6_1.
[ BibTex | DOI | Web page | PDF ]
[BGM14]: P. Bouyer, P. Gardy, and N. Markey. Quantitative verification of weighted Kripke structures. In Proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis (ATVA'14), volume 8837 of Lecture Notes in Computer Science, pages 64--80, Sydney, Australia, November 2014. Springer.
doi: 10.1007/978-3-319-11936-6_6.
[ BibTex | DOI | Web page | PDF ]
[MV14b]: N. Markey and S. Vester. Symmetry Reduction in Infinite Games with Finite Branching. In Proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis (ATVA'14), volume 8837 of Lecture Notes in Computer Science, pages 281--296, Sydney, Australia, November 2014. Springer.
doi: 10.1007/978-3-319-11936-6_21.
[ BibTex | DOI | Web page | PDF ]
[ACD14]: M. Arnaud, V. Cortier, and S. Delaune. Modeling and Verifying Ad Hoc Routing Protocols. Information and Computation, 238:30--67, November 2014.
doi: 10.1016/j.ic.2014.07.004.
[ BibTex | DOI | Web page | PDF ]
[BCD14]: S. Bursuc, H. Comon-Lundh, and S. Delaune. Deducibility constraints and blind signatures. Information and Computation, 238:106--127, November 2014.
doi: 10.1016/j.ic.2014.07.006.
[ BibTex | DOI | Web page | PDF ]
[KNS14]: P. Karandikar, M. Niewerth, and Ph. Schnoebelen. On the state complexity of closures and interiors of regular languages with subwords. Research Report 1406.0690, Computing Research Repository, November 2014. 24 pages.
[ BibTex | Web page | PDF ]
[MCGS14]: N. Markey, N. Chaturvedi, G. Geeraerts, and J. Srba. Efficient strategy synthesis for complex objectives. Cassting deliverable D2.4 (FP7-ICT-601148), October 2014. 20 pages.
[ BibTex | Web page | PDF ]
[BHHP14]: B. Barbot, S. Haddad, M. Heiner, and C. Picaronny. Rare Event Handling in Signalling Cascades. In Proceedings of the 6th International Conference on Advances in System Simulation (SIMUL'14), pages 126--131, Nice, France, October 2014. XPS.
[ BibTex | Web page | PDF ]
[AFG14]: S. Abiteboul, L. Fribourg, and J. Goubault-Larrecq. Gérard Berry : un informaticien médaille d'or du CNRS 2014. 1024 -- Bulletin de la société informatique de France, 4:139--142, October 2014.
[ BibTex | Web page | PDF ]
[MA14]: D. Montoya and S. Abiteboul. Inférence d'itinéraires multimodaux à partir de données smartphone. In Actes de la 30ème Conférence sur la Gestion de Données -- Principes, Technologies et Applications (BDA'14), pages 38--42, Autrans, France, October 2014.
[ BibTex | Web page | PDF ]
[Lef14]: E. Lefaucheux. Détection de fautes dans les systèmes probabilistes. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2014. 35 pages.
[ BibTex | Web page | PDF ]
[Dub14]: J. Dubut. Homologie dirigée. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2014. 35 pages.
[ BibTex | Web page | PDF ]
[Hal14]: S. Halfon. Non Primitive Recursive Complexity Classes. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2014. 21 pages.
[ BibTex | Web page | PDF ]
[DDS14]: S. Demri, A. K. Dhar, and A. Sangnier. Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), volume 8762 of Lecture Notes in Computer Science, pages 85--97, Oxford, UK, September 2014. Springer.
doi: 10.1007/978-3-319-11439-2_7.
[ BibTex | DOI | Web page | PDF ]
[CD14c]: R. Chrétien and S. Delaune. Le bitcoin, une monnaie 100% numérique. Interstices, September 2014.
[ BibTex | Web page | PDF ]
[Sch14a]: S. Schmitz. Complexity Bounds for Ordinal-Based Termination. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), volume 8762 of Lecture Notes in Computer Science, pages 1--19, Oxford, UK, September 2014. Springer.
doi: 10.1007/978-3-319-11439-2_1.
[ BibTex | DOI | Web page | PDF ]
[BGS14]: B. Bollig, P. Gastin, and J. Schubert. Parameterized Verification of Communicating Automata under Context Bounds. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), volume 8762 of Lecture Notes in Computer Science, pages 45--57, Oxford, UK, September 2014. Springer.
doi: 10.1007/978-3-319-11439-2_4.
[ BibTex | DOI | Web page | PDF ]
[HM14]: S. Haddad and B. Monmege. Reachability in MDPs: Refining Convergence of Value Iteration. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), volume 8762 of Lecture Notes in Computer Science, pages 125--137, Oxford, UK, September 2014. Springer.
doi: 10.1007/978-3-319-11439-2_10.
[ BibTex | DOI | Web page | PDF ]
[LS14b]: J. Leroux and Ph. Schnoebelen. On Functions Weakly Computable by Petri Nets and Vector Addition Systems. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), volume 8762 of Lecture Notes in Computer Science, pages 190--202, Oxford, UK, September 2014. Springer.
doi: 10.1007/978-3-319-11439-2_15.
[ BibTex | DOI | Web page | PDF ]
[HH14]: C. Haase and S. Halfon. Integer Vector Addition Systems with States. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), volume 8762 of Lecture Notes in Computer Science, pages 112--124, Oxford, UK, September 2014. Springer.
doi: 10.1007/978-3-319-11439-2_9.
[ BibTex | DOI | Web page | PDF ]
[BMP14]: L. Brandán Briones, A. Madalinski, and H. Ponce de León. Distributed Diagnosability Analysis with Petri Nets. In Proceedings of the 25th International Workshop on Principles of Diagnosis (DX'14), Graz, Austria, September 2014.
[ BibTex | Web page | PDF ]
[CGNK14]: A. Cyriac, P. Gastin, and K. Narayan Kumar. Controllers for the Verification of Communicating Multi-Pushdown Systems. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), volume 8704 of Lecture Notes in Computer Science, pages 297--311, Rome, Italy, September 2014. Springer.
doi: 10.1007/978-3-662-44584-6_21.
[ BibTex | DOI | Web page | PDF ]
[CCD14]: R. Chrétien, V. Cortier, and S. Delaune. Typing messages for free in security protocols: the case of equivalence properties. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), volume 8704 of Lecture Notes in Computer Science, pages 372--386, Rome, Italy, September 2014. Springer.
doi: 10.1007/978-3-662-44584-6_26.
[ BibTex | DOI | Web page | PDF ]
[DMS14b]: L. Doyen, Th. Massart, and M. Shirmohammadi. Robust Synchronization in Markov Decision Processes. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), volume 8704 of Lecture Notes in Computer Science, pages 234--248, Rome, Italy, September 2014. Springer.
doi: 10.1007/978-3-662-44584-6_17.
[ BibTex | DOI | Web page | PDF ]
[BMM14]: P. Bouyer, N. Markey, and R. M. Matteplackel. Averaging in LTL. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), volume 8704 of Lecture Notes in Computer Science, pages 266--280, Rome, Italy, September 2014. Springer.
doi: 10.1007/978-3-662-44584-6_19.
[ BibTex | DOI | Web page | PDF ]
[PHL14a]: H. Ponce de León, S. Haar, and D. Longuet. Distributed testing of concurrent systems: vector clocks to the rescue. In Proceedings of the 11th International Colloquium on Theoretical Aspects of Computing (ICTAC'14), volume 8687 of Lecture Notes in Computer Science, pages 369--387, Bucharest, Romania, September 2014. Springer.
doi: 10.1007/978-3-319-10882-7_22.
[ BibTex | DOI | Web page | PDF ]
[Dou14]: A. Doumane. Études des automates en ludique. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2014.
[ BibTex ]
[Gou14c]: J. Goubault-Larrecq. Noetherian spaces. Invited talk, Continuity, Computability, Constructivity workshop (CCC), Ljubljana, Slovenia, September 2014.
[ BibTex ]
[Jaz14]: S. Jaziri. Robustness issues in priced timed automata. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2014.
[ BibTex ]
[CS14]: J.-B. Courtois and S. Schmitz. Alternating Vector Addition Systems with States. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS'14) -- Part I, volume 8634 of Lecture Notes in Computer Science, pages 220--231, Budapest, Hungary, August 2014. Springer.
doi: 10.1007/978-3-662-44522-8_19.
[ BibTex | DOI | Web page | PDF ]
[KS14]: P. Karandikar and Ph. Schnoebelen. On the state complexity of closures and interiors of regular languages with subwords. In Proceedings of the 16th Workshop on Descriptional Complexity of Formal Systems (DCFS'14), volume 8614 of Lecture Notes in Computer Science, pages 234--245, Turku, Finland, August 2014. Springer-Verlag.
doi: 10.1007/978-3-319-09704-6_21.
[ BibTex | DOI | Web page | PDF ]
[SLS⁺14]: Y. Sun, G. Lipari, R. Soulat, L. Fribourg, and N. Markey. Component-Based Analysis of Hierarchical Scheduling using Linear Hybrid Automata. In Proceedings of the 20th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'14), Chongqing, China, August 2014. IEEE Computer Society Press.
doi: 10.1109/RTCSA.2014.6910502.
[ BibTex | DOI | Web page | PDF ]
[DD14a]: S. Demri and M. Deters. The effects of modalities in separation logics (extended abstract). In Proceedings of the 10th Conference on Advances in Modal Logics (AiML'14), pages 134--138, Groningen, The Netherlands, August 2014. College Publications.
[ BibTex | Web page | PDF ]
[DKW14]: S. Demri, D. Kapur, and C. Weidenbach, editors. Proceedings of the 7th International Joint Conference on Automated Reasoning (IJCAR'14), volume 8562 of Lecture Notes in Computer Science, Vienna, Austria, July 2014. Springer.
[ BibTex | Web page ]
[CKM14]: M. Cadilhac, A. Krebs, and P. McKenzie. Extremely uniform branching programs. In Proceedings of the 6th Workshop on Non-Classical Models of Automata and Applications (NCMA'14), volume 304 of books@ocg.at, pages 73--83, Kassel, Germany, July 2014. Austrian Computer Society.
[ BibTex | Web page | PDF ]
[BFS14]: F. Bouchy, A. Finkel, and P. San Pietro. Dense-choice Counter Machines Revisited. Theoretical Computer Science, 542:17--31, July 2014.
doi: 10.1016/j.tcs.2014.04.029.
[ BibTex | DOI | Web page | PDF ]
[CD14a]: K. Chatterjee and L. Doyen. Games with a Weak Adversary. In Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP'14) -- Part II, volume 8573 of Lecture Notes in Computer Science, pages 110--121, Copenhagen, Denmark, July 2014. Springer.
doi: 10.1007/978-3-662-43951-7_10.
[ BibTex | DOI | Web page | PDF ]
[BFM14]: M. Blondin, A. Finkel, and P. McKenzie. Handling Infinitely Branching WSTS. In Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP'14) -- Part II, volume 8573 of Lecture Notes in Computer Science, pages 13--25, Copenhagen, Denmark, July 2014. Springer.
doi: 10.1007/978-3-662-43951-7_2.
[ BibTex | DOI | Web page | PDF ]
[DD14b]: S. Demri and M. Deters. Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction. In Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/ IEEE Symposium on Logic In Computer Science (CSL/LICS'14), Vienna, Austria, July 2014. ACM Press.
doi: 10.1145/2603088.2603142.
[ BibTex | DOI | Web page | PDF ]
[BGMZ14a]: B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Logical Characterization of Weighted Pebble Walking Automata. In Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/ IEEE Symposium on Logic In Computer Science (CSL/LICS'14), Vienna, Austria, July 2014. ACM Press.
doi: 10.1145/2603088.2603118.
[ BibTex | DOI | Web page | PDF ]
[Haa14]: C. Haase. Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy. In Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/ IEEE Symposium on Logic In Computer Science (CSL/LICS'14), Vienna, Austria, July 2014. ACM Press.
doi: 10.1145/2603088.2603092.
[ BibTex | DOI | Web page | PDF ]
[Bol14]: B. Bollig. Logic for Communicating Automata with Parameterized Topology. In Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/ IEEE Symposium on Logic In Computer Science (CSL/LICS'14), Vienna, Austria, July 2014. ACM Press.
doi: 10.1145/2603088.2603093.
[ BibTex | DOI | Web page | PDF ]
[Sch14b]: S. Schmitz. Implicational Relevance Logic is 2-ExpTime-Complete. In Proceedings of the Joint 25th International Conference on Rewriting Techniques and Applications and 12th International Conference on Typed Lambda-Calculi and Applications (RTA/ TLCA'14), volume 8560 of Lecture Notes in Computer Science, pages 395--409, Vienna, Austria, July 2014. Springer.
doi: 10.1007/978-3-319-08918-8_27.
[ BibTex | DOI | Web page | PDF ]
[LS14a]: R. Lazić and S. Schmitz. Non-Elementary Complexities for Branching VASS, MELL, and Extensions. In Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/ IEEE Symposium on Logic In Computer Science (CSL/LICS'14), Vienna, Austria, July 2014. ACM Press.
doi: 10.1145/2603088.2603129.
[ BibTex | DOI | Web page | PDF ]
[Gou14d]: J. Goubault-Larrecq. OrchIDS: on the value of rigor in intrusion detection. CPS Summer School, Grenoble, France, July 2014.
[ BibTex ]
[DSS14]: A. Durand, N. Schweikardt, and L. Segoufin. Enumerating answers to first-order queries over databases of low degree. In Proceedings of the 33rd Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'14), pages 121--131, Snowbird, Utah, USA, June 2014. ACM Press.
doi: 10.1145/2594538.2594539.
[ BibTex | DOI | Web page | PDF ]
[JLMX14]: S. Jaziri, K. G. Larsen, R. Mardare, and B. Xue. Adequacy and Complete Axiomatization for Timed Modal Logic. In Proceedings of the 30th Conference on Mathematical Foundations of Programming Semantics (MFPS'14), volume 308 of Electronic Notes in Theoretical Computer Science, pages 183--210, Ithaca, New York, USA, June 2014. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2014.10.011.
[ BibTex | DOI | Web page | PDF ]
[GJ14]: J. Goubault-Larrecq and A. Jung. QRB, QFS, and the Probabilistic Powerdomain. In Proceedings of the 30th Conference on Mathematical Foundations of Programming Semantics (MFPS'14), volume 308 of Electronic Notes in Theoretical Computer Science, pages 167--182, Ithaca, New York, USA, June 2014. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2014.10.010.
[ BibTex | DOI | Web page | PDF ]
[ADK14]: M. Arapinis, S. Delaune, and S. Kremer. Dynamic Tags for Security Protocols. Logical Methods in Computer Science, 10(2:11), June 2014.
doi: 10.2168/LMCS-10(2:11)2014.
[ BibTex | DOI | Web page | PDF ]
[FL14]: A. Finkel and J. Leroux. Neue, einfache Algorithmen für Petrinetze. Informatik Spektrum, 37(3):229--236, June 2014.
doi: 10.1007/s00287-013-0753-5.
[ BibTex | DOI | Web page | PDF ]
[KH14]: F. Kordon and F. Hulin-Hubard. BenchKit, a Tool for Massive Concurrent Benchmarking. In Proceedings of the 14th International Conference on Application of Concurrency to System Design (ACSD'14), pages 159--165, Tunis, Tunisia, June 2014. IEEE Computer Society Press.
doi: 10.1109/ACSD.2014.12.
[ BibTex | DOI | Web page | PDF ]
[GHKS14]: V. Germanos, S. Haar, V. Khomenko, and S. Schwoon. Diagnosability under Weak Fairness. In Proceedings of the 14th International Conference on Application of Concurrency to System Design (ACSD'14), pages 132--141, Tunis, Tunisia, June 2014. IEEE Computer Society Press.
doi: 10.1109/ACSD.2014.9.
[ BibTex | DOI | Web page | PDF ]
[DGLWM14]: S. Demri, D. Galmiche, D. Larchey-Wendling, and D. Méry. Separation Logic with One Quantified Variable. In Proceedings of the 9th International Computer Science Symposium in Russia (CSR'14), volume 8476 of Lecture Notes in Computer Science, pages 125--138, Moscow, Russia, June 2014. Springer.
doi: 10.1007/978-3-319-06686-8_10.
[ BibTex | DOI | Web page | PDF ]
[Gou14b]: J. Goubault-Larrecq. Exponentiable streams and prestreams. Applied Categorical Structures, 22(3):515--549, June 2014. Errata 1: http://www.lsv.fr/Publis/PAPERS/PDF/GL-acs13-erratum.pdf; Errata 2: http://www.lsv.fr/Publis/PAPERS/PDF/GL-acs13-erratum2.pdf.
doi: 10.1007/s10485-013-9315-x.
[ BibTex | DOI | Web page | PDF ]
[KGH⁺14]: F. Kordon, H. Garavel, L.-M. Hillah, F. Hulin-Hubard, A. Linard, M. Beccuti, S. Evangelista, A. Hamez, N. Lohmann, E. Lopez, E. Paviot-Adet, C. Rodriguez, C. Rohr, and J. Srba. Results for the MCC @ Petri Nets 2014, June 2014.
[ BibTex | Web page ]
[FFL⁺14]: G. Feld, L. Fribourg, D. Labrousse, B. Revol, and R. Soulat. Correct-by-design Control Synthesis for Multilevel Converters using State Space Decomposition. In Proceedings of the 2nd French-Singaporean Workshop on Formal Methods and Applications (FSFMA'14), volume 156 of Electronic Proceedings in Theoretical Computer Science, pages 5--16, Singapore, May 2014.
doi: 10.4204/EPTCS.156.5.
[ BibTex | DOI | Web page | PDF ]
[MV14a]: N. Markey and S. Valette. Annual report for Year 1. Cassting deliverable D6.2 (FP7-ICT-601148), May 2014. 38 pages.
[ BibTex ]
[GM14]: P. Gastin and B. Monmege. Adding Pebbles to Weighted Automata -- Easy Specification & Efficient Evaluation. Theoretical Computer Science, 534:24--44, May 2014.
doi: 10.1016/j.tcs.2014.02.034.
[ BibTex | DOI | Web page | PDF ]
[GLSM14b]: J. Goubault-Larrecq, P.-A. Sentucq, and F. Majorczyk. Techniques et méthodes de génération de signatures pour la détection d'intrusions. Fourniture 2 du contrat DGA-INRIA Orchids, May 2014.
[ BibTex ]
[GLSM14a]: J. Goubault-Larrecq, P.-A. Sentucq, and F. Majorczyk. Politiques de sécurité système. Fourniture 1 du contrat DGA-INRIA Orchids, May 2014.
[ BibTex ]
[SLAF14]: Y. Sun, G. Lipari, É. André, and L. Fribourg. Toward Parametric Timed Interfaces for Real-Time Components. In Proceedings of the 1st International Workshop on Synthesis of Continuous Parameters (SYNCOP'14), volume 145 of Electronic Proceedings in Theoretical Computer Science, pages 49--64, Grenoble, France, April 2014.
doi: 10.4204/EPTCS.145.6.
[ BibTex | DOI | Web page | PDF ]
[CD14b]: K. Chatterjee and L. Doyen. Partial-Observation Stochastic Games: How to Win when Belief Fails. ACM Transactions on Computational Logic, 15(2:16), April 2014.
doi: 10.1145/2579819.
[ BibTex | DOI | Web page | PDF ]
[SL14]: Y. Sun and G. Lipari. A Weak Simulation Relation for Real-Time Schedulability Analysis of Global Fixed Priority Scheduling Using Linear Hybrid Automata. Research Report LSV-14-06, Laboratoire Spécification et Vérification, ENS Cachan, France, April 2014. 17 pages.
[ BibTex | Web page | PDF ]
[CDNV14]: K. Chatterjee, L. Doyen, S. Nain, and M. Y. Vardi. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. In Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'14), volume 8412 of Lecture Notes in Computer Science, pages 242--257, Grenoble, France, April 2014. Springer.
doi: 10.1007/978-3-642-54830-7_16.
[ BibTex | DOI | Web page | PDF ]
[CDGO14]: K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj. Perfect-Information Stochastic Mean-Payoff Parity Games. In Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'14), volume 8412 of Lecture Notes in Computer Science, pages 210--225, Grenoble, France, April 2014. Springer.
doi: 10.1007/978-3-642-54830-7_4.
[ BibTex | DOI | Web page | PDF ]
[DMS14a]: L. Doyen, Th. Massart, and M. Shirmohammadi. Limit Synchronization in Markov Decision Processes. In Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'14), volume 8412 of Lecture Notes in Computer Science, pages 58--72, Grenoble, France, April 2014. Springer.
doi: 10.1007/978-3-642-54830-7_4.
[ BibTex | DOI | Web page | PDF ]
[Mar14]: N. Markey. Cassting: Synthesizing Complex Systems Using Non-Zero-Sum Games. ERCIM News, 97:25--26, April 2014.
[ BibTex | Web page | PDF ]
[BDH14]: D. Baelde, S. Delaune, and L. Hirschi. A reduced semantics for deciding trace equivalence using constraint systems. In Proceedings of the 3rd International Conference on Principles of Security and Trust (POST'14), volume 8414 of Lecture Notes in Computer Science, pages 1--21, Grenoble, France, April 2014. Springer.
doi: 10.1007/978-3-642-54792-8_1.
[ BibTex | DOI | Web page | PDF ]
[BM14a]: D. Berwanger and A. B. Mathew. Games with Recurring Certainty. In Proceedings of the 2nd International Workshop on Strategic Reasoning (SR'14), volume 146 of Electronic Proceedings in Theoretical Computer Science, pages 91--96, Grenoble, France, April 2014.
doi: 10.4204/EPTCS.146.12.
[ BibTex | DOI | Web page | PDF ]
[CDFR14b]: K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin. Doomsday Equilibria for Omega-Regular Games. In Proceedings of the 2nd International Workshop on Strategic Reasoning (SR'14), volume 146 of Electronic Proceedings in Theoretical Computer Science, pages 43--48, Grenoble, France, April 2014.
doi: 10.4204/EPTCS.146.6.
[ BibTex | DOI | Web page | PDF ]
[BMV14]: P. Bouyer, N. Markey, and S. Vester. Nash Equilibria in Symmetric Games with Partial Observation. In Proceedings of the 2nd International Workshop on Strategic Reasoning (SR'14), volume 146 of Electronic Proceedings in Theoretical Computer Science, pages 49--55, Grenoble, France, April 2014.
doi: 10.4204/EPTCS.146.7.
[ BibTex | DOI | Web page | PDF ]
[AGH⁺14]: T. Antonopoulos, N. Gorogiannis, C. Haase, M. Kanovich, and J. Ouaknine. Foundations for Decision Problems in Separation Logic with General Inductive Predicates. In Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'14), volume 8412 of Lecture Notes in Computer Science, pages 411--425, Grenoble, France, April 2014. Springer.
doi: 10.1007/978-3-642-54830-7_27.
[ BibTex | DOI | Web page | PDF ]
[BFH⁺14]: N. Bertrand, É. Fabre, S. Haar, S. Haddad, and L. Hélouët. Active diagnosis for probabilistic systems. In Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'14), volume 8412 of Lecture Notes in Computer Science, pages 29--42, Grenoble, France, April 2014. Springer.
doi: 10.1007/978-3-642-54830-7_4.
[ BibTex | DOI | Web page | PDF ]
[ABG⁺14b]: S. Akshay, B. Bollig, P. Gastin, M. Mukund, and K. Narayan Kumar. Distributed Timed Automata with Independently Evolving Clocks. Fundamenta Informaticae, 130(4):377--407, April 2014.
doi: 10.3233/FI-2014-996.
[ BibTex | DOI | Web page | PDF ]
[BGMZ14b]: B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Pebble Weighted Automata and Weighted Logics. ACM Transactions on Computational Logic, 15(2:15), April 2014.
doi: 10.1145/2579819.
[ BibTex | DOI | Web page | PDF ]
[MBL14]: N. Markey, Th. Brihaye, and K. G. Larsen. Robustness of collective adaptive systems. Cassting deliverable D3.1 (FP7-ICT-601148), March 2014. 17 pages.
[ BibTex | Web page | PDF ]
[BM14b]: Th. Brihaye and N. Markey. Solution concepts for collective adaptive systems. Cassting deliverable D1.4 (FP7-ICT-601148), March 2014. 13 pages.
[ BibTex | Web page | PDF ]
[Seg14]: L. Segoufin. A glimpse on constant delay enumeration. In Proceedings of the 31st Annual Symposium on Theoretical Aspects of Computer Science (STACS'14), volume 25 of Leibniz International Proceedings in Informatics, pages 13--27, Lyon, France, March 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2014.13.
[ BibTex | DOI | Web page | PDF ]
[ADV14]: S. Abiteboul, D. Deutch, and V. Vianu. Deduction with Contradictions in Datalog. In Proceedings of the 17th International Conference on Database Theory (ICDT'14), pages 143--154, Athens, Greece, March 2014.
doi: 10.5441/002/icdt.2014.17.
[ BibTex | DOI | Web page | PDF ]
[EM14]: Y. Elias and P. McKenzie. On Generalized Addition Chains. INTEGERS -- Electronic Journal of Combinatorial Number Theory, 14(A16), March 2014.
[ BibTex | Web page | PDF ]
[FSS14]: N. Francis, L. Segoufin, and C. Sirangelo. Datalog Rewritings of Regular Path Queries using Views. In Proceedings of the 17th International Conference on Database Theory (ICDT'14), pages 107--118, Athens, Greece, March 2014.
doi: 10.5441/002/icdt.2014.14.
[ BibTex | DOI | Web page | PDF ]
[BLM14]: P. Bouyer, K. G. Larsen, and N. Markey. Lower-Bound Constrained Runs in Weighted Timed Automata. Performance Evaluation, 73:91--109, March 2014.
doi: 10.1016/j.peva.2013.11.002.
[ BibTex | DOI | Web page | PDF ]
[HHM14]: S. Haddad, R. Hennicker, and M. H. Møller. Specification of Asynchronous Component Systems with Modal IashO-Petri Nets. In Revised Selected Papers of the 8th Symposium on Trustworthy Global Computing (TGC'13), volume 8358 of Lecture Notes in Computer Science, pages 219--234, Buenos Aires, Argentina, March 2014. Springer.
doi: 10.1007/978-3-319-05119-2_13.
[ BibTex | DOI | Web page | PDF ]
[Fin14]: A. Finkel. REACHARD -- Compte-rendu intermédiaire. Deliverable D3 Reachard (ANR-11-BS02-001), February 2014. 18 pages.
[ BibTex ]
[Bra14]: J. Brault-Baron. Hypergraph Acyclicity Revisited. Research Report 1403.7076, Computing Research Repository, February 2014. 32 pages.
[ BibTex | Web page | PDF ]
[Sou14]: R. Soulat. Synthesis of Correct-by-Design Schedulers for Hybrid Systems. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, February 2014.
[ BibTex | Web page | PDF ]
[FGM⁺14]: L. Fribourg, É. Goubault, S. Mohamed, S. Putot, and R. Soulat. Synthesis of robust boundary control for systems governed by semi-discrete differential equations. Research Report LSV-14-03, Laboratoire Spécification et Vérification, ENS Cachan, France, February 2014. 8 pages.
[ BibTex | Web page | PDF ]
[SBM14]: O. Sankur, P. Bouyer, and N. Markey. Shrinking Timed Automata. Information and Computation, 234:107--132, February 2014.
doi: 10.1016/j.ic.2014.01.002.
[ BibTex | DOI | Web page | PDF ]
[KL14]: S. Kumar and G. Lipari. Latency Analysis of Network-On-Chip-based Many-Core Processors. In Proceedings of the 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'14), pages 432--439, Turin, Italy, February 2014. IEEE Computer Society Press.
doi: 10.1109/PDP.2014.107.
[ BibTex | DOI ]
[ABG⁺14a]: A. Adjé, O. Bouissou, J. Goubault-Larrecq, É. Goubault, and S. Putot. Static Analysis of Programs with Imprecise Probabilistic Inputs. In Revised Selected Papers of the 5th IFIP TC2/WG2.3 Conference Verified Software---Theories, Tools, and Experiments (VSTTE'13), volume 8164 of Lecture Notes in Computer Science, pages 22--47, Atherton, California, USA, 2014. Springer.
doi: 10.1007/978-3-642-54108-7.
[ BibTex | DOI | Web page | PDF ]
[BFHP14]: L. Bernardinello, C. Ferigato, S. Haar, and L. Pomello. Closed Sets in Occurrence Nets with Conflicts. Fundamenta Informaticae, 133(4):323--344, 2014.
doi: 10.3233/FI-2014-1079.
[ BibTex | DOI | Web page | PDF ]
[KHY14]: M. Koutny, S. Haddad, and A. Yakovlev, editors. Transactions on Petri Nets and Other Models of Concurrency IX, volume 8910 of Lecture Notes in Computer Science. Springer, 2014.
[ BibTex | Web page ]
[CH14]: Th. Chatain and S. Haar. A Canonical Contraction for Safe Petri Nets. In Transactions on Petri Nets and Other Models of Concurrency IX, volume 8910 of Lecture Notes in Computer Science, pages 83--98. Springer, 2014.
doi: 10.1007/978-3-662-45730-6_5.
[ BibTex | DOI | Web page | PDF ]
[GS14]: J. Goubault-Larrecq and R. Segala. Random Measurable Selections. In Horizons of the Mind. A Tribute to Prakash Panangaden, volume 8464 of Lecture Notes in Computer Science, pages 343--362. Springer, 2014.
doi: 10.1007/978-3-319-06880-0_18.
[ BibTex | DOI | Web page | PDF ]
[CDFR14a]: K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin. Doomsday Equilibria for Omega-Regular Games. In Proceedings of the 15th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'14), volume 8318 of Lecture Notes in Computer Science, pages 78--97, San Diego, California, USA, January 2014. Springer.
doi: 10.1007/978-3-642-54013-4_5.
[ BibTex | DOI | Web page | PDF ]
[Cyr14]: A. Cyriac. Verification of Communicating Recursive Programs via Split-width. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2014.
[ BibTex | Web page | PDF ]
[BCG⁺14]: D. Baelde, K. Chaudhuri, A. Gacek, D. Miller, G. Nadathur, A. Tiu, and Y. Wang. Abella: A System for Reasoning about Relational Specifications. Journal of Formalized Reasoning, 7(2):1--89, 2014.
doi: 10.6092/issn.1972-5787/4650.
[ BibTex | DOI | Web page | PDF ]
[Cha13]: Th. Chatain. Concurrency in Real-Time Distributed Systems, from Unfoldings to Implementability. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, December 2013.
[ BibTex | Web page | PDF ]
[Rod13]: C. Rodríguez. Verification Based on Unfoldings of Petri Nets with Read Arcs. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2013.
[ BibTex | Web page | PDF ]
[Sch13]: S. Schwoon. Efficient verification of sequential and concurrent systems. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, December 2013.
[ BibTex | Web page | PDF ]
[Ant13]: É. Antoine. Distributed data management with a declarative rule-based language: Webdamlog. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2013.
[ BibTex | Web page | PDF ]
[BLBL13]: M. Bambagini, J. Lelli, G. Buttazzo, and G. Lipari. On the Energy-Aware Partitioning of Real-Time Tasks on Homogeneous Multi-Processor Systems. In Proceedings of the 4th International Conference on Energy-Aware Computing Systems and Applications (ICEAC'14),, pages 69--74, Istanbul, Turkey, December 2013. IEEE Circuits and Systems Society.
doi: 10.1109/ICEAC.2013.6737640.
[ BibTex | DOI | Web page | PDF ]
[HHMS13]: S. Haar, S. Haddad, T. Melliti, and S. Schwoon. Optimal Constructions for Active Diagnosis. In Proceedings of the 33rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), volume 24 of Leibniz International Proceedings in Informatics, pages 527--539, Guwahati, India, December 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2013.527.
[ BibTex | DOI | Web page | PDF ]
[EJS13]: J. Esparza, L. Jezequel, and S. Schwoon. Computation of summaries using net unfoldings. In Proceedings of the 33rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), volume 24 of Leibniz International Proceedings in Informatics, pages 225--236, Guwahati, India, December 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2013.225.
[ BibTex | DOI | Web page | PDF ]
[CDKR13]: C. Chevalier, S. Delaune, S. Kremer, and M. D. Ryan. Composition of Password-based Protocols. Formal Methods in System Design, 43(3):369--413, December 2013.
doi: 10.1007/s10703-013-0184-6.
[ BibTex | DOI | Web page | PDF ]
[BS13c]: D. Berwanger and O. Serre. Théorie des jeux en informatique. Technique et Science Informatiques, 32(9-10), December 2013.
[ BibTex | Web page | PDF ]
[BC13a]: S. Balaguer and Th. Chatain. Avoiding Shared Clocks in Networks of Timed Automata. Logical Methods in Computer Science, 9(4:13), November 2013.
doi: 10.2168/LMCS-9(4:13)2013.
[ BibTex | DOI | Web page | PDF ]
[CD13b]: R. Chrétien and S. Delaune. La protection des informations sensibles. Pour La Science, 433:70--77, November 2013.
[ BibTex | Web page ]
[PHL13]: H. Ponce de León, S. Haar, and D. Longuet. Unfolding-based Test Selection for Concurrent Conformance. In Proceedings of the 25th IFIP International Conference on Testing Software and Systems (ICTSS'13), Lecture Notes in Computer Science, pages 98--113, Istanbul, Turkey, November 2013. Springer.
doi: 10.1007/978-3-642-41707-8_7.
[ BibTex | DOI | Web page | PDF ]
[KS13c]: W. Kazana and L. Segoufin. Enumeration of monadic second-order queries on trees. ACM Transactions on Computational Logic, 14(4), November 2013.
doi: 10.1145/2528928.
[ BibTex | DOI | Web page | PDF ]
[CFM13]: M. Cadilhac, A. Finkel, and P. McKenzie. Unambiguous Contrained Automata. International Journal of Foundations of Computer Science, 24(7):1099--1116, November 2013.
doi: 10.1142/S0129054113400339.
[ BibTex | DOI | Web page | PDF ]
[BS13a]: N. Bertrand and Ph. Schnoebelen. Computable fixpoints in well-structured symbolic model checking. Formal Methods in System Design, 43(2):233--267, October 2013.
doi: 10.1007/s10703-012-0168-y.
[ BibTex | DOI | Web page | PDF ]
[MLS⁺13]: N. Markey, K. G. Larsen, A. Skou, D. Lux, J. Rozenkilde, K. L. Pedersen, and S. M. Sørensen. Description of case studies. Cassting deliverable D4.1 (FP7-ICT-601148), October 2013. 19 pages.
[ BibTex ]
[Mon13]: B. Monmege. Spécification et vérification de propriétés quantitatives : expressions, logiques, et automates. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2013.
[ BibTex | Web page | PDF ]
[PLML13]: A. Parri, J. Lelli, M. Marinoni, and G. Lipari. Design and Implementation of the Multiprocessor Bandwidth Inheritance Protocol on Linux. In Proceedings of the 15th Real-Time Linux Workshop (RTLWS'13), pages 41--54, Lugano-Manno, Switzerland, October 2013. Open Source Automation Development Lab (OSADL).
[ BibTex | Web page | PDF ]
[SSL⁺13]: Y. Sun, R. Soulat, G. Lipari, É. André, and L. Fribourg. Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems. In Preproceedings of the 2nd International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS'13), pages 179--194, Queenstown, New Zealand, October 2013.
[ BibTex | Web page | PDF ]
[PBB13]: H. Ponce de León, G. Bonigo, and L. Brandán Briones. Distributed Analysis of Diagnosability in Concurrent Systems. In Proceedings of the 24th International Workshop on Principles of Diagnosis (DX'13), Jerusalem, Israel, October 2013.
[ BibTex | Web page | PDF ]
[ABD⁺13]: É. André, B. Barbot, C. Démoulins, L. M. Hillah, F. Hulin-Hubard, F. Kordon, A. Linard, and L. Petrucci. A Modular Approach for Reusing Formalisms in Verification Tools of Concurrent Systems. In Proceedings of the 15th International Conference on Formal Engineering Methods (ICFEM'13), Lecture Notes in Computer Science, pages 199--214, Queenstown, New Zealand, October-November 2013. Springer.
doi: 10.1007/978-3-642-41202-8_14.
[ BibTex | DOI | Web page | PDF ]
[BDG⁺13]: Th. Brihaye, L. Doyen, G. Geeraerts, J. Ouaknine, J.-F. Raskin, and J. Worrell. Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points. In Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), volume 8172 of Lecture Notes in Computer Science, pages 55--70, Hanoi, Vietnam, October 2013. Springer.
doi: 10.1007/978-3-319-02444-8_6.
[ BibTex | DOI | Web page | PDF ]
[CDRR13]: K. Chatterjee, L. Doyen, M. Randour, and J.-F. Raskin. Looking at Mean-Payoff and Total-Payoff through Windows. In Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), volume 8172 of Lecture Notes in Computer Science, pages 118--132, Hanoi, Vietnam, October 2013. Springer.
doi: 10.1007/978-3-319-02444-8_10.
[ BibTex | DOI | Web page | PDF ]
[RS13a]: C. Rodríguez and S. Schwoon. Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs. In Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), volume 8172 of Lecture Notes in Computer Science, pages 492--495, Hanoi, Vietnam, October 2013. Springer.
doi: 10.1007/978-3-319-02444-8_42.
[ BibTex | DOI | Web page | PDF ]
[AFS13a]: É. André, L. Fribourg, and R. Soulat. Merge and Conquer: State Merging in Parametric Timed Automata. In Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), volume 8172 of Lecture Notes in Computer Science, pages 381--396, Hanoi, Vietnam, October 2013. Springer.
doi: 10.1007/978-3-319-02444-8_27.
[ BibTex | DOI | Web page | PDF ]
[CDH13]: K. Chatterjee, L. Doyen, and Th. A. Henzinger. A survey of partial-observation stochastic parity games. Formal Methods in System Design, 43(2):268--284, October 2013.
doi: 10.1007/s10703-012-0164-2.
[ BibTex | DOI | Web page | PDF ]
[GO13]: J. Goubault-Larrecq and J. Olivain. On the Efficiency of Mathematics in Intrusion Detection: The NetEntropy Case. In Revised Selected Papers of the 6th International Symposium on Foundations and Practice of Security (FPS'13), volume 8352 of Lecture Notes in Computer Science, pages 3--16, La Rochelle, France, October 2013. Springer.
doi: 10.1007/978-3-319-05302-8_1.
[ BibTex | DOI | Web page | PDF ]
[AV13b]: S. Abiteboul and V. Vianu. Models for Data-Centric Workflows. In In Search of Elegance in the Theory and Practice of Computation -- Essays Dedicated to Peter Buneman, volume 8000 of Lecture Notes in Computer Science, pages 1--12. Springer, September 2013.
doi: 10.1007/978-3-642-41660-6_1.
[ BibTex | DOI ]
[tCS13]: B. ten Cate and L. Segoufin. Unary negation. Logical Methods in Computer Science, 9(3:25), September 2013.
doi: 10.2168/LMCS-9(3:25)2013.
[ BibTex | DOI | Web page | PDF ]
[BCMV13]: R. Bonnet, R. Chadha, P. Madhusudan, and M. Viswanathan. Reachability under contextual locking. Logical Methods in Computer Science, 9(3:21), September 2013.
doi: 10.2168/LMCS-9(3:21)2013.
[ BibTex | DOI | Web page | PDF ]
[BL13b]: G. Buttazzo and G. Lipari. Ptask: An Educational C Library for Programming Real-Time Systems on Linux. In Proceedings of the 18th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'13), Cagliari, Italy, September 2013. IEEE Industrial Electronics Society.
doi: 10.1109/ETFA.2013.6648001.
[ BibTex | DOI | Web page | PDF ]
[Bro13]: R. Brochenin. Separation Logic: Expressiveness, Complexity, Temporal Extension. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2013.
[ BibTex | Web page | PDF ]
[Kaz13]: W. Kazana. Query Evaluation with Constant Delay. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2013.
[ BibTex | Web page | PDF ]
[Hir13a]: L. Hirschi. Réduction d'entrelacements pour l'équivalence de traces. Research Report LSV-13-13, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2013. 22 pages.
[ BibTex | Web page | PDF ]
[BMS13b]: P. Bouyer, N. Markey, and O. Sankur. Robustness in timed automata. In Proceedings of the 7th Workshop on Reachability Problems in Computational Models (RP'13), volume 8169 of Lecture Notes in Computer Science, pages 1--18, Uppsala, Sweden, September 2013. Springer.
doi: 10.1007/978-3-642-41036-9_1.
[ BibTex | DOI | Web page | PDF ]
[Rei13]: J. Reichert. On The Complexity of Counter Reachability Games. In Proceedings of the 7th Workshop on Reachability Problems in Computational Models (RP'13), volume 8169 of Lecture Notes in Computer Science, pages 196--208, Uppsala, Sweden, September 2013. Springer.
doi: 10.1007/978-3-642-41036-9_18.
[ BibTex | DOI | Web page | PDF ]
[BHJL13]: B. Bérard, S. Haddad, A. Jovanovic, and D. Lime. Parametric Interrupt Timed Automata. In Proceedings of the 7th Workshop on Reachability Problems in Computational Models (RP'13), volume 8169 of Lecture Notes in Computer Science, pages 59--69, Uppsala, Sweden, September 2013. Springer.
doi: 10.1007/978-3-642-41036-9_7.
[ BibTex | DOI | Web page | PDF ]
[FS13c]: L. Fribourg and R. Soulat. Stability Controllers for Sampled Switched Systems. In Proceedings of the 7th Workshop on Reachability Problems in Computational Models (RP'13), volume 8169 of Lecture Notes in Computer Science, pages 135--145, Uppsala, Sweden, September 2013. Springer.
doi: 10.1007/978-3-642-41036-9_13.
[ BibTex | DOI | Web page | PDF ]
[SHL⁺13]: R. Soulat, G. Hérault, D. Labrousse, B. Revol, G. Feld, S. Lefebvre, and L. Fribourg. Use of a full wave correct-by-design command to control a multilevel modular converter. In Proceedings of the 15th European Conference on Power Electronics and Applications (EPE'13), Lille, France, September 2013. IEEE Power Electronics Society.
doi: 10.1109/EPE.2013.6634448.
[ BibTex | DOI | Web page | PDF ]
[KKS13]: S. Kremer, R. Künnemann, and G. Steel. Universally Composable Key-Management. In Proceedings of the 18th European Symposium on Research in Computer Security (ESORICS'13), volume 8134 of Lecture Notes in Computer Science, pages 327--344, Egham, U.K., September 2013. Springer.
doi: 10.1007/978-3-642-40203-6_19.
[ BibTex | DOI | Web page | PDF ]
[AtCK13]: S. Abiteboul, B. ten Cate, and Y. Katsis. On the equivalence of distributed systems with queries and communication. Journal of Computer and System Sciences, 79(6):739--762, September 2013.
doi: 10.1016/j.jcss.2013.01.001.
[ BibTex | DOI | Web page | PDF ]
[BDD13]: C. Barrett, S. Demri, and M. Deters. Witness runs for counter machines. In Proceedings of the 9th International Symposium on Frontiers of Combining Systems (FroCoS'13), volume 8152 of Lecture Notes in Artificial Intelligence, pages 120--150, Nancy, France, September 2013. Springer.
doi: 10.1007/978-3-642-40885-4_9.
[ BibTex | DOI | Web page | PDF ]
[Sta13]: D. Stan. Équilibres mixtes dans les jeux concurrents. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2013. 29 pages.
[ BibTex | Web page | PDF ]
[BF13]: V. Braberman and L. Fribourg, editors. Proceedings of the 11th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'13), volume 8053 of Lecture Notes in Computer Science, Buenos Aires, Argentina, August 2013. Springer.
[ BibTex | Web page ]
[BL13a]: S. Benedetto and G. Lipari. ADOK: A Minimal Object Oriented Real-Time Operating System in C++. In Proceedings of the 3rd Embedded Operating Systems Workshop (EWiLi'13), Toulouse, France, August 2013.
[ BibTex | Web page | PDF ]
[Gou13a]: J. Goubault-Larrecq. A Constructive Proof of the Topological Kruskal Theorem. In Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), volume 8087 of Lecture Notes in Computer Science, pages 22--41, Klosterneuburg, Austria, August 2013. Springer.
doi: 10.1007/978-3-642-40313-2_3.
[ BibTex | DOI | Web page | PDF ]
[LM13]: F. Laroussinie and N. Markey. Satisfiability of ATL with strategy contexts. In Proceedings of the 4th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'13), volume 119 of Electronic Proceedings in Theoretical Computer Science, pages 208--223, Borca di Cadore, Italy, August 2013.
doi: 10.4204/EPTCS.119.18.
[ BibTex | DOI | Web page | PDF ]
[SS13]: S. Schmitz and Ph. Schnoebelen. The Power of Well-Structured Systems. In Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), volume 8052 of Lecture Notes in Computer Science, pages 5--24, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40184-8_2.
[ BibTex | DOI | Web page | PDF ]
[ABHH13]: S. Akshay, N. Bertrand, S. Haddad, and L. Hélouët. The steady-state control problem for Markov decision processes. In Proceedings of the 10th International Conference on Quantitative Evaluation of Systems (QEST'13), pages 290--304, Buenos Aires, Argentina, August 2013. IEEE Computer Society Press.
doi: 10.1007/978-3-642-40196-1_26.
[ BibTex | DOI | Web page | PDF ]
[CJ13]: Th. Chatain and C. Jard. Back in Time Petri Nets. In Proceedings of the 11th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'13), volume 8053 of Lecture Notes in Computer Science, pages 91--105, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40229-6_7.
[ BibTex | DOI | Web page | PDF ]
[BMS13a]: P. Bouyer, N. Markey, and O. Sankur. Robust Weighted Timed Automata and Games. In Proceedings of the 11th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'13), volume 8053 of Lecture Notes in Computer Science, pages 31--46, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40229-6_3.
[ BibTex | DOI | Web page | PDF ]
[HSS13]: C. Haase, S. Schmitz, and Ph. Schnoebelen. The Power of Priority Channel Systems. In Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), volume 8052 of Lecture Notes in Computer Science, pages 319--333, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40184-8_23.
[ BibTex | DOI | Web page | PDF ]
[SBMR13]: O. Sankur, P. Bouyer, N. Markey, and P.-A. Reynier. Robust Controller Synthesis in Timed Automata. In Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), volume 8052 of Lecture Notes in Computer Science, pages 546--560, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40184-8_38.
[ BibTex | DOI | Web page | PDF ]
[FGH13]: A. Finkel, S. Göller, and C. Haase. Reachability in Register Machines with Polynomial Updates. In Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), volume 8087 of Lecture Notes in Computer Science, pages 409--420, Klosterneuburg, Austria, August 2013. Springer.
doi: 10.1007/978-3-642-40313-2_37.
[ BibTex | DOI | Web page | PS | PDF ]
[Dem13]: S. Demri. On selective unboundedness of VASS. Journal of Computer and System Sciences, 79(5):689--713, August 2013.
doi: 10.1016/j.jcss.2013.01.014.
[ BibTex | DOI | Web page | PDF ]
[Hir13b]: L. Hirschi. Reduction of interleavings for trace equivalence checking of security protocols. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, August 2013.
[ BibTex ]
[Fan13]: E. Fang. Permissive multi-strategies in timed games. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, August 2013.
[ BibTex ]
[GLS13a]: A. Gheerbrant, L. Libkin, and C. Sirangelo. Reasoning About Pattern-Based XML Queries. In Proceedings of the 7th International Conference on Web Reasoning and Rule Systems (WRRS'13), volume 7994 of Lecture Notes in Computer Science, pages 4--18, Mannheim, Germany, July 2013. Springer.
doi: 10.1007/978-3-642-39666-3_2.
[ BibTex | DOI | Web page | PDF ]
[FS13a]: L. Fribourg and R. Soulat. Control of Switching Systems by Invariance Analysis: Application to Power Electronics. Wiley-ISTE, July 2013. 144 pages.
[ BibTex | Web page ]
[RS13b]: C. Rodríguez and S. Schwoon. An Improved Construction of Petri Net Unfoldings. In Proceedings of the 1st French-Singaporean Workshop on Formal Methods and Applications (FSFMA'13), volume 31 of Open Access Series in Informatics, pages 47--52, Singapore, July 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.FSFMA.2013.47.
[ BibTex | DOI | Web page | PDF ]
[HMY13]: S. Haddad, L. Mokdad, and S. Youcef. Bounding models families for performance evaluation in composite Web services. Journal of Computational Science, 4(4):232--241, July 2013.
doi: 10.1016/j.jocs.2011.11.003.
[ BibTex | DOI | Web page | PDF ]
[DDS13]: S. Demri, A. K. Dhar, and A. Sangnier. On the Complexity of Verifying Regular Properties on Flat Counter Systems. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP'13) -- Part II, volume 7966 of Lecture Notes in Computer Science, pages 162--173, Riga, Latvia, July 2013. Springer.
doi: 10.1007/978-3-642-39212-2_17.
[ BibTex | DOI | Web page | PDF ]
[Fri13]: L. Fribourg. Control of Switching Systems by Invariance Analysis (Invited Talk). In Proceedings of the 1st French-Singaporean Workshop on Formal Methods and Applications (FSFMA'13), volume 31 of Open Access Series in Informatics, page 1, Singapore, July 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.FSFMA.2013.1.
[ BibTex | DOI | Web page | PDF ]
[FKS13]: L. Fribourg, U. Kühne, and R. Soulat. Constructing Attractors of Nonlinear Dynamical Systems by State Space Decomposition. In Proceedings of the 1st French-Singaporean Workshop on Formal Methods and Applications (FSFMA'13), volume 31 of Open Access Series in Informatics, pages 53--60, Singapore, July 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.FSFMA.2013.53.
[ BibTex | DOI | Web page | PDF ]
[AHH⁺13]: É. André, L. M. Hillah, F. Hulin-Hubard, F. Kordon, Y. Lembachar, A. Linard, and L. Petrucci. CosyVerif: An Open Source Extensible Verification Environment. In Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'13), pages 33--36, Singapore, July 2013. IEEE Computer Society Press.
doi: 10.1109/ICECCS.2013.15.
[ BibTex | DOI | Web page | PDF ]
[HRS13]: S. Haar, C. Rodríguez, and S. Schwoon. Reveal Your Faults: It's Only Fair! In Proceedings of the 13th International Conference on Application of Concurrency to System Design (ACSD'13), pages 120--129, Barcelona, Spain, July 2013. IEEE Computer Society Press.
doi: 10.1109/ACSD.2013.15.
[ BibTex | DOI | Web page | PDF ]
[HKS13]: S. Haar, C. Kern, and S. Schwoon. Computing the Reveals Relation in Occurrence Nets. Theoretical Computer Science, 493:66--79, July 2013.
doi: 10.1016/j.tcs.2013.04.028.
[ BibTex | DOI | Web page | PDF ]
[McK13]: P. McKenzie. Can chimps go it alone? In Proceedings of the 15th Workshop on Descriptional Complexity of Formal Systems (DCFS'13), volume 8031 of Lecture Notes in Computer Science, page 17, London, Ontario, Canada, July 2013. Springer-Verlag.
doi: 10.1007/978-3-642-39310-5_3.
[ BibTex | DOI | Web page | PDF ]
[CCD13b]: R. Chrétien, V. Cortier, and S. Delaune. From security protocols to pushdown automata. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP'13) -- Part II, volume 7966 of Lecture Notes in Computer Science, pages 137--149, Riga, Latvia, July 2013. Springer.
doi: 10.1007/978-3-642-39212-2_15.
[ BibTex | DOI | Web page | PDF ]
[CCP13]: V. Cheval, V. Cortier, and A. Plet. Lengths may break privacy ---or how to check for equivalences with length. In Proceedings of the 25th International Conference on Computer Aided Verification (CAV'13), volume 8044 of Lecture Notes in Computer Science, pages 708--723, Saint Petersburg, Russia, July 2013. Springer.
doi: 10.1007/978-3-642-39799-8_50.
[ BibTex | DOI | Web page | PDF ]
[HIOP13]: C. Haase, S. Ishtiaq, J. Ouaknine, and M. Parkinson. SeLoger: A Tool for Graph-Based Reasoning in Separation Logic. In Proceedings of the 25th International Conference on Computer Aided Verification (CAV'13), volume 8044 of Lecture Notes in Computer Science, pages 790--795, Saint Petersburg, Russia, July 2013. Springer.
doi: 10.1007/978-3-642-39799-8_55.
[ BibTex | DOI | Web page | PDF ]
[San13b]: O. Sankur. Shrinktech: A Tool for the Robustness Analysis of Timed Automata. In Proceedings of the 25th International Conference on Computer Aided Verification (CAV'13), volume 8044 of Lecture Notes in Computer Science, pages 1006--1012, Saint Petersburg, Russia, July 2013. Springer.
doi: 10.1007/978-3-642-39799-8_72.
[ BibTex | DOI | Web page | PDF ]
[Bre13]: R. Brenguier. PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games. In Proceedings of the 25th International Conference on Computer Aided Verification (CAV'13), volume 8044 of Lecture Notes in Computer Science, pages 890--895, Saint Petersburg, Russia, July 2013. Springer.
doi: 10.1007/978-3-642-39799-8_63.
[ BibTex | DOI | Web page | PDF ]
[Gou13b]: J. Goubault-Larrecq. A few pearls in the theory of quasi-metric spaces. Invited talk (semi-plenary speaker), Summer Topology Conference, North Bay, Ontario, CA, July 2013.
[ BibTex ]
[Gou13e]: J. Goubault-Larrecq. A short proof of the Schröder-Simpson theorem. Invited talk, Workshop on Asymmetric Topology, Summer Topology Conference, North Bay, Ontario, CA, July 2013.
[ BibTex ]
[ABG13]: S. Akshay, B. Bollig, and P. Gastin. Event-clock Message Passing Automata: A Logical Characterization and an Emptiness-Checking Algorithm. Formal Methods in System Design, 42(3):262--300, June 2013.
doi: 10.1007/s10703-012-0179-8.
[ BibTex | DOI | Web page | PDF ]
[GS13]: P. Gastin and N. Sznajder. Fair Synthesis for Asynchronous Distributed Systems. ACM Transactions on Computational Logic, 14(2:9), June 2013.
doi: 10.1145/2480759.2480761.
[ BibTex | DOI | Web page | PDF ]
[AAM⁺13]: S. Abiteboul, É. Antoine, G. Miklau, J. Stoyanovich, and J. Testard. Rule-based application development using Webdamlog. In Proceedings of the ACM SIGMOD Internaitonal Conference on Management of Data (SIGMOD'13), pages 965--968, New York, New York, USA, June 2013. ACM Press.
doi: 10.1145/2463676.2465251.
[ BibTex | DOI | Web page | PDF ]
[BD13]: K. Bansal and S. Demri. Model-checking bounded multi-pushdown systems. In Proceedings of the 8th International Computer Science Symposium in Russia (CSR'13), volume 7913 of Lecture Notes in Computer Science, pages 405--417, Ekaterinburg, Russia, June 2013. Springer.
doi: 10.1007/978-3-642-38536-0_35.
[ BibTex | DOI | Web page | PDF ]
[VM13a]: S. Valette and N. Markey. Cassting website. Cassting deliverable D6.1 (FP7-ICT-601148), June 2013. 10 pages.
[ BibTex | Web page | PDF ]
[CH13]: Th. Chatain and S. Haar. A Canonical Contraction for Safe Petri Nets. In Proceedings of the 7th International Workshop on Petri Nets and Software Engineering (PNSE'13), volume 969 of CEUR Workshop Proceedings, pages 25--39, Milano, Italy, June 2013. RWTH Aachen, Germany.
[ BibTex | Web page | PDF ]
[GHPR13]: G. Geeraerts, A. Heußner, M. Praveen, and J.-F. Raskin. ω-Petri nets. In Proceedings of the 34th International Conference on Applications and Theory of Petri Nets (PETRI NETS'13), volume 7927 of Lecture Notes in Computer Science, pages 49--69, Milano, Italy, June 2013. Springer.
doi: 10.1007/978-3-642-38697-8_4.
[ BibTex | DOI | Web page | PDF ]
[BST13]: M. Bojańczyk, L. Segoufin, and S. Toruńczyk. Verification of Database-driven Systems via Amalgamation. In Proceedings of the 32nd Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'13), pages 63--74, New York, New York, USA, June 2013. ACM Press.
doi: 10.1145/2463664.2465228.
[ BibTex | DOI | Web page | PDF ]
[GLS13b]: A. Gheerbrant, L. Libkin, and C. Sirangelo. When is Naïve Evaluation Possible? In Proceedings of the 32nd Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'13), pages 75--86, New York, New York, USA, June 2013. ACM Press.
doi: 10.1145/2463664.2463674.
[ BibTex | DOI | Web page | PDF ]
[AV13a]: S. Abiteboul and V. Vianu. Collaborative Data-Driven Workflows: Think Global, Act Local. In Proceedings of the 32nd Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'13), pages 91--102, New York, New York, USA, June 2013. ACM Press.
doi: 10.1145/2463664.2463672.
[ BibTex | DOI | Web page | PDF ]
[KS13b]: W. Kazana and L. Segoufin. Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion. In Proceedings of the 32nd Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'13), pages 297--308, New York, New York, USA, June 2013. ACM Press.
doi: 10.1145/2463664.2463667.
[ BibTex | DOI | Web page | PDF ]
[CCD13a]: V. Cheval, V. Cortier, and S. Delaune. Deciding equivalence-based properties using constraint solving. Theoretical Computer Science, 492:1--39, June 2013.
doi: 10.1016/j.tcs.2013.04.016.
[ BibTex | DOI | Web page | PDF ]
[CCS13]: H. Comon-Lundh, V. Cortier, and G. Scerri. Tractable inference systems: an extension with a deducibility predicate. In Proceedings of the 24th International Conference on Automated Deduction (CADE'13), volume 7898 of Lecture Notes in Artificial Intelligence, pages 91--108, Lake Placid, New York, USA, June 2013. Springer.
doi: 10.1007/978-3-642-38574-2_6.
[ BibTex | DOI | Web page | PDF ]
[BKM13]: B. Bollig, D. Kuske, and R. Mennicke. The Complexity of Model Checking Multi-Stack Systems. In Proceedings of the 28th Annual IEEE Symposium on Logic in Computer Science (LICS'13), pages 163--170, New-Orleans, Louisiana, USA, June 2013. IEEE Computer Society Press.
doi: 10.1109/LICS.2013.22.
[ BibTex | DOI | Web page | PDF ]
[DFP13]: S. Demri, D. Figueira, and M. Praveen. Reasoning about Data Repetitions with Counter Systems. In Proceedings of the 28th Annual IEEE Symposium on Logic in Computer Science (LICS'13), pages 33--42, New-Orleans, Louisiana, USA, June 2013. IEEE Computer Society Press.
doi: 10.1109/LICS.2013.8.
[ BibTex | DOI | Web page | PDF ]
[BS13d]: A. Boral and S. Schmitz. Model Checking Parse Trees. In Proceedings of the 28th Annual IEEE Symposium on Logic in Computer Science (LICS'13), pages 153--162, New-Orleans, Louisiana, USA, June 2013. IEEE Computer Society Press.
doi: 10.1109/LICS.2013.21.
[ BibTex | DOI | Web page | PDF ]
[BHLM13]: B. Bollig, P. Habermehl, M. Leucker, and B. Monmege. A Fresh Approach to Learning Register Automata. In Proceedings of the 17th International Conference on Developments in Language Theory (DLT'13), volume 7907 of Lecture Notes in Computer Science, pages 118--130, Marne-la-Vallée, France, June 2013. Springer.
doi: 10.1007/978-3-642-38771-5_12.
[ BibTex | DOI | Web page | PDF ]
[RSK13]: C. Rodríguez, S. Schwoon, and V. Khomenko. Contextual Merged Processes. In Proceedings of the 34th International Conference on Applications and Theory of Petri Nets (PETRI NETS'13), volume 7927 of Lecture Notes in Computer Science, pages 29--48, Milano, Italy, June 2013. Springer.
doi: 10.1007/978-3-642-38697-8_3.
[ BibTex | DOI | Web page | PDF ]
[FH13]: E. Fraca and S. Haddad. Complexity Analysis of Continuous Petri Nets. In Proceedings of the 34th International Conference on Applications and Theory of Petri Nets (PETRI NETS'13), volume 7927 of Lecture Notes in Computer Science, pages 170--189, Milano, Italy, June 2013. Springer.
doi: 10.1007/978-3-642-38697-8_10.
[ BibTex | DOI | Web page | PDF ]
[HHM13]: S. Haddad, R. Hennicker, and M. H. Møller. Channel Properties of Asynchronously Composed Petri Nets. In Proceedings of the 34th International Conference on Applications and Theory of Petri Nets (PETRI NETS'13), volume 7927 of Lecture Notes in Computer Science, pages 369--388, Milano, Italy, June 2013. Springer.
doi: 10.1007/978-3-642-38697-8_20.
[ BibTex | DOI | Web page | PDF ]
[AR13]: A. Arul and J. Reichert. The Complexity of Robot Games on the Integer Line. In Proceedings of the 11th International Workshop on Quantitative Aspects of Programming Languages (QAPl'13), volume 117 of Electronic Proceedings in Theoretical Computer Science, pages 132--148, Rome, Italy, June 2013.
doi: 10.4204/EPTCS.117.9.
[ BibTex | DOI | Web page | PDF ]
[BS13b]: N. Bertrand and Ph. Schnoebelen. Solving stochastic Büchi games on infinite arenas with a finite attractor. In Proceedings of the 11th International Workshop on Quantitative Aspects of Programming Languages (QAPl'13), volume 117 of Electronic Proceedings in Theoretical Computer Science, pages 116--131, Rome, Italy, June 2013.
doi: 10.4204/EPTCS.117.8.
[ BibTex | DOI | Web page | PDF ]
[Gou13d]: J. Goubault-Larrecq. OrchIDS, ou : de l'importance de la sémantique. Séminaire DGA Innosciences. DGA, Bagneux, June 2013.
[ BibTex ]
[BCH13a]: S. Balaguer, Th. Chatain, and S. Haar. Building Occurrence Nets from Reveals Relations. Fundamenta Informaticae, 123(3):245--272, May 2013.
doi: 10.3233/FI-2013-809.
[ BibTex | DOI | Web page | PDF ]
[FS13b]: L. Fribourg and R. Soulat. Limit Cycles of Controlled Switched Systems: Existence, Stability, Sensitivity. In Proceedings of the 3rd International Workshop on New Computational Methods for Inverse Problems (NCMIP'13), volume 464 of Journal of Physics: Conference Series, Cachan, France, May 2013. IOS Press.
doi: 10.1088/1742-6596/464/1/012007.
[ BibTex | DOI | Web page | PDF ]
[San13a]: O. Sankur. Robustness in Timed Automata: Analysis, Synthesis, Implementation. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, May 2013.
[ BibTex | Web page | PDF ]
[ABB⁺13]: E. G. Amparore, B. Barbot, M. Beccuti, S. Donatelli, and G. Franceschinis. Simulation-based Verification of Hybrid Automata Stochastic Logic Formulas for Stochastic Symmetric Nets. In Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation (PADS'13), pages 253--264, Montreal, Canada, May 2013. ACM Press.
doi: 10.1145/2486092.2486124.
[ BibTex | DOI | Web page | PDF ]
[AFS13b]: É. André, L. Fribourg, and J. Sproston. An Extension of the Inverse Method to Probabilistic Timed Automata. Formal Methods in System Design, 42(2):119--145, April 2013.
doi: 10.1007/s10703-012-0169-x.
[ BibTex | DOI | Web page | PDF ]
[VM13b]: S. Valette and N. Markey. Minutes of the Kick-Off Meeting. Cassting deliverable D6.1 (FP7-ICT-601148), April 2013. 9 pages.
[ BibTex | Web page | PDF ]
[BCG⁺13]: L. Barguñó, C. Creus, G. Godoy, F. Jacquemard, and C. Vacher. Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories. Logical Methods in Computer Science, 9(2), April 2013.
doi: 10.2168/LMCS-9(2:1)2013.
[ BibTex | DOI | Web page | PDF ]
[BCH⁺13c]: B. Bollig, A. Cyriac, L. Hélouët, A. Kara, and Th. Schwentick. Dynamic Communicating Automata and Branching High-Level MSCs. In Proceedings of the 7th International Conference on Language and Automata Theory and Applications (LATA'13), volume 7810 of Lecture Notes in Computer Science, pages 177--189, Bilbao, Spain, April 2013. Springer.
doi: 10.1109/REVET.2012.6195253.
[ BibTex | DOI | Web page | PDF ]
[CB13]: V. Cheval and B. Blanchet. Proving More Observational Equivalences with ProVerif. In Proceedings of the 2nd International Conference on Principles of Security and Trust (POST'13), volume 7796 of Lecture Notes in Computer Science, pages 226--246, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-36830-1_12.
[ BibTex | DOI | Web page | PDF ]
[CD13a]: R. Chrétien and S. Delaune. Formal analysis of privacy for routing protocols in mobile ad hoc networks. In Proceedings of the 2nd International Conference on Principles of Security and Trust (POST'13), volume 7796 of Lecture Notes in Computer Science, pages 1--20, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-36830-1_1.
[ BibTex | DOI | Web page | PDF ]
[BFHR13]: R. Bonnet, A. Finkel, S. Haddad, and F. Rosa-Velardo. Ordinal Theory for Expressiveness of Well-Structured Transition Systems. Information and Computation, 224:1--22, March 2013.
doi: 10.1016/j.ic.2012.11.003.
[ BibTex | DOI | Web page | PDF ]
[Gou13c]: J. Goubault-Larrecq. Non-Hausdorff Topology and Domain Theory---Selected Topics in Point-Set Topology, volume 22 of New Mathematical Monographs. Cambridge University Press, March 2013.
[ BibTex | Web page ]
[BC13b]: R. Bonnet and R. Chadha. Bounded Context-Switching and Reentrant Locking. In Proceedings of the 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'13), volume 7794 of Lecture Notes in Computer Science, pages 65--80, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-37075-5_5.
[ BibTex | DOI ]
[LGBB13]: G. Lipari, L. George, E. Bini, and M. Bertogna. On the Average Complexity of the Processor Demand Analysis for Earliest Deadline Scheduling. In Real-Time Sytems: the past, the present, and the future -- Proceedings of a conference organized in celebration of Professor Alan Burns' sixtieth birthday, pages 75--86, York, UK, March 2013. CreateSpace Independent Publishing Platform.
[ BibTex | Web page | PDF ]
[LB13]: G. Lipari and G. Buttazzo. Resource reservation for Mixed Criticality Systems. In Real-Time Sytems: the past, the present, and the future -- Proceedings of a conference organized in celebration of Professor Alan Burns' sixtieth birthday, pages 60--74, York, UK, March 2013. CreateSpace Independent Publishing Platform.
[ BibTex | Web page | PDF ]
[DKN⁺13]: M. Duflot, M. Kwiatkowska, G. Norman, D. Parker, S. Peyronnet, C. Picaronny, and J. Sproston. Practical Applications of Probabilistic Model Checking to Communication Protocols. In Formal Methods for Industrial Critical Systems: A Survey of Applications, chapter 7, pages 133--150. John Wiley & Sons, Ltd. and IEEE Computer Society Press, March 2013.
doi: 10.1002/9781118459898.ch7.
[ BibTex | DOI | Web page | PDF ]
[ABMW13]: S. Abiteboul, P. Bourhis, A. Muscholl, and Z. Wu. Recursive queries on trees and data trees. In Proceedings of the 16th International Conference on Database Theory (ICDT'13), pages 93--104, Genoa, Italy, March 2013. ACM Press.
doi: 10.1145/2448496.2448509.
[ BibTex | DOI | Web page | PDF ]
[BGM13]: B. Bollig, P. Gastin, and B. Monmege. Weighted Specifications over Nested Words. In Proceedings of the 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'13), volume 7794 of Lecture Notes in Computer Science, pages 385--400, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-37075-5_25.
[ BibTex | DOI | Web page | PDF ]
[BNS13]: E. Bertsch, M.-J. Nederhof, and S. Schmitz. On LR Parsing with Selective Delays. In Proceedings of the 22nd International Conference on Compiler Construction (CC'13), volume 7791 of Lecture Notes in Computer Science, pages 244--263, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-37051-9_13.
[ BibTex | DOI | Web page | PDF ]
[KS13a]: P. Karandikar and S. Schmitz. The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. In Proceedings of the 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'13), volume 7794 of Lecture Notes in Computer Science, pages 273--288, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-37075-5_18.
[ BibTex | DOI | Web page | PDF ]
[Fin13]: A. Finkel. REACHARD -- Compte-rendu intermédiaire. Deliverable D2 Reachard (ANR-11-BS02-001), March 2013. 9 pages.
[ BibTex ]
[BCH⁺13b]: B. Bérard, F. Cassez, S. Haddad, D. Lime, and O. H. Roux. The Expressive Power of Time Petri Nets. Theoretical Computer Science, 474:1--20, February 2013.
doi: 10.1016/j.tcs.2012.12.005.
[ BibTex | DOI | Web page | PDF ]
[BCD13]: M. Baudet, V. Cortier, and S. Delaune. YAPA: A generic tool for computing intruder knowledge. ACM Transactions on Computational Logic, 14(1:4), February 2013.
doi: 10.1145/2422085.2422089.
[ BibTex | DOI | Web page | PDF ]
[FK13]: L. Fribourg and U. Kühne. Parametric Verification and Test Coverage for Hybrid Automata using the Inverse Method. International Journal of Foundations of Computer Science, 24(2):233--249, February 2013.
doi: 10.1142/S0129054113400091.
[ BibTex | DOI | Web page | PDF ]
[HM13]: S. Haar and T. Masopust. Languages, Decidability, and Complexity. In Control of Discrete-Event Systems -- Automata and Petri Net Perspectives, volume 433 of Lecture Notes in Control and Information Sciences, pages 23--43. Springer, 2013.
doi: 10.1007/978-1-4471-4276-8_2.
[ BibTex | DOI | Web page | PDF ]
[HF13]: S. Haar and É. Fabre. Diagnosis with Petri Net Unfoldings. In Control of Discrete-Event Systems -- Automata and Petri Net Perspectives, volume 433 of Lecture Notes in Control and Information Sciences, pages 301--318. Springer, 2013.
doi: 10.1007/978-1-4471-4276-8_15.
[ BibTex | DOI | Web page | PDF ]
[BBL⁺13]: B. Bérard, P. Bouyer, K. G. Larsen, N. Markey, J. Mullins, O. Sankur, M. Sassolas, and C. Thrane. Measuring the robustness. Deliverable ImpRo 3.1, (ANR-10-BLAN-0317), January 2013. 59 pages.
[ BibTex | Web page | PDF ]
[BFH⁺13]: P. Bouyer, S. Faucou, S. Haar, A. Jovanivić, D. Lime, N. Markey, O. H. Roux, and O. Sankur. Control tasks for Timed System; Robustness issues. Deliverable ImpRo 5.1, (ANR-10-BLAN-0317), January 2013. 34 pages.
[ BibTex | Web page | PDF ]
[AS13]: É. André and R. Soulat. The Inverse Method. Wiley-ISTE, January 2013. 176 pages.
[ BibTex | Web page ]
[HMN13]: S. Haddad, J. Mairesse, and H.-T. Nguyen. Synthesis and Analysis of Product-form Petri Nets. Fundamenta Informaticae, 122(1-2):147--172, 2013.
doi: 10.3233/FI-2013-786.
[ BibTex | DOI | Web page | PDF ]
[GJ13]: J. Goubault-Larrecq and J.-P. Jouannaud. The Blossom of Finite Semantic Trees. In Programming Logics -- Essays in Memory of Harald Ganzinger, volume 7797 of Lecture Notes in Computer Science, pages 90--122. Springer, January 2013.
[ BibTex | Web page | PDF ]
[Bon13]: R. Bonnet. Theory of Well-Structured Transition Systems and Extended Vector-Addition Systems. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2013.
[ BibTex | Web page | PDF ]
[DR13]: L. Doyen and A. Rabinovich. Robot games. Research Report LSV-13-02, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2013. 2 pages.
[ BibTex | Web page | PDF ]
[Haa12]: S. Haar. What topology tells us about diagnosability in partial order semantics. Discrete Event Dynamic Systems: Theory and Applications, 22(4):383--402, December 2012.
doi: 10.1007/s10626-011-0121-z.
[ BibTex | DOI | Web page | PDF ]
[CU12]: R. Chadha and M. Ummels. The complexity of quantitative information flow in recursive programs. In Proceedings of the 32nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'12), volume 18 of Leibniz International Proceedings in Informatics, pages 534--545, Hyderabad, India, December 2012. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2012.534.
[ BibTex | DOI | Web page | PDF ]
[Ben12b]: H. Benzina. Enforcing Virtualized Systems Security. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012.
[ BibTex | Web page | PDF ]
[Bal12]: S. Balaguer. La concurrence dans les systèmes distribués temps-réel. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012.
[ BibTex | Web page | PDF ]
[FFL⁺12b]: G. Feld, L. Fribourg, D. Labrousse, B. Revol, and R. Soulat. Correct-by-Design Control of 5-level and 7-level Power Converters. Research Report LSV-12-25, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012. 8 pages.
[ BibTex | Web page | PDF ]
[FS12]: L. Fribourg and R. Soulat. Controlled Recurrent Subspaces for Sampled Switched Linear Systems. Research Report LSV-12-24, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012. 11 pages.
[ BibTex | Web page | PDF ]
[Ves12]: S. Vester. Symmetric Nash equilibria. Research Report LSV-12-23, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012. 51 pages.
[ BibTex | Web page | PDF ]
[Che12]: V. Cheval. Automatic verification of cryptographic protocols: privacy-type properties. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012.
[ BibTex | Web page | PDF ]
[CFM12b]: M. Cadilhac, A. Finkel, and P. McKenzie. Bounded Parikh automata. International Journal of Foundations of Computer Science, 23(8):1691--1710, December 2012.
doi: 10.1142/S0129054112400709.
[ BibTex | DOI | Web page | PDF ]
[BGKR12]: D. Berwanger, E. Grädel, L. Kaiser, and R. Rabinovich. Entanglement and the complexity of directed graphs. Theoretical Computer Science, 463:2--25, December 2012.
doi: 10.1016/j.tcs.2012.07.010.
[ BibTex | DOI | Web page | PDF ]
[BFP12]: R. Bonnet, A. Finkel, and M. Praveen. Extending the Rackoff technique to affine nets. In Proceedings of the 32nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'12), volume 18 of Leibniz International Proceedings in Informatics, Hyderabad, India, December 2012. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2012.301.
[ BibTex | DOI | Web page | PDF ]
[BS12]: D. Berwanger and O. Serre. Parity games on undirected graphs. Information Processing Letters, 112(23):928--932, December 2012.
doi: 10.1016/j.ipl.2012.08.021.
[ BibTex | DOI | Web page | PDF ]
[GS12]: P. Gastin and N. Sznajder. Decidability of well-connectedness for distributed synthesis. Information Processing Letters, 112(24):963--968, December 2012.
doi: 10.1016/j.ipl.2012.08.018.
[ BibTex | DOI | Web page | PDF ]
[BDF12]: A. Bušić, H. Djafri, and J.-M. Fourneau. Bounded state space truncation and censored Markov chains. In Proceedings of the 51st IEEE Conference on Decision and Control (CDC'12), pages 5828--5833, Maui, Hawaii, USA, December 2012. IEEE Control System Society.
doi: 10.1109/CDC.2012.6426156.
[ BibTex | DOI | Web page | PDF ]
[AvMSS12]: M. Anderson, D. van Melkebeek, N. Schweikardt, and L. Segoufin. Locality from Circuit Lower Bounds. SIAM Journal on Computing, 41(6):1481--1523, November 2012.
doi: 10.1137/110856873.
[ BibTex | DOI | Web page | PDF ]
[Bre12]: R. Brenguier. Équilibres de Nash dans les Jeux Concurrents -- Application aux Jeux Temporisés. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2012.
[ BibTex | Web page | PDF ]
[BHP12b]: B. Barbot, S. Haddad, and C. Picaronny. Importance Sampling for Model Checking of Continuous Time Markov Chains. In Proceedings of the 4th International Conference on Advances in System Simulation (SIMUL'12), pages 30--35, Lisbon, Portugal, November 2012. XPS.
[ BibTex | Web page | PDF ]
[CD12c]: K. Chatterjee and L. Doyen. Energy parity games. Theoretical Computer Science, 458:49--60, November 2012.
doi: 10.1016/j.tcs.2012.07.038.
[ BibTex | DOI | Web page | PDF ]
[FLC12]: D. Faggioli, G. Lipari, and T. Cucinotta. Analysis and Implementation of the Multiprocessor Bandwidth Inheritance Protocol. Real-Time Systems, 48(6):789--825, November 2012.
doi: 10.1007/s11241-012-9162-0.
[ BibTex | DOI | Web page | PDF ]
[DDG12]: S. Demri, D. D'Souza, and R. Gascon. Temporal Logics of Repeating Values. Journal of Logic and Computation, 22(5):1059--1096, October 2012.
doi: 10.1093/logcom/exr013.
[ BibTex | DOI | Web page | PDF ]
[CFM12a]: M. Cadilhac, A. Finkel, and P. McKenzie. Affine Parikh automata. RAIRO Informatique Théorique et Applications, 46(4):511--545, October 2012.
doi: 10.1051/ita/2012013.
[ BibTex | DOI | Web page | PDF ]
[DDMM12]: Ph. Darondeau, S. Demri, R. Meyer, and Ch. Morvan. Petri Net Reachability Graphs: Decidability Status of FO Properties. Logical Methods in Computer Science, 8(4:9), October 2012.
doi: 10.2168/LMCS-8(4:9)2012.
[ BibTex | DOI | Web page | PDF ]
[AG12]: A. Adjé and J. Goubault-Larrecq. Concrete Semantics of Programs with Non-Deterministic and Random Inputs. Research Report cs.LO/1210.2605, Computing Research Repository, October 2012. 19 pages.
[ BibTex | Web page | PDF ]
[BGMZ12]: B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. A Probabilistic Kleene Theorem. In Proceedings of the 10th International Symposium on Automated Technology for Verification and Analysis (ATVA'12), volume 7561 of Lecture Notes in Computer Science, pages 400--415, Thiruvananthapuram, India, October 2012. Springer.
doi: 10.1007/978-3-642-33386-6_31.
[ BibTex | DOI | Web page | PDF ]
[SVMdM12]: D. V. Simões De Sousa, H. Viana, N. Markey, and J. A. F. de Macêdo. Querying Trajectories through Model Checking based on Timed Automata. In Proceedings of the 27th Brazilian Symposium on Databases (SBBD'12), São Paulo, Brazil, October 2012. Sociedade Brasileira de Computação.
[ BibTex | Web page | PDF ]
[AGL12]: A. Adjé and J. Goubault-Larrecq. Concrete semantics of programs with non-deterministic and random inputs. Fourniture du projet ANR CPP (Confidence, Proofs, and Probabilities), WP 2, version 1, October 2012.
[ BibTex | Web page ]
[FG12a]: A. Finkel and J. Goubault-Larrecq. Forward Analysis for WSTS, Part II: Complete WSTS. Logical Methods in Computer Science, 8(3:28), September 2012.
doi: 10.2168/LMCS-8(3:28)2012.
[ BibTex | DOI | Web page | PDF ]
[Abi12b]: S. Abiteboul. Sharing Distributed Knowledge on the Web (Invited Talk). In Proceedings of the 21st Annual EACSL Conference on Computer Science Logic (CSL'12), volume 16 of Leibniz International Proceedings in Informatics, pages 6--8, Fontainebleau, France, September 2012. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2012.6.
[ BibTex | DOI | Web page | PDF ]
[BSS12]: M. Bojańczyk, L. Segoufin, and H. Straubing. Piecewise testable tree languages. Logical Methods in Computer Science, 8(3:26), September 2012.
doi: 10.2168/LMCS-8(3:26)2012.
[ BibTex | DOI | Web page | PDF ]
[Chr12]: R. Chrétien. Trace equivalence of protocols for an unbounded number of sessions. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2012. 30 pages.
[ BibTex | Web page | PDF ]
[KS12b]: R. Künnemann and G. Steel. YubiSecure? Formal Security Analysis Results for the Yubikey and YubiHSM. In Revised Selected Papers of the 8th Workshop on Security and Trust Management (STM'12), volume 7783 of Lecture Notes in Computer Science, pages 257--272, Pisa, Italy, September 2012. Springer.
doi: 10.1007/978-3-642-38004-4_17.
[ BibTex | DOI | Web page | PDF ]
[FLP12]: A. Finkel, J. Leroux, and I. Potapov, editors. Proceedings of the 6th International Wokshop on Reachability Problems (RP'12), volume 7550 of Lecture Notes in Computer Science, Bordeaux, France, September 2012. Springer.
doi: 10.1007/978-3-642-33512-9.
[ BibTex | DOI | Web page ]
[SLBC12]: R. M. Santos, G. Lipari, E. Bini, and T. Cucinotta. On-line schedulability tests for adaptive reservations in fixed priority scheduling. Real-Time Systems, 48(5):601--634, September 2012.
doi: 10.1007/s11241-012-9156-y.
[ BibTex | DOI | Web page | PDF ]
[JKS12]: P. Jančar, P. Karandikar, and Ph. Schnoebelen. Unidirectional channel systems can be tested. In Proceedings of the 7th IFIP International Conference on Theoretical Computer Science (IFIP TCS'12), volume 7604 of Lecture Notes in Computer Science, pages 149--163, Amsterdam, The Netherlands, September 2012. Springer.
doi: 10.1007/978-3-642-33475-7_11.
[ BibTex | DOI | Web page | PDF ]
[RS12]: C. Rodríguez and S. Schwoon. Verification of Petri Nets with Read Arcs. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 471--485, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_33.
[ BibTex | DOI | Web page | PDF ]
[CGNK12]: A. Cyriac, P. Gastin, and K. Narayan Kumar. MSO Decidability of Multi-Pushdown Systems via Split-Width. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 547--561, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_38.
[ BibTex | DOI | Web page | PDF ]
[BGS12]: R. Brenguier, S. Göller, and O. Sankur. A Comparison of Succinctly Represented Finite-State Systems. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 147--161, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_12.
[ BibTex | DOI | Web page | PDF ]
[BHSS12]: B. Bérard, S. Haddad, M. Sassolas, and N. Sznajder. Concurrent Games on VASS with Inhibition. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 39--52, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_5.
[ BibTex | DOI | Web page | PDF ]
[BC12a]: S. Balaguer and Th. Chatain. Avoiding Shared Clocks in Networks of Timed Automata. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 100--114, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_9.
[ BibTex | DOI | Web page | PDF ]
[DLM12]: A. Da Costa, F. Laroussinie, and N. Markey. Quantified CTL: expressiveness and model checking. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 177--192, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_14.
[ BibTex | DOI | Web page | PDF ]
[FLMS12]: L. Fribourg, D. Lesens, P. Moro, and R. Soulat. Robustness Analysis for Scheduling Problems using the Inverse Method. In Proceedings of the 19th International Symposium on Temporal Representation and Reasoning (TIME'12), pages 73--80, Leicester, UK, September 2012. IEEE Computer Society Press.
doi: 10.1109/TIME.2012.10.
[ BibTex | DOI | Web page | PDF ]
[BBJM12]: P. Bouyer, Th. Brihaye, M. Jurdziński, and Q. Menet. Almost-Sure Model-Checking of Reactive Timed Automata. In Proceedings of the 9th International Conference on Quantitative Evaluation of Systems (QEST'12), pages 138--147, London, UK, September 2012. IEEE Computer Society Press.
doi: 10.1109/QEST.2012.10.
[ BibTex | DOI | Web page | PDF ]
[BLM12]: P. Bouyer, K. G. Larsen, and N. Markey. Lower-Bound Constrained Runs in Weighted Timed Automata. In Proceedings of the 9th International Conference on Quantitative Evaluation of Systems (QEST'12), pages 128--137, London, UK, September 2012. IEEE Computer Society Press.
doi: 10.1109/QEST.2012.28.
[ BibTex | DOI | Web page | PDF ]
[CFM12c]: M. Cadilhac, A. Finkel, and P. McKenzie. Unambiguous Constrained Automata. In Proceedings of the 16th International Conference on Developments in Language Theory (DLT'12), volume 7410 of Lecture Notes in Computer Science, pages 239--250, Taipei, Taiwan, August 2012. Springer.
doi: 10.1007/978-3-642-31653-1_22.
[ BibTex | DOI | Web page | PDF ]
[BKL12]: D. Berwanger, L. Kaiser, and S. Leßenich. Solving Counter Parity Games. In Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS'12), volume 7464 of Lecture Notes in Computer Science, pages 160--171, Bratislava, Slovakia, August 2012. Springer.
doi: 10.1007/978-3-642-32589-2_17.
[ BibTex | DOI | Web page | PDF ]
[BBC⁺12]: P. Baldan, A. Bruni, A. Corradini, B. König, C. Rodríguez, and S. Schwoon. Efficient unfolding of contextual Petri nets. Theoretical Computer Science, 449(1):2--22, August 2012.
doi: 10.1016/j.tcs.2012.04.046.
[ BibTex | DOI | Web page | PDF ]
[BFK⁺12]: R. Bardou, R. Focardi, Y. Kawamoto, L. Simionato, G. Steel, and J.-K. Tsay. Efficient Padding Oracle Attacks on Cryptographic Hardware. In Proceedings of the 32nd Annual International Cryptology Conference (CRYPTO'12), volume 7417 of Lecture Notes in Computer Science, pages 608--625, Santa Barbara, California, USA, August 2012. Springer.
doi: 10.1007/978-3-642-32009-5_36.
[ BibTex | DOI | Web page | PDF ]
[CD12b]: F. Carreiro and S. Demri. Beyond Regularity for Presburger Modal Logics. In Selected Papers from the 9th Workshop on Advances in Modal Logics (AiML'12), pages 161--182, Copenhagen, Denmark, August 2012. College Publications.
[ BibTex | Web page | PDF ]
[AFKS12]: É. André, L. Fribourg, U. Kühne, and R. Soulat. IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems. In Proceedings of the 18th International Symposium on Formal Methods (FM'12), volume 7436 of Lecture Notes in Computer Science, pages 33--36, Paris, France, August 2012. Springer.
doi: 10.1007/978-3-642-32759-9_6.
[ BibTex | DOI | Web page | PDF ]
[AMH12]: A. Agarwal, A. Madalinski, and S. Haar. Effective Verification of Weak Diagnosability. In Proceedings of the 8th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes (SAFEPROCESS'12), Mexico City, Mexico, August 2012. IFAC.
doi: 10.3182/20120829-3-MX-2028.00083.
[ BibTex | DOI | Web page | PDF ]
[DG12]: S. Demri and P. Gastin. Specification and Verification using Temporal Logics. In Modern applications of automata theory, volume 2 of IISc Research Monographs, chapter 15, pages 457--494. World Scientific, July 2012.
[ BibTex | Web page | PDF ]
[BDH⁺12]: D. Berwanger, A. Dawar, P. Hunter, S. Kreutzer, and J. Obdrzálek. The DAG-width of directed graphs. Journal of Combinatorial Theory, Series B, 102(4):900--923, July 2012.
doi: 10.1016/j.jctb.2012.04.004.
[ BibTex | DOI | Web page | PDF ]
[FFL⁺12c]: G. Feld, L. Fribourg, D. Labrousse, B. Revol, and R. Soulat. Numerical simulation and physical experimentation of a 5-level and 7-level power converter under a control designed by a formal method. Research Report LSV-12-16, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2012. 18 pages.
[ BibTex | Web page | PDF ]
[Loz12]: É. Lozes. Separation Logic: Expressiveness and Copyless Message-Passing. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, July 2012.
[ BibTex | Web page | PDF ]
[GM12]: P. Gastin and B. Monmege. Adding Pebbles to Weighted Automata. In Proceedings of the 17th International Conference on Implementation and Application of Automata (CIAA'12), volume 7381 of Lecture Notes in Computer Science, pages 28--51, Porto, Portugal, July 2012. Springer-Verlag.
doi: 10.1007/978-3-642-31606-7_4.
[ BibTex | DOI | Web page | PDF ]
[BMO⁺12]: P. Bouyer, N. Markey, J. Ouaknine, Ph. Schnoebelen, and J. Worrell. On Termination and Invariance for Faulty Channel Systems. Formal Aspects of Computing, 24(4-6):595--607, July 2012.
doi: 10.1007/s00165-012-0234-7.
[ BibTex | DOI | Web page | PDF ]
[BDL12a]: B. Bollig, N. Decker, and M. Leucker. Frequency Linear-time Temporal Logic. In Proceedings of the 6th International Symposium on Theoretical Aspects of Software Engineering (TASE'12), pages 85--92, Beijing, China, July 2012. IEEE Computer Society Press.
doi: 10.1109/TASE.2012.43.
[ BibTex | DOI | Web page | PDF ]
[BMS12]: P. Bouyer, N. Markey, and O. Sankur. Robust Reachability in Timed Automata: A Game-based Approach. In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP'12) -- Part II, volume 7392 of Lecture Notes in Computer Science, pages 128--140, Warwick, UK, July 2012. Springer.
doi: 10.1007/978-3-642-31585-5_15.
[ BibTex | DOI | Web page | PDF ]
[Ben12a]: H. Benzina. A Network Policy Model for Virtualized Systems. In Proceedings of the 17th IEEE Symposium on Computers and Communications (ISCC'12), pages 680--683, Nevsehir, Turkey, July 2012. IEEE Computer Society Press.
doi: 10.1109/ISCC.2012.6249376.
[ BibTex | DOI | Web page | PDF ]
[KS12a]: P. Karandikar and Ph. Schnoebelen. Cutting Through Regular Post Embedding Problems. In Proceedings of the 7th International Computer Science Symposium in Russia (CSR'12), volume 7353 of Lecture Notes in Computer Science, pages 229--240, Nizhni Novgorod, Russia, July 2012. Springer.
doi: 10.1007/978-3-642-30642-6_22.
[ BibTex | DOI | Web page | PDF ]
[Abi12c]: S. Abiteboul. Viewing the Web as a Distributed Knowledge Base. In Proceedings of the 2012 International Workshop Description Logic (DL'09), volume 846 of CEUR Workshop Proceedings, Rome, Italy, June 2012. RWTH Aachen, Germany.
[ BibTex | Web page | PDF ]
[CD12d]: K. Chatterjee and L. Doyen. Partial-Observation Stochastic Games: How to Win when Belief Fails. In Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science (LICS'12), pages 175--184, Dubrovnik, Croatia, June 2012. IEEE Computer Society Press.
doi: 10.1109/LICS.2012.28.
[ BibTex | DOI | Web page | PDF ]
[HP12]: S. Haddad and L. Pomello, editors. Proceedings of the 33rd International Conference on Applications and Theory of Petri Nets (ICATPN'12), volume 7347 of Lecture Notes in Computer Science, Hamburg, Germany, June 2012. Springer.
doi: 10.1007/978-3-642-31131-4.
[ BibTex | DOI | Web page ]
[FG12b]: A. Finkel and J. Goubault-Larrecq. The Theory of WSTS: The Case of Complete WSTS. In Proceedings of the 33rd International Conference on Applications and Theory of Petri Nets (PETRI NETS'12), volume 7347 of Lecture Notes in Computer Science, pages 3--31, Hamburg, Germany, June 2012. Springer.
doi: 10.1007/978-3-642-31131-4_2.
[ BibTex | DOI | Web page | PDF ]
[FFL⁺12a]: G. Feld, L. Fribourg, D. Labrousse, S. Lefebvre, B. Revol, and R. Soulat. Control of Multilevel Power Converters using Formal Methods. Research Report LSV-12-14, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2012. 14 pages.
[ BibTex | Web page | PDF ]
[Dja12]: H. Djafri. Approches numériques et statistiques pour le model checking des processus stochastiques. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2012.
[ BibTex | Web page | PDF ]
[HSS12]: S. Haddad, S. Schmitz, and Ph. Schnoebelen. The Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets. In Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science (LICS'12), pages 355--364, Dubrovnik, Croatia, June 2012. IEEE Computer Society Press.
doi: 10.1109/LICS.2012.46.
[ BibTex | DOI | Web page | PDF ]
[DDS12b]: S. Demri, A. K. Dhar, and A. Sangnier. Taming Past LTL and Flat Counter Systems. In Proceedings of the 6th International Joint Conference on Automated Reasoning (IJCAR'12), volume 7364 of Lecture Notes in Artificial Intelligence, pages 179--193, Manchester, UK, June 2012. Springer-Verlag.
doi: 10.1007/978-3-642-31365-3_16.
[ BibTex | DOI | Web page | PDF ]
[ACD12]: M. Arapinis, V. Cheval, and S. Delaune. Verifying privacy-type properties in a modular way. In Proceedings of the 25th IEEE Computer Security Foundations Symposium (CSF'12), pages 95--109, Cambridge Massachusetts, USA, June 2012. IEEE Computer Society Press.
doi: 10.1109/CSF.2012.16.
[ BibTex | DOI | Web page | PDF ]
[DKP12]: S. Delaune, S. Kremer, and D. Pasailă. Security protocols, constraint systems, and group theories. In Proceedings of the 6th International Joint Conference on Automated Reasoning (IJCAR'12), volume 7364 of Lecture Notes in Artificial Intelligence, pages 164--178, Manchester, UK, June 2012. Springer-Verlag.
doi: 10.1007/978-3-642-31365-3_15.
[ BibTex | DOI | Web page | PDF ]
[BCH12a]: S. Balaguer, Th. Chatain, and S. Haar. A Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata. Formal Methods in System Design, 40(3):330--355, June 2012.
doi: 10.1007/s10703-012-0146-4.
[ BibTex | DOI | Web page | PDF ]
[BK12]: B. Bollig and D. Kuske. An optimal construction of Hanf sentences. Journal of Applied Logic, 10(2):179--186, June 2012.
doi: 10.1016/j.jal.2012.01.002.
[ BibTex | DOI | Web page | PDF ]
[ABD12]: S. Abiteboul, M. Bienvenu, and D. Deutch. Deduction in the Presence of Distribution and Contradictions. In Proceedings of the 15th International Workshop on the Web and Databases (WebDB'12), pages 31--36, Scottsdale, Arizona, USA, May 2012.
[ BibTex | Web page | PDF ]
[AAMS12]: S. Abiteboul, Y. Amsterdamer, T. Milo, and P. Senellart. Auto-completion learning for XML. In Proceedings of the ACM SIGMOD Internaitonal Conference on Management of Data (SIGMOD'12), pages 669--672, Scottsdale, Arizona, USA, May 2012. ACM Press.
doi: 10.1145/2213836.2213928.
[ BibTex | DOI | Web page | PDF ]
[ABV12a]: S. Abiteboul, P. Bourhis, and V. Vianu. Comparing workflow specification languages: A matter of views. ACM Transactions on Database Systems, 37(2:10), May 2012.
doi: 10.1145/2188349.2188352.
[ BibTex | DOI | Web page | PDF ]
[PHL12]: H. Ponce de León, S. Haar, and D. Longuet. Conformance Relations for Labeled Event Structures. In Proceedings of the 6th International Conference on Tests and Proofs (TAP'12), volume 7305 of Lecture Notes in Computer Science, pages 83--98, Prague, Czech Republic, May-June 2012. Springer.
doi: 10.1007/978-3-642-30473-6_8.
[ BibTex | DOI | Web page | PDF ]
[IL12]: M. Izabachène and B. Libert. Divisible E-Cash in the Standard Model. In Proceedings of the 5th International Conference on Pairing-Based Cryptography (PAIRING'12), volume 7708 of Lecture Notes in Computer Science, pages 314--332, Cologne, Germany, May 2012. Springer.
doi: 10.1007/978-3-642-36334-4_20.
[ BibTex | DOI | Web page | PDF ]
[Ben12c]: H. Benzina. Towards Designing Secure Virtualized Systems. In Proceedings of the 2nd International Conference on Digital Information and Communication Technology and its Application (DICTAP'12), pages 250--255, Bangkok, Thailand, May 2012. IEEE Computer Society Press.
doi: 10.1109/DICTAP.2012.6215385.
[ BibTex | DOI | Web page | PDF ]
[CD12e]: H. Comon-Lundh and S. Delaune. Formal Security Proofs. In Software Safety and Security, volume 33 of NATO Science for Peace and Security Series -- D: Information and Communication Security, pages 26--63. IOS Press, May 2012.
[ BibTex | Web page | PDF ]
[CD12f]: V. Cortier and S. Delaune. Decidability and combination results for two notions of knowledge in security protocols. Journal of Automated Reasoning, 48(4):441--487, April 2012.
doi: 10.1007/s10817-010-9208-8.
[ BibTex | DOI | Web page | PDF ]
[ASV12]: S. Abiteboul, P. Senellart, and V. Vianu. The ERC webdam on foundations of web data management. In Proceedings of the 21st World Wide Web Conference (WWW'12) -- Companion Volume, pages 211--214, Lyon, France, April 2012. ACM Press.
[ BibTex | Web page | PDF ]
[AAS12]: S. Abiteboul, É. Antoine, and J. Stoyanovich. Viewing the Web as a Distributed Knowledge Base. In Proceedings of the 28th International Conference on Data Engineering (ICDE'12), pages 1--4, Washington, D.C., USA, April 2012. IEEE Computer Society Press.
doi: 10.1109/ICDE.2012.150.
[ BibTex | DOI | Web page | PDF ]
[AFS12]: É. André, L. Fribourg, and R. Soulat. Enhancing the Inverse Method with State Merging. In Proceedings of the 4th NASA Formal Methods Symposium (NFM'12), volume 7226 of Lecture Notes in Computer Science, pages 100--105, Norfolk, Virginia, USA, April 2012. Springer.
doi: 10.1007/978-3-642-28891-3_10.
[ BibTex | DOI | Web page | PDF ]
[GMM12]: P. Ganty, R. Majumdar, and B. Monmege. Bounded underapproximations. Formal Methods in System Design, 40(2):206--231, April 2012.
doi: 10.1007/s10703-011-0136-y.
[ BibTex | DOI | Web page | PDF ]
[CHKS12]: H. Comon-Lundh, M. Hagiya, Y. Kawamoto, and H. Sakurada. Computational Soundness of Indistinguishability Properties without Computable Parsing. In Proceedings of the 8th International Conference on Information Security Practice and Experience (ISPEC'12), volume 7232 of Lecture Notes in Computer Science, pages 63--79, Hangzhou, China, April 2012. Springer.
doi: 10.1007/978-3-642-29101-2_5.
[ BibTex | DOI | Web page | PDF ]
[BGGP12]: O. Bouissou, É. Goubault, J. Goubault-Larrecq, and S. Putot. A Generalization of P-boxes to Affine Arithmetic, and Applications to Static Analysis of Programs. Computing, 94(2-4):189--201, March 2012.
doi: 10.1007/s00607-011-0182-8.
[ BibTex | DOI | Web page | PDF ]
[BC12b]: G. Bana and H. Comon-Lundh. Towards Unconditional Soundness: Computationally Complete Symbolic Attacker. In Proceedings of the 1st International Conference on Principles of Security and Trust (POST'12), volume 7215 of Lecture Notes in Computer Science, pages 189--208, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28641-4_11.
[ BibTex | DOI | Web page | PDF ]
[CCS12]: H. Comon-Lundh, V. Cortier, and G. Scerri. Security proof with dishonest keys. In Proceedings of the 1st International Conference on Principles of Security and Trust (POST'12), volume 7215 of Lecture Notes in Computer Science, pages 149--168, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28641-4_9.
[ BibTex | DOI | Web page | PDF ]
[CDD12]: V. Cortier, J. Degrieck, and S. Delaune. Analysing routing protocols: four nodes topologies are sufficient. In Proceedings of the 1st International Conference on Principles of Security and Trust (POST'12), volume 7215 of Lecture Notes in Computer Science, pages 30--50, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28641-4_3.
[ BibTex | DOI | Web page | PDF ]
[BHP12a]: B. Barbot, S. Haddad, and C. Picaronny. Coupling and Importance Sampling for Statistical Model Checking. In Proceedings of the 18th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'12), volume 7214 of Lecture Notes in Computer Science, pages 331--346, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28756-5_23.
[ BibTex | DOI | Web page | PDF ]
[CMV12]: R. Chadha, P. Madhusudan, and M. Viswanathan. Reachability under Contextual Locking. In Proceedings of the 18th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'12), volume 7214 of Lecture Notes in Computer Science, pages 437--450, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28756-5_30.
[ BibTex | DOI | Web page | PDF ]
[BCGNK12]: B. Bollig, A. Cyriac, P. Gastin, and K. Narayan Kumar. Model Checking Languages of Data Words. In Proceedings of the 15th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'12), volume 7213 of Lecture Notes in Computer Science, pages 391--405, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28729-9_26.
[ BibTex | DOI | Web page | PDF ]
[BBMU12]: P. Bouyer, R. Brenguier, N. Markey, and M. Ummels. Concurrent games with ordered objectives. In Proceedings of the 15th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'12), volume 7213 of Lecture Notes in Computer Science, pages 301--315, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28729-9_20.
[ BibTex | DOI | Web page | PDF ]
[BJ12]: A. Bouhoula and F. Jacquemard. Sufficient completeness verification for conditional and constrained TRS. Journal of Applied Logic, 10(1):127--143, March 2012.
doi: 10.1016/j.jal.2011.09.001.
[ BibTex | DOI | Web page | PDF ]
[ABV12b]: S. Abiteboul, P. Bourhis, and V. Vianu. Highly expressive query languages for unordered data trees. In Proceedings of the 15th International Conference on Database Theory (ICDT'12), pages 46--60, Berlin, Germany, March 2012. ACM Press.
doi: 10.1145/2274576.2274583.
[ BibTex | DOI | Web page | PDF ]
[AAD⁺12]: S. Abiteboul, Y. Amsterdamer, D. Deutch, T. Milo, and P. Senellart. Finding optimal probabilistic generators for XML collections. In Proceedings of the 15th International Conference on Database Theory (ICDT'12), pages 127--139, Berlin, Germany, March 2012. ACM Press.
doi: 10.1145/2274576.2274591.
[ BibTex | DOI | Web page | PDF ]
[IHL⁺12]: R. Iosif, P. Habermehl, S. Labbe, É. Lozes, and B. Yakobowski. Concurrent Programs with Simple Data Structures ash Sequential Programs with Composite Data Structures. Deliverable VERIDYC D 2 (ANR-09-SEGI-016), March 2012.
[ BibTex | Web page | PDF ]
[LL12]: M. Lange and É. Lozes. Model-Checking the Higher-Dimensional Modal μ-Calculus. In Proceedings of the 8th Workshop on Fixed Points in Computer Science (FICS'12), volume 77 of Electronic Proceedings in Theoretical Computer Science, pages 39--46, Tallinn, Estonia, March 2012.
doi: 10.4204/EPTCS.77.6.
[ BibTex | DOI | Web page | PDF ]
[BCH12b]: S. Balaguer, Th. Chatain, and S. Haar. Concurrent semantics for timed distributed systems. Deliverable ImpRo D 4.1 (ANR-2010-BLAN-0317), March 2012.
[ BibTex | Web page | PDF ]
[Doy12]: L. Doyen. Games and Automata: From Boolean to Quantitative Verification. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, March 2012.
[ BibTex | Web page | PDF ]
[Sou12]: R. Soulat. Scheduling with IMITATOR: Some Case Studies. Research Report LSV-12-05, Laboratoire Spécification et Vérification, ENS Cachan, France, March 2012. 13 pages.
[ BibTex | Web page | PDF ]
[CCK12]: R. Chadha, S. Ciobâcă, and S. Kremer. Automated verification of equivalence properties of cryptographic protocols. In Programming Languages and Systems --- Proceedings of the 22nd European Symposium on Programming (ESOP'12), volume 7211 of Lecture Notes in Computer Science, pages 108--127, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28869-2_6.
[ BibTex | DOI | Web page | PDF ]
[BLL⁺12]: G. Belkacem, D. Labrousse, S. Lefebvre, P.-Y. Joubert, U. Kühne, L. Fribourg, R. Soulat, É. Florentin, and Ch. Rey. Distributed and Coupled Electrothermal Model of Power Semiconductor Devices. In Proceedings of the 1st International Conference on Renewable Energies and VEhicular Technology (REVET'12), pages 84--89, Hammamet, Tunisia, March 2012. IEEE Power & Energy Society.
doi: 10.1109/REVET.2012.6195253.
[ BibTex | DOI | Web page | PDF ]
[KMT12]: S. Kremer, A. Mercier, and R. Treinen. Reducing Equational Theories for the Decision of Static Equivalence. Journal of Automated Reasoning, 2(48):197--217, February 2012.
doi: 10.1007/s10817-010-9203-0.
[ BibTex | DOI | Web page | PDF ]
[CDK12]: S. Ciobâcă, S. Delaune, and S. Kremer. Computing knowledge in security protocols under convergent equational theories. Journal of Automated Reasoning, 48(2):219--262, February 2012.
doi: 10.1007/s10817-010-9197-7.
[ BibTex | DOI | Web page | PDF ]
[DJLL12]: S. Demri, M. Jurdziński, O. Lachish, and R. Lazić. The covering and boundedness problems for branching vector addition systems. Journal of Computer and System Sciences, 79(1):23--38, February 2012.
doi: 10.1016/j.jcss.2012.04.002.
[ BibTex | DOI | Web page | PDF ]
[BHP12c]: B. Barbot, S. Haddad, and C. Picaronny. Importance Sampling for Model Checking of Time-Bounded Until. Research Report LSV-12-04, Laboratoire Spécification et Vérification, ENS Cachan, France, February 2012. 14 pages.
[ BibTex | Web page | PDF ]
[BHS12]: B. Bérard, S. Haddad, and M. Sassolas. Interrupt Timed Automata: Verification and Expressiveness. Formal Methods in System Design, 40(1):41--87, February 2012.
doi: 10.1007/s10703-011-0140-2.
[ BibTex | DOI | Web page | PDF ]
[BDL12b]: R. Brochenin, S. Demri, and É. Lozes. On the Almighty Wand. Information and Computation, 211:106--137, February 2012.
doi: 10.1016/j.ic.2011.12.003.
[ BibTex | DOI | Web page | PDF ]
[Gou12]: J. Goubault-Larrecq. QRB-Domains and the Probabilistic Powerdomain. Logical Methods in Computer Science, 8(1:14), 2012.
doi: 10.2168/LMCS-8(1:14)2012.
[ BibTex | DOI | Web page | PDF ]
[CD12a]: P. Cabalar and S. Demri. Automata-Based Computation of Temporal Equilibrium Models. In Proceedings of the 21st International Workshop on Logic Program Synthesis and Transformation (LOPSTR'11), volume 7225 of Lecture Notes in Computer Science, pages 57--72, Odense, Denmark, 2012. Springer.
doi: 10.1007/978-3-642-32211-2_5.
[ BibTex | DOI | Web page | PDF ]
[DDS12a]: M. Dahl, S. Delaune, and G. Steel. Formal Analysis of Privacy for Anonymous Location Based Services. In Revised Selected Papaers of the Workshop on Theory of Security and Applications (TOSCA'11), volume 6993 of Lecture Notes in Computer Science, pages 98--112, Saarbrücken, Germany, January 2012. Springer.
doi: 10.1007/978-3-642-27375-9_6.
[ BibTex | DOI | Web page | PDF ]
[JLTV12]: F. Jacquemard, É. Lozes, R. Treinen, and J. Villard. Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus. In Revised Selected Papaers of the Workshop on Theory of Security and Applications (TOSCA'11), volume 6993 of Lecture Notes in Computer Science, pages 166--185, Saarbrücken, Germany, January 2012. Springer.
doi: 10.1007/978-3-642-27375-9_10.
[ BibTex | DOI | Web page | PDF ]
[Abi12a]: S. Abiteboul. Sciences des données: De la logique du premier ordre à la Toile. Leçons inaugurales du Collège de France. Fayard, 2012.
[ BibTex ]
[LV12]: É. Lozes and J. Villard. Reliable Contracts for Unreliable Half-Duplex Communications. In Revised Selected Papers of the 8th International Workshop on Web Services and Formal Methods (WS-FM'11), volume 7176 of Lecture Notes in Computer Science, pages 2--16, Clermont-Ferrand, France, 2012. Springer.
doi: 10.1007/978-3-642-29834-9_2.
[ BibTex | DOI | Web page | PDF ]
[ABB⁺12]: S. Akshay, B. Bérard, P. Bouyer, S. Haar, S. Haddad, C. Jard, D. Lime, N. Markey, P.-A. Reynier, O. Sankur, and Y. Thierry-Mieg. Overview of Robustness in Timed Systems. Deliverable ImpRo D 2.1 (ANR-2010-BLAN-0317), January 2012.
[ BibTex | Web page | PDF ]
[AGG12]: A. Adjé, S. Gaubert, and É. Goubault. Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis. Logical Methods in Computer Science, 8(1:1), January 2012.
doi: 10.2168/LMCS-8(1:01)2012.
[ BibTex | DOI | Web page | PDF ]
[Fig12]: D. Figueira. Alternating register automata on finite words and trees. Logical Methods in Computer Science, 8(1:22), 2012.
doi: 10.2168/LMCS-8(1:22)2012.
[ BibTex | DOI | Web page | PDF ]
[BFLZ12]: R. Bonnet, A. Finkel, J. Leroux, and M. Zeitoun. Model Checking Vector Addition Systems with one zero-test. Logical Methods in Computer Science, 8(2:11), 2012.
doi: 10.2168/LMCS-8(2:11)2012.
[ BibTex | DOI | Web page | PDF ]
[EHH12]: D. El Hog-Benzina, S. Haddad, and R. Hennicker. Refinement and Asynchronous Composition of Modal Petri Nets. In Transactions on Petri Nets and Other Models of Concurrency V, volume 6900 of Lecture Notes in Computer Science, pages 96--120. Springer, 2012.
doi: 10.1007/978-3-642-29072-5_4.
[ BibTex | DOI | Web page | PDF ]
[ACK⁺11]: S. Abiteboul, T.-H. H. Chan, E. Kharlamov, W. Nutt, and P. Senellart. Capturing continuous data and answering aggregate queries in probabilistic XML. ACM Transactions on Database Systems, 36(4:25), December 2011.
doi: 10.1145/2043652.2043658.
[ BibTex | DOI | Web page | PDF ]
[ACD11b]: M. Arnaud, V. Cortier, and S. Delaune. Modeling and Verifying Ad Hoc Routing Protocols. Research Report LSV-11-24, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2011. 66 pages.
[ BibTex | Web page | PDF ]
[Arn11]: M. Arnaud. Formal verification of secured routing protocols. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2011.
[ BibTex | Web page | PDF ]
[Cio11a]: S. Ciobâcă. Automated Verification of Security Protocols with Appplications to Electronic Voting. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2011.
[ BibTex | Web page | PDF ]
[LV11]: É. Lozes and J. Villard. Sharing Contract-Obedient Endpoints. Research Report LSV-11-23, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2011. 42 pages.
[ BibTex | Web page | PDF ]
[ILV11]: M. Izabachène, B. Libert, and D. Vergnaud. Block-wise P-Signatures and Non-Interactive Anonymous Credentials with Efficient Attributes. In Proceedings of the 13th IMA International Conference on Cryptography and Coding (IMACC'11), volume 7089 of Lecture Notes in Computer Science, pages 431--450, Oxford, UK, December 2011. Springer.
doi: 10.1007/978-3-642-25516-8_26.
[ BibTex | DOI | Web page | PDF ]
[DDMM11]: Ph. Darondeau, S. Demri, R. Meyer, and Ch. Morvan. Petri Net Reachability Graphs: Decidability Status of FO Properties. In Proceedings of the 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), volume 13 of Leibniz International Proceedings in Informatics, pages 140--151, Mumbai, India, December 2011. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2011.140.
[ BibTex | DOI | Web page | PDF ]
[SBM11]: O. Sankur, P. Bouyer, and N. Markey. Shrinking Timed Automata. In Proceedings of the 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), volume 13 of Leibniz International Proceedings in Informatics, pages 90--102, Mumbai, India, December 2011. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2011.90.
[ BibTex | DOI | Web page | PDF ]
[CDK11]: C. Chevalier, S. Delaune, and S. Kremer. Transforming Password Protocols to Compose. In Proceedings of the 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), volume 13 of Leibniz International Proceedings in Informatics, pages 204--216, Mumbai, India, December 2011. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2011.204.
[ BibTex | DOI | Web page | PDF ]
[BBMU11]: P. Bouyer, R. Brenguier, N. Markey, and M. Ummels. Nash Equilibria in Concurrent Games with Büchi Objectives. In Proceedings of the 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), volume 13 of Leibniz International Proceedings in Informatics, pages 375--386, Mumbai, India, December 2011. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2011.375.
[ BibTex | DOI | Web page | PDF ]
[BKP11]: D. Berwanger, L. Kaiser, and B. Puchala. Perfect-Information Construction for Coordination in Games. In Proceedings of the 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), volume 13 of Leibniz International Proceedings in Informatics, pages 387--398, Mumbai, India, December 2011. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2011.387.
[ BibTex | DOI | Web page | PDF ]
[AGM11]: S. Abiteboul, G. Gottlob, and M. Manna. Distributed XML design. Journal of Computer and System Sciences, 77(6):936--964, November 2011.
doi: 10.1016/j.jcss.2011.02.003.
[ BibTex | DOI | Web page | PDF ]
[PS11]: Th. Place and L. Segoufin. A decidable characterization of locally testable tree languages. Logical Methods in Computer Science, 7(4:03), November 2011.
doi: 10.2168/LMCS-7(4:3)2011.
[ BibTex | DOI | Web page | PDF ]
[Jac11]: F. Jacquemard. Extended Tree Automata for the Verification of Infinite State Systems. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, November 2011.
[ BibTex | Web page | PDF ]
[ECGJ11]: J. Echeveste, A. Cont, J.-L. Giavitto, and F. Jacquemard. Formalisation des relations temporelles entre une partition et une performance musicale dans un contexte d'accompagnement automatique. In Actes du 8ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'11), volume 45 of Journal Européen des Systèmes Automatisés, pages 109--124, Lille, France, November 2011. Hermès.
doi: 10.3166/jesa.45.109-124.
[ BibTex | DOI | Web page | PDF ]
[BHP11]: B. Barbot, S. Haddad, and C. Picaronny. Échantillonnage préférentiel pour le model checking statistique. In Actes du 8ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'11), volume 45 of Journal Européen des Systèmes Automatisés, pages 237--252, Lille, France, November 2011. Hermès.
doi: 10.3166/jesa.45.237-252.
[ BibTex | DOI | Web page | PDF ]
[SGA11]: F. M. Suchanek, D. Gross-Amblard, and S. Abiteboul. Watermarking for Ontologies. In Proceedings of the 10th International Semantic Web Conference (ISWC'11), volume 7031 of Lecture Notes in Computer Science, pages 697--713, Bonn, Germany, October 2011. Springer.
doi: 10.1007/978-3-642-25073-6_44.
[ BibTex | DOI | Web page | PDF ]
[CD11b]: K. Chatterjee and L. Doyen. Games and Markov Decision Processes with Mean-payoff Parity and Energy Parity Objectives. In Proceedings of the 7th Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'11), volume 7119 of Lecture Notes in Computer Science, Lednice, Czech Republic, October 2011. Springer.
[ BibTex | Web page | PDF ]
[BBD⁺11b]: Th. Brihaye, V. Bruyère, L. Doyen, M. Ducobu, and J.-F. Raskin. Antichain-based QBF Solving. In Proceedings of the 9th International Symposium on Automated Technology for Verification and Analysis (ATVA'11), volume 6996 of Lecture Notes in Computer Science, pages 183--197, Taipei, Taiwan, October 2011. Springer.
doi: 10.1007/978-3-642-24372-1_14.
[ BibTex | DOI | Web page | PDF ]
[JKS11]: F. Jacquemard, Y. Kojima, and M. Sakai. Controlled Term Rewriting. In Proceedings of the 8th International Symposium on Frontiers of Combining Systems (FroCoS'11), volume 6989 of Lecture Notes in Artificial Intelligence, pages 179--194, Saarbrücken, Germany, October 2011. Springer.
[ BibTex | DOI | Web page | PDF ]
[FRS11]: L. Fribourg, B. Revol, and R. Soulat. Synthesis of Switching Rules for Ensuring Reachability Properties of Sampled Linear Systems. In Proceedings of the 13th International Workshops on Verification of Infinite State Systems (INFINITY'11), volume 73 of Electronic Proceedings in Theoretical Computer Science, pages 35--48, Taipei, Taiwan, October 2011.
doi: 10.4204/EPTCS.73.6.
[ BibTex | DOI | Web page | PDF ]
[BD11]: M. Bersani and S. Demri. The complexity of reversal-bounded model-checking. In Proceedings of the 8th International Symposium on Frontiers of Combining Systems (FroCoS'11), volume 6989 of Lecture Notes in Artificial Intelligence, pages 71--86, Saarbrücken, Germany, October 2011. Springer.
doi: 10.1007/978-3-642-24364-6_6.
[ BibTex | DOI | Web page | PDF ]
[BKL11]: D. Berwanger, L. Kaiser, and S. Leßenich. Imperfect Recall and Counter Games. Research Report LSV-11-20, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2011. 21 pages.
[ BibTex | Web page | PDF ]
[CCD11]: V. Cheval, H. Comon-Lundh, and S. Delaune. Trace Equivalence Decision: Negative Tests and Non-determinism. In Proceedings of the 18th ACM Conference on Computer and Communications Security (CCS'11), pages 321--330, Chicago, Illinois, USA, October 2011. ACM Press.
doi: 10.1145/2046707.2046744.
[ BibTex | DOI | Web page | PDF ]
[BMOU11]: P. Bouyer, N. Markey, J. Olschewski, and M. Ummels. Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited. In Proceedings of the 9th International Symposium on Automated Technology for Verification and Analysis (ATVA'11), volume 6996 of Lecture Notes in Computer Science, pages 135--149, Taipei, Taiwan, October 2011. Springer.
doi: 10.1007/978-3-642-24372-1_11.
[ BibTex | DOI | Web page | PDF ]
[CSV11a]: R. Chadha, A. P. Sistla, and M. Viswanathan. Power of Randomization in Automata on Infinite Strings. Logical Methods in Computer Science, 7(3:22), September 2011.
doi: 10.2168/LMCS-7(3:22)2011.
[ BibTex | DOI | Web page | PDF ]
[KD11]: A. Kumar Dhar. Counter Systems with Presburger-definable Reachability Sets: Decidability and Complexity. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2011.
[ BibTex | Web page | PDF ]
[Cha11]: P. Chambart. Du Problème de sous-mot de Post et de la complexité des canaux non fiables. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2011.
[ BibTex | Web page | PDF ]
[Gal11]: A. Galland. Distributed Data Management with Access Control. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2011.
[ BibTex | Web page | PDF ]
[UW11b]: M. Ummels and D. Wojtczak. The Complexity of Nash Equilibria in Stochastic Multiplayer Games. Logical Methods in Computer Science, 7(3:20), September 2011.
doi: 10.2168/LMCS-7(3:20)2011.
[ BibTex | DOI | Web page | PDF ]
[Da 11]: A. Da Costa. Propriétés de jeux multi-agents. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2011.
[ BibTex | Web page | PDF ]
[Pas11b]: D. Pasailă. Verifying equivalence properties of security protocols. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2011.
[ BibTex | Web page | PDF ]
[Deg11]: J. Degrieck. Réduction de graphes pour l'analyse de protocoles de routage sécurisés. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2011.
[ BibTex | Web page | PDF ]
[CFM11a]: M. Cadilhac, A. Finkel, and P. McKenzie. Bounded Parikh Automata. In Proceedings of the 8th International Conference WORDS (WORDS'11), volume 63 of Electronic Proceedings in Theoretical Computer Science, pages 93--102, Prague, Czech Republic, September 2011.
doi: 10.4204/EPTCS.63.13.
[ BibTex | DOI | Web page | PDF ]
[FLS11]: R. Focardi, F. L. Luccio, and G. Steel. An Introduction to Security API Analysis. In Foundations of Security Analysis and Design -- FOSAD Tutorial Lectures (FOSAD'VI), volume 6858 of Lecture Notes in Computer Science, pages 35--65. Springer, September 2011.
doi: 10.1007/978-3-642-23082-0_2.
[ BibTex | DOI | Web page | PDF ]
[BMS11]: P. Bouyer, N. Markey, and O. Sankur. Robust Model-Checking of Timed Automata via Pumping in Channel Machines. In Proceedings of the 9th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'11), volume 6919 of Lecture Notes in Computer Science, pages 97--112, Aalborg, Denmark, September 2011. Springer.
doi: 10.1007/978-3-642-24310-3_8.
[ BibTex | DOI | Web page | PDF ]
[Bon11a]: R. Bonnet. Decidability of LTL Model Checking for Vector Addition Systems with one Zero-test. In Proceedings of the 5th Workshop on Reachability Problems in Computational Models (RP'11), volume 6945 of Lecture Notes in Computer Science, pages 85--95, Genova, Italy, September 2011. Springer.
doi: 10.1007/978-3-642-24288-5_9.
[ BibTex | DOI | Web page | PDF ]
[FK11a]: L. Fribourg and U. Kühne. Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method. In Proceedings of the 5th Workshop on Reachability Problems in Computational Models (RP'11), volume 6945 of Lecture Notes in Computer Science, pages 191--204, Genova, Italy, September 2011. Springer.
doi: 10.1007/978-3-642-24288-5_17.
[ BibTex | DOI | Web page | PDF ]
[AS11]: É. André and R. Soulat. Synthesis of Timing Parameters Satisfying Safety Properties. In Proceedings of the 5th Workshop on Reachability Problems in Computational Models (RP'11), volume 6945 of Lecture Notes in Computer Science, pages 31--44, Genova, Italy, September 2011. Springer.
doi: 10.1007/978-3-642-24288-5_5.
[ BibTex | DOI | Web page | PDF ]
[CKV⁺11]: R. Chadha, V. Korthikranthi, M. Viswanathan, G. Agha, and Y. Kwon. Model Checking MDPs with a Unique Compact Invariant Set of Distributions. In Proceedings of the 8th International Conference on Quantitative Evaluation of Systems (QEST'11), pages 121--130, Aachen, Germany, September 2011. IEEE Computer Society Press.
doi: 10.1109/QEST.2011.22.
[ BibTex | DOI | Web page | PDF ]
[BDD⁺11a]: P. Ballarini, H. Djafri, M. Duflot, S. Haddad, and N. Pekergin. COSMOS: a Statistical Model Checker for the Hybrid Automata Stochastic Logic. In Proceedings of the 8th International Conference on Quantitative Evaluation of Systems (QEST'11), pages 143--144, Aachen, Germany, September 2011. IEEE Computer Society Press.
doi: 10.1109/QEST.2011.24.
[ BibTex | DOI | Web page | PDF ]
[BFH11]: M. Beccuti, G. Franceschinis, and S. Haddad. MDWNsolver: A Framework to Design and Solve Markov Decision Petri Nets. International Journal of Performability Engineering, 7(5):417--428, September 2011.
[ BibTex | Web page | PDF ]
[UW11a]: M. Ummels and D. Wojtczak. The Complexity of Nash Equilibria in Limit-Average Games. In Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11), volume 6901 of Lecture Notes in Computer Science, pages 482--496, Aachen, Germany, September 2011. Springer.
doi: 10.1007/978-3-642-23217-6_32.
[ BibTex | DOI | Web page | PDF ]
[Bol11]: B. Bollig. An automaton over data words that captures EMSO logic. In Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11), volume 6901 of Lecture Notes in Computer Science, pages 171--186, Aachen, Germany, September 2011. Springer.
doi: 10.1007/978-3-642-23217-6_12.
[ BibTex | DOI | Web page | PDF ]
[RSB11]: C. Rodríguez, S. Schwoon, and P. Baldan. Efficient contextual unfolding. In Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11), volume 6901 of Lecture Notes in Computer Science, pages 342--357, Aachen, Germany, September 2011. Springer.
doi: 10.1007/978-3-642-23217-6_23.
[ BibTex | DOI | Web page | PDF ]
[BLM⁺11]: P. Bouyer, K. G. Larsen, N. Markey, O. Sankur, and C. Thrane. Timed automata can always be made implementable. In Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11), volume 6901 of Lecture Notes in Computer Science, pages 76--91, Aachen, Germany, September 2011. Springer.
doi: 10.1007/978-3-642-23217-6_6.
[ BibTex | DOI | Web page | PDF ]
[BFLM11]: P. Bouyer, U. Fahrenberg, K. G. Larsen, and N. Markey. Quantitative analysis of real-time systems using priced timed automata. Communications of the ACM, 54(9):78--87, September 2011.
doi: 10.1145/1995376.1995396.
[ BibTex | DOI | Web page | PDF ]
[CDS11]: K. Chatterjee, L. Doyen, and R. Singh. On Memoryless Quantitative Objectives. In Proceedings of the 18th International Symposium on Fundamentals of Computation Theory (FCT'11), volume 6914 of Lecture Notes in Computer Science, pages 148--159, Oslo, Norway, August 2011. Springer.
doi: 10.1007/978-3-642-22953-4_13.
[ BibTex | DOI | Web page | PDF ]
[CD11a]: K. Chatterjee and L. Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), volume 6907 of Lecture Notes in Computer Science, pages 206--218, Warsaw, Poland, August 2011. Springer.
doi: 10.1007/978-3-642-22993-0_21.
[ BibTex | DOI | Web page | PDF ]
[DMS11a]: L. Doyen, Th. Massart, and M. Shirmohammadi. Infinite Synchronizing Words for Probabilistic Automata. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), volume 6907 of Lecture Notes in Computer Science, pages 278--289, Warsaw, Poland, August 2011. Springer.
doi: 10.1007/978-3-642-22993-0_27.
[ BibTex | DOI | Web page | PDF ]
[BCGZ11]: B. Bollig, A. Cyriac, P. Gastin, and M. Zeitoun. Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), volume 6907 of Lecture Notes in Computer Science, pages 132--144, Warsaw, Poland, August 2011. Springer.
doi: 10.1007/978-3-642-22993-0_15.
[ BibTex | DOI | Web page | PDF ]
[BS11]: M. Blockelet and S. Schmitz. Model-Checking Coverability Graphs of Vector Addition Systems. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), volume 6907 of Lecture Notes in Computer Science, pages 108--119, Warsaw, Poland, August 2011. Springer.
doi: 10.1007/978-3-642-22993-0_13.
[ BibTex | DOI | Web page | PDF ]
[San11]: O. Sankur. Untimed Language Preservation in Timed Systems. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), volume 6907 of Lecture Notes in Computer Science, pages 556--567, Warsaw, Poland, August 2011. Springer.
doi: 10.1007/978-3-642-22993-0_50.
[ BibTex | DOI | Web page | PDF ]
[Bon11b]: R. Bonnet. The reachability problem for Vector Addition Systems with one zero-test. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), volume 6907 of Lecture Notes in Computer Science, pages 145--157, Warsaw, Poland, August 2011. Springer.
doi: 10.1007/978-3-642-22993-0_16.
[ BibTex | DOI | Web page | PDF ]
[BDD⁺11c]: P. Ballarini, H. Djafri, M. Duflot, S. Haddad, and N. Pekergin. Petri Nets Compositional Modeling and Verification of Flexible Manufacturing Systems. In Proceedings of the 7th IEEE Conference on Automation Science and Engineering (CASE'11), pages 588--593, Trieste, Italy, August 2011. IEEE Robotics & Automation Society.
doi: 10.1109/CASE.2011.6042488.
[ BibTex | DOI | Web page | PDF ]
[Gou11a]: J. Goubault-Larrecq. A Few Pearls in the Theory of Quasi-Metric Spaces. Invited talk, Fifth International Conference on Topology, Algebra, and Categories in Logic (TACL'11), Marseilles, France, July 2011, July 2011.
[ BibTex ]
[BDM⁺11]: M. Bojańczyk, C. David, A. Muscholl, Th. Schwentick, and L. Segoufin. Two-variable logic on data words. ACM Transactions on Computational Logic, 12(4:27), July 2011.
doi: 10.1145/1970398.1970403.
[ BibTex | DOI | Web page | PDF ]
[LPS11]: F. Luccio, L. Pagli, and G. Steel. Mathematical and Algorithmic Foundations of the Internet. CRC Press, July 2011.
[ BibTex | Web page ]
[CFM11b]: M. Cadilhac, A. Finkel, and P. McKenzie. On the Expressiveness of Parikh Automata and Related Models. In Proceedings of the 3rd Workshop on Non-Classical Models of Automata and Applications (NCMA'11), volume 282 of books@ocg.at, pages 103--119, Milano, Italy, July 2011. Austrian Computer Society.
[ BibTex | DOI | Web page | PDF ]
[SR11]: S. Schwoon and C. Rodríguez. Construction and SAT-based verification of Contextual Unfoldings. In Proceedings of the 13th International Workshop on Descriptional Complexity of Formal Systems (DCFS'11), volume 6808 of Lecture Notes in Computer Science, pages 34--42, Limburg, Germany, July 2011. Springer.
doi: 10.1007/978-3-642-22600-7_3.
[ BibTex | DOI | Web page | PDF ]
[Cio11b]: S. Ciobâcă. Computing finite variants for subterm convergent rewrite systems. In Proceedings of the 25th International Workshop on Unification (UNIF'11), Wroclaw, Poland, July 2011.
[ BibTex | Web page | PDF ]
[Sch11]: S. Schmitz. A Note on Sequential Rule-Based POS Tagging. In Proceedings of the 9th International Workshop on Finite-State Methods and Natural Language Processing (FSMNLP'11), pages 83--87, Blois, France, July 2011. ACL Press.
[ BibTex | Web page | PDF ]
[BBBS11]: N. Bertrand, P. Bouyer, Th. Brihaye, and A. Stainer. Emptiness and Universality Problems in Timed Automata with Positive Frequency. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP'11) -- Part II, volume 6756 of Lecture Notes in Computer Science, pages 246--257, Zürich, Switzerland, July 2011. Springer.
doi: 10.1007/978-3-642-22012-8_19.
[ BibTex | DOI | Web page | PDF ]
[BDG⁺11]: Th. Brihaye, L. Doyen, G. Geeraerts, J. Ouaknine, J.-F. Raskin, and J. Worrell. On Reachability for Hybrid Automata over Bounded Time. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP'11) -- Part II, volume 6756 of Lecture Notes in Computer Science, pages 416--427, Zürich, Switzerland, July 2011. Springer.
doi: 10.1007/978-3-642-22012-8_33.
[ BibTex | DOI | Web page | PDF ]
[BtCS11]: V. Bárány, B. ten Cate, and L. Segoufin. Guarded negation. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP'11) -- Part II, volume 6756 of Lecture Notes in Computer Science, pages 356--367, Zürich, Switzerland, July 2011. Springer.
doi: 10.1007/978-3-642-22012-8_28.
[ BibTex | DOI | Web page | PDF ]
[SS11]: S. Schmitz and Ph. Schnoebelen. Multiply-Recursive Upper Bounds with Higman's Lemma. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP'11) -- Part II, volume 6756 of Lecture Notes in Computer Science, pages 441--452, Zürich, Switzerland, July 2011. Springer.
doi: 10.1007/978-3-642-22012-8_35.
[ BibTex | DOI | Web page | PDF ]
[AvMSS11]: M. Anderson, D. van Melkebeek, N. Schweikardt, and L. Segoufin. Locality of queries definable in invariant first-order logic with arbitrary built-in predicates. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP'11) -- Part II, volume 6756 of Lecture Notes in Computer Science, pages 368--379, Zürich, Switzerland, July 2011. Springer.
doi: 10.1007/978-3-642-22012-8_29.
[ BibTex | DOI | Web page | PDF ]
[ACD11a]: M. Arnaud, V. Cortier, and S. Delaune. Deciding security for protocols with recursive tests. In Proceedings of the 23rd International Conference on Automated Deduction (CADE'11), volume 6803 of Lecture Notes in Computer Science, pages 49--63, Wroclaw, Poland, July 2011. Springer.
doi: 10.1007/978-3-642-22438-6_6.
[ BibTex | DOI | Web page | PDF ]
[AFFM11]: C. Areces, D. Figueira, S. Figueira, and S. Mera. The Expressive Power of Memory Logics. Review of Symbolic Logic, 4(2):290 -- 318, June 2011.
doi: 10.1017/S1755020310000389.
[ BibTex | DOI | Web page | PDF ]
[GK11]: J. Goubault-Larrecq and K. Keimel. Choquet-Kendall-Matheron Theorems for Non-Hausdorff Spaces. Mathematical Structures in Computer Science, 21(3):511--561, June 2011.
doi: 10.1017/S0960129510000617.
[ BibTex | DOI | Web page | PDF ]
[AGP11]: S. Abiteboul, A. Galland, and N. Polyzotis. Web information management with access control. In Proceedings of the 14th International Workshop on the Web and Databases (WebDB'11), Athens, Greece, June 2011.
[ BibTex | Web page | PDF ]
[KS11]: W. Kazana and L. Segoufin. First-order query evaluation on structures of bounded degree. Logical Methods in Computer Science, 7(2:20), June 2011.
doi: 10.2168/LMCS-7(2:20)2011.
[ BibTex | DOI | Web page | PDF ]
[ABGA11]: S. Abiteboul, M. Bienvenu, A. Galland, and É. Antoine. A rule-based language for Web data management. In Proceedings of the 30th Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'11), pages 293--304, Athens, Greece, June 2011. ACM Press.
doi: 10.1145/1989284.1989320.
[ BibTex | DOI | Web page | PDF ]
[BCJ⁺11]: M. Backes, I. Cervesato, A. Jaggard, A. Scedrov, and J.-K. Tsay. Cryptographically sound security proofs for basic and public-key Kerberos. International Journal on Information Security, 10(2):107--134, June 2011.
doi: 10.1007/s10207-011-0125-6.
[ BibTex | DOI | Web page | PDF ]
[HKS11]: S. Haar, C. Kern, and S. Schwoon. Computing the Reveals Relation in Occurrence Nets. In Proceedings of the 2nd International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'11), volume 54 of Electronic Proceedings in Theoretical Computer Science, pages 31--44, Minori, Italy, June 2011.
doi: 10.4204/EPTCS.54.3.
[ BibTex | DOI | Web page | PDF ]
[FFK⁺11]: É. Florentin, L. Fribourg, U. Kühne, S. Lefebvre, and Ch. Rey. COUPLET: Coupled Electrothermal Simulation. Research Report LSV-11-18, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2011. 32 pages.
[ BibTex | Web page | PDF ]
[Mar11a]: N. Markey. Robustness in Real-time Systems. In Proceedings of the 6th IEEE International Symposium on Industrial Embedded Systems (SIES'11), pages 28--34, Västerås, Sweden, June 2011. IEEE Computer Society Press.
doi: 10.1109/SIES.2011.5953652.
[ BibTex | DOI | Web page | PDF ]
[KSW11]: S. Kremer, G. Steel, and B. Warinschi. Security for Key Management Interfaces. In Proceedings of the 24th IEEE Computer Security Foundations Symposium (CSF'11), pages 266--280, Cernay-la-Ville, France, June 2011. IEEE Computer Society Press.
doi: 10.1109/CSF.2011.25.
[ BibTex | DOI | Web page | PDF ]
[DKRS11]: S. Delaune, S. Kremer, M. D. Ryan, and G. Steel. Formal analysis of protocols based on TPM state registers. In Proceedings of the 24th IEEE Computer Security Foundations Symposium (CSF'11), pages 66--82, Cernay-la-Ville, France, June 2011. IEEE Computer Society Press.
doi: 10.1109/CSF.2011.12.
[ BibTex | DOI | Web page | PDF ]
[BCH11]: S. Balaguer, Th. Chatain, and S. Haar. Building Tight Occurrence Nets from Reveals Relations. In Proceedings of the 11th International Conference on Application of Concurrency to System Design (ACSD'11), pages 44--53, Newcastle upon Tyne, UK, June 2011. IEEE Computer Society Press.
doi: 10.1109/ACSD.2011.16.
[ BibTex | DOI | Web page | PDF ]
[HMN11]: S. Haddad, J. Mairesse, and H.-T. Nguyen. Synthesis and Analysis of Product-form Petri Nets. In Proceedings of the 32nd International Conference on Applications and Theory of Petri Nets (PETRI NETS'11), volume 6709 of Lecture Notes in Computer Science, pages 288--307, Newcastle upon Tyne, UK, June 2011. Springer.
doi: 10.1007/978-3-642-21834-7_16.
[ BibTex | DOI | Web page | PDF ]
[CFS11]: P. Chambart, A. Finkel, and S. Schmitz. Forward Analysis and Model Checking for Trace Bounded WSTS. In Proceedings of the 32nd International Conference on Applications and Theory of Petri Nets (PETRI NETS'11), volume 6709 of Lecture Notes in Computer Science, Newcastle upon Tyne, UK, June 2011. Springer.
doi: 10.1007/978-3-642-21834-7_4.
[ BibTex | DOI | Web page ]
[FFSS11]: D. Figueira, S. Figueira, S. Schmitz, and Ph. Schnoebelen. Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. In Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS'11), pages 269--278, Toronto, Canada, June 2011. IEEE Computer Society Press.
doi: 10.1109/LICS.2011.39.
[ BibTex | DOI | Web page | PDF ]
[GV11]: J. Goubault-Larrecq and D. Varacca. Continuous Random Variables. In Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS'11), pages 97--106, Toronto, Canada, June 2011. IEEE Computer Society Press.
doi: 10.1109/LICS.2011.23.
[ BibTex | DOI | Web page | PDF ]
[Fig11]: D. Figueira. A decidable two-way logic on data words. In Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS'11), pages 365--374, Toronto, Canada, June 2011. IEEE Computer Society Press.
doi: 10.1109/LICS.2011.18.
[ BibTex | DOI | Web page | PDF ]
[Ben11]: H. Benzina. Logic in Virtualized Systems. In Proceedings of the International Conference on Computer Applications and Network Security (ICCANS'11), Republic of Maldives, May 2011.
[ BibTex | Web page | PDF ]
[LS11]: L. Libkin and C. Sirangelo. Data exchange and schema mappings in open and closed worlds. Journal of Computer and System Sciences, 77(3):542--571, May 2011.
doi: 10.1016/j.jcss.2010.04.010.
[ BibTex | DOI | Web page | PDF ]
[BDD⁺11b]: P. Ballarini, H. Djafri, M. Duflot, S. Haddad, and N. Pekergin. HASL: An Expressive Language for Statistical Verification of Stochastic Models. In Proceedings of the 5th International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS'11), pages 306--315, Cachan, France, May 2011.
[ BibTex | Web page | PDF ]
[BCL11]: P. Bouyer, F. Cassez, and F. Laroussinie. Timed Modal Logics for Real-Time Systems: Specification, Verification and Control. Journal of Logic, Language and Information, 20(2):169--203, April 2011.
doi: 10.1007/s10849-010-9127-4.
[ BibTex | DOI | Web page | PDF ]
[ABKT11]: S. Abiteboul, K. Böhm, C. Koch, and K.-L. Tan. Proceedings of the 27th International Conference on Data Engineering (ICDE'11). In Proceedings of the 27th International Conference on Data Engineering (ICDE'11), Hannover, Germany, April 2011. IEEE Computer Society Press.
doi: 10.1109/ICDE.2011.5767975.
[ BibTex | DOI | Web page ]
[BCD⁺11]: L. Brim, J. Chaloupka, L. Doyen, R. Gentilini, and J.-F. Raskin. Faster algorithms for mean-payoff games. Formal Methods in System Design, 38(2):97--118, April 2011.
doi: 10.1007/s10703-010-0105-x.
[ BibTex | DOI | Web page | PDF ]
[AGL⁺11]: É. Antoine, A. Galland, K. Lyngbaek, A. Marian, and N. Polyzotis. Social networking on top of the WebdamExchange system. In Proceedings of the 27th International Conference on Data Engineering (ICDE'11), pages 1300--1303, Hannover, Germany, April 2011. IEEE Computer Society Press.
doi: 10.1109/ICDE.2011.5767939.
[ BibTex | DOI | Web page | PDF ]
[BGMZ11]: B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Weighted Expressions and DFS Tree Automata. Research Report LSV-11-08, Laboratoire Spécification et Vérification, ENS Cachan, France, April 2011. 32 pages.
[ BibTex | Web page | PDF ]
[Mar11b]: N. Markey. Verification of Embedded Systems -- Algorithms and Complexity. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, April 2011.
[ BibTex | Web page | PDF ]
[Gou11b]: J. Goubault-Larrecq. Musings Around the Geometry of Interaction, and Coherence. Theoretical Computer Science, 412(20):1998--2014, April 2011.
doi: 10.1016/j.tcs.2010.12.023.
[ BibTex | DOI | Web page | PDF ]
[ABGR11]: S. Abiteboul, M. Bienvenu, A. Galland, and M.-Ch. Rousset. Distributed Datalog Revisited. In Revised Selected Papers of the 1st International Workshop Datalog Reloaded (Datalog'10), volume 6702 of Lecture Notes in Computer Science, pages 252--261, Oxford, UK, March 2011. Springer.
doi: 10.1007/978-3-642-24206-9_15.
[ BibTex | DOI | Web page | PDF ]
[JKV11]: F. Jacquemard, F. Klay, and C. Vacher. Rigid Tree Automata. Information and Computation, 209(3):486--512, March 2011.
doi: 10.1016/j.ic.2010.11.015.
[ BibTex | DOI | Web page | PDF ]
[AtCK11]: S. Abiteboul, B. ten Cate, and Y. Katsis. On the equivalence of distributed systems with queries and communication. In Proceedings of the 14th International Conference on Database Theory (ICDT'11), pages 126--137, Uppsala, Sweden, March 2011. ACM Press.
doi: 10.1145/1938551.1938570.
[ BibTex | DOI | Web page | PDF ]
[ABV11]: S. Abiteboul, P. Bourhis, and V. Vianu. Comparing workflow specification languages: a matter of views. In Proceedings of the 14th International Conference on Database Theory (ICDT'11), pages 78--89, Uppsala, Sweden, March 2011. ACM Press.
doi: 10.1145/1938551.1938564.
[ BibTex | DOI | Web page | PDF ]
[DMS11b]: L. Doyen, Th. Massart, and M. Shirmohammadi. Synchronizing Objectives for Markov Decision Processes. In Proceedings of the International Workshop on Interactions, Games and Protocols (iWIGP'11), volume 50 of Electronic Proceedings in Theoretical Computer Science, pages 61--75, Saarbrücken, Germany, March 2011.
[ BibTex | Web page | PDF ]
[FK11b]: L. Fribourg and U. Kühne. Parametric Verification of Hybrid Automata Using the Inverse Method. Research Report LSV-11-04, Laboratoire Spécification et Vérification, ENS Cachan, France, March 2011. 25 pages.
[ BibTex | Web page | PDF ]
[CC11]: H. Comon-Lundh and V. Cortier. How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. In Proceedings of the 28th Annual Symposium on Theoretical Aspects of Computer Science (STACS'11), volume 9 of Leibniz International Proceedings in Informatics, pages 29--44, Dortmund, Germany, March 2011. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2011.29.
[ BibTex | DOI | Web page | PDF ]
[tCS11]: B. ten Cate and L. Segoufin. Unary negation. In Proceedings of the 28th Annual Symposium on Theoretical Aspects of Computer Science (STACS'11), volume 9 of Leibniz International Proceedings in Informatics, pages 344--355, Dortmund, Germany, March 2011. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2011.344.
[ BibTex | DOI | Web page | PDF ]
[ST11]: L. Segoufin and S. Toruńczyk. Automata based verification over linearly ordered data domains. In Proceedings of the 28th Annual Symposium on Theoretical Aspects of Computer Science (STACS'11), volume 9 of Leibniz International Proceedings in Informatics, pages 81--92, Dortmund, Germany, March 2011. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2011.81.
[ BibTex | DOI | Web page | PDF ]
[Kre11]: S. Kremer. Modelling and analyzing security protocols in cryptographic process calculi. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, March 2011.
[ BibTex | Web page | PDF ]
[Ste11b]: G. Steel. Formal Analysis of Security APIs. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, March 2011.
[ BibTex | Web page | PDF ]
[Del11]: S. Delaune. Verification of security protocols: from confidentiality to privacy. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, March 2011.
[ BibTex | Web page | PDF ]
[Pas11a]: D. Pasailă. Conjunctive queries determinacy and rewriting. In Proceedings of the 14th International Conference on Database Theory (ICDT'11), pages 220--231, Uppsala, Sweden, March 2011. ACM Press.
doi: 10.1145/1938551.1938580.
[ BibTex | DOI | Web page | PDF ]
[BFHR11]: R. Bonnet, A. Finkel, S. Haddad, and F. Rosa-Velardo. Ordinal Theory for Expressiveness of Well Structured Transition Systems. In Proceedings of the 14th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'11), volume 6604 of Lecture Notes in Computer Science, pages 153--167, Saarbrücken, Germany, March-April 2011. Springer.
doi: 10.1007/978-3-642-19805-2_11.
[ BibTex | DOI | Web page | PDF ]
[FS11]: D. Figueira and L. Segoufin. Bottom-up automata on data trees and vertical XPath. In Proceedings of the 28th Annual Symposium on Theoretical Aspects of Computer Science (STACS'11), volume 9 of Leibniz International Proceedings in Informatics, pages 93--104, Dortmund, Germany, March 2011. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2011.93.
[ BibTex | DOI | Web page | PDF ]
[Bou11]: P. Bourhis. On the dynamics of active documents for distributed data management. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, February 2011.
[ BibTex | Web page | PDF ]
[ACGP11]: M. Abdalla, C. Chevalier, L. Granboulan, and D. Pointcheval. Contributory Password-Authenticated Group Key Exchange with Join Capability. In Proceedings of the Cryptographers' Track at the RSA Conference 2011 (CT-RSA'11), volume 6558 of Lecture Notes in Computer Science, pages 142--160, San Francisco, California, USA, February 2011. Springer.
doi: 10.1007/978-3-642-19074-2_11.
[ BibTex | DOI | Web page | PDF ]
[Vil11]: J. Villard. Heaps and Hops. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, February 2011.
[ BibTex | Web page | PDF ]
[BBD⁺11a]: S. Baarir, M. Beccuti, C. Dutheillet, G. Franceschinis, and S. Haddad. Lumping partially symmetrical stochastic models. Performance Evaluation, 76:21--44, January 2011.
doi: 10.1016/j.peva.2010.09.002.
[ BibTex | DOI | Web page | PDF ]
[CSV11b]: R. Chadha, A. P. Sistla, and M. Viswanathan. Probabilistic Büchi automata with non-extremal acceptance thresholds. In Proceedings of the 12th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'11), volume 6538 of Lecture Notes in Computer Science, pages 103--117, Austin, Texas, USA, January 2011. Springer.
doi: 10.1007/978-3-642-18275-4_9.
[ BibTex | DOI | Web page | PDF ]
[DR11]: L. Doyen and J.-F. Raskin. Games with Imperfect Information: Theory and Algorithms. In Lectures in Game Theory for Computer Scientists. Cambridge University Press, January 2011.
[ BibTex | Web page | PS | PDF ]
[Ste11a]: G. Steel. Formal Analysis of Security APIs. In Encyclopedia of Cryptography and Security, pages 492--494. Springer, 2nd edition, 2011.
doi: 10.1007/978-1-4419-5906-5_873.
[ BibTex | DOI ]
[AMR⁺11]: S. Abiteboul, I. Manolescu, Ph. Rigaux, M.- Ch. Rousset, and P. Senellart. Web Data Management. Cambridge University Press, 2011.
[ BibTex | Web page ]
[Had11]: S. Haddad. Introduction to Verification. In Models and Analysis in Distributed Systems, chapter 6, pages 137--154. John Wiley & Sons, Ltd., 2011.
[ BibTex ]
[DP11]: S. Demri and D. Poitrenaud. Verification of Infinite-State Systems. In Models and Analysis in Distributed Systems, chapter 8, pages 221--269. John Wiley & Sons, Ltd., 2011.
[ BibTex | Web page | PDF ]
[HKPP11a]: S. Haddad, F. Kordon, L. Pautet, and L. Petrucci, editors. Distributed Systems Design and Algorithms. John Wiley & Sons, Ltd., 2011.
[ BibTex | Web page ]
[HKPP11b]: S. Haddad, F. Kordon, L. Pautet, and L. Petrucci, editors. Models and Analysis in Distributed Systems. John Wiley & Sons, Ltd., 2011.
[ BibTex | Web page ]
[CDM11]: H. Comon-Lundh, S. Delaune, and J. K. Millen. Constraint solving techniques and enriching the model with equational theories. In Formal Models and Techniques for Analyzing Security Protocols, volume 5 of Cryptology and Information Security Series, pages 35--61. IOS Press, 2011.
[ BibTex | Web page | PDF ]
[CK11]: V. Cortier and S. Kremer, editors. Formal Models and Techniques for Analyzing Security Protocols, volume 5 of Cryptology and Information Security Series. IOS Press, 2011.
[ BibTex | Web page ]
[BKKL11]: B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. SMA---The Smyle Modeling Approach. In Revised Selected Papars of the 3rd IFIP TC2 Central and East European Conference on Software Engineering Techniques (CEE-SET'08), volume 4980 of Lecture Notes in Computer Science, pages 103--117, Brno, Czech Republic, 2011. Springer.
doi: 10.1007/978-3-642-22386-0_8.
[ BibTex | DOI | Web page | PDF ]
[LAL10]: D. Longuet, M. Aiguier, and P. Le Gall. Proof-guided test selection from first-order specifications with equality. Journal of Automated Reasoning, 45(4):437--473, December 2010.
doi: 10.1007/s10817-009-9128-7.
[ BibTex | DOI | Web page | PS | PDF ]
[BFHR10]: R. Bonnet, A. Finkel, S. Haddad, and F. Rosa-Velardo. Comparing Petri Data Nets and Timed Petri Nets. Research Report LSV-10-23, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2010. 16 pages.
[ BibTex | Web page | PDF ]
[Vac10]: C. Vacher. Automates à contraintes globales pour la vérification de propriétés de sécurité. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2010.
[ BibTex | Web page | PDF ]
[Pla10]: Th. Place. Decidable Characterizations for Tree Logics. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2010.
[ BibTex | Web page | PDF ]
[Fig10b]: D. Figueira. On decidable automata on data words and data trees in relation to satisfiability of LTL and XPath. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2010.
[ BibTex | Web page | PDF ]
[And10c]: É. André. An Inverse Method for the Synthesis of Timing Parameters in Concurrent Systems. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2010.
[ BibTex | Web page | PDF ]
[Sou10b]: R. Soulat. On Properties of the Inverse Method: Commutation of Instanciation and Full Covering of the Behavioral Cartography. Research Report LSV-10-22, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2010. 14 pages.
[ BibTex | Web page | PDF ]
[And10d]: É. André. Synthesizing Parametric Constraints on Various Case Studies Using IMITATOR II. Research Report LSV-10-21, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2010. 66 pages.
[ BibTex | Web page | PDF ]
[DR10a]: S. Demri and A. Rabinovich. The Complexity of Linear-time Temporal Logic over the Class of Ordinals. Logical Methods in Computer Science, 6(4), December 2010.
doi: 10.2168/LMCS-6(4:9)2010.
[ BibTex | DOI | Web page | PDF ]
[CSV10]: R. Chadha, A. P. Sistla, and M. Viswanathan. Model Checking Concurrent Programs with Nondeterminism and Randomization. In Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'10), volume 8 of Leibniz International Proceedings in Informatics, pages 364--375, Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2010.364.
[ BibTex | DOI | Web page | PDF ]
[AGMNK10]: S. Akshay, P. Gastin, M. Mukund, and K. Narayan Kumar. Model checking time-constrained scenario-based specifications. In Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'10), volume 8 of Leibniz International Proceedings in Informatics, pages 204--215, Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2010.204.
[ BibTex | DOI | Web page | PDF ]
[CDHR10]: K. Chatterjee, L. Doyen, Th. A. Henzinger, and J.-F. Raskin. Generalized Mean-payoff and Energy Games. In Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'10), volume 8 of Leibniz International Proceedings in Informatics, pages 505--516, Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2010.505.
[ BibTex | DOI | Web page | PDF ]
[BFLZ10]: R. Bonnet, A. Finkel, J. Leroux, and M. Zeitoun. Place-Boundedness for Vector Addition Systems with one zero-test. In Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'10), volume 8 of Leibniz International Proceedings in Informatics, pages 192--203, Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2010.192.
[ BibTex | DOI | Web page | PDF ]
[HBM⁺10]: P. Hunter, P. Bouyer, N. Markey, J. Ouaknine, and J. Worrell. Computing rational radical sums in uniform TC^0. In Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'10), volume 8 of Leibniz International Proceedings in Informatics, pages 308--316, Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2010.308.
[ BibTex | DOI | Web page | PDF ]
[DLM10]: A. Da Costa, F. Laroussinie, and N. Markey. ATL with strategy contexts: Expressiveness and Model Checking. In Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'10), volume 8 of Leibniz International Proceedings in Informatics, pages 120--132, Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2010.120.
[ BibTex | DOI | Web page | PDF ]
[BLPS10]: P. Barceló, L. Libkin, A. Poggi, and C. Sirangelo. XML with incomplete information. Journal of the ACM, 58(1), December 2010.
doi: 10.1145/1870103.1870107.
[ BibTex | DOI | Web page | PDF ]
[DKS10]: S. Delaune, S. Kremer, and G. Steel. Formal Analysis of PKCS#11 and Proprietary Extensions. Journal of Computer Security, 18(6):1211--1245, November 2010.
doi: 10.3233/JCS-2009-0394.
[ BibTex | DOI | Web page | PDF ]
[Gou10b]: J. Goubault-Larrecq. Finite Models for Formal Security Proofs. Journal of Computer Security, 18(6):1247--1299, November 2010.
doi: 10.3233/JCS-2009-0395.
[ BibTex | DOI | Web page | PDF ]
[KM10]: S. Kremer and L. Mazaré. Computationally Sound Analysis of Protocols using Bilinear Pairings. Journal of Computer Security, 18(6):999--1033, November 2010.
doi: 10.3233/JCS-2009-0388.
[ BibTex | DOI | Web page | PDF ]
[And10b]: É. André. IMITATOR II User Manual. Research Report LSV-10-20, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2010. 31 pages.
[ BibTex | Web page | PDF ]
[LMT10]: R. Lanotte, A. Maggiolo-Schettini, and A. Troina. Weak bisimulation for Probabilistic Timed Automata? Theoretical Computer Science, 411(50):4291--4322, November 2010.
doi: 10.1016/j.tcs.2010.09.003.
[ BibTex | DOI | Web page | PDF ]
[AJRG10]: R. Abassi, F. Jacquemard, M. Rusinowitch, and S. Guemara El Fatmi. XML Access Control: from XACML to Annotated Schemas. In Proceedings of the 2nd International Conference on Communications and Networking (ComNet'10), Tozeur, Tunisia, November 2010. IEEE Computer Society Press.
doi: 10.1109/COMNET.2010.5699810.
[ BibTex | DOI | Web page | PDF ]
[BHB10]: S. S. Bauer, R. Hennicker, and M. Bidoit. A Modal Interface Theory with Data Constraints. In Revised Selected Papers of the 13th Brazilian Symposium on Formal Methods (SBMF'10), volume 6527 of Lecture Notes in Computer Science, pages 80--95. Springer, November 2010.
doi: 10.1007/978-3-642-19829-8_6.
[ BibTex | DOI | Web page | PDF ]
[LBD⁺10]: S. Li, S. Balaguer, A. David, K. G. Larsen, B. Nielsen, and S. Pusinskas. Scenario-based verification of real-time systems using Uppaal. Formal Methods in System Design, 37(2-3):200--264, November 2010.
doi: 10.1007/s10703-010-0103-z.
[ BibTex | DOI | Web page | PDF ]
[BHSZ10]: B. Bérard, S. Haddad, M. Sassolas, and M. Zeitoun. Distributed Synthesis with Incomparable Information. Research Report LSV-10-17, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2010. 20 pages.
[ BibTex | Web page | PDF ]
[CD10a]: K. Chatterjee and L. Doyen. The Complexity of Partial-Observation Parity Games. In Proceedings of the 17th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'10), volume 6397 of Lecture Notes in Artificial Intelligence, pages 1--14, Yogyakarta, Indonesia, October 2010. Springer.
doi: 10.1007/978-3-642-16242-8_1.
[ BibTex | DOI | Web page | PS | PDF ]
[KBBB10]: U. Kühne, S. Beyer, J. Bormann, and J. Barstow. Automated Formal Verification of Processors Based on Architectural Models. In Proceedings of the 10th International Conference on Formal Methods in Computer Aided Design (FMCAD'10), pages 129--136, Lugano, Switzerland, October 2010. IEEE Computer Society Press.
[ BibTex | Web page | PDF ]
[BCFS10]: M. Bortolozzo, M. Centenaro, R. Focardi, and G. Steel. Attacking and Fixing PKCS#11 Security Tokens. In Proceedings of the 17th ACM Conference on Computer and Communications Security (CCS'10), pages 260--269, Chicago, Illinois, USA, October 2010. ACM Press.
doi: 10.1145/1866307.1866337.
[ BibTex | DOI | Web page | PDF ]
[Haa10a]: S. Haar. Types of Asynchronous Diagnosability and the phReveals-Relation in Occurrence Nets. IEEE Transactions on Automatic Control, 55(10):2310--2320, October 2010.
doi: 10.1109/TAC.2010.2063490.
[ BibTex | DOI | Web page | PDF ]
[SRKK10]: B. Smyth, M. D. Ryan, S. Kremer, and M. Kourjieh. Towards automatic analysis of election verifiability properties. In Proceedings of the Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security (ARSPA-WITS'10), volume 6186 of Lecture Notes in Computer Science, pages 146--163, Paphos, Cyprus, October 2010. Springer.
doi: 10.1007/978-3-642-16074-5_11.
[ BibTex | DOI | Web page | PDF ]
[BCHK10]: P. Baldan, Th. Chatain, S. Haar, and B. König. Unfolding-based Diagnosis of Systems with an Evolving Topology. Information and Computation, 208(10):1169--1192, October 2010.
doi: 10.1016/j.ic.2009.11.009.
[ BibTex | DOI | Web page | PDF ]
[BK10]: D. Berwanger and L. Kaiser. Information Tracking in Games on Graphs. Journal of Logic, Language and Information, 19(4):395--412, October 2010.
doi: 10.1007/s10849-009-9115-8.
[ BibTex | DOI | Web page | PDF ]
[BCD⁺10]: D. Berwanger, K. Chatterjee, L. Doyen, M. De Wulf, and Th. A. Henzinger. Strategy Construction for Parity Games with Imperfect Information. Information and Computation, 208(10):1206--1220, October 2010.
doi: 10.1016/j.ic.2009.09.006.
[ BibTex | DOI | Web page | PS | PDF ]
[BS10]: M. Bojańczyk and L. Segoufin. Tree Languages Defined in First-Order Logic with One Quantifier Alternation. Logical Methods in Computer Science, 6(4:1), October 2010.
doi: 10.2168/LMCS-6(4:1)2010.
[ BibTex | DOI | Web page | PDF ]
[Rod10]: C. Rodríguez. Implementation of a complete prefix unfolder for contextual nets. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2010.
[ BibTex | Web page | PDF ]
[HMY10b]: S. Haddad, L. Mokdad, and S. Youcef. Selection of the Best composite Web Service Based on Quality of Service. In Proceedings of the 2nd International Symposium on Services Science and 3rd International Conference on Business Process and Services Computing (ISSSashBPSC'10), volume 177 of Lecture Notes in Informatics, pages 255--266, Leipzig, Germany, September-October 2010. Gesellschaft für Informatik.
[ BibTex | Web page | PDF ]
[Sce10]: G. Scerri. Modélisation des clés de l'intrus. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2010.
[ BibTex ]
[CDH10a]: K. Chatterjee, L. Doyen, and Th. A. Henzinger. Expressiveness and Closure Properties for Quantitative Languages. Logical Methods in Computer Science, 6(3:10), September 2010.
doi: 10.2168/LMCS-6(3:10)2010.
[ BibTex | DOI | Web page | PS | PDF ]
[BGGP10]: O. Bouissou, É. Goubault, J. Goubault-Larrecq, and S. Putot. A Generalization of P-boxes to Affine Arithmetic, and Applications to Static Analysis of Programs. In Proceedings of the 14th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN'10), Lyon, France, September 2010.
[ BibTex ]
[Dem10a]: S. Demri. Counter Systems for Data Logics. In Proceedings of the 12th European Conference on Logics in Artificial Intelligence (JELIA'10), volume 6431 of Lecture Notes in Artificial Intelligence, page 10, Helsinki, Finland, September 2010. Springer.
doi: 10.1007/978-3-642-15675-5_3.
[ BibTex | DOI | Web page | PDF ]
[MW10]: N. Markey and J. Wijsen, editors. Proceedings of the 17th International Symposium on Temporal Representation and Reasoning (TIME'10), Paris, France, September 2010. IEEE Computer Society Press.
doi: 10.1109/TIME.2010.4.
[ BibTex | DOI | Web page ]
[DKRS10a]: S. Delaune, S. Kremer, M. D. Ryan, and G. Steel. A Formal Analysis of Authentication in the TPM. In Revised Selected Papers of the 7th International Workshop on Formal Aspects in Security and Trust (FAST'10), volume 6561 of Lecture Notes in Computer Science, pages 111--125, Pisa, Italy, September 2010. Springer.
doi: 10.1007/978-3-642-19751-2_8.
[ BibTex | DOI | Web page | PS | PDF ]
[BWA10]: M. Baudet, B. Warinschi, and M. Abadi. Guessing Attacks and the Computational Soundness of Static Equivalence. Journal of Computer Security, 18(5):909--968, September 2010.
doi: 10.3233/JCS-2009-0386.
[ BibTex | DOI | Web page | PDF ]
[BG10]: H. Benzina and J. Goubault-Larrecq. Some Ideas on Virtualized Systems Security, and Monitors. In Revised Selected Papers of the 5th International Workshop on Data Privacy Management and Autonomous Spontaneous Security (DPM'10) and 3rd International Workshop on Autonomous and Spontaneous Security (SETOP'10), volume 6514 of Lecture Notes in Computer Science, pages 244--258, Athens, Greece, September 2010. Springer.
doi: 10.1007/978-3-642-19348-4_18.
[ BibTex | DOI | Web page | PDF ]
[LV10]: É. Lozes and J. Villard. A spatial equational logic for the applied π-calculus. Distributed Computing, 23(1):61--83, September 2010.
doi: 10.1007/s00446-010-0112-6.
[ BibTex | DOI | Web page | PDF ]
[And10a]: É. André. IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata. In Proceedings of the 12th International Workshops on Verification of Infinite State Systems (INFINITY'10), volume 39 of Electronic Proceedings in Theoretical Computer Science, pages 91--99, Singapore, September 2010.
doi: 10.4204/EPTCS.39.7.
[ BibTex | DOI | Web page | PDF ]
[Dem10b]: S. Demri. On Selective Unboundedness of VASS. In Proceedings of the 12th International Workshops on Verification of Infinite State Systems (INFINITY'10), volume 39 of Electronic Proceedings in Theoretical Computer Science, pages 1--15, Singapore, September 2010.
doi: 10.4204/EPTCS.39.1.
[ BibTex | DOI | Web page | PDF ]
[BDF10]: A. Bušić, H. Djafri, and J.-M. Fourneau. Stochastic Bounds for Censored Markov Chains. In Proceedings of the 6th International Meeting on the Numerical Solution of Markov Chain (NSMC'10), Williamsburg, Virginia, USA, September 2010.
[ BibTex | Web page | PDF ]
[KRS10]: S. Kremer, M. D. Ryan, and B. Smyth. Election verifiability in electronic voting protocols. In Proceedings of the 15th European Symposium on Research in Computer Security (ESORICS'10), volume 6345 of Lecture Notes in Computer Science, pages 389--404, Athens, Greece, September 2010. Springer.
doi: 10.1007/978-3-642-15497-3_24.
[ BibTex | DOI | Web page | PDF ]
[DDS10a]: M. Dahl, S. Delaune, and G. Steel. Formal Analysis of Privacy for Vehicular Mix-Zones. In Proceedings of the 15th European Symposium on Research in Computer Security (ESORICS'10), volume 6345 of Lecture Notes in Computer Science, pages 55--70, Athens, Greece, September 2010. Springer.
doi: 10.1007/978-3-642-15497-3_4.
[ BibTex | DOI | Web page | PS | PDF ]
[BBM10a]: P. Bouyer, R. Brenguier, and N. Markey. Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games. In Proceedings of the 8th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'10), volume 6246 of Lecture Notes in Computer Science, pages 62--76, Vienna, Austria, September 2010. Springer.
doi: 10.1007/978-3-642-15297-9_7.
[ BibTex | DOI | Web page | PDF ]
[BCH10]: S. Balaguer, Th. Chatain, and S. Haar. A Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata. In Proceedings of the 17th International Symposium on Temporal Representation and Reasoning (TIME'10), pages 77--84, Paris, France, September 2010. IEEE Computer Society Press.
doi: 10.1109/TIME.2010.12.
[ BibTex | DOI | Web page | PDF ]
[BHS10]: B. Bérard, S. Haddad, and M. Sassolas. Real Time Properties for Interrupt Timed Automata. In Proceedings of the 17th International Symposium on Temporal Representation and Reasoning (TIME'10), pages 69--76, Paris, France, September 2010. IEEE Computer Society Press.
doi: 10.1109/TIME.2010.11.
[ BibTex | DOI | Web page | PDF ]
[BKM10]: B. Bollig, D. Kuske, and I. Meinecke. Propositional Dynamic Logic for Message-Passing Systems. Logical Methods in Computer Science, 6(3:16), September 2010.
doi: 10.2168/LMCS-6(3:16)2010.
[ BibTex | DOI | Web page | PDF ]
[DL10]: S. Demri and D. Lugiez. Complexity of Modal Logics with Presburger Constraints. Journal of Applied Logic, 8(3):233--252, September 2010.
doi: 10.1016/j.jal.2010.03.001.
[ BibTex | DOI | Web page | PDF ]
[San10]: O. Sankur. Model-checking robuste des automates temporisés via les machines à canaux. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2010.
[ BibTex | Web page | PDF ]
[Sou10a]: R. Soulat. Améliorations algorithmiques d'un moteur de model-checking et études de cas. Rapport de Master, Master 2 Recherche Informatique Paris Sud 11, September 2010.
[ BibTex | Web page | PDF ]
[Boi10]: A. Boiret. Grammaires context-free pour les arbres sans rang. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2010.
[ BibTex | Web page | PDF ]
[Dim10]: J. Dimino. Sur les arbres de rang non borné avec données. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2010.
[ BibTex | Web page | PDF ]
[Mon10]: B. Monmege. Propriétés quantitatives des mots et des arbres -- Applications aux langages XML. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2010.
[ BibTex | Web page | PDF ]
[ABMG10]: S. Abiteboul, P. Bourhis, B. Marinoiu, and A. Galland. AXART -- Enabling Collaborative Work with AXML Artifacts. In Proceedings of the 36th International Conference on Very Large Data Bases (VLDB'10), volume 3 of Proceedings of the VLDB Endowment, pages 1553--1556, Singapore, September 2010. ACM Press.
[ BibTex | Web page | PDF ]
[BBC⁺10a]: P. Baldan, A. Bruni, A. Corradini, B. König, and S. Schwoon. On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars. In Proceedings of the 5th International Conference on Graph Transformations (ICGT'10), volume 6372 of Lecture Notes in Computer Science, pages 91--106, Enschede, The Netherlands, September-October 2010. Springer.
doi: 10.1007/978-3-642-15928-2_7.
[ BibTex | DOI | Web page | PDF ]
[Cyr10b]: A. Cyriac. Temporal Logics for Concurrent Recursive Programs. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2010.
[ BibTex | Web page | PDF ]
[Haa10b]: S. Haar. What Topology Tells us about Diagnosability in Partial Order Semantics. In Proceedings of the 10th Workshop on Discrete Event Systems (WODES'10), pages 221--226, Berlin, Germany, August-September 2010. IFAC.
[ BibTex | Web page | PDF ]
[GL10]: P. Gastin and F. Laroussinie, editors. Proceedings of the 21st International Conference on Concurrency Theory (CONCUR'10), volume 6269 of Lecture Notes in Computer Science. Springer, August-September 2010.
doi: 10.1007/978-3-642-15375-4.
[ BibTex | DOI | Web page ]
[FHL10]: D. Figueira, P. Hofman, and S. Lasota. Relating timed and register automata. In Proceedings of the 17th International Workshop on Expressiveness in Concurrency (EXPRESS'10), volume 41 of Electronic Proceedings in Theoretical Computer Science, pages 61--75, Paris, France, August 2010.
doi: 10.4204/EPTCS.41.5.
[ BibTex | DOI | Web page | PDF ]
[DKRS10b]: S. Delaune, S. Kremer, M. D. Ryan, and G. Steel. A Formal Analysis of Authentication in the TPM (short paper). In Preliminary Proceedings of the 8th International Workshop on Security Issues in Coordination Models, Languages and Systems (SecCo'10), Paris, France, August 2010.
[ BibTex | Web page | PS | PDF ]
[Sch10c]: Ph. Schnoebelen. Lossy Counter Machines Decidability Cheat Sheet. In Proceedings of the 4th Workshop on Reachability Problems in Computational Models (RP'10), volume 6227 of Lecture Notes in Computer Science, pages 51--75, Brno, Czech Republic, August 2010. Springer.
doi: 10.1007/978-3-642-15349-5_4.
[ BibTex | DOI | Web page | PDF ]
[AF10a]: É. André and L. Fribourg. Behavioral Cartography of Timed Automata. In Proceedings of the 4th Workshop on Reachability Problems in Computational Models (RP'10), volume 6227 of Lecture Notes in Computer Science, pages 76--90, Brno, Czech Republic, August 2010. Springer.
doi: 10.1007/978-3-642-15349-5_5.
[ BibTex | DOI | Web page | PDF ]
[DDG⁺10]: A. Degorre, L. Doyen, R. Gentilini, J.-F. Raskin, and S. Toruńczyk. Energy and Mean-Payoff Games with Imperfect Information. In Proceedings of the 19th Annual EACSL Conference on Computer Science Logic (CSL'10), volume 6247 of Lecture Notes in Computer Science, pages 260--274, Brno, Czech Republic, August 2010. Springer.
doi: 10.1007/978-3-642-15205-4_22.
[ BibTex | DOI | Web page | PDF ]
[Sch10d]: Ph. Schnoebelen. Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS'10), volume 6281 of Lecture Notes in Computer Science, pages 616--628, Brno, Czech Republic, August 2010. Springer.
doi: 10.1007/978-3-642-15155-2_54.
[ BibTex | DOI | Web page | PDF ]
[CDGH10]: K. Chatterjee, L. Doyen, H. Gimbert, and Th. A. Henzinger. Randomness for Free. In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS'10), volume 6281 of Lecture Notes in Computer Science, pages 246--257, Brno, Czech Republic, August 2010. Springer.
doi: 10.1007/978-3-642-15155-2_23.
[ BibTex | DOI | Web page | PDF ]
[FP10]: G. Fontaine and Th. Place. Classes of trees definable in the μ-calculus. In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS'10), volume 6281 of Lecture Notes in Computer Science, pages 381--392, Brno, Czech Republic, August 2010. Springer.
doi: 10.1007/978-3-642-15155-2_34.
[ BibTex | DOI | Web page | PDF ]
[CDH10b]: K. Chatterjee, L. Doyen, and Th. A. Henzinger. Qualitative Analysis of Partially-observable Markov Decision Processes. In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS'10), volume 6281 of Lecture Notes in Computer Science, pages 258--269, Brno, Czech Republic, August 2010. Springer.
doi: 10.1007/978-3-642-15155-2_24.
[ BibTex | DOI | Web page | PDF ]
[OU10]: J. Olschewski and M. Ummels. The Complexity of Finding Reset Words in Finite Automata. In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS'10), volume 6281 of Lecture Notes in Computer Science, pages 568--579, Brno, Czech Republic, August 2010. Springer.
doi: 10.1007/978-3-642-15155-2_50.
[ BibTex | DOI | Web page | PDF ]
[CDE⁺10]: K. Chatterjee, L. Doyen, H. Edelsbrunner, Th. A. Henzinger, and P. Rannou. Mean-Payoff Automaton Expressions. In Proceedings of the 21st International Conference on Concurrency Theory (CONCUR'10), volume 6269 of Lecture Notes in Computer Science, pages 269--283, Paris, France, August-September 2010. Springer.
doi: 10.1007/978-3-642-15375-4_19.
[ BibTex | DOI | Web page | PDF ]
[BBM10b]: P. Bouyer, R. Brenguier, and N. Markey. Nash Equilibria for Reachability Objectives in Multi-player Timed Games. In Proceedings of the 21st International Conference on Concurrency Theory (CONCUR'10), volume 6269 of Lecture Notes in Computer Science, pages 192--206, Paris, France, August-September 2010. Springer.
doi: 10.1007/978-3-642-15375-4_14.
[ BibTex | DOI | Web page | PDF ]
[CS10a]: P. Chambart and Ph. Schnoebelen. Computing blocker sets for the Regular Post Embedding Problem. In Proceedings of the 14th International Conference on Developments in Language Theory (DLT'10), volume 6224 of Lecture Notes in Computer Science, pages 136--147, London, Ontario, Canada, August 2010. Springer.
doi: 10.1007/978-3-642-14455-4_14.
[ BibTex | DOI | Web page | PDF ]
[HNS10]: P.-C. Héam, C. Nicaud, and S. Schmitz. Parametric Random Generation of Deterministic Tree Automata. Theoretical Computer Science, 411(38-39):3469--3480, August 2010.
doi: 10.1016/j.tcs.2010.05.036.
[ BibTex | DOI | Web page | PDF ]
[JR10]: F. Jacquemard and M. Rusinowitch. Rewrite-based verification of XML updates. In Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'10), pages 119--130, Hagenberg, Austria, July 2010. ACM Press.
doi: 10.1145/1836089.1836105.
[ BibTex | DOI | Web page | PDF ]
[NSV10]: A. Nash, L. Segoufin, and V. Vianu. Views and queries: Determinacy and rewriting. ACM Transactions on Database Systems, 35(3), July 2010.
doi: 10.1145/1806907.1806913.
[ BibTex | DOI | Web page | PDF ]
[Car10]: J.-L. Carré. Analyse statique de programmes multi-thread pour l'embarqué. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2010.
[ BibTex | Web page | PDF ]
[Aks10]: S. Akshay. Spécification et vérification pour des systèmes distribués et temporisés. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2010.
[ BibTex | Web page | PDF ]
[DDS10b]: M. Dahl, S. Delaune, and G. Steel. Formal Analysis of Privacy for Vehicular Mix-Zones. In Proceedings of the Workshop on Foundations of Security and Privacy (FCS-PrivMod'10), pages 55--70, Edinburgh, Scotland, UK, July 2010.
doi: 10.1007/978-3-642-15497-3_4.
[ BibTex | DOI | Web page | PS | PDF ]
[Sch10b]: S. Schmitz. On the Computational Complexity of Dominance Links in Grammatical Formalisms. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL'10), pages 514--524, Uppsala, Sweden, July 2010. Association for Computational Linguistics.
[ BibTex | Web page | PDF ]
[CCD10]: V. Cheval, H. Comon-Lundh, and S. Delaune. Automating security analysis: symbolic equivalence of constraint systems. In Proceedings of the 5th International Joint Conference on Automated Reasoning (IJCAR'10), volume 6173 of Lecture Notes in Artificial Intelligence, pages 412--426, Edinburgh, Scotland, UK, July 2010. Springer-Verlag.
doi: 10.1007/978-3-642-14203-1_35.
[ BibTex | DOI | Web page | PDF ]
[Gou10c]: J. Goubault-Larrecq. Noetherian Spaces in Verification. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) -- Part II, volume 6199 of Lecture Notes in Computer Science, pages 2--21, Bordeaux, France, July 2010. Springer.
doi: 10.1007/978-3-642-14162-1_2.
[ BibTex | DOI | Web page | PDF ]
[CS10b]: P. Chambart and Ph. Schnoebelen. Pumping and Counting on the Regular Post Embedding Problem. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) -- Part II, volume 6199 of Lecture Notes in Computer Science, pages 64--75, Bordeaux, France, July 2010. Springer.
doi: 10.1007/978-3-642-14162-1_6.
[ BibTex | DOI | Web page | PDF ]
[CD10b]: K. Chatterjee and L. Doyen. Energy Parity Games. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) -- Part II, volume 6199 of Lecture Notes in Computer Science, pages 599--610, Bordeaux, France, July 2010. Springer.
doi: 10.1007/978-3-642-14162-1_50.
[ BibTex | DOI | Web page | PDF ]
[BGMZ10]: B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Pebble weighted automata and transitive closure logics. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) -- Part II, volume 6199 of Lecture Notes in Computer Science, pages 587--598, Bordeaux, France, July 2010. Springer.
doi: 10.1007/978-3-642-14162-1_49.
[ BibTex | DOI | Web page | PDF ]
[CC10]: S. Ciobâcă and V. Cortier. Protocol composition for arbitrary primitives. In Proceedings of the 23rd IEEE Computer Security Foundations Symposium (CSF'10), pages 322--336, Edinburgh, Scotland, UK, July 2010. IEEE Computer Society Press.
doi: 10.1109/CSF.2010.29.
[ BibTex | DOI | Web page | PDF ]
[ACD10]: M. Arnaud, V. Cortier, and S. Delaune. Modeling and Verifying Ad Hoc Routing Protocols. In Proceedings of the 23rd IEEE Computer Security Foundations Symposium (CSF'10), pages 59--74, Edinburgh, Scotland, UK, July 2010. IEEE Computer Society Press.
doi: 10.1109/CSF.2010.12.
[ BibTex | DOI | Web page | PDF ]
[BKK⁺10]: B. Bollig, J.-P. Katoen, C. Kern, M. Leucker, D. Neider, and D. R. Piegdon. libalf: the Automata Learning Framework. In Proceedings of the 22nd International Conference on Computer Aided Verification (CAV'10), volume 6174 of Lecture Notes in Computer Science, pages 360--364, Edinburgh, Scotland, UK, July 2010. Springer.
doi: 10.1007/978-3-642-14295-6_32.
[ BibTex | DOI | Web page | PDF ]
[SS10]: N. Schweikardt and L. Segoufin. Addition-invariant FO and regularity. In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science (LICS'10), pages 273--282, Edinburgh, Scotland, UK, July 2010. IEEE Computer Society Press.
doi: 10.1109/LICS.2010.16.
[ BibTex | DOI | Web page | PDF ]
[PS10]: Th. Place and L. Segoufin. Deciding definability in FO_2(<) on trees. In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science (LICS'10), pages 253--262, Edinburgh, Scotland, UK, July 2010. IEEE Computer Society Press.
doi: 10.1109/LICS.2010.17.
[ BibTex | DOI | Web page | PDF ]
[Gou10d]: J. Goubault-Larrecq. ωQRB-Domains and the Probabilistic Powerdomain. In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science (LICS'10), pages 352--361, Edinburgh, Scotland, UK, July 2010. IEEE Computer Society Press.
doi: 10.1109/LICS.2010.50.
[ BibTex | DOI | Web page | PDF ]
[BCG⁺10]: L. Barguñó, C. Creus, G. Godoy, F. Jacquemard, and C. Vacher. The Emptiness Problem for Tree Automata with Global Constraints. In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science (LICS'10), pages 263--272, Edinburgh, Scotland, UK, July 2010. IEEE Computer Society Press.
doi: 10.1109/LICS.2010.28.
[ BibTex | DOI | Web page | PDF ]
[GK10]: P. Gastin and D. Kuske. Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. Information and Computation, 208(7):797--816, July 2010.
doi: 10.1016/j.ic.2009.12.003.
[ BibTex | DOI | Web page | PDF ]
[Cyr10a]: A. Cyriac. A New Version of Focus Games for LTL Satisfiability. In Proceedings of the Workshop on Comparing Logical Decision Methods (CLoDeM'10), Edinburgh, Scotland, UK, July 2010.
[ BibTex | Web page | PDF ]
[BJL⁺10]: Th. Brihaye, M. Jungers, S. Lasaulce, N. Markey, and G. Oreiby. Using Model Checking for Analyzing Distributed Power Control Problems. EURASIP Journal on Wireless Communications and Networking, 2010(861472), June 2010.
doi: 10.1155/2010/861472.
[ BibTex | DOI | Web page | PDF ]
[DHLN10]: L. Doyen, Th. A. Henzinger, A. Legay, and D. Nickovic. Robustness of Sequential Circuits. In Proceedings of the 10th International Conference on Application of Concurrency to System Design (ACSD'10), pages 77--84, Braga, Portugal, June 2010. IEEE Computer Society Press.
doi: 10.1109/ACSD.2010.26.
[ BibTex | DOI | Web page | PDF ]
[EHH10]: D. El Hog-Benzina, S. Haddad, and R. Hennicker. Process Refinement and Asynchronous Composition with Modalities. In Proceedings of the 2nd International Workshop on Abstractions for Petri Nets and Other Models of Concurrency (APNOC'10), Braga, Portugal, June 2010.
[ BibTex | Web page | PDF ]
[HMY10a]: S. Haddad, L. Mokdad, and S. Youcef. Response time of BPEL4WS constructors. In Proceedings of the 15th IEEE Symposium on Computers and Communications (ISCC'10), pages 695--700, Riccione, Italy, June 2010. IEEE Computer Society Press.
doi: 10.1109/ISCC.2010.5546538.
[ BibTex | DOI | Web page | PDF ]
[CF10]: Th. Chatain and É. Fabre. Factorization Properties of Symbolic Unfoldings of Colored Petri Nets. In Proceedings of the 31st International Conference on Applications and Theory of Petri Nets (PETRI NETS'10), volume 6128 of Lecture Notes in Computer Science, pages 165--184, Braga, Portugal, June 2010. Springer.
doi: 10.1007/978-3-642-13675-7_11.
[ BibTex | DOI | Web page | PDF ]
[LS10b]: L. Libkin and C. Sirangelo. Reasoning about XML with temporal logics and automata. Journal of Applied Logic, 8(2):210--232, June 2010.
doi: 10.1016/j.jal.2009.09.005.
[ BibTex | DOI | Web page | PDF ]
[BH10b]: B. Bollig and L. Hélouët. Realizability of Dynamic MSC Languages. In Proceedings of the 5th International Computer Science Symposium in Russia (CSR'10), volume 6072 of Lecture Notes in Computer Science, pages 48--59, Kazan, Russia, June 2010. Springer.
doi: 10.1007/978-3-642-13182-0_5.
[ BibTex | DOI | Web page | PDF ]
[BKKL10a]: B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. Learning Communicating Automata from MSCs. IEEE Transactions on Software Engineering, 36(3):390--408, May-June 2010.
doi: 10.1109/TSE.2009.89.
[ BibTex | DOI | Web page | PDF ]
[CJ10]: Th. Chatain and C. Jard. Sémantique concurrente symbolique des réseaux de Petri saufs et dépliages finis des réseaux temporels. In Actes de la 10ème Conférence Internationale sur les NOuvelles TEchnologies de la RÉpartition (NOTERE'10), Tozeur, Tunisia, May-June 2010. IEEE Computer Society Press.
[ BibTex | Web page | PDF ]
[DKR10b]: S. Delaune, S. Kremer, and M. D. Ryan. Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster. In Towards Trustworthy Elections -- New Directions in Electronic Voting, volume 6000 of Lecture Notes in Computer Science, pages 289--309. Springer, May 2010.
doi: 10.1007/978-3-642-12980-3_18.
[ BibTex | DOI | Web page | PDF ]
[DLS10]: S. Demri, R. Lazić, and A. Sangnier. Model checking memoryful linear-time logics over one-counter automata. Theoretical Computer Science, 411(22-24):2298--2316, May 2010.
doi: 10.1016/j.tcs.2010.02.021.
[ BibTex | DOI | Web page | PDF ]
[BFLM10]: P. Bouyer, U. Fahrenberg, K. G. Larsen, and N. Markey. Timed Automata with Observers under Energy Constraints. In Proceedings of the 13th International Conference on Hybrid Systems: Computation and Control (HSCC'10), pages 61--70, Stockholm, Sweden, April 2010. ACM Press.
doi: 10.1145/1755952.1755963.
[ BibTex | DOI | Web page | PDF ]
[Gou10a]: J. Goubault-Larrecq. De Groot Duality and Models of Choice: Angels, Demons, and Nature. Mathematical Structures in Computer Science, 20(2):169--237, April 2010.
doi: 10.1017/S0960129509990363.
[ BibTex | DOI | Web page | PDF ]
[CKW10]: V. Cortier, S. Kremer, and B. Warinschi. A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems. Journal of Automated Reasoning, 46(3-4):225--259, April 2010.
doi: 10.1007/s10817-010-9187-9.
[ BibTex | DOI | Web page | PDF ]
[BH10a]: M. Ben Hmida and S. Haddad. Client Synthesis for Aspect Oriented Web Services. In Revised Selected Papers of the 15th Monterey Workshop on Foundations of Computer Software (MONTEREY'08), volume 6028 of Lecture Notes in Computer Science, pages 24--42, Budapest, Hungary, April 2010. Springer.
doi: 10.1007/978-3-642-12566-9_2.
[ BibTex | DOI | Web page | PDF ]
[RHS10]: L. Recalde, S. Haddad, and M. Silva. Continuous Petri Nets: Expressive Power and Decidability Issues. International Journal of Foundations of Computer Science, 21(2):235--256, April 2010.
doi: 10.1142/S0129054110007222.
[ BibTex | DOI ]
[VLC10]: J. Villard, É. Lozes, and C. Calcagno. Tracking Heaps that Hop with Heap-Hop. In Proceedings of the 16th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'10), volume 6015 of Lecture Notes in Computer Science, pages 275--279, Paphos, Cyprus, March 2010. Springer.
doi: 10.1007/978-3-642-12002-2_23.
[ BibTex | DOI | Web page | PDF ]
[DS10]: S. Demri and A. Sangnier. When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. In Proceedings of the 13th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'10), volume 6014 of Lecture Notes in Computer Science, pages 176--190, Paphos, Cyprus, March 2010. Springer.
doi: 10.1007/978-3-642-12032-9_13.
[ BibTex | DOI | Web page | PDF ]
[tCF10]: B. ten Cate and G. Fontaine. An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees. In Proceedings of the 13th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'10), volume 6014 of Lecture Notes in Computer Science, pages 161--175, Paphos, Cyprus, March 2010. Springer.
doi: 10.1007/978-3-642-12032-9_12.
[ BibTex | DOI | Web page | PDF ]
[CS10c]: P. Chambart and Ph. Schnoebelen. Toward a compositional theory of leftist grammars and transformations. In Proceedings of the 13th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'10), volume 6014 of Lecture Notes in Computer Science, pages 237--251, Paphos, Cyprus, March 2010. Springer.
doi: 10.1007/978-3-642-12032-9_17.
[ BibTex | DOI | Web page | PDF ]
[DKR10a]: S. Delaune, S. Kremer, and M. D. Ryan. Symbolic bisimulation for the applied pi calculus. Journal of Computer Security, 18(2):317--377, March 2010.
doi: 10.3233/JCS-2010-0363.
[ BibTex | DOI | Web page | PDF ]
[Bon10]: R. Bonnet. Well-structured Petri-nets extensions with data. Rapport de Master, Master Computer Science, EPFL, Lausanne, Switzerland, March 2010.
[ BibTex | Web page | PDF ]
[tCS10]: B. ten Cate and L. Segoufin. Transitive Closure Logic, Nested Tree Walking Automata, and XPath. Journal of the ACM, 57(3), March 2010.
doi: 10.1145/1706591.1706598.
[ BibTex | DOI | Web page | PDF ]
[Seg10]: L. Segoufin, editor. Proceedings of the 13th International Conference on Database Theory (ICDT'10), March 2010.
[ BibTex | Web page ]
[ACK⁺10]: S. Abiteboul, T.-H. H. Chan, E. Kharlamov, W. Nutt, and P. Senellart. Aggregate queries for discrete and continuous probabilistic XML. In Proceedings of the 13th International Conference on Database Theory (ICDT'10), pages 50--61, Lausanne, Switzerland, March 2010. ACM Press.
doi: 10.1145/1804669.1804679.
[ BibTex | DOI | Web page | PDF ]
[Fig10a]: D. Figueira. Forward-XPath and extended register automata on data-trees. In Proceedings of the 13th International Conference on Database Theory (ICDT'10), pages 230--240, Lausanne, Switzerland, March 2010. ACM Press.
doi: 10.1145/1804669.1804699.
[ BibTex | DOI | Web page | PS | PDF ]
[DR10b]: L. Doyen and J.-F. Raskin. Antichains Algorithms for Finite Automata. In Proceedings of the 16th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'10), volume 6015 of Lecture Notes in Computer Science, pages 2--22, Paphos, Cyprus, March 2010. Springer.
doi: 10.1007/978-3-642-12002-2_2.
[ BibTex | DOI | Web page | PS | PDF ]
[BCM10]: P. Bouyer, F. Chevalier, and N. Markey. On the Expressiveness of TPTL and MTL. Information and Computation, 208(2):97--116, February 2010.
doi: 10.1016/j.ic.2009.10.004.
[ BibTex | DOI | Web page | PDF ]
[AHL⁺10]: A. Antonik, M. Huth, K. G. Larsen, U. Nyman, and A. Wąsowski. Modal and mixed specifications: key decision problems and their complexities. Mathematical Structures in Computer Science, 10(1):75--103, February 2010.
doi: 10.1017/S0960129509990260.
[ BibTex | DOI | Web page | PDF ]
[GAMS10]: A. Galland, S. Abiteboul, A. Marian, and P. Senellart. Corroborating information from disagreeing views. In Proceedings of the 3rd International Conference on Web Search and Web Data Mining (WSDM'10), pages 131--140, New York, New York, USA, February 2010. ACM Press.
doi: 10.1145/1718487.1718504.
[ BibTex | DOI | Web page | PDF ]
[Sch10a]: S. Schmitz. An Experimental Ambiguity Detection Tool. Science of Computer Programming, 75(1-2):71--84, January 2010.
doi: 10.1016/j.scico.2009.07.002.
[ BibTex | DOI | Web page | PDF ]
[CLPV10]: R. Chadha, A. Legay, P. Prabhakar, and M. Viswanathan. Complexity bounds for the verification of real-time software. In Proceedings of the 11th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'10), volume 5944 of Lecture Notes in Computer Science, pages 95--111, Madrid, Spain, January 2010. Springer.
doi: 10.1007/978-3-642-11319-2_10.
[ BibTex | DOI | Web page | PDF ]
[BBC10b]: P. Bouyer, Th. Brihaye, and F. Chevalier. O-Minimal Hybrid Reachability Games. Logical Methods in Computer Science, 6(1:1), January 2010.
doi: 10.2168/LMCS-6(1:1)2010.
[ BibTex | DOI | Web page | PDF ]
[FS10]: A. Finkel and A. Sangnier. Mixing coverability and reachability to analyze VASS with one zero-test. In Proceedings of the 36th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'10), volume 5901 of Lecture Notes in Computer Science, pages 394--406, Špindlerův Mlýn, Czech Republic, January 2010. Springer.
doi: 10.1007/978-3-642-11266-9_33.
[ BibTex | DOI | Web page | PS | PDF ]
[BKKL10b]: B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. SMA---The Smyle Modeling Approach. Computing and Informatics, 29(1):45--72, 2010.
[ BibTex | Web page | PDF ]
[ZBH10]: M. Zargayouna, F. Balbo, and S. Haddad. Agents Secure Interaction in Data Driven Languages. In Revised Selected Papers of the 2nd Workshop on LAnguages, methodologies and Development tools for multi-agent systemS (LADS'09), volume 6039 of Lecture Notes in Computer Science, pages 72--91, Turin, Italy, 2010. Springer.
doi: 10.1007/978-3-642-13338-1_5.
[ BibTex | DOI | Web page | PDF ]
[CCZ10]: H. Comon-Lundh, V. Cortier, and E. Zălinescu. Deciding security properties for cryptographic protocols. Application to key cycles. ACM Transactions on Computational Logic, 11(2), January 2010.
doi: 10.1145/1656242.1656244.
[ BibTex | DOI | Web page | PDF ]
[AF10b]: P. Arnoux and A. Finkel. Using mental imagery processes for teaching and research in mathematics and computer science. International Journal of Mathematical Education in Science and Technology, 41(2):229--242, January 2010.
doi: 10.1080/00207390903372429.
[ BibTex | DOI | Web page | PDF ]
[Ber10]: D. Berwanger. Infinite Coordination Games. In Logic and the Foundations of Game and Decision Theory (LOFT8), volume 6006 of Lecture Notes in Artificial Intelligence, pages 1--19. Springer, 2010.
doi: 10.1007/978-3-642-15164-4_1.
[ BibTex | DOI | Web page | PDF ]
[CDH10c]: K. Chatterjee, L. Doyen, and Th. A. Henzinger. Quantitative Languages. ACM Transactions on Computational Logic, 11(4), 2010.
[ BibTex | Web page | PS | PDF ]
[MLRS10]: N. Markey, S. Li, J.-F. Raskin, and M. Stoelinga. Synthesizing controllers with bounded resources. Deliverable QUASIMODO 3.4 (ICT-FP7-STREP-214755), January 2010.
[ BibTex ]
[LS10a]: L. Libkin and C. Sirangelo. Disjoint pattern matching and implication in strings. Information Processing Letters, 110(4):143--147, January 2010.
doi: 10.1016/j.ipl.2009.11.009.
[ BibTex | DOI | Web page | PDF ]
[DFGvD10]: S. Demri, A. Finkel, V. Goranko, and G. van Drimmelen. Model-checking CTL^* over Flat Presburger Counter Systems. Journal of Applied Non-Classical Logics, 20(4):313--344, 2010.
doi: 10.3166/jancl.20.313-344.
[ BibTex | DOI | Web page | PDF ]
[CDMP09]: F. Chevalier, D. D'Souza, R. M. Matteplackel, and P. Prabhakar. Automata and logics over finitely varying functions. Annals of Pure and Applied Logics, 161(3):324--336, December 2009.
doi: 10.1016/j.apal.2009.07.007.
[ BibTex | DOI | Web page | PDF ]
[Mer09]: A. Mercier. Contributions à l'analyse automatique des protocoles cryptographiques en présence de propriétés algébriques : protocoles de groupe, équivalence statique. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2009.
[ BibTex | Web page | PDF ]
[Bur09a]: S. Bursuc. Contraintes de déductibilité dans une algèbre quotient: réduction de modèles et applications à la sécurité. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2009.
[ BibTex | Web page | PDF ]
[Gou09a]: J. Goubault-Larrecq. Logic Wins!. In Proceedings of the 13th Asian Computing Science Conference (ASIAN'09), volume 5913 of Lecture Notes in Computer Science, pages 1--16, Seoul, Korea, December 2009. Springer.
doi: 10.1007/978-3-642-10622-4_1.
[ BibTex | DOI | Web page | PDF ]
[DJLL09]: S. Demri, M. Jurdziński, O. Lachish, and R. Lazić. The covering and boundedness problems for branching vector addition systems. In Proceedings of the 29th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'09), volume 4 of Leibniz International Proceedings in Informatics, pages 181--192, Kanpur, India, December 2009. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2009.2317.
[ BibTex | DOI | Web page | PDF ]
[DKP09]: S. Delaune, S. Kremer, and O. Pereira. Simulation based security in the applied pi calculus. In Proceedings of the 29th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'09), volume 4 of Leibniz International Proceedings in Informatics, pages 169--180, Kanpur, India, December 2009. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2009.2316.
[ BibTex | DOI | Web page | PDF ]
[VLC09]: J. Villard, É. Lozes, and C. Calcagno. Proving Copyless Message Passing. In Proceedings of the 7th Asian Symposium on Programming Languages and Systems (APLAS'09), volume 5904 of Lecture Notes in Computer Science, pages 194--209, Seoul, Korea, December 2009. Springer.
doi: 10.1007/978-3-642-10672-9_15.
[ BibTex | DOI | Web page | PDF ]
[BBC09]: P. Bouyer, Th. Brihaye, and F. Chevalier. Weighted O-Minimal Hybrid Systems. Annals of Pure and Applied Logics, 161(3):268--288, December 2009.
doi: 10.1016/j.apal.2009.07.014.
[ BibTex | DOI | Web page | PDF ]
[KMT09a]: S. Kremer, A. Mercier, and R. Treinen. Reducing Equational Theories for the Decision of Static Equivalence. In Proceedings of the 13th Asian Computing Science Conference (ASIAN'09), volume 5913 of Lecture Notes in Computer Science, pages 94--108, Seoul, Korea, December 2009. Springer.
doi: 10.1007/978-3-642-10622-4_8.
[ BibTex | DOI | Web page | PS | PDF ]
[BDC09]: S. Bursuc, S. Delaune, and H. Comon-Lundh. Deducibility constraints. In Proceedings of the 13th Asian Computing Science Conference (ASIAN'09), volume 5913 of Lecture Notes in Computer Science, pages 24--38, Seoul, Korea, December 2009. Springer.
doi: 10.1007/978-3-642-10622-4_3.
[ BibTex | DOI | Web page | PS | PDF ]
[BDL09]: R. Brochenin, S. Demri, and É. Lozes. Reasoning about sequences of memory states. Annals of Pure and Applied Logics, 161(3):305--323, December 2009.
doi: 10.1016/j.apal.2009.07.004.
[ BibTex | DOI | Web page | PDF ]
[DG09a]: S. Demri and R. Gascon. The Effects of Bounding Syntactic Resources on Presburger LTL. Journal of Logic and Computation, 19(6):1541--1575, December 2009.
doi: 10.1093/logcom/exp037.
[ BibTex | DOI | Web page | PDF ]
[ASV09b]: S. Abiteboul, L. Segoufin, and V. Vianu. Static Analysis of Active XML Systems. ACM Transactions on Database Systems, 34(4), December 2009.
doi: 10.1145/1620585.1620590.
[ BibTex | DOI | Web page | PDF ]
[Haa09]: S. Haar. Qualitative Diagnosability of Labeled Petri Nets Revisited. In Proceedings of the Joint 48th IEEE Conference on Decision and Control (CDC'09) and 28th Chinese Control Conference (CCC'09), pages 1248--1253, Shanghai, China, December 2009. IEEE Control System Society.
doi: 10.1109/CDC.2009.5400917.
[ BibTex | DOI | Web page | PDF ]
[Bou09a]: F. Bouchy. Logiques et modèles pour la vérification de systèmes infinis. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2009.
[ BibTex | Web page | PDF ]
[Szn09]: N. Sznajder. Synthèse de systèmes distribués ouverts. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2009.
[ BibTex | Web page | PDF ]
[SRKK09]: B. Smyth, M. D. Ryan, S. Kremer, and M. Kourjieh. Election verifiability in electronic voting protocols (Preliminary version). In Proceedings of the 4th Benelux Workshop on Information and System Security (WISSEC'09), Louvain-la-Neuve, Belgium, November 2009.
[ BibTex | Web page | PDF ]
[BFS09a]: F. Bouchy, A. Finkel, and P. San Pietro. Dense-choice Counter Machines Revisited. In Proceedings of the 11th International Workshops on Verification of Infinite State Systems (INFINITY'09), volume 10 of Electronic Proceedings in Theoretical Computer Science, pages 3--22, Bologna, Italy, November 2009.
doi: 10.4204/EPTCS.10.1.
[ BibTex | DOI | Web page | PDF ]
[AF09a]: É. André and L. Fribourg. An Inverse Method for Policy-Iteration Based Algorithms. In Proceedings of the 11th International Workshops on Verification of Infinite State Systems (INFINITY'09), volume 10 of Electronic Proceedings in Theoretical Computer Science, pages 44--61, Bologna, Italy, November 2009.
doi: 10.4204/EPTCS.10.4.
[ BibTex | DOI | Web page | PDF ]
[HMY09]: S. Haddad, L. Mokdad, and S. Youcef. Bornes du temps de réponse des services Web composites. In Actes du 7ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'09), volume 43 of Journal Européen des Systèmes Automatisés, pages 969--983, Nantes, France, November 2009. Hermès.
[ BibTex | Web page | PDF ]
[ACD⁺09a]: É. André, Th. Chatain, O. De Smet, L. Fribourg, and S. Ruel. Synthèse de contraintes temporisées pour une architecture d'automatisation en réseau. In Actes du 7ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'09), volume 43 of Journal Européen des Systèmes Automatisés, pages 1049--1064, Nantes, France, November 2009. Hermès.
[ BibTex | Web page | PDF ]
[Ste09b]: G. Steel. Towards a Formal Analysis of the SeVeCoM API. In Proceedings of the 7th Conference on Embedded Security in Cars (ESCAR'09), Düsseldorf, Germany, November 2009.
[ BibTex | Web page | PDF ]
[LCE⁺09]: LIAFA, CRIL, EDF, LSV, and Verimag. Projet RNTL Averiles -- Fourniture F2.2 : Algorithmes de vérification -- Rapport final, November 2009. 25 pages.
[ BibTex | Web page | PDF ]
[FLS09a]: A. Finkel, É. Lozes, and A. Sangnier. Towards Model Checking Pointer Systems. In Revised Selected Papers of the International Conference on Infinity in Logic & Computation (ILC'07), volume 5489 of Lecture Notes in Artificial Intelligence, pages 56--82, Cape Town, South Africa, October 2009. Springer-Verlag.
doi: 10.1007/978-3-642-03092-5_6.
[ BibTex | DOI | Web page | PS | PDF ]
[AKSS09]: S. Abiteboul, B. Kimelfeld, Y. Sagiv, and P. Senellart. On the expressiveness of probabilistic XML models. The VLDB Journal, 18(5):1041--1064, October 2009.
doi: 10.1007/s00778-009-0146-1.
[ BibTex | DOI | Web page | PDF ]
[CM09]: F. Cassez and N. Markey. Control of Timed Systems. In Communicating Embedded Systems -- Software and Design, chapter 3, pages 83--120. Wiley-ISTE, October 2009.
[ BibTex | Web page ]
[DH09]: S. Donatelli and S. Haddad. Quantitative Verification of Markov Chains. In Communicating Embedded Systems -- Software and Design, chapter 5, pages 139--163. Wiley-ISTE, October 2009.
[ BibTex | Web page ]
[Cha09]: N. Chamseddine. Analyse quantitative parametrée d'automates temporisés probabilistes. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2009.
[ BibTex | Web page | PDF ]
[CCD09]: V. Cheval, H. Comon-Lundh, and S. Delaune. A decision procedure for proving observational equivalence. In Preliminary Proceedings of the 7th International Workshop on Security Issues in Coordination Models, Languages and Systems (SecCo'09), Bologna, Italy, October 2009.
[ BibTex | Web page | PDF ]
[Dim09]: J. Dimino. Les systèmes à canaux non-fiables vus comme des transducteurs. Rapport de stage de M1, Master Parisien de Recherche en Informatique, Paris, France, October 2009.
[ BibTex | Web page | PDF ]
[FLS09b]: R. Focardi, F. L. Luccio, and G. Steel. Blunting Differential Attacks on PIN Processing APIs. In Proceedings of the 14th Nordic Workshop on Secure IT Systems (NordSec'09), volume 5838 of Lecture Notes in Computer Science, pages 88--103, Oslo, Norway, October 2009. Springer.
doi: 10.1007/978-3-642-04766-4_7.
[ BibTex | DOI | Web page | PDF ]
[BCHK09]: Y. Boichut, R. Courbis, P.-C. Héam, and O. Kouchnarenko. Handling Non-left Linear Rules when Completing Tree Automata. International Journal of Foundations of Computer Science, 20(5):837--849, October 2009.
doi: 10.1142/S0129054109006917.
[ BibTex | DOI | Web page | PDF ]
[ACEF09]: É. André, Th. Chatain, E. Encrenaz, and L. Fribourg. An Inverse Method for Parametric Timed Automata. International Journal of Foundations of Computer Science, 20(5):819--836, October 2009.
doi: 10.1142/S0129054109006905.
[ BibTex | DOI | Web page | PDF ]
[DHL09]: F. Dadeau, P.-C. Héam, and J. Levrey. On the Use of Uniform Random Generation of Automata for Testing. In Proceedings of the 5th Workshop on Model-Based Testing (MBT'09), volume 253 of Electronic Notes in Theoretical Computer Science, pages 37--51, York, UK, October 2009. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2009.09.050.
[ BibTex | DOI | Web page | PDF ]
[BS09a]: M. Benedikt and L. Segoufin. Regular tree languages definable in FO and in FO_mod. ACM Transactions on Computational Logic, 11(1), October 2009.
doi: 10.1145/1614431.1614435.
[ BibTex | DOI | Web page | PDF ]
[DBB⁺09]: A. David, G. Behrmann, P. Bulychev, J. Byg, Th. Chatain, K. G. Larsen, P. Pettersson, J. I. Rasmussen, J. Srba, W. Yi, K. Y. Joergensen, D. Lime, M. Magnin, O. H. Roux, and L.-M. Traonouez. Tools for Model-Checking Timed Systems. In Communicating Embedded Systems -- Software and Design, chapter 6, pages 165--225. Wiley-ISTE, October 2009.
[ BibTex | Web page ]
[ASV09a]: S. Abiteboul, L. Segoufin, and V. Vianu. Modeling and Verifying Active XML Artifacts. IEEE Data Engineering Bulletin, 32(3):10--15, September 2009.
[ BibTex | DOI | Web page | PDF ]
[Che09]: V. Cheval. Algorithme de décision de l'équivalence symbolique de systèmes de contraintes. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2009.
[ BibTex | Web page | PDF ]
[Bre09]: R. Brenguier. Calcul des équilibres de Nash dans les jeux temporisés. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2009.
[ BibTex | Web page | PS | PDF ]
[BCH⁺09]: C. Boutrous-Saab, D. Coulibaly, S. Haddad, T. Melliti, P. Moreaux, and S. Rampacek. An Integrated Framework for Web Services Orchestration. International Journal of Web Services Research, 6(4):1--29, September 2009.
[ BibTex | Web page | PDF ]
[AFS09]: É. André, L. Fribourg, and J. Sproston. An Extension of the Inverse Method to Probabilistic Timed Automata. In Proceedings of the 9th International Workshop on Automated Verification of Critical Systems (AVoCS'09), volume 23 of Electronic Communications of the EASST, Swansea, UK, September 2009. European Association of Software Science and Technology.
[ BibTex | Web page | PDF ]
[CDL09]: Th. Chatain, A. David, and K. G. Larsen. Playing Games with Timed Games. In Proceedings of the 3rd IFAC Conference on Analysis and Design of Hybrid Systems (ADHS'09), Zaragoza, Spain, September 2009.
[ BibTex | Web page | PDF ]
[BHK09]: Y. Boichut, P.-C. Héam, and O. Kouchnarenko. How to Tackle Integer Weighted Automata Positivity. In Proceedings of the 3rd Workshop on Reachability Problems in Computational Models (RP'09), volume 5797 of Lecture Notes in Computer Science, pages 79--92, Palaiseau, France, September 2009. Springer.
doi: 10.1007/978-3-642-04420-5_9.
[ BibTex | DOI | Web page | PDF ]
[BCDL09]: P. Bulychev, Th. Chatain, A. David, and K. G. Larsen. Checking simulation relation between timed game automata. In Proceedings of the 7th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'09), volume 5813 of Lecture Notes in Computer Science, pages 73--87, Budapest, Hungary, September 2009. Springer.
doi: 10.1007/978-3-642-04368-0_8.
[ BibTex | DOI | Web page | PDF ]
[HP09]: S. Haddad and N. Pekergin. Using Stochastic Comparison for Efficient Model Checking of Uncertain Markov Chains. In Proceedings of the 6th International Conference on Quantitative Evaluation of Systems (QEST'09), pages 177--186, Budapest, Hungary, September 2009. IEEE Computer Society Press.
doi: 10.1109/QEST.2009.42.
[ BibTex | DOI | Web page | PDF ]
[CFLS09]: M. Centenaro, R. Focardi, F. L. Luccio, and G. Steel. Type-based Analysis of PIN Processing APIs. In Proceedings of the 14th European Symposium on Research in Computer Security (ESORICS'09), volume 5789 of Lecture Notes in Computer Science, pages 53--68, Saint Malo, France, September 2009. Springer.
doi: 10.1007/978-3-642-04444-1_4.
[ BibTex | DOI | Web page | PDF ]
[CS09]: V. Cortier and G. Steel. A generic security API for symmetric key management on cryptographic devices. In Proceedings of the 14th European Symposium on Research in Computer Security (ESORICS'09), volume 5789 of Lecture Notes in Computer Science, pages 605--620, Saint Malo, France, September 2009. Springer.
doi: 10.1007/978-3-642-04444-1_37.
[ BibTex | DOI | Web page | PDF ]
[CAM09]: B. Cautis, S. Abiteboul, and T. Milo. Reasoning about XML update constraints. Journal of Computer and System Sciences, 75(6):336--358, September 2009.
doi: 10.1016/j.jcss.2009.02.001.
[ BibTex | DOI | Web page | PDF ]
[BHR09a]: A. Bouillard, S. Haar, and S. Rosario. Critical paths in the Partial Order Unfolding of a Stochastic Petri Net. In Proceedings of the 7th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'09), volume 5813 of Lecture Notes in Computer Science, pages 43--57, Budapest, Hungary, September 2009. Springer.
doi: 10.1007/978-3-642-04368-0_6.
[ BibTex | DOI | Web page | PDF ]
[BDMR09]: P. Bouyer, M. Duflot, N. Markey, and G. Renault. Measuring Permissivity in Finite Games. In Proceedings of the 20th International Conference on Concurrency Theory (CONCUR'09), volume 5710 of Lecture Notes in Computer Science, pages 196--210, Bologna, Italy, September 2009. Springer.
doi: 10.1007/978-3-642-04081-8_14.
[ BibTex | DOI | Web page | PDF ]
[CC09]: S. Ciobâcă and V. Cortier. Algorithmes pour l'équivalence statique. Deliverable AVOTE 2.1 (ANR-07-SESU-002), September 2009. 17 pages.
[ BibTex | Web page | PDF ]
[BK09]: M. Boreale and S. Kremer, editors. Proceedings of the 7th International Workshop on Security Issues in Concurrency (SecCo'09), volume 7 of Electronic Proceedings in Theoretical Computer Science, Bologna, Italy, August 2009.
doi: 10.4204/EPTCS.7.
[ BibTex | DOI | Web page ]
[FS09a]: D. Figueira and L. Segoufin. Future-looking logics on data words and trees. In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS'09), volume 5734 of Lecture Notes in Computer Science, pages 331--343, Novy Smokovec, Slovakia, August 2009. Springer.
doi: 10.1007/978-3-642-03816-7_29.
[ BibTex | DOI | Web page | PS | PDF ]
[KAS09]: G. Keighren, D. Aspinall, and G. Steel. Towards a Type System for Security APIs. In Revised Selected Papers of the Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security (ARSPA-WITS'09), volume 5511 of Lecture Notes in Computer Science, pages 173--192, York, UK, August 2009. Springer.
doi: 10.1007/978-3-642-03459-6_12.
[ BibTex | DOI | Web page | PDF ]
[FS09b]: S. Fröschle and G. Steel. Analysing PKCS#11 Key Management APIs with Unbounded Fresh Data. In Revised Selected Papers of the Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security (ARSPA-WITS'09), volume 5511 of Lecture Notes in Computer Science, pages 92--106, York, UK, August 2009. Springer.
doi: 10.1007/978-3-642-03459-6_7.
[ BibTex | DOI | Web page | PDF ]
[LA09]: D. Longuet and M. Aiguier. Integration Testing from Structured First-Order Specifications via Deduction Modulo. In Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (ICTAC'09), volume 5684 of Lecture Notes in Computer Science, pages 261--276, Kuala Lumpur, Malaysia, August 2009. Springer.
doi: 10.1007/978-3-642-03466-4_17.
[ BibTex | DOI | Web page | PDF ]
[And09b]: É. André. IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata. In Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (ICTAC'09), volume 5684 of Lecture Notes in Computer Science, pages 336--342, Kuala Lumpur, Malaysia, August 2009. Springer.
doi: 10.1007/978-3-642-03466-4_22.
[ BibTex | DOI | Web page | PDF ]
[CDK09c]: S. Ciobâcă, S. Delaune, and S. Kremer. Computing knowledge in security protocols under convergent equational theories. In Proceedings of the 22nd International Conference on Automated Deduction (CADE'09), volume 5663 of Lecture Notes in Computer Science, pages 355--370, Montreal, Canada, August 2009. Springer.
doi: 10.1007/978-3-642-02959-2_27.
[ BibTex | DOI | Web page | PDF ]
[KP09]: S. Kremer and P. Panangaden, editors. Proceedings of the 6th International Workshop on Security Issues in Concurrency (SecCo'08), volume 242 of Electronic Notes in Theoretical Computer Science, Toronto, Canada, August 2009. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2009.07.077.
[ BibTex | DOI | Web page ]
[EF09]: E. Encrenaz and A. Finkel. Automatic verification of counter systems with ranking functions. In Joint Proceedings of the 8th, 9th and 10th International Workshops on Verification of Infinite State Systems (INFINITY'06,'07,'08), volume 239 of Electronic Notes in Theoretical Computer Science, pages 85--103. Elsevier Science Publishers, July 2009.
doi: 10.1016/j.entcs.2009.05.032.
[ BibTex | DOI | Web page | PS | PDF ]
[DKR09]: S. Delaune, S. Kremer, and M. D. Ryan. Verifying Privacy-type Properties of Electronic Voting Protocols. Journal of Computer Security, 17(4):435--487, July 2009.
doi: 10.3233/JCS-2009-0340.
[ BibTex | DOI | Web page | PS | PDF ]
[BFS09b]: F. Bouchy, A. Finkel, and A. Sangnier. Reachability in Timed Counter Systems. In Joint Proceedings of the 8th, 9th and 10th International Workshops on Verification of Infinite State Systems (INFINITY'06,'07,'08), volume 239 of Electronic Notes in Theoretical Computer Science, pages 167--178. Elsevier Science Publishers, July 2009.
doi: 10.1016/j.entcs.2009.05.038.
[ BibTex | DOI | Web page | PDF ]
[HV09a]: P. Habermehl and T. Vojnar, editors. Joint Proceedings of the 8th, 9th and 10th International Workshops on Verification of Infinite State Systems (INFINITY'06,'07,'08), volume 239 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, July 2009.
doi: 10.1016/j.entcs.2009.05.026.
[ BibTex | DOI ]
[And09a]: É. André. Everything You Always Wanted to Know About IMITATOR (But Were Afraid to Ask). Research Report LSV-09-20, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2009. 11 pages.
[ BibTex | Web page | PDF ]
[AF09b]: C. Areces and D. Figueira. Which Semantics for Neighbourhood Semantics? In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI'09), pages 671--676, Pasadena, California, USA, July 2009. AAAI Press.
[ BibTex | Web page | PS | PDF ]
[BHS09]: B. Bérard, S. Haddad, and M. Sassolas. Verification on Interrupt Timed Automata. Research Report LSV-09-16, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2009. 16 pages.
[ BibTex | Web page | PDF ]
[HN09]: P.-C. Héam and C. Nicaud. Seed: an Easy-to-Use Random Generator of Recursive Data Structures for Testing. Research Report LSV-09-15, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2009. 16 pages.
[ BibTex | Web page | PDF ]
[CDK09b]: S. Ciobâcă, S. Delaune, and S. Kremer. Computing knowledge in security protocols under convergent equational theories. In Preliminary Proceedings of the 4th International Workshop on Security and Rewriting Techniques (SecReT'09), pages 47--58, Port Jefferson, New York, USA, July 2009.
[ BibTex | Web page | PDF ]
[ACD09b]: M. Arnaud, V. Cortier, and S. Delaune. Modeling and Verifying Ad Hoc Routing Protocol. In Preliminary Proceedings of the 4th International Workshop on Security and Rewriting Techniques (SecReT'09), pages 33--46, Port Jefferson, New York, USA, July 2009.
[ BibTex | Web page | PS | PDF ]
[KMT09b]: S. Kremer, A. Mercier, and R. Treinen. Reducing Equational Theories for the Decision of Static Equivalence (Preliminary Version). In Preliminary Proceedings of the 4th International Workshop on Security and Rewriting Techniques (SecReT'09), Port Jefferson, New York, USA, July 2009.
[ BibTex | Web page | PS | PDF ]
[AFGM09]: C. Areces, D. Figueira, D. Gorín, and S. Mera. Tableaux and Model Checking for Memory Logics. In Proceedings of the 18th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX'09), volume 5607 of Lecture Notes in Artificial Intelligence, pages 47--61, Oslo, Norway, July 2009. Springer.
doi: 10.1007/978-3-642-02716-1_5.
[ BibTex | DOI | Web page | PS | PDF ]
[CHK09]: R. Courbis, P.-C. Héam, and O. Kouchnarenko. TAGED Approximations for Veriying Temporal Patterns. In Proceedings of the 14th International Conference on Implementation and Application of Automata (CIAA'09), volume 5642 of Lecture Notes in Computer Science, pages 135--144, Sydney, Australia, July 2009. Springer-Verlag.
doi: 10.1007/978-3-642-02979-0_17.
[ BibTex | DOI | Web page | PDF ]
[HNS09]: P.-C. Héam, C. Nicaud, and S. Schmitz. Random Generation of Deterministic Tree (Walking) Automata. In Proceedings of the 14th International Conference on Implementation and Application of Automata (CIAA'09), volume 5642 of Lecture Notes in Computer Science, pages 115--124, Sydney, Australia, July 2009. Springer-Verlag.
doi: 10.1007/978-3-642-02979-0_15.
[ BibTex | DOI | Web page | PDF ]
[PS09]: Th. Place and L. Segoufin. A decidable characterization of Locally Testable Tree Languages. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09), volume 5556 of Lecture Notes in Computer Science, pages 285--296, Rhodes, Greece, July 2009. Springer.
doi: 10.1007/978-3-642-02930-1_24.
[ BibTex | DOI | Web page | PDF ]
[FG09b]: A. Finkel and J. Goubault-Larrecq. Forward Analysis for WSTS, Part II: Complete WSTS. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09), volume 5556 of Lecture Notes in Computer Science, pages 188--199, Rhodes, Greece, July 2009. Springer.
doi: 10.1007/978-3-642-02930-1_16.
[ BibTex | DOI | Web page | PDF ]
[BBBB09]: C. Baier, N. Bertrand, P. Bouyer, and Th. Brihaye. When are Timed Automata Determinizable? In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09), volume 5556 of Lecture Notes in Computer Science, pages 43--54, Rhodes, Greece, July 2009. Springer.
doi: 10.1007/978-3-642-02930-1_4.
[ BibTex | DOI | Web page | PDF ]
[BF09]: P. Bouyer and V. Forejt. Reachability in Stochastic Timed Games. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09), volume 5556 of Lecture Notes in Computer Science, pages 103--114, Rhodes, Greece, July 2009. Springer.
doi: 10.1007/978-3-642-02930-1_9.
[ BibTex | DOI | Web page | PDF ]
[CD09a]: V. Cortier and S. Delaune. A method for proving observational equivalence. In Proceedings of the 22nd IEEE Computer Security Foundations Symposium (CSF'09), pages 266--276, Port Jefferson, New York, USA, July 2009. IEEE Computer Society Press.
doi: 10.1109/CSF.2009.9.
[ BibTex | DOI | Web page | PDF ]
[BHKL09]: B. Bollig, P. Habermehl, C. Kern, and M. Leucker. Angluin-Style Learning of NFA. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI'09), pages 1004--1009, Pasadena, California, USA, July 2009. AAAI Press.
[ BibTex | Web page | PDF ]
[Ste09a]: G. Steel. Computational Soundness for APIs. In Proceedings of the 5th Workshop on Formal and Computational Cryptography (FCC'09), Port Jefferson, New York, USA, July 2009.
[ BibTex | Web page | PDF ]
[LS09]: L. Libkin and C. Sirangelo. Open and closed world assumptions in data exchange. In Proceedings of the 22nd International Workshop Description Logic (DL'09), volume 477 of CEUR Workshop Proceedings, pages 1--6, Oxford, UK, July 2009. RWTH Aachen, Germany.
[ BibTex | Web page | PDF ]
[BYBJ09]: N. Ben Youssef, A. Bouhoula, and F. Jacquemard. Automatic Verification of Conformance of Firewall Configurations to Security Policies. In Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC'09), pages 526 -- 531, Sousse, Tunisia, July 2009. IEEE Computer Society Press.
doi: 10.1109/ISCC.2009.5202309.
[ BibTex | DOI | Web page | PDF ]
[LVN09]: F. Laroussinie, F. Vaandrager, and M. Neuhäußer. Extended timed automata for scheduling. Deliverable QUASIMODO 3.5 (ICT-FP7-STREP-214755), July 2009.
[ BibTex ]
[MBD⁺09]: N. Markey, J. Berendsen, A. David, T. Han, H. Hermanns, K. G. Larsen, and M. Neuhäußer. Symbolic data structures and analysis of models with multiple quantitative aspects. Deliverable QUASIMODO 2.2 (ICT-FP7-STREP-214755), July 2009.
[ BibTex ]
[ABGM09]: S. Abiteboul, P. Bourhis, A. Galland, and B. Marinoiu. The AXML Artifact Model. In Proceedings of the 16th International Symposium on Temporal Representation and Reasoning (TIME'09), pages 11--17, Brixen-Bressanone, Italy, July 2009. IEEE Computer Society Press.
[ BibTex | Web page | PDF ]
[AP09]: S. Abiteboul and N. Polyzotis. Searching Shared Content in Communities with the Data Ring. IEEE Data Engineering Bulletin, 32(2):44--51, June 2009.
[ BibTex | DOI | Web page | PDF ]
[AEF09]: É. André, E. Encrenaz, and L. Fribourg. Synthesizing Parametric Constraints on Various Case Studies Using IMITATOR. Research Report LSV-09-13, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2009. 18 pages.
[ BibTex | Web page | PDF ]
[ABC09]: M. Abadi, B. Blanchet, and H. Comon-Lundh. Models and Proofs of Protocol Security: A Progress Report. In Proceedings of the 21st International Conference on Computer Aided Verification (CAV'09), volume 5643 of Lecture Notes in Computer Science, pages 35--49, Grenoble, France, June-July 2009. Springer.
doi: 10.1007/978-3-642-02658-4_5.
[ BibTex | DOI | Web page | PDF ]
[BRBH09]: A. Bouillard, S. Rosario, A. Benveniste, and S. Haar. Monotonicity in Service Orchestrations. In Proceedings of the 30th International Conference on Applications and Theory of Petri Nets (PETRI NETS'09), volume 5606 of Lecture Notes in Computer Science, pages 263--282, Paris, France, June 2009. Springer.
doi: 10.1007/978-3-642-02424-5_16.
[ BibTex | DOI | Web page | PDF ]
[HKP⁺09]: S. Haddad, F. Kordon, L. Petrucci, J.-F. Pradat-Peyre, and N. Trèves. Efficient State-Based Analysis by Introducing Bags in Petri Nets Color Domains. In Proceedings of the 28th American Control Conference (ACC'09), pages 5018--5025, Saint Louis, Missouri, USA, June 2009.
doi: 10.1109/ACC.2009.5160020.
[ BibTex | DOI | Web page | PDF ]
[BG09]: B. Bollig and P. Gastin. Weighted versus Probabilistic Logics. In Proceedings of the 13th International Conference on Developments in Language Theory (DLT'09), volume 5583 of Lecture Notes in Computer Science, pages 18--38, Stuttgart, Germany, June-July 2009. Springer.
doi: 10.1007/978-3-642-02737-6_2.
[ BibTex | DOI | Web page | PDF ]
[AGM09]: S. Abiteboul, G. Gottlob, and M. Manna. Distributed XML Design. In Proceedings of the 28th Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'09), pages 247--258, Providence, Rhode Island, USA, June-July 2009. ACM Press.
doi: 10.1145/1559795.1559833.
[ BibTex | DOI | Web page | PDF ]
[ABM09b]: S. Abiteboul, P. Bourhis, and B. Marinoiu. Satisfiability and relevance for queries over active documents. In Proceedings of the 28th Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'09), pages 87--96, Providence, Rhode Island, USA, June-July 2009. ACM Press.
doi: 10.1145/1559795.1559810.
[ BibTex | DOI | Web page | PDF ]
[BLPS09]: P. Barceló, L. Libkin, A. Poggi, and C. Sirangelo. XML with Incomplete Information: Models, Properties, and Query Answering. In Proceedings of the 28th Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'09), pages 237--246, Providence, Rhode Island, USA, June-July 2009. ACM Press.
doi: 10.1145/1559795.1559832.
[ BibTex | DOI | Web page | PDF ]
[Fig09]: D. Figueira. Satisfiability of Downward XPath with Data Equality Tests. In Proceedings of the 28th Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'09), pages 197--206, Providence, Rhode Island, USA, June-July 2009. ACM Press.
doi: 10.1145/1559795.1559827.
[ BibTex | DOI | Web page | PS | PDF ]
[CDK09a]: R. Chadha, S. Delaune, and S. Kremer. Epistemic Logic for the Applied Pi Calculus. In Proceedings of IFIP International Conference on Formal Techniques for Distributed Systems (FMOODS/FORTE'09), volume 5522 of Lecture Notes in Computer Science, pages 182--197, Lisbon, Portugal, June 2009. Springer.
doi: 10.1007/978-3-642-02138-1_12.
[ BibTex | DOI | Web page | PS | PDF ]
[BC09a]: S. Bursuc and H. Comon-Lundh. Protocol security and algebraic properties: decision results for a bounded number of sessions. In Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA'09), volume 5595 of Lecture Notes in Computer Science, pages 133--147, Brasília, Brazil, June-July 2009. Springer.
doi: 10.1007/978-3-642-02348-4_10.
[ BibTex | DOI | Web page | PDF ]
[GJ09]: G. Godoy and F. Jacquemard. Unique Normalization for Shallow TRS. In Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA'09), volume 5595 of Lecture Notes in Computer Science, pages 63--77, Brasília, Brazil, June-July 2009. Springer.
doi: 10.1007/978-3-642-02348-4_5.
[ BibTex | DOI | Web page | PDF ]
[BCD09a]: M. Baudet, V. Cortier, and S. Delaune. YAPA: A generic tool for computing intruder knowledge. In Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA'09), volume 5595 of Lecture Notes in Computer Science, pages 148--163, Brasília, Brazil, June-July 2009. Springer.
doi: 10.1007/978-3-642-02348-4_11.
[ BibTex | DOI | Web page | PDF ]
[GSZ09]: P. Gastin, N. Sznajder, and M. Zeitoun. Distributed synthesis for well-connected architectures. Formal Methods in System Design, 34(3):215--237, June 2009.
doi: 10.1007/s10703-008-0064-7.
[ BibTex | DOI | Web page | PDF ]
[BFCH09]: M. Beccuti, G. Franceschinis, D. Codetta-Raiteri, and S. Haddad. Parametric NdRFT for the derivation of optimal repair strategies. In Proceedings of the 39th Annual IEEEashIFIP International Conference on Dependable Systems and Networks (DSN'09), pages 399--408, Estoril, Portugal, June-July 2009. IEEE Computer Society Press.
doi: 10.1109/DSN.2009.5270312.
[ BibTex | DOI | Web page | PDF ]
[AC09]: R. Affeldt and H. Comon-Lundh. Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables. In Formal to Practical Security, volume 5458 of Lecture Notes in Computer Science, pages 1--20. Springer, May 2009.
doi: 10.1007/978-3-642-02002-5_1.
[ BibTex | DOI | Web page | PDF ]
[Gou09b]: J. Goubault-Larrecq. On a Generalization of a Result by Valk and Jantzen. Research Report LSV-09-09, Laboratoire Spécification et Vérification, ENS Cachan, France, May 2009. 18 pages.
[ BibTex | Web page | PDF ]
[BMSS09]: M. Bojańczyk, A. Muscholl, Th. Schwentick, and L. Segoufin. Two-variable logic on data trees and applications to XML reasoning. Journal of the ACM, 56(3), May 2009.
doi: 10.1145/1516512.1516515.
[ BibTex | DOI | Web page | PDF ]
[GGJ09]: A. Gascón, G. Godoy, and F. Jacquemard. Closure of Tree Automata Languages under Innermost Rewriting. In Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'08), volume 237 of Electronic Notes in Theoretical Computer Science, pages 23--38, Castle of Hagenberg, Austria, April 2009. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2009.03.033.
[ BibTex | DOI | Web page | PDF ]
[Bur09b]: E. Bursztein. Extending Anticipation Games with Location, Penalty and Timeline. In Revised Selected Papers of the 5th International Workshop on Formal Aspects in Security and Trust (FAST'08), volume 5491 of Lecture Notes in Computer Science, pages 272--286, Malaga, Spain, April 2009. Springer.
doi: 10.1007/978-3-642-01465-9_18.
[ BibTex | DOI | Web page | PDF ]
[DL09]: S. Demri and R. Lazić. LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic, 10(3), April 2009.
doi: 10.1145/1507244.1507246.
[ BibTex | DOI | Web page | PDF ]
[EFSH09]: A. El Fallah Seghrouchni and S. Haddad. Interopérabilité des systèmes multi-agents à l'aide des services web. In Technologies des systèmes multi-agents et applications industrielles, chapter 3, pages 77--99. Hermès, April 2009.
[ BibTex | Web page ]
[JKV09]: F. Jacquemard, F. Klay, and C. Vacher. Rigid Tree Automata. In Proceedings of the 3rd International Conference on Language and Automata Theory and Applications (LATA'09), volume 5457 of Lecture Notes in Computer Science, pages 446--457, Tarragona, Spain, April 2009. Springer.
doi: 10.1007/978-3-642-00982-2_38.
[ BibTex | DOI | Web page | PDF ]
[BCK09]: M. Baudet, V. Cortier, and S. Kremer. Computationally Sound Implementations of Equational Theories against Passive Adversaries. Information and Computation, 207(4):496--520, April 2009.
doi: 10.1016/j.ic.2008.12.005.
[ BibTex | DOI | Web page | PDF ]
[Bou09c]: P. Bouyer. Model-Checking Timed Temporal Logics. In Proceedings of the 4th Workshop on Methods for Modalities (M4M-5), volume 231 of Electronic Notes in Theoretical Computer Science, pages 323--341, Cachan, France, March 2009. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2009.02.044.
[ BibTex | DOI | Web page | PDF ]
[AD09]: C. Areces and S. Demri, editors. Proceedings of the 5th International Workshop on Methods for Modalities (M4M-5), volume 231 of Electronic Notes in Theoretical Computer Science, Cachan, France, March 2009. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2009.02.025.
[ BibTex | DOI | Web page ]
[ABM09a]: S. Abiteboul, P. Bourhis, and B. Marinoiu. Efficient maintenance techniques for views over active documents. In Advances in Database Technology --- Proceedings of the 12th International Conference on Extending Database Technology (EDBT'09), ACM International Conference Proceeding Series, pages 1076--1087, Saint Petersburg, Russia, March 2009. Springer.
doi: 10.1145/1516360.1516483.
[ BibTex | DOI | Web page | PDF ]
[AGMP09]: S. Abiteboul, O. Greenshpan, T. Milo, and N. Polyzotis. MatchUp: Autocompletion for Mashups. In Proceedings of the 25th International Conference on Data Engineering (ICDE'09), pages 1479--1482, Shanghai, China, March-April 2009. IEEE Computer Society Press.
doi: 10.1109/ICDE.2009.47.
[ BibTex | DOI | Web page | PDF ]
[CGM⁺09]: Th. Chatain, P. Gastin, A. Muscholl, N. Sznajder, I. Walukiewicz, and M. Zeitoun. Distributed control for restricted specifications. Deliverable DOTS 2.2 (ANR-06-SETI-003), March 2009.
[ BibTex ]
[BLLM09]: P. Bouyer, F. Laroussinie, D. Lime, and N. Markey. Synthesis of timed controllers. Deliverable DOTS 1.2a (ANR-06-SETI-003), March 2009.
[ BibTex ]
[DHS09]: S. Donatelli, S. Haddad, and J. Sproston. Model Checking Timed and Stochastic Properties with CSL^TA. IEEE Transactions on Software Engineering, 35(2):224--240, March-April 2009.
doi: 10.1109/TSE.2008.108.
[ BibTex | DOI | Web page | PDF ]
[BCD⁺09b]: D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and Th. A. Henzinger. Alpaga: A Tool for Solving Parity Games with Imperfect Information. In Proceedings of the 15th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'09), volume 5505 of Lecture Notes in Computer Science, pages 58--61, York, UK, March 2009. Springer.
doi: 10.1007/978-3-642-00768-2_7.
[ BibTex | DOI | Web page | PDF ]
[BBL09]: K. Bansal, R. Brochenin, and É. Lozes. Beyond Shapes: Lists with Ordered Data. In Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'09), volume 5504 of Lecture Notes in Computer Science, pages 425--439, York, UK, March 2009. Springer.
doi: 10.1007/978-3-642-00596-1_30.
[ BibTex | DOI | Web page | PDF ]
[BH09]: B. Bérard and S. Haddad. Interrupt Timed Automata. In Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'09), volume 5504 of Lecture Notes in Computer Science, pages 197--211, York, UK, March 2009. Springer.
doi: 10.1007/978-3-642-00596-1_15.
[ BibTex | DOI | Web page | PDF ]
[BGH09]: B. Bollig, M.-L. Grindei, and P. Habermehl. Realizability of Concurrent Recursive Programs. In Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'09), volume 5504 of Lecture Notes in Computer Science, pages 410--424, York, UK, March 2009. Springer.
doi: 10.1007/978-3-642-00596-1_29.
[ BibTex | DOI | Web page | PDF ]
[BS09b]: M. Benedikt and L. Segoufin. Towards a Characterization of Order-Invariant Queries over Tame Structures. Journal of Symbolic Logic, 74(1):168--186, March 2009.
doi: 10.2178/jsl/1231082307.
[ BibTex | DOI | Web page | PDF ]
[CEFX09]: R. Chevallier, E. Encrenaz-Tiphène, L. Fribourg, and W. Xu. Timed Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata. Formal Methods in System Design, 34(1):59--81, February 2009.
doi: 10.1007/s10703-008-0061-x.
[ BibTex | DOI | Web page | PS | PDF ]
[CD09b]: V. Cortier and S. Delaune. Safely Composing Security Protocols. Formal Methods in System Design, 34(1):1--36, February 2009.
doi: 10.1007/s10703-008-0059-4.
[ BibTex | DOI | Web page | PS | PDF ]
[BC09b]: S. Bursuc and H. Comon-Lundh. Protocols, insecurity decision and combination of equational theories. Research Report LSV-09-02, Laboratoire Spécification et Vérification, ENS Cachan, France, February 2009. 43 pages.
[ BibTex | Web page | PDF ]
[FG09a]: A. Finkel and J. Goubault-Larrecq. Forward Analysis for WSTS, Part I: Completions. In Proceedings of the 26th Annual Symposium on Theoretical Aspects of Computer Science (STACS'09), volume 3 of Leibniz International Proceedings in Informatics, pages 433--444, Freiburg, Germany, February 2009. Leibniz-Zentrum für Informatik.
[ BibTex | Web page | PDF ]
[DG09c]: M. Droste and P. Gastin. Weighted automata and weighted logics. In Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, chapter 5, pages 175--211. Springer, 2009.
[ BibTex | Web page | PDF ]
[DG09b]: V. Diekert and P. Gastin. Local safety and local liveness for distributed systems. In Perspectives in Concurrency Theory, IARCS-Universities, pages 86--106. Universities Press, January 2009.
[ BibTex | Web page | PDF ]
[HI09]: S. Haddad and J.-M. Ilié. Symmetry and Temporal Logic. In Petri Nets: Fundamental Models, Verification and Applications, pages 435--460. Wiley-ISTE, 2009.
[ BibTex | Web page ]
[HV09c]: S. Haddad and F. Vernadat. Verification of Specific Properties. In Petri Nets: Fundamental Models, Verification and Applications, pages 349--414. Wiley-ISTE, 2009.
[ BibTex | Web page ]
[HM09c]: S. Haddad and P. Moreaux. Tensor Methods and Stochastic Petri Nets. In Petri Nets: Fundamental Models, Verification and Applications, pages 321--346. Wiley-ISTE, 2009.
[ BibTex | Web page ]
[HM09b]: S. Haddad and P. Moreaux. Stochastic Well-formed Petri Nets. In Petri Nets: Fundamental Models, Verification and Applications, pages 303--320. Wiley-ISTE, 2009.
[ BibTex | Web page ]
[HM09a]: S. Haddad and P. Moreaux. Stochastic Petri Nets. In Petri Nets: Fundamental Models, Verification and Applications, pages 269--302. Wiley-ISTE, 2009.
[ BibTex | Web page ]
[Had09]: S. Haddad. Decidability and Complexity of Petri Net Problems. In Petri Nets: Fundamental Models, Verification and Applications, pages 87--122. Wiley-ISTE, 2009.
[ BibTex | Web page ]
[HV09b]: S. Haddad and F. Vernadat. Analysis Methods for Petri Nets. In Petri Nets: Fundamental Models, Verification and Applications, pages 41--86. Wiley-ISTE, 2009.
[ BibTex | Web page ]
[BHR09b]: P. Bouyer, S. Haddad, and P.-A. Reynier. Undecidability Results for Timed Automata with Silent Transitions. Fundamenta Informaticae, 92(1-2):1--25, 2009.
[ BibTex | Web page | PS | PDF ]
[BKL⁺09]: P. Bouyer, J.-P. Katoen, R. Langerak, F. Laroussinie, N. Markey, and J.-F. Raskin. Transfer of correctness from models to implementation. Deliverable QUASIMODO 3.1 (ICT-FP7-STREP-214755), January 2009.
[ BibTex ]
[Bou09b]: P. Bouyer. From Qualitative to Quantitative Analysis of Timed Systems. Mémoire d'habilitation, Université Paris 7, Paris, France, January 2009.
[ BibTex | Web page | PDF ]
[GMNK09]: P. Gastin, M. Mukund, and K. Narayan Kumar. Reachability and boundedness in time-constrained MSC graphs. In Perspectives in Concurrency Theory, IARCS-Universities, pages 157--183. Universities Press, January 2009.
[ BibTex | Web page | PDF ]
[BP09]: P. Bouyer and A. Petit. On extensions of timed automata. In Perspectives in Concurrency Theory, IARCS-Universities, pages 35--63. Universities Press, January 2009.
[ BibTex ]
[CGS09]: Th. Chatain, P. Gastin, and N. Sznajder. Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. In Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09), volume 5404 of Lecture Notes in Computer Science, pages 141--152, Špindlerův Mlýn, Czech Republic, January 2009. Springer.
doi: 10.1007/978-3-540-95891-8_16.
[ BibTex | DOI | Web page | PDF ]
[BDLM09]: Th. Brihaye, A. Da Costa, F. Laroussinie, and N. Markey. ATL with Strategy Contexts and Bounded Memory. In Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS'09), volume 5407 of Lecture Notes in Computer Science, pages 92--106, Deerfield Beach, Florida, USA, January 2009. Springer.
doi: 10.1007/978-3-540-92687-0_7.
[ BibTex | DOI | Web page | PDF ]
[Com08a]: H. Comon-Lundh. About models of security protocols. In Proceedings of the 28th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'08), volume 2 of Leibniz International Proceedings in Informatics, Bangalore, India, December 2008. Leibniz-Zentrum für Informatik.
[ BibTex | Web page | PDF ]
[Ore08]: G. Oreiby. Logiques temporelles pour le contrôle temporisé. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2008.
[ BibTex | Web page | PDF ]
[GLN08]: J. Goubault-Larrecq, S. Lasota, and D. Nowak. Logical Relations for Monadic Types. Mathematical Structures in Computer Science, 18(6):1169--1217, December 2008. 81 pages.
doi: 10.1017/S0960129508007172.
[ BibTex | DOI | Web page | PDF ]
[Bol08]: B. Bollig. On the Expressive Power of 2-Stack Visibly Pushdown Automata. Logical Methods in Computer Science, 4(4:16), December 2008.
doi: 10.2168/LMCS-4(4:16)2008.
[ BibTex | DOI | Web page | PS | PDF ]
[DG08a]: S. Demri and R. Gascon. Verification of Qualitative Z constraints. Theoretical Computer Science, 409(1):24--40, December 2008.
doi: 10.1016/j.tcs.2008.07.023.
[ BibTex | DOI | Web page | PDF ]
[DDMR08]: M. De Wulf, L. Doyen, N. Markey, and J.-F. Raskin. Robust Safety of Timed Automata. Formal Methods in System Design, 33(1-3):45--84, December 2008.
doi: 10.1007/s10703-008-0056-7.
[ BibTex | DOI | Web page | PDF ]
[ACEF08]: É. André, Th. Chatain, E. Encrenaz, and L. Fribourg. An Inverse Method for Parametric Timed Automata. In Proceedings of the 2nd Workshop on Reachability Problems in Computational Models (RP'08), volume 223 of Electronic Notes in Theoretical Computer Science, pages 29--46, Liverpool, UK, December 2008. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2008.12.029.
[ BibTex | DOI | Web page | PDF ]
[Bur08a]: E. Bursztein. Anticipation games. Théorie des jeux appliqués à la sécurité réseau. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2008.
[ BibTex | Web page | PDF ]
[San08]: A. Sangnier. Vérification de systèmes avec compteurs et pointeurs. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2008.
[ BibTex | Web page | PS | PDF ]
[Ara08]: M. Arapinis. Sécurité des protocoles cryptographiques : décidabilité et résultats de réduction. Thèse de doctorat, Université Paris 12, Créteil, France, November 2008.
[ BibTex | Web page | PDF ]
[ADK08]: M. Arapinis, S. Delaune, and S. Kremer. From One Session to Many: Dynamic Tags for Security Protocols. In Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'08), volume 5330 of Lecture Notes in Artificial Intelligence, pages 128--142, Doha, Qatar, November 2008. Springer.
doi: 10.1007/978-3-540-89439-1_9.
[ BibTex | DOI | Web page | PDF ]
[AGM08]: S. Abiteboul, O. Greenshpan, and T. Milo. Modeling the mashup space. In Proceedings of the 10th ACM International Workshop on Web Information and Data Management (WIDM'08), pages 87--94, Napa Valley, California, USA, October 2008. ACM Press.
doi: 10.1145/1458502.1458517.
[ BibTex | DOI | Web page | PDF ]
[DH08]: S. Donatelli and S. Haddad. Vérification quantitative de chaînes de Markov. In Approches formelles des systèmes embarqués communicants, chapter 6, pages 177--198. Hermès, October 2008.
[ BibTex | Web page ]
[CM08]: F. Cassez and N. Markey. Contrôle des systèmes temporisés. In Approches formelles des systèmes embarqués communicants, chapter 4, pages 105--144. Hermès, October 2008.
[ BibTex | Web page ]
[CC08]: H. Comon-Lundh and V. Cortier. Computational Soundness of Observational Equivalence. In Proceedings of the 15th ACM Conference on Computer and Communications Security (CCS'08), pages 109--118, Alexandria, Virginia, USA, October 2008. ACM Press.
doi: 10.1145/1455770.1455786.
[ BibTex | DOI | Web page | PDF ]
[BCFH08]: M. Beccuti, D. Codetta-Raiteri, G. Franceschinis, and S. Haddad. Non Deterministic Repairable Fault Trees for Computing Optimal Repair Strategy. In Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS'08), Athens, Greece, October 2008. Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering.
doi: 10.4108/ICST.VALUETOOLS2008.4411.
[ BibTex | DOI | Web page | PDF ]
[Bur08c]: E. Bursztein. NetQi: A Model Checker for Anticipation Game. In Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis (ATVA'08), volume 5311 of Lecture Notes in Computer Science, pages 246--251, Seoul, Korea, October 2008. Springer.
doi: 10.1007/978-3-540-88387-6_22.
[ BibTex | DOI | Web page | PDF ]
[BFLP08]: S. Bardin, A. Finkel, J. Leroux, and L. Petrucci. FAST: Acceleration from theory to practice. International Journal on Software Tools for Technology Transfer, 10(5):401--424, October 2008.
doi: 10.1007/s10009-008-0064-3.
[ BibTex | DOI | Web page ]
[RBHJ08]: S. Rosario, A. Benveniste, S. Haar, and C. Jard. Probabilistic QoS and Soft Contracts for Transaction-Based Web Services Orchestrations. IEEE Transactions on Services Computing, 1(4):187--200, October-December 2008.
doi: 10.1109/TSC.2008.17.
[ BibTex | DOI | Web page | PDF ]
[BHK08]: Y. Boichut, P.-C. Héam, and O. Kouchnarenko. Approximation-based Tree Regular Model-Checking. Nordic Journal of Computing, 14(3):216--241, October 2008.
[ BibTex | Web page | PDF ]
[Cio08]: S. Ciobâcă. Verification of anonymity properties in e-voting protocols. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2008.
[ BibTex | Web page | PDF ]
[L⁺08b]: F. Laroussinie et al. Projet DOTS (ANR-06-SETI-003) : Rapport à 18 mois, September 2008. 5 pages.
[ BibTex ]
[CLLM08]: F. Cassez, F. Laroussinie, D. Lime, and N. Markey. Quantitative Objectives in Timed Games. Deliverable DOTS 1.1 (ANR-06-SETI-003), September 2008.
[ BibTex ]
[BBC⁺08]: B. Bollig, P. Bouyer, F. Cassez, Th. Chatain, P. Gastin, S. Haddad, and C. Jard. Model for distributed timed systems. Deliverable DOTS 3.1 (ANR-06-SETI-003), September 2008.
[ BibTex ]
[BBJ⁺08]: P. Bouyer, Th. Brihaye, M. Jurdziński, R. Lazić, and M. Rutkowski. Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. In Proceedings of the 6th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'08), volume 5215 of Lecture Notes in Computer Science, pages 63--77, Saint-Malo, France, September 2008. Springer.
doi: 10.1007/978-3-540-85778-5_6.
[ BibTex | DOI | Web page | PDF ]
[BFL⁺08b]: P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and J. Srba. Infinite Runs in Weighted Timed Automata with Energy Constraints. In Proceedings of the 6th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'08), volume 5215 of Lecture Notes in Computer Science, pages 33--47, Saint-Malo, France, September 2008. Springer.
doi: 10.1007/978-3-540-85778-5_4.
[ BibTex | DOI | Web page | PDF ]
[ABH08]: M. F. Atig, B. Bollig, and P. Habermehl. Emptiness of multi-pushdown automata is 2ETIME-complete. In Proceedings of the 12th International Conference on Developments in Language Theory (DLT'08), volume 5257 of Lecture Notes in Computer Science, pages 121--133, Kyoto, Japan, September 2008. Springer.
doi: 10.1007/978-3-540-85780-8_9.
[ BibTex | DOI | Web page | PDF ]
[CDF⁺08]: N. Chamseddine, M. Duflot, L. Fribourg, C. Picaronny, and J. Sproston. Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata. In Proceedings of the 5th International Conference on Quantitative Evaluation of Systems (QEST'08), pages 254--263, Saint Malo, France, September 2008. IEEE Computer Society Press.
doi: 10.1109/QEST.2008.34.
[ BibTex | DOI | Web page | PDF ]
[Pla08]: Th. Place. Characterization of Logics Over Ranked Tree Languages. In Proceedings of the 17th Annual EACSL Conference on Computer Science Logic (CSL'08), volume 5213 of Lecture Notes in Computer Science, pages 401--415, Bertinoro, Italy, September 2008. Springer.
doi: 10.1007/978-3-540-87531-4_29.
[ BibTex | DOI | Web page | PDF ]
[BDL08]: R. Brochenin, S. Demri, and É. Lozes. On the Almighty Wand. In Proceedings of the 17th Annual EACSL Conference on Computer Science Logic (CSL'08), volume 5213 of Lecture Notes in Computer Science, pages 323--338, Bertinoro, Italy, September 2008. Springer.
doi: 10.1007/978-3-540-87531-4_24.
[ BibTex | DOI | Web page | PDF ]
[BBBM08]: N. Bertrand, P. Bouyer, Th. Brihaye, and N. Markey. Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. In Proceedings of the 5th International Conference on Quantitative Evaluation of Systems (QEST'08), pages 55--64, Saint Malo, France, September 2008. IEEE Computer Society Press.
doi: 10.1109/QEST.2008.19.
[ BibTex | DOI | Web page | PDF ]
[BCH⁺08]: B. Bérard, F. Cassez, S. Haddad, D. Lime, and O. H. Roux. When are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? Theoretical Computer Science, 403(2-3):202--220, September 2008.
doi: 10.1016/j.tcs.2008.03.030.
[ BibTex | DOI | Web page | PDF ]
[BK08]: B. Bollig and D. Kuske. Muller Message-Passing Automata and Logics. Information and Computation, 206(9-10):1084--1094, September-October 2008.
doi: 10.1016/j.ic.2008.03.010.
[ BibTex | DOI | Web page | PS | PDF ]
[LHS08]: É. Lozes, D. Hirschkoff, and D. Sangiorgi. Separability in the Ambient Logic. Logical Methods in Computer Science, 4(3:4), September 2008.
doi: 10.2168/LMCS-4(3:4)2008.
[ BibTex | DOI | Web page | PS | PDF ]
[AAC⁺08]: S. Abiteboul, T. Allard, Ph. Chatalic, G. Gardarin, A. Ghitescu, F. Goasdoué, I. Manolescu, B. Nguyen, M. Ouazara, A. Somani, N. Travers, G. Vasile, and S. Zoupanos. WebContent: efficient P2P warehousing of web data. In Proceedings of the 34th International Conference on Very Large Data Bases (VLDB'08), volume 1 of Proceedings of the VLDB Endowment, pages 1428--1431, Auckland, New Zealand, August 2008. ACM Press.
[ BibTex | Web page | PDF ]
[ABM08]: S. Abiteboul, O. Benjelloun, and T. Milo. The Active XML project: an overview. The VLDB Journal, 17(5):1019--1040, August 2008.
doi: 10.1007/s00778-007-0049-y.
[ BibTex | DOI | Web page | PDF ]
[Mar08]: N. Markey. Infinite Runs In Weighted Times Games with Energy Constraints. Invited talk, Workshop Automata and Verification (AV'08), Mons, Belgium, August 2008.
[ BibTex ]
[Bou08b]: P. Bouyer. Probabilities in Timed Automata. Invited talk, Workshop Automata and Verification (AV'08), Mons, Belgium, August 2008.
[ BibTex ]
[Sch08]: Ph. Schnoebelen. The complexity of lossy channel systems. Invited talk, Workshop Automata and Verification (AV'08), Mons, Belgium, August 2008.
[ BibTex ]
[Com08b]: H. Comon-Lundh. Challenges in the Automated Verification of Security Protocols. In Proceedings of the 4th International Joint Conference on Automated Reasoning (IJCAR'08), volume 5195 of Lecture Notes in Artificial Intelligence, pages 396--409, Sydney, Australia, August 2008. Springer-Verlag.
doi: 10.1007/978-3-540-71070-7_34.
[ BibTex | DOI | Web page | PDF ]
[CS08a]: P. Chambart and Ph. Schnoebelen. Mixing Lossy and Perfect Fifo Channels. In Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), volume 5201 of Lecture Notes in Computer Science, pages 340--355, Toronto, Canada, August 2008. Springer.
doi: 10.1007/978-3-540-85361-9_28.
[ BibTex | DOI | Web page | PS | PDF ]
[BCHK08]: P. Baldan, Th. Chatain, S. Haar, and B. König. Unfolding-based Diagnosis of Systems with an Evolving Topology. In Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), volume 5201 of Lecture Notes in Computer Science, pages 203--217, Toronto, Canada, August 2008. Springer.
doi: 10.1007/978-3-540-85361-9_19.
[ BibTex | DOI | Web page | PDF ]
[BKKL08]: B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. In Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), volume 5201 of Lecture Notes in Computer Science, pages 162--166, Toronto, Canada, August 2008. Springer.
doi: 10.1007/978-3-540-85361-9_15.
[ BibTex | DOI | Web page | PDF ]
[LV08]: É. Lozes and J. Villard. A Spatial Equational Logic for the Applied π-Calculus. In Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), volume 5201 of Lecture Notes in Computer Science, pages 387--401, Toronto, Canada, August 2008. Springer.
doi: 10.1007/978-3-540-85361-9_31.
[ BibTex | DOI | Web page | PDF ]
[ABG⁺08]: S. Akshay, B. Bollig, P. Gastin, M. Mukund, and K. Narayan Kumar. Distributed Timed Automata with Independently Evolving Clocks. In Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), volume 5201 of Lecture Notes in Computer Science, pages 82--97, Toronto, Canada, August 2008. Springer.
doi: 10.1007/978-3-540-85361-9_10.
[ BibTex | DOI | Web page | PDF ]
[FS08]: A. Finkel and A. Sangnier. Reversal-bounded Counter Machines Revisited. In Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS'08), volume 5162 of Lecture Notes in Computer Science, pages 323--334, Toruń, Poland, August 2008. Springer.
doi: 10.1007/978-3-540-85238-4_26.
[ BibTex | DOI | Web page | PS | PDF ]
[BJ08]: A. Bouhoula and F. Jacquemard. Automated Induction with Constrained Tree Automata. In Proceedings of the 4th International Joint Conference on Automated Reasoning (IJCAR'08), volume 5195 of Lecture Notes in Artificial Intelligence, pages 539--553, Sydney, Australia, August 2008. Springer-Verlag.
doi: 10.1007/978-3-540-71070-7_44.
[ BibTex | DOI | Web page | PDF ]
[KMT08]: S. Kremer, A. Mercier, and R. Treinen. Proving Group Protocols Secure Against Eavesdroppers. In Proceedings of the 4th International Joint Conference on Automated Reasoning (IJCAR'08), volume 5195 of Lecture Notes in Artificial Intelligence, pages 116--131, Sydney, Australia, August 2008. Springer-Verlag.
doi: 10.1007/978-3-540-71070-7_9.
[ BibTex | DOI | Web page | PDF ]
[AMZ08b]: S. Abiteboul, I. Manolescu, and S. Zoupanos. OptimAX: Optimizing Distributed ActiveXML Applications. In Proceedings of the 8th International Conference on Web Engineering (ICWE'08), pages 299--310, Yorktown Heights, New York, USA, July 2008. IEEE Computer Society Press.
doi: 10.1109/ICWE.2008.11.
[ BibTex | DOI | Web page | PDF ]
[JR08]: F. Jacquemard and M. Rusinowitch. Closure of Hedge-Automata Languages by Hedge Rewriting. In Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA'08), volume 5117 of Lecture Notes in Computer Science, pages 157--171, Hagenberg, Austria, July 2008. Springer.
doi: 10.1007/978-3-540-70590-1_11.
[ BibTex | DOI | Web page | PDF ]
[BHH⁺08b]: A. Bouajjani, P. Habermehl, L. Holík, T. Touili, and T. Vojnar. Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. In Proceedings of the 13th International Conference on Implementation and Application of Automata (CIAA'08), volume 5148 of Lecture Notes in Computer Science, pages 57--67, San Francisco, California, USA, July 2008. Springer-Verlag.
doi: 10.1007/978-3-540-70844-5_7.
[ BibTex | DOI | Web page | PDF ]
[AFFM08]: C. Areces, D. Figueira, S. Figueira, and S. Mera. Expressive Power and Decidability for Memory Logics. In Proceedings of the 15th Workshop on Logic, Language, Information and Computation (WoLLIC'08), volume 5110 of Lecture Notes in Computer Science, pages 56--68, Edinburgh, Scotland, UK, July 2008. Springer.
doi: 10.1007/978-3-540-69937-8_7.
[ BibTex | DOI | Web page | PDF ]
[BS08]: M. Bojańczyk and L. Segoufin. Tree languages defined in first-order logic with one quantifier alternation. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP'08) -- Part II, volume 5126 of Lecture Notes in Computer Science, pages 233--245, Reykjavik, Iceland, July 2008. Springer.
doi: 10.1007/978-3-540-70583-3_20.
[ BibTex | DOI | Web page | PDF ]
[BMOW08]: P. Bouyer, N. Markey, J. Ouaknine, and J. Worrell. On Expressiveness and Complexity in Real-time Model Checking. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP'08) -- Part II, volume 5126 of Lecture Notes in Computer Science, pages 124--135, Reykjavik, Iceland, July 2008. Springer.
doi: 10.1007/978-3-540-70583-3_11.
[ BibTex | DOI | Web page | PDF ]
[HMY08]: S. Haddad, L. Mokdad, and S. Youcef. Response Time Analysis of Composite Web Services. In Proceedings of the 6th Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP'08), pages 506--510, Graz, Austria, July 2008. IEEE Computer Society Press.
[ BibTex | Web page | PDF ]
[Gou08a]: J. Goubault-Larrecq. A Cone-Theoretic Krein-Milman Theorem. Research Report LSV-08-18, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2008. 8 pages.
[ BibTex | Web page | PDF ]
[CJP08]: H. Comon-Lundh, F. Jacquemard, and N. Perrin. Visibly Tree Automata with Memory and Constraints. Logical Methods in Computer Science, 4(2:8), June 2008.
doi: 10.2168/LMCS-4(2:8)2008.
[ BibTex | DOI | Web page | PDF ]
[DJ08]: S. Demri and Ch. S. Jensen, editors. Proceedings of the 15th International Symposium on Temporal Representation and Reasoning (TIME'08), Montréal, Canada, June 2008. IEEE Computer Society Press.
[ BibTex ]
[tCS08]: B. ten Cate and L. Segoufin. XPath, Transitive Closure Logic, and Nested Tree Walking Automata. In Proceedings of the 27th Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'08), pages 251--260, Vancouver, Canada, June 2008. ACM Press.
doi: 10.1145/1376916.1376952.
[ BibTex | DOI | Web page | PDF ]
[ASV08]: S. Abiteboul, L. Segoufin, and V. Vianu. Static Analysis of Active XML Systems. In Proceedings of the 27th Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'08), pages 221--230, Vancouver, Canada, June 2008. ACM Press.
doi: 10.1145/1376916.1376948.
[ BibTex | DOI | Web page | PDF ]
[BLM08]: P. Bouyer, K. G. Larsen, and N. Markey. Model Checking One-clock Priced Timed Automata. Logical Methods in Computer Science, 4(2:9), June 2008.
doi: 10.2168/LMCS-4(2:9)2008.
[ BibTex | DOI | Web page | PDF ]
[Gou08d]: J. Goubault-Larrecq. Towards Producing Formally Checkable Security Proofs, Automatically. In Proceedings of the 21st IEEE Computer Security Foundations Symposium (CSF'08), pages 224--238, Pittsburgh, Pennsylvania, USA, June 2008. IEEE Computer Society Press.
doi: 10.1109/CSF.2008.21.
[ BibTex | DOI | Web page | PDF ]
[DKR08]: S. Delaune, S. Kremer, and M. D. Ryan. Composition of Password-based Protocols. In Proceedings of the 21st IEEE Computer Security Foundations Symposium (CSF'08), pages 239--251, Pittsburgh, Pennsylvania, USA, June 2008. IEEE Computer Society Press.
doi: 10.1109/CSF.2008.6.
[ BibTex | DOI | Web page | PDF ]
[DKS08a]: S. Delaune, S. Kremer, and G. Steel. Formal Analysis of PKCS#11. In Proceedings of the 21st IEEE Computer Security Foundations Symposium (CSF'08), pages 331--344, Pittsburgh, Pennsylvania, USA, June 2008. IEEE Computer Society Press.
doi: 10.1109/CSF.2008.16.
[ BibTex | DOI | Web page | PDF ]
[BSS08]: M. Bojańczyk, L. Segoufin, and H. Straubing. Piecewise Testable Tree Languages. In Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS'08), pages 442--451, Pittsburgh, Pennsylvania, USA, June 2008. IEEE Computer Society Press.
doi: 10.1109/LICS.2008.46.
[ BibTex | DOI | Web page | PDF ]
[CS08c]: P. Chambart and Ph. Schnoebelen. The Ordinal Recursive Complexity of Lossy Channel Systems. In Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS'08), pages 205--216, Pittsburgh, Pennsylvania, USA, June 2008. IEEE Computer Society Press.
doi: 10.1109/LICS.2008.47.
[ BibTex | DOI | Web page | PDF ]
[BBB⁺08]: C. Baier, N. Bertrand, P. Bouyer, Th. Brihaye, and M. Größer. Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. In Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS'08), pages 217--226, Pittsburgh, Pennsylvania, USA, June 2008. IEEE Computer Society Press.
doi: 10.1109/LICS.2008.25.
[ BibTex | DOI | Web page | PDF ]
[DRS08]: S. Delaune, M. D. Ryan, and B. Smyth. Automatic verification of privacy properties in the applied pi-calculus. In Proceedings of the 2nd Joint iTrust and PST Conferences on Privacy, Trust Management and Security (IFIPTM'08), volume 263 of IFIP Conference Proceedings, pages 263--278, Trondheim, Norway, June 2008. Springer.
[ BibTex | Web page | PS | PDF ]
[BFL08a]: F. Bouchy, A. Finkel, and J. Leroux. Decomposition of Decidable First-Order Logics over Integers and Reals. In Proceedings of the 15th International Symposium on Temporal Representation and Reasoning (TIME'08), pages 147--155, Montréal, Canada, June 2008. IEEE Computer Society Press.
doi: 10.1109/TIME.2008.22.
[ BibTex | DOI | Web page | PDF ]
[BGMR08]: Th. Brihaye, M. Ghannem, N. Markey, and L. Rieg. Good friends are hard to find! In Proceedings of the 15th International Symposium on Temporal Representation and Reasoning (TIME'08), pages 32--40, Montréal, Canada, June 2008. IEEE Computer Society Press.
doi: 10.1109/TIME.2008.10.
[ BibTex | DOI | Web page | PDF ]
[DGK08]: V. Diekert, P. Gastin, and M. Kufleitner. A Survey on Small Fragments of First-Order Logic over Finite Words. International Journal of Foundations of Computer Science, 19(3):513--548, June 2008.
doi: 10.1142/S0129054108005802.
[ BibTex | DOI | Web page | PDF ]
[DG08c]: M. Droste and P. Gastin. On aperiodic and star-free formal power series in partially commuting variables. Theory of Computing Systems, 42(4):608--631, May 2008.
doi: 10.1007/s00224-007-9064-z.
[ BibTex | DOI | Web page | PS | PDF ]
[LMO08]: F. Laroussinie, N. Markey, and G. Oreiby. On the Expressiveness and Complexity of ATL. Logical Methods in Computer Science, 4(2:7), May 2008.
doi: 10.2168/LMCS-4(2:7)2008.
[ BibTex | DOI | Web page | PDF ]
[BHH⁺08a]: B. Bérard, S. Haddad, L. M. Hillah, F. Kordon, and Y. Thierry-Mieg. Collision Avoidance in Intelligent Transport Systems: Towards an Application of Control Theory. In Proceedings of the 9th Workshop on Discrete Event Systems (WODES'08), pages 346--351, Gothenburg, Sweden, May 2008.
doi: 10.1109/WODES.2008.4605970.
[ BibTex | DOI | Web page | PDF ]
[Bur08e]: E. Bursztein. Probabilistic Protocol Identification for Hard to Classify Protocol. In Proceedings of the 2nd International Workshop on Information Security Theory and Practices (WISTP'08), volume 5019 of Lecture Notes in Computer Science, pages 49--63, Sevilla, Spain, May 2008. Springer. Best paper award.
doi: 10.1007/978-3-540-79966-5_4.
[ BibTex | DOI | Web page | PDF ]
[JRV08]: F. Jacquemard, M. Rusinowitch, and L. Vigneron. Tree automata with equality constraints modulo equational theories. Journal of Logic and Algebraic Programming, 75(2):182--208, April 2008.
doi: 10.1016/j.jlap.2007.10.006.
[ BibTex | DOI | Web page | PDF ]
[AMP⁺08]: S. Abiteboul, I. Manolescu, N. Polyzotis, N. Preda, and C. Sun. XML processing in DHT networks. In Proceedings of the 24th International Conference on Data Engineering (ICDE'08), pages 606--615, Cancun, Mexico, April 2008. IEEE Computer Society Press.
doi: 10.1109/ICDE.2008.4497469.
[ BibTex | DOI | Web page | PDF ]
[AMZ08a]: S. Abiteboul, I. Manolescu, and S. Zoupanos. OptimAX: efficient support for data-intensive mash-ups. In Proceedings of the 24th International Conference on Data Engineering (ICDE'08), pages 1564--1567, Cancun, Mexico, April 2008. IEEE Computer Society Press.
doi: 10.1109/ICDE.2008.4497622.
[ BibTex | DOI | Web page | PDF ]
[AMB08]: S. Abiteboul, B. Marinoiu, and P. Bourhis. Distributed Monitoring of Peer-to-Peer Systems. In Proceedings of the 24th International Conference on Data Engineering (ICDE'08), pages 1572--1575, Cancun, Mexico, April 2008. IEEE Computer Society Press.
doi: 10.1109/ICDE.2008.4497624.
[ BibTex | DOI | Web page | PDF ]
[EF08]: E. Encrenaz and L. Fribourg. Time Separation of Events: An Inverse Method. In Proceedings of the LIX Colloquium on Emerging Trends in Concurrency Theory (LIX'06), volume 209 of Electronic Notes in Theoretical Computer Science, pages 135--148, Palaiseau, France, April 2008. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2008.04.008.
[ BibTex | DOI | Web page | PDF ]
[DLS08]: S. Demri, R. Lazić, and A. Sangnier. Model checking freeze LTL over one-counter automata. In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), volume 4962 of Lecture Notes in Computer Science, pages 490--504, Budapest, Hungary, March-April 2008. Springer.
doi: 10.1007/978-3-540-78499-9_34.
[ BibTex | DOI | Web page | PS | PDF ]
[HIV08]: P. Habermehl, R. Iosif, and T. Vojnar. What else is decidable about arrays? In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), volume 4962 of Lecture Notes in Computer Science, pages 474--489, Budapest, Hungary, March-April 2008. Springer.
doi: 10.1007/978-3-540-78499-9_33.
[ BibTex | DOI | Web page | PDF ]
[BMR08]: P. Bouyer, N. Markey, and P.-A. Reynier. Robust Analysis of Timed Automata via Channel Machines. In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), volume 4962 of Lecture Notes in Computer Science, pages 157--171, Budapest, Hungary, March-April 2008. Springer.
doi: 10.1007/978-3-540-78499-9_12.
[ BibTex | DOI | Web page | PS | PDF ]
[CS08b]: P. Chambart and Ph. Schnoebelen. The ω-Regular Post Embedding Problem. In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), volume 4962 of Lecture Notes in Computer Science, pages 97--111, Budapest, Hungary, March-April 2008. Springer.
doi: 10.1007/978-3-540-78499-9_8.
[ BibTex | DOI | Web page | PS | PDF ]
[Gou08c]: J. Goubault-Larrecq. Simulation Hemi-Metrics Between Infinite-State Stochastic Games. In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), volume 4962 of Lecture Notes in Computer Science, pages 50--65, Budapest, Hungary, March-April 2008. Springer.
doi: 10.1007/978-3-540-78499-9_5.
[ BibTex | DOI | Web page ]
[Gou08b]: J. Goubault-Larrecq. Prevision Domains and Convex Powercones. In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), volume 4962 of Lecture Notes in Computer Science, pages 318--333, Budapest, Hungary, March-April 2008. Springer.
doi: 10.1007/978-3-540-78499-9_23.
[ BibTex | DOI | Web page ]
[L⁺08a]: F. Laroussinie et al. Projet DOTS (ANR-06-SETI-003) : Rapport à 12 mois, March 2008. 6 pages.
[ BibTex ]
[VLT08]: J. Villard, É. Lozes, and R. Treinen. A Spatial Equational Logic for the Applied pi-calculus. Research Report LSV-08-10, Laboratoire Spécification et Vérification, ENS Cachan, France, March 2008. 44 pages.
[ BibTex | Web page | PDF ]
[GO08]: J. Goubault-Larrecq and J. Olivain. A Smell of Orchids. In Proceedings of the 8th Workshop on Runtime Verification (RV'08), volume 5289 of Lecture Notes in Computer Science, pages 1--20, Budapest, Hungary, March 2008. Springer.
doi: 10.1007/978-3-540-89247-2_1.
[ BibTex | DOI | Web page | PDF ]
[FL08]: A. Finkel and J. Leroux. Presburger Functions are Piecewise Linear. Research Report LSV-08-08, Laboratoire Spécification et Vérification, ENS Cachan, France, March 2008. 9 pages.
[ BibTex | Web page | PDF ]
[DKS08b]: S. Delaune, S. Kremer, and G. Steel. Formal Analysis of PKCS#11. In Proceedings of the 4th Taiwanese-French Conference on Information Technology (TFIT'08), pages 267--278, Taipei, Taiwan, March 2008.
[ BibTex | Web page | PDF ]
[Bou08a]: P. Bouyer. Model-Checking Timed Temporal Logics. In Proceedings of the 4th Taiwanese-French Conference on Information Technology (TFIT'08), pages 132--142, Taipei, Taiwan, March 2008.
[ BibTex | Web page | PDF ]
[BMO⁺08]: P. Bouyer, N. Markey, J. Ouaknine, Ph. Schnoebelen, and J. Worrell. On Termination for Faulty Channel Machines. In Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS'08), volume 1 of Leibniz International Proceedings in Informatics, pages 121--132, Bordeaux, France, February 2008. Leibniz-Zentrum für Informatik.
[ BibTex | Web page | PS | PDF ]
[DLLT08]: S. Delaune, P. Lafourcade, D. Lugiez, and R. Treinen. Symbolic protocol analysis for monoidal equational theories. Information and Computation, 206(2-4):312--351, February-April 2008.
doi: 10.1016/j.ic.2007.07.005.
[ BibTex | DOI | Web page | PDF ]
[BBL08]: P. Bouyer, E. Brinksma, and K. G. Larsen. Optimal Infinite Scheduling for Multi-Priced Timed Automata. Formal Methods in System Design, 32(1):2--23, February 2008.
doi: 10.1007/s10703-007-0043-4.
[ BibTex | DOI | Web page | PS | PDF ]
[Bur08d]: E. Bursztein. Network Administrator and Intruder Strategies. Research Report LSV-08-02, Laboratoire Spécification et Vérification, ENS Cachan, France, February 2008. 23 pages.
[ BibTex | Web page | PDF ]
[PPS⁺08]: P. Papadimitratos, M. Poturalski, P. Schaller, P. Lafourcade, D. Basin, S. Čapkun, and J.-P. Hubaux. Secure Neighborhood Discovery: A Fundamental Element for Mobile Ad Hoc Networking. IEEE Communications Magazine, 46(2):132--139, February 2008.
doi: 10.1109/MCOM.2008.4473095.
[ BibTex | DOI | Web page | PDF ]
[BC08]: V. Bernat and H. Comon-Lundh. Normal proofs in intruder theories. In Revised Selected Papers of the 11th Asian Computing Science Conference (ASIAN'06), volume 4435 of Lecture Notes in Computer Science, pages 151--166, Tokyo, Japan, January 2008. Springer.
doi: 10.1007/978-3-540-77505-8_12.
[ BibTex | DOI | Web page | PDF ]
[LNY08]: S. Lasota, D. Nowak, and Z. Yu. On completeness of logical relations for monadic types. In Revised Selected Papers of the 11th Asian Computing Science Conference (ASIAN'06), volume 4435 of Lecture Notes in Computer Science, pages 223--230, Tokyo, Japan, January 2008. Springer.
doi: 10.1007/978-3-540-77505-8_17.
[ BibTex | DOI | Web page | PDF ]
[Kre08]: S. Kremer. Computational soundness of equational theories (Tutorial). In Revised Selected Papers from the 3rd Symposium on Trustworthy Global Computing (TGC'07), volume 4912 of Lecture Notes in Computer Science, pages 363--382, Sophia-Antipolis, France, 2008. Springer.
doi: 10.1007/978-3-540-78663-4.
[ BibTex | DOI | Web page | PDF ]
[TED08]: S. Taktak, E. Encrenaz, and J.-L. Desbarbieux. A tool for automatic detection of deadlocks in wormhole networks on chip. ACM Transactions on Design Automation of Electronic Systems, 13(1), January 2008.
doi: 10.1145/1297666.1297672.
[ BibTex | DOI | Web page | PS | PDF ]
[BHR08]: P. Bouyer, S. Haddad, and P.-A. Reynier. Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. Information and Computation, 206(1):73--107, January 2008.
doi: 10.1016/j.ic.2007.10.004.
[ BibTex | DOI | Web page | PDF ]
[SAG08]: P. Senellart, S. Abiteboul, and R. Gilleron. Understanding the Hidden Web. ERCIM News, 72:32--33, January 2008.
[ BibTex | Web page ]
[CKR08]: L. Chen, S. Kremer, and M. D. Ryan, editors. Formal Protocol Verification Applied, volume 07421 of Dagstuhl Seminar Proceedings, Dagstuhl, Germany, 2008.
[ BibTex | Web page ]
[HM08]: S. Haddad and P. Moreaux. Verification of Probabilistic Systems Methods and Tools. In Modeling and Verification of Real-Time Systems, pages 289--318. ISTE Ltd. -- John Wiley & Sons, Ltd., January 2008.
[ BibTex | Web page ]
[BL08]: P. Bouyer and F. Laroussinie. Model Checking Timed Automata. In Modeling and Verification of Real-Time Systems, pages 111--140. ISTE Ltd. -- John Wiley & Sons, Ltd., January 2008.
[ BibTex | Web page | PDF ]
[Bur08b]: E. Bursztein. NetAnalyzer v0.7.5, January 2008. Written in C and Perl (about 25000 lines).
[ BibTex ]
[DG08b]: V. Diekert and P. Gastin. First-order definable languages. In Logic and Automata: History and Perspectives, volume 2 of Texts in Logic and Games, pages 261--306. Amsterdam University Press, 2008.
[ BibTex | Web page | PDF ]
[BG07]: E. Bursztein and J. Goubault-Larrecq. A Logical Framework for Evaluating Network Resilience Against Faults and Attacks. In Proceedings of the 12th Asian Computing Science Conference (ASIAN'07), volume 4846 of Lecture Notes in Computer Science, pages 212--227, Doha, Qatar, December 2007. Springer.
doi: 10.1007/978-3-540-76929-3_20.
[ BibTex | DOI | Web page | PDF ]
[ABG07]: S. Akshay, B. Bollig, and P. Gastin. Automata and Logics for Timed Message Sequence Charts. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 290--302, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_24.
[ BibTex | DOI | Web page | PS | PDF ]
[CS07]: P. Chambart and Ph. Schnoebelen. Post Embedding Problem is not Primitive Recursive, with Applications to Channel Systems. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 265--276, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_22.
[ BibTex | DOI | Web page | PS | PDF ]
[CDD07]: V. Cortier, J. Delaitre, and S. Delaune. Safely Composing Security Protocols. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 352--363, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_29.
[ BibTex | DOI | Web page | PDF ]
[BBB⁺07]: C. Baier, N. Bertrand, P. Bouyer, Th. Brihaye, and M. Größer. Probabilistic and Topological Semantics for Timed Automata. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 179--191, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_15.
[ BibTex | DOI | Web page | PDF ]
[BKM07]: B. Bollig, D. Kuske, and I. Meinecke. Propositional Dynamic Logic for Message-Passing Systems. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 303--315, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_25.
[ BibTex | DOI | Web page | PS | PDF ]
[DKR07]: S. Delaune, S. Kremer, and M. D. Ryan. Symbolic Bisimulation for the Applied Pi-Calculus. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 133--145, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_11.
[ BibTex | DOI | Web page | PDF ]
[BBS07]: C. Baier, N. Bertrand, and Ph. Schnoebelen. Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Transactions on Computational Logic, 9(1), December 2007.
doi: 10.1145/1297658.1297663.
[ BibTex | DOI | Web page | PS | PDF ]
[Car07]: J.-L. Carré. Réécriture, confluence. Course notes, Préparation à l'agrégation, ENS Cachan, France, December 2007.
[ BibTex ]
[Bur07a]: E. Bursztein. NetQi v1rc1. Available at http://www.netqi.org/, December 2007. Written in C and Java (about 10000 lines).
[ BibTex | Web page ]
[Gas07a]: R. Gascon. Spécification et vérification de propriétés quantitatives sur des automates à contraintes. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2007.
[ BibTex | Web page | PS | PDF ]
[GPT07]: J. Goubault-Larrecq, C. Palamidessi, and A. Troina. A Probabilistic Applied Pi-Calculus. In Proceedings of the 5th Asian Symposium on Programming Languages and Systems (APLAS'07), volume 4807 of Lecture Notes in Computer Science, pages 175--290, Singapore, November-December 2007. Springer.
doi: 10.1007/978-3-540-76637-7_12.
[ BibTex | DOI | Web page | PDF ]
[GK07]: P. Gastin and D. Kuske. Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces. Fundamenta Informaticae, 80(1-3):169--197, November 2007.
[ BibTex | Web page | PDF ]
[CDG⁺07]: H. Comon-Lundh, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. November 2007.
[ BibTex | Web page ]
[Gas07b]: P. Gastin. Algorithmique. Course notes, Magistère STIC, ENS Cachan, France, November 2007.
[ BibTex ]
[Bur07b]: E. Bursztein. Time has something to tell us about network address translation. In Proceedings of the 12th Nordic Workshop on Secure IT Systems (NordSec'07), Reykjavik, Iceland, October 2007.
[ BibTex | Web page | PDF ]
[JR07]: F. Jacquemard and M. Rusinowitch. Rewrite Closure of Hedge-Automata Languages. Research Report LSV-07-31, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2007. 22 pages.
[ BibTex | Web page | PDF ]
[HIRV07]: P. Habermehl, R. Iosif, A. Rogalewicz, and T. Vojnar. Proving Termination of Tree Manipulating Programs. In Proceedings of the 5th International Symposium on Automated Technology for Verification and Analysis (ATVA'07), volume 4762 of Lecture Notes in Computer Science, pages 145--161, Tokyo, Japan, October 2007. Springer.
doi: 10.1007/978-3-540-75596-8_12.
[ BibTex | DOI | Web page | PS | PDF ]
[DR07]: S. Demri and A. Rabinovich. The complexity of temporal logic with until and since over ordinals. In Proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'07), volume 4790 of Lecture Notes in Artificial Intelligence, pages 531--545, Yerevan, Armenia, October 2007. Springer.
doi: 10.1007/978-3-540-75560-9_38.
[ BibTex | DOI | Web page | PDF ]
[DLL07]: S. Delaune, H. Lin, and Ch. Lynch. Protocol verification via rigidashflexible resolution. In Proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'07), volume 4790 of Lecture Notes in Artificial Intelligence, pages 242--256, Yerevan, Armenia, October 2007. Springer.
doi: 10.1007/978-3-540-75560-9_19.
[ BibTex | DOI | Web page | PDF ]
[CD07]: V. Cortier and S. Delaune. Deciding Knowledge in Security Protocols for Monoidal Equational Theories. In Proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'07), volume 4790 of Lecture Notes in Artificial Intelligence, pages 196--210, Yerevan, Armenia, October 2007. Springer.
doi: 10.1007/978-3-540-75560-9_16.
[ BibTex | DOI | Web page | PS | PDF ]
[CDP07]: F. Chevalier, D. D'Souza, and P. Prabhakar. Counter-free Input Determined Timed Automata. In Proceedings of the 5th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'07), volume 4763 of Lecture Notes in Computer Science, pages 82--97, Salzburg, Austria, October 2007. Springer.
doi: 10.1007/978-3-540-75454-1_8.
[ BibTex | DOI | Web page | PS | PDF ]
[BM07b]: P. Bouyer and N. Markey. Costs are Expensive! In Proceedings of the 5th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'07), volume 4763 of Lecture Notes in Computer Science, pages 53--68, Salzburg, Austria, October 2007. Springer.
doi: 10.1007/978-3-540-75454-1_6.
[ BibTex | DOI | Web page | PS | PDF ]
[Laf07d]: P. Lafourcade. Rapport final d'activité à 11 mois, contrat CNRS/DGA référence : 06 60 019 00 470 75 01 << Utilisation et exploitation des théories équationnelles dans l'analyse des protocoles cryptographiques >>. Contract report, DGA, October 2007. 6 pages.
[ BibTex | Web page | PS ]
[BGP07]: B. Bérard, P. Gastin, and A. Petit. Timed substitutions for regular signal-event languages. Formal Methods in System Design, 31(2):101--134, October 2007.
doi: 10.1007/s10703-007-0034-5.
[ BibTex | DOI | Web page | PDF ]
[BBBR07]: P. Bouyer, Th. Brihaye, V. Bruyère, and J.-F. Raskin. On the optimal reachability problem on weighted timed automata. Formal Methods in System Design, 31(2):135--175, October 2007.
doi: 10.1007/s10703-007-0035-4.
[ BibTex | DOI | Web page | PS | PDF ]
[Pro07]: A. ProNoBis. ProNoBis: Probability and Nondeterminism, Bisimulations and Security -- Rapport Final, October 2007.
[ BibTex | Web page | PDF ]
[GL07]: J. Goubault-Larrecq. Pronobis: Probability and nondeterminism, bisimulations and security. Rapport final ARC ProNoBis, October 2007.
[ BibTex ]
[Cha07]: P. Chambart. Canaux fiables et non-fiables : frontières de la décidabilité. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2007.
[ BibTex | Web page | PDF ]
[Da 07]: A. Da Costa. Propriétés de jeux multi-agents. Rapport de Master, Master de Logique Mathématique et Fondements de l'Informatique, Paris, France, September 2007.
[ BibTex | Web page | PDF ]
[Vil07]: J. Villard. Logique spatiale pour le pi-calcul appliqué. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2007.
[ BibTex | Web page | PDF ]
[Vac07]: C. Vacher. Accessibilité inverse dans les automates d'arbres à mémoire d'ordre supérieur. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2007.
[ BibTex | Web page | PDF ]
[CL07]: C. Cremers and P. Lafourcade. Comparing State Spaces in Automatic Security Protocol Verification. In Pre-proceedings of the 7th International Workshop on Automated Verification of Critical Systems (AVoCS'07), Oxford, UK, September 2007.
[ BibTex | Web page | PDF ]
[AMNK07]: S. Akshay, M. Mukund, and K. Narayan Kumar. Checking Coverage for Infinite Collections of Timed Scenarios. In Proceedings of the 18th International Conference on Concurrency Theory (CONCUR'07), volume 4703 of Lecture Notes in Computer Science, pages 181--196, Lisbon, Portugal, September 2007. Springer.
doi: 10.1007/978-3-540-74407-8_13.
[ BibTex | DOI | Web page | PDF ]
[ACD07]: M. Arnaud, V. Cortier, and S. Delaune. Combining algorithms for deciding knowledge in security protocols. In Proceedings of the 6th International Symposium on Frontiers of Combining Systems (FroCoS'07), volume 4720 of Lecture Notes in Artificial Intelligence, pages 103--117, Liverpool, UK, September 2007. Springer.
doi: 10.1007/978-3-540-74621-8_7.
[ BibTex | DOI | Web page | PS | PDF ]
[KM07]: S. Kremer and L. Mazaré. Adaptive Soundness of Static Equivalence. In Proceedings of the 12th European Symposium on Research in Computer Security (ESORICS'07), volume 4734 of Lecture Notes in Computer Science, pages 610--625, Dresden, Germany, September 2007. Springer.
doi: 10.1007/978-3-540-74835-9_40.
[ BibTex | DOI | Web page | PDF ]
[BLMO07]: Th. Brihaye, F. Laroussinie, N. Markey, and G. Oreiby. Timed Concurrent Game Structures. In Proceedings of the 18th International Conference on Concurrency Theory (CONCUR'07), volume 4703 of Lecture Notes in Computer Science, pages 445--459, Lisbon, Portugal, September 2007. Springer.
doi: 10.1007/978-3-540-74407-8_30.
[ BibTex | DOI | Web page | PS | PDF ]
[Gou07c]: J. Goubault-Larrecq. Continuous Previsions. In Proceedings of the 16th Annual EACSL Conference on Computer Science Logic (CSL'07), volume 4646 of Lecture Notes in Computer Science, pages 542--557, Lausanne, Switzerland, September 2007. Springer.
doi: 10.1007/978-3-540-74915-8_40.
[ BibTex | DOI | Web page | PDF ]
[OBRS07]: A. Ourghanlian, M. Bozga, A. Roglewicz, and A. Sangnier. Projet RNTL Averiles -- Fourniture F1.6 : Expérimentation, September 2007. 16 pages.
[ BibTex | Web page | PDF ]
[LLV07]: LIAFA, LSV, and Verimag. Projet RNTL Averiles -- Fourniture F1.4 : Prototypes d'outil, September 2007. 3 pages.
[ BibTex | Web page | PDF ]
[LCE⁺07c]: LIAFA, CRIL Technology, EDF R&D, LSV, and Verimag. Projet RNTL Averiles -- Fourniture F1.3 : Algorithmes de vérification, September 2007. 19 pages.
[ BibTex | Web page | PDF ]
[LCE⁺07b]: LIAFA, CRIL Technology, EDF R&D, LSV, and Verimag. Projet RNTL Averiles -- Fourniture F1.2 : Extraction de modèles, September 2007. 19 pages.
[ BibTex | Web page | PDF ]
[LCE⁺07a]: LIAFA, CRIL Technology, EDF R&D, LSV, and Verimag. Projet RNTL Averiles -- Fourniture F1.1 : Modèles, September 2007. 6 pages.
[ BibTex | Web page | PDF ]
[LCE⁺07d]: LIAFA, CRIL Technology, EDF R&D, LSV, and Verimag. Rapport à mi-parcours du projet RNTL Averiles (analyse et vérification de logiciels embarqués avec structures de mémoire dynamique, September 2007. 4 pages.
[ BibTex | Web page | PDF ]
[BHJS07]: A. Bouajjani, P. Habermehl, Y. Jurski, and M. Sighireanu. Rewriting Systems with Data -- A Framework for Reasoning About Systems with Unbounded Structures over Infinite Data Domains. In Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT'07), volume 4639 of Lecture Notes in Computer Science, pages 1--22, Budapest, Hungary, August 2007. Springer.
doi: 10.1007/978-3-540-74240-1_1.
[ BibTex | DOI | Web page | PS | PDF ]
[BGMNK07]: P. Bhateja, P. Gastin, M. Mukund, and K. Narayan Kumar. Local testing of message sequence charts is difficult. In Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT'07), volume 4639 of Lecture Notes in Computer Science, pages 76--87, Budapest, Hungary, August 2007. Springer.
doi: 10.1007/978-3-540-74240-1_8.
[ BibTex | DOI | Web page | PDF ]
[L⁺07]: F. Laroussinie et al. Projet DOTS (ANR-06-SETI-003) : Rapport à 6 mois, August 2007. 7 pages.
[ BibTex ]
[GO07]: P. Gastin and D. Oddoux. LTL2BA v1.1, August 2007. Written in C++ (about 4000 lines).
[ BibTex | Web page ]
[Laf07a]: P. Lafourcade. Intruder Deduction for the Equational Theory of phExclusive-or with Commutative and Distributive Encryption. In Proceedings of the 1st International Workshop on Security and Rewriting Techniques (SecReT'06), volume 171 of Electronic Notes in Theoretical Computer Science, pages 37--57, Venice, Italy, July 2007. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2007.02.054.
[ BibTex | DOI | Web page | PS | PDF ]
[BJ07b]: A. Bouhoula and F. Jacquemard. Verifying Regular Trace Properties of Security Protocols with Explicit Destructors and Implicit Induction. In Proceedings of the Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA'07), pages 27--44, Wroclaw, Poland, July 2007.
[ BibTex | Web page | PDF ]
[BE07]: C. Braunstein and E. Encrenaz. Using CTL formulae as component abstraction in a design and verification flow. In Proceedings of the 7th International Conference on Application of Concurrency to System Design (ACSD'07), pages 80--89, Bratislava, Slovak Republik, July 2007. IEEE Computer Society Press.
doi: 10.1109/ACSD.2007.76.
[ BibTex | DOI | Web page | PDF ]
[NT07]: M. Nesi and R. Treinen, editors. Preliminary Proceedings of the 2nd International Workshop on Security and Rewriting Techniques (SecReT'07), Paris, France, July 2007.
[ BibTex ]
[GM07]: P. Gastin and P. Moro. Minimal counter-example generation for SPIN. In Proceedings of the 14th International SPIN Workshop on Model Checking Software (SPIN'07), volume 4595 of Lecture Notes in Computer Science, pages 24--38, Berlin, Germany, July 2007. Springer.
doi: 10.1007/978-3-540-73370-6_4.
[ BibTex | DOI | Web page | PS | PDF ]
[Gou07b]: J. Goubault-Larrecq. Continuous Capacities on Continuous State Spaces. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP'07), volume 4596 of Lecture Notes in Computer Science, pages 764--776, Wroclaw, Poland, July 2007. Springer.
doi: 10.1007/978-3-540-73420-8_66.
[ BibTex | DOI | Web page | PDF ]
[BHPR07]: Th. Brihaye, Th. A. Henzinger, V. Prabhu, and J.-F. Raskin. Minimum-Time Reachability in Timed Games. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP'07), volume 4596 of Lecture Notes in Computer Science, pages 825--837, Wroclaw, Poland, July 2007. Springer.
doi: 10.1007/978-3-540-73420-8_71.
[ BibTex | DOI | Web page | PS | PDF ]
[CDS07]: V. Cortier, S. Delaune, and G. Steel. A Formal Theory of Key Conjuring. In Proceedings of the 20th IEEE Computer Security Foundations Symposium (CSF'07), pages 79--93, Venice, Italy, July 2007. IEEE Computer Society Press.
doi: 10.1109/CSF.2007.5.
[ BibTex | DOI | Web page | PS | PDF ]
[Gou07d]: J. Goubault-Larrecq. On Noetherian Spaces. In Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS'07), pages 453--462, Wroclaw, Poland, July 2007. IEEE Computer Society Press.
doi: 10.1109/LICS.2007.34.
[ BibTex | DOI | Web page | PDF ]
[BMOW07]: P. Bouyer, N. Markey, J. Ouaknine, and J. Worrell. The Cost of Punctuality. In Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS'07), pages 109--118, Wroclaw, Poland, July 2007. IEEE Computer Society Press.
doi: 10.1109/LICS.2007.49.
[ BibTex | DOI | Web page | PS | PDF ]
[SC07]: G. Steel and J. Courant. A formal model for detecting parallel key search attacks. In Proceedings of the 3rd Workshop on Formal and Computational Cryptography (FCC'07), Venice, Italy, July 2007.
[ BibTex | Web page | PDF ]
[Sch07]: Ph. Schnoebelen. Model Checking Branching-Time Logics. In Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME'07), page 5, Alicante, Spain, June 2007. IEEE Computer Society Press.
doi: 10.1109/TIME.2007.52.
[ BibTex | DOI | Web page | PS | PDF ]
[BCD07b]: S. Bursuc, H. Comon-Lundh, and S. Delaune. Deducibility Constraints, Equational Theory and Electronic Money. In Rewriting, Computation and Proof --- Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday, volume 4600 of Lecture Notes in Computer Science, pages 196--212, Cachan, France, June 2007. Springer.
doi: 10.1007/978-3-540-73147-4_10.
[ BibTex | DOI | Web page | PS ]
[CKK07]: H. Comon-Lundh, C. Kirchner, and H. Kirchner, editors. Rewriting, Computation and Proof --- Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday, volume 4600 of Lecture Notes in Computer Science, Cachan, France, June 2007. Springer.
doi: 10.1007/978-3-540-73147-4.
[ BibTex | DOI | Web page ]
[Che07]: F. Chevalier. Logiques pour les systèmes temporisés : contrôle et expressivité. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2007.
[ BibTex | Web page | PS | PDF ]
[Rey07b]: P.-A. Reynier. Vérification de systèmes temporisés et distribués : modèles, algorithmes et implémentabilité. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2007.
[ BibTex | Web page | PS | PDF ]
[Dem07]: S. Demri. Logiques pour la spécification et vérification. Mémoire d'habilitation, Université Paris 7, Paris, France, June 2007.
[ BibTex | Web page | PDF ]
[Enc07]: E. Encrenaz-Tiphène. Contributions pour la conception et la vérification de systèmes matériels embarqués. Mémoire d'habilitation, Université Paris 6, Paris, France, June 2007.
[ BibTex | Web page | PDF ]
[Boz07]: L. Bozzelli. Complexity results on branching-time pushdown model checking. Theoretical Computer Science, 379(1-2):286--297, June 2007.
doi: 10.1016/j.tcs.2007.03.049.
[ BibTex | DOI | Web page | PDF ]
[DG07a]: S. Demri and R. Gascon. The Effects of Bounding Syntactic Resources on Presburger LTL (Extended Abstract). In Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME'07), pages 94--104, Alicante, Spain, June 2007. IEEE Computer Society Press.
doi: 10.1109/TIME.2007.63.
[ BibTex | DOI | Web page | PDF ]
[BDL07b]: R. Brochenin, S. Demri, and É. Lozes. Reasoning about sequences of memory states. In Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS'07), volume 4514 of Lecture Notes in Computer Science, pages 100--114, New York, New York, USA, June 2007. Springer.
doi: 10.1007/978-3-540-72734-7_8.
[ BibTex | DOI | Web page | PDF ]
[LS07]: F. Laroussinie and J. Sproston. State Explosion in Almost-Sure Probabilistic Reachability. Information Processing Letters, 102(6):236--241, June 2007.
doi: 10.1016/j.ipl.2007.01.003.
[ BibTex | DOI | Web page | PDF ]
[BM07a]: B. Bollig and I. Meinecke. Weighted Distributed Systems and Their Logics. In Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS'07), volume 4514 of Lecture Notes in Computer Science, pages 54--68, New York, New York, USA, June 2007. Springer.
doi: 10.1007/978-3-540-72734-7_5.
[ BibTex | DOI | Web page | PS | PDF ]
[DDG07]: S. Demri, D. D'Souza, and R. Gascon. Decidable Temporal Logic with Repeating Values. In Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS'07), volume 4514 of Lecture Notes in Computer Science, pages 180--194, New York, New York, USA, June 2007. Springer.
doi: 10.1007/978-3-540-72734-7_13.
[ BibTex | DOI | Web page | PDF ]
[BBC07]: P. Bouyer, Th. Brihaye, and F. Chevalier. Weighted O-Minimal Hybrid Systems are more Decidable than Weighted Timed Automata! In Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS'07), volume 4514 of Lecture Notes in Computer Science, pages 69--83, New York, New York, USA, June 2007. Springer.
doi: 10.1007/978-3-540-72734-7_6.
[ BibTex | DOI | Web page | PS | PDF ]
[VG07]: K. N. Verma and J. Goubault-Larrecq. Alternating Two-Way AC-Tree Automata. Information and Computation, 205(6):817--869, June 2007.
doi: 10.1016/j.ic.2006.12.006.
[ BibTex | DOI | Web page | PS | PDF ]
[DG07b]: M. Droste and P. Gastin. Weighted automata and weighted logics. Theoretical Computer Science, 380(1-2):69--86, June 2007.
doi: 10.1016/j.tcs.2007.02.055.
[ BibTex | DOI | Web page | PS | PDF ]
[DK07]: S. Delaune and F. Klay. Synthèse des expérimentations. Technical Report 10, projet RNTL PROUVÉ, May 2007. 10 pages.
[ BibTex | Web page | PDF ]
[CDFP07]: N. Chamseddine, M. Duflot, L. Fribourg, and C. Picaronny. Determinate Probabilistic Timed Automata as Markov Chains with Parametric Costs. Research Report LSV-07-21, Laboratoire Spécification et Vérification, ENS Cachan, France, May 2007. 17 pages.
[ BibTex | Web page | PDF ]
[Bre07]: R. Bresciani. The ZRTP Protocol --- Security Considerations. Research Report LSV-07-20, Laboratoire Spécification et Vérification, ENS Cachan, France, May 2007. 23 pages.
[ BibTex | Web page | PS | PDF ]
[Gas07c]: P. Gastin. Langages formels. Course notes, Magistère STIC, ENS Cachan, France, May 2007.
[ BibTex ]
[Laf07c]: P. Lafourcade. Rapport d'activités à 6 mois, contrat CNRS/DGA référence : 06 60 019 00 470 75 01 << Utilisation et exploitation des théories équationnelles dans l'analyse des protocoles cryptographiques >>. Contract report, DGA, April 2007. 5 pages.
[ BibTex | Web page | PS ]
[LLT07]: P. Lafourcade, D. Lugiez, and R. Treinen. Intruder Deduction for the Equational Theory of Abelian Groups with Distributive Encryption. Information and Computation, 205(4):581--623, April 2007.
doi: 10.1016/j.ic.2006.10.008.
[ BibTex | DOI | Web page | PS | PDF ]
[BDL07a]: R. Brochenin, S. Demri, and É. Lozes. Reasoning about Sequences of Memory States. In Proceedings of the 1st Workshop on Heap Analysis and Verification (HAV'07), Braga, Portugal, March 2007.
[ BibTex | Web page | PDF ]
[Maz07]: L. Mazaré. Computationally Sound Analysis of Protocols using Bilinear Pairings. In Preliminary Proceedings of the 7th International Workshop on Issues in the Theory of Security (WITS'07), pages 6--21, Braga, Portugal, March 2007.
[ BibTex | Web page | PDF ]
[BK07]: B. Bollig and D. Kuske. Muller Message-Passing Automata and Logics. In Preliminary Proceedings of the 1st International Conference on Language and Automata Theory and Applications (LATA'07), Tarragona, Spain, March-April 2007.
[ BibTex | Web page | PS | PDF ]
[JLS07]: M. Jurdziński, F. Laroussinie, and J. Sproston. Model Checking Probabilistic Timed Automata with One or Two Clocks. In Proceedings of the 13th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'07), volume 4424 of Lecture Notes in Computer Science, pages 170--184, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71209-1_15.
[ BibTex | DOI | Web page | PDF ]
[DDSS07]: D. D'Aprile, S. Donatelli, A. Sangnier, and J. Sproston. From Time Petri Nets to Timed Automata: An Untimed Approach. In Proceedings of the 13th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'07), volume 4424 of Lecture Notes in Computer Science, pages 216--230, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71209-1_18.
[ BibTex | DOI | Web page | PS | PDF ]
[BKKL07]: B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. Replaying Play in and Play out: Synthesis of Design Models from Scenarios by Learning. In Proceedings of the 13th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'07), volume 4424 of Lecture Notes in Computer Science, pages 435--450, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71209-1_33.
[ BibTex | DOI | Web page | PS | PDF ]
[CJP07]: H. Comon-Lundh, F. Jacquemard, and N. Perrin. Tree Automata with Memory, Visibility and Structural Constraints. In Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'07), volume 4423 of Lecture Notes in Computer Science, pages 168--182, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71389-0_13.
[ BibTex | DOI | Web page | PDF ]
[LMO07]: F. Laroussinie, N. Markey, and G. Oreiby. On the Expressiveness and Complexity of ATL. In Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'07), volume 4423 of Lecture Notes in Computer Science, pages 243--257, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71389-0_18.
[ BibTex | DOI | Web page | PS | PDF ]
[BLM07]: P. Bouyer, K. G. Larsen, and N. Markey. Model-Checking One-Clock Priced Timed Automata. In Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'07), volume 4423 of Lecture Notes in Computer Science, pages 108--122, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71389-0_9.
[ BibTex | DOI | Web page | PS | PDF ]
[DD07]: S. Demri and D. D'Souza. An automata-theoretic approach to constraint LTL. Information and Computation, 205(3):380--415, March 2007.
doi: 10.1016/j.ic.2006.09.006.
[ BibTex | DOI | Web page | PDF ]
[BJ07a]: A. Bouhoula and F. Jacquemard. Tree Automata, Implicit Induction and Explicit Destructors for Security Protocol Verification. Research Report LSV-07-10, Laboratoire Spécification et Vérification, ENS Cachan, France, February 2007. 21 pages.
[ BibTex | Web page | PDF ]
[KL07]: B. Ksieżopolski and P. Lafourcade. Attack and Revison of an Electronic Auction Protocol using OFMC. Technical Report 549, Department of Computer Science, ETH Zurich, Switzerland, February 2007. 13 pages.
[ BibTex | Web page | PDF ]
[DN07]: S. Demri and D. Nowak. Reasoning about transfinite sequences. International Journal of Foundations of Computer Science, 18(1):87--112, February 2007.
doi: 10.1142/S0129054107004589.
[ BibTex | DOI | Web page | PS | PDF ]
[BCD07a]: S. Bursuc, H. Comon-Lundh, and S. Delaune. Associative-Commutative Deducibility Constraints. In Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS'07), volume 4393 of Lecture Notes in Computer Science, pages 634--645, Aachen, Germany, February 2007. Springer.
doi: 10.1007/978-3-540-70918-3_54.
[ BibTex | DOI | Web page | PS | PDF ]
[Laf07b]: P. Lafourcade. Rapport d'activités à 3 mois, contrat CNRS/DGA référence : 06 60 019 00 470 75 01 << Utilisation et exploitation des théories équationnelles dans l'analyse des protocoles cryptographiques >>. Contract report, DGA, January 2007. 3 pages.
[ BibTex | Web page | PS ]
[Gou07a]: J. Goubault-Larrecq. Believe It Or Not, GOI is a Model of Classical Linear Logic. Research Report LSV-07-03, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2007. 18 pages.
[ BibTex | Web page | PDF ]
[DO07]: S. Demri and E. Orlowska. Relative Nondeterministic Information Logic is EXPTIME-complete. Fundamenta Informaticae, 75(1-4):163--178, 2007.
[ BibTex | Web page | PDF ]
[Rey07a]: P.-A. Reynier. Diagonal constraints handled efficiently in UPPAAL. Research Report LSV-07-02, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2007. 4 pages.
[ BibTex | Web page | PS | PDF ]
[Bau07]: M. Baudet. Sécurité des protocoles cryptographiques : aspects logiques et calculatoires. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2007.
[ BibTex | Web page | PS | PDF ]
[DLN07]: S. Demri, R. Lazić, and D. Nowak. On the freeze quantifier in constraint LTL: Decidability and complexity. Information and Computation, 205(1):2--24, January 2007.
doi: 10.1016/j.ic.2006.08.003.
[ BibTex | DOI | Web page | PDF ]
[Com07]: H. Comon-Lundh. Soundness of abstract cryptography, 2007. Course notes (part 1), Symposium on Cryptography and Information Security (SCIS2008), Tokai, Japan.
[ BibTex | Web page | PDF ]
[Gou06]: J. Goubault-Larrecq. Preuve et vérification pour la sécurité et la sûreté. In Encyclopédie de l'informatique et des systèmes d'information, chapter I.6, pages 683--703. Vuibert, December 2006.
[ BibTex | Web page ]
[BKŘS06]: L. Bozzelli, M. Křetínský, V. Řehák, and J. Strejček. On Decidability of LTL Model Checking for Process Rewrite Systems. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, pages 248--259, Kolkata, India, December 2006. Springer.
doi: 10.1007/11944836_24.
[ BibTex | DOI | Web page | PDF ]
[BLMR06]: P. Bouyer, K. G. Larsen, N. Markey, and J. I. Rasmussen. Almost Optimal Strategies in One-Clock Priced Timed Automata. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, pages 345--356, Kolkata, India, December 2006. Springer.
doi: 10.1007/11944836_32.
[ BibTex | DOI | Web page | PS | PDF ]
[Che06]: F. Chevalier. Decision procedures for timed logics. Invited talk, Advances and Issues in Timed Systems, Kolkata, India, December 2006.
[ BibTex ]
[Gas06c]: P. Gastin. Refinements and Abstractions of Signal-Event (Timed) Languages. Invited talk, Advances and Issues in Timed Systems, Kolkata, India, December 2006.
[ BibTex ]
[GSZ06]: P. Gastin, N. Sznajder, and M. Zeitoun. Distributed synthesis for well-connected architectures. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, pages 321--332, Kolkata, India, December 2006. Springer.
doi: 10.1007/11944836_30.
[ BibTex | DOI | Web page | PDF ]
[CDP06]: F. Chevalier, D. D'Souza, and P. Prabhakar. On continuous timed automata with input-determined guards. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, pages 369--380, Kolkata, India, December 2006. Springer.
doi: 10.1007/11944836_34.
[ BibTex | DOI | Web page | PS | PDF ]
[CKKW06]: V. Cortier, S. Kremer, R. Küsters, and B. Warinschi. Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, pages 176--187, Kolkata, India, December 2006. Springer.
doi: 10.1007/11944836_18.
[ BibTex | DOI | Web page | PS | PDF ]
[Del06b]: S. Delaune. An Undecidability Result for AGh. Theoretical Computer Science, 368(1-2):161--167, December 2006.
doi: 10.1016/j.tcs.2006.08.018.
[ BibTex | DOI | Web page | PS | PDF ]
[BBS06b]: C. Baier, N. Bertrand, and Ph. Schnoebelen. On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. In Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'06), volume 4246 of Lecture Notes in Artificial Intelligence, pages 347--361, Phnom Penh, Cambodia, November 2006. Springer.
doi: 10.1007/11916277_24.
[ BibTex | DOI | Web page | PS | PDF ]
[BG06]: L. Bozzelli and R. Gascon. Branching Time Temporal Logic Extended with Presburger Constraints. In Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'06), volume 4246 of Lecture Notes in Artificial Intelligence, pages 197--211, Phnom Penh, Cambodia, November 2006. Springer.
doi: 10.1007/11916277_14.
[ BibTex | DOI | Web page | PS | PDF ]
[TED06]: S. Taktak, E. Encrenaz, and J.-L. Desbarbieux. A Tool for Automatic Detection of Deadlock in Wormhole Networks on Chip. In Proceedings of the IEEE High Level Design Verification and Test Workshop (HLDVT'06), pages 203--210, Monterey, California, USA, November 2006. IEEE Computer Society Press.
doi: 10.1109/HLDVT.2006.319992.
[ BibTex | DOI | Web page | PDF ]
[DG06b]: V. Diekert and P. Gastin. Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Information and Computation, 204(11):1597--1619, November 2006.
doi: 10.1016/j.ic.2006.07.002.
[ BibTex | DOI | Web page | PDF ]
[Sch06]: Ph. Schnoebelen. De nouvelles applications pour le model-checking. Invited lecture, Journées à l'occasion des 20 ans du LIPN, Villetaneuse, France, November 2006.
[ BibTex ]
[KBL⁺06]: F. Klay, L. Bozga, Y. Lakhnech, L. Mazaré, S. Delaune, and S. Kremer. Retour d'expérience sur la validation du vote électronique. Technical Report 9, projet RNTL PROUVÉ, November 2006. 47 pages.
[ BibTex | Web page | PDF ]
[B⁺06]: P. Bouyer et al. ACI Sécurité Informatique CORTOS --- Rapport final, November 2006. 17 pages.
[ BibTex | Web page | PDF ]
[SBS06]: Ph. Schnoebelen, A. Bouajjani, and G. Sutre. ACI Sécurité Informatique PERSÉE --- Rapport final, November 2006. 12 pages.
[ BibTex | Web page | PDF ]
[Gas06b]: P. Gastin. GasT_EX: Graphs and Automata Simplified in T_EX (v2.8), November 2006. Written in T_EX(about 2000 lines).
[ BibTex | Web page ]
[BBBL06]: H. Bel mokadem, B. Bérard, P. Bouyer, and F. Laroussinie. Timed temporal logics for abstracting transient states. In Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), volume 4218 of Lecture Notes in Computer Science, pages 337--351, Beijing, China, October 2006. Springer.
doi: 10.1007/11901914_26.
[ BibTex | DOI | Web page | PDF ]
[BHR06c]: P. Bouyer, S. Haddad, and P.-A. Reynier. Timed Unfoldings for Networks of Timed Automata. In Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), volume 4218 of Lecture Notes in Computer Science, pages 292--306, Beijing, China, October 2006. Springer.
doi: 10.1007/11901914_23.
[ BibTex | DOI | Web page | PS | PDF ]
[DFGvD06]: S. Demri, A. Finkel, V. Goranko, and G. van Drimmelen. Towards a model-checker for counter systems. In Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), volume 4218 of Lecture Notes in Computer Science, pages 493--507, Beijing, China, October 2006. Springer.
doi: 10.1007/11901914_36.
[ BibTex | DOI | Web page | PDF ]
[BGM06]: P. Bhateja, P. Gastin, and M. Mukund. A fresh look at testing for asynchronous communication. In Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), volume 4218 of Lecture Notes in Computer Science, pages 369--383, Beijing, China, October 2006. Springer.
doi: 10.1007/11901914_28.
[ BibTex | DOI | Web page | PS | PDF ]
[Mar06]: N. Markey. Verification of Multi-Agent Systems with ATL. Invited talk, FNRS meeting on "Synthesis and Verification", October 2006.
[ BibTex ]
[Ber06b]: N. Bertrand. Modèles stochastiques pour les pertes de messages dans les protocoles asynchrones et techniques de vérification automatique. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2006.
[ BibTex | Web page | PS | PDF ]
[G⁺06]: P. Gastin et al. ACI Sécurité Informatique VERSYDIS --- Rapport final, October 2006. 10 pages.
[ BibTex | Web page | PDF ]
[BBS06c]: C. Baier, N. Bertrand, and Ph. Schnoebelen. Symbolic verification of communicating systems with probabilistic message losses: liveness and fairness. In Proceedings of 26th IFIP WG6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'06), volume 4229 of Lecture Notes in Computer Science, pages 212--227, Paris, France, September 2006. Springer.
doi: 10.1007/11888116_17.
[ BibTex | DOI | Web page | PS | PDF ]
[MBDC⁺06]: F. Mancinelli, J. Boender, R. Di Cosmo, J. Vouillon, B. Durak, X. Leroy, and R. Treinen. Managing the Complexity of Large Free and Open Source Package-Based Software Distributions. In Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06), pages 199--208, Tokyo, Japan, September 2006. IEEE Computer Society Press.
doi: 10.1109/ASE.2006.49.
[ BibTex | DOI | Web page | PDF ]
[AB06]: E. Asarin and P. Bouyer, editors. Proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202 of Lecture Notes in Computer Science, Paris, France, September 2006. Springer.
doi: 10.1007/11867340.
[ BibTex | DOI | Web page ]
[BGP06b]: B. Bérard, P. Gastin, and A. Petit. Refinements and abstractions of signal-event (timed) languages. In Proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202 of Lecture Notes in Computer Science, pages 67--81, Paris, France, September 2006. Springer.
doi: 10.1007/11867340_6.
[ BibTex | DOI | Web page | PS | PDF ]
[BGP06a]: B. Bérard, P. Gastin, and A. Petit. Intersection of regular signal-event (timed) languages. In Proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202 of Lecture Notes in Computer Science, pages 52--66, Paris, France, September 2006. Springer.
doi: 10.1007/11867340_5.
[ BibTex | DOI | Web page | PS | PDF ]
[CEFX06b]: R. Chevallier, E. Encrenaz-Tiphène, L. Fribourg, and W. Xu. Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata. In Proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202 of Lecture Notes in Computer Science, pages 113--127, Paris, France, September 2006. Springer.
doi: 10.1007/11867340_9.
[ BibTex | DOI | Web page | PS | PDF ]
[LMO06]: F. Laroussinie, N. Markey, and G. Oreiby. Model Checking Timed ATL for Durational Concurrent Game Structures. In Proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202 of Lecture Notes in Computer Science, pages 245--259, Paris, France, September 2006. Springer.
doi: 10.1007/11867340_18.
[ BibTex | DOI | Web page | PS | PDF ]
[MOJ06]: I. Mitsuhashi, M. Oyamaguchi, and F. Jacquemard. The Confluence Problem for Flat TRSs. In Proceedings of the 8th International Conference on Artificial Intelligence and Symbolic Computation (AISC'06), volume 4120 of Lecture Notes in Artificial Intelligence, pages 68--81, Beijing, China, September 2006. Springer.
doi: 10.1007/11856290_8.
[ BibTex | DOI | Web page | PDF ]
[Laf06]: P. Lafourcade. Vérification des protocoles cryptographiques en présence de théories équationnelles. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2006. 209 pages.
[ BibTex | Web page | PS | PDF ]
[Bel06]: H. Bel mokadem. Vérification des propriétés temporisées des automates programmables industriels. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2006.
[ BibTex | Web page | PDF ]
[Nav06]: G. Naves. Accessibilité dans les automates temporisés à deux horloges. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2006.
[ BibTex | Web page | PS | PDF ]
[Aks06]: S. Akshay. Formal Specification and Verification of Timed Communicating Systems. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2006.
[ BibTex | Web page | PDF ]
[Bur06]: S. Bursuc. Contraintes de déductibilité modulo Associativité-Commutativité. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2006.
[ BibTex | Web page | PDF ]
[BP06]: M. Baclet and C. Pagetti. Around Hopcroft's Algorithm. In Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA'06), volume 4094 of Lecture Notes in Computer Science, pages 114--125, Taipei, Taiwan, August 2006. Springer-Verlag.
doi: 10.1007/11812128_12.
[ BibTex | DOI | Web page | PDF ]
[BM06]: P. Bouyer and P. Madhusudan, editors. Proceedings of the 3rd Workshop on Games in Design and Verification (GDV'06), Seattle, Washington, USA, August 2006.
[ BibTex ]
[BBC06a]: P. Bouyer, L. Bozzelli, and F. Chevalier. Controller Synthesis for MTL Specifications. In Proceedings of the 17th International Conference on Concurrency Theory (CONCUR'06), volume 4137 of Lecture Notes in Computer Science, pages 450--464, Bonn, Germany, August 2006. Springer.
doi: 10.1007/11817949_30.
[ BibTex | DOI | Web page | PS | PDF ]
[BBC06b]: P. Bouyer, Th. Brihaye, and F. Chevalier. Control in o-Minimal Hybrid Systems. In Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pages 367--378, Seattle, Washington, USA, August 2006. IEEE Computer Society Press.
doi: 10.1109/LICS.2006.22.
[ BibTex | DOI | Web page | PS | PDF ]
[BLP06]: S. Bardin, J. Leroux, and G. Point. FAST Extended Release. In Proceedings of the 18th International Conference on Computer Aided Verification (CAV'06), volume 4144 of Lecture Notes in Computer Science, pages 63--66, Seattle, Washington, USA, August 2006. Springer.
doi: 10.1007/11817963_9.
[ BibTex | DOI | Web page | PS | PDF ]
[DL06a]: S. Demri and R. Lazić. LTL with the freeze quantifier and register automata. In Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pages 17--26, Seattle, Washington, USA, August 2006. IEEE Computer Society Press.
doi: 10.1109/LICS.2006.31.
[ BibTex | DOI | Web page | PDF ]
[DL06b]: S. Demri and D. Lugiez. Presburger Modal Logic is Only PSPACE-complete. In Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR'06), volume 4130 of Lecture Notes in Artificial Intelligence, pages 541--556, Seattle, Washington, USA, August 2006. Springer-Verlag.
doi: 10.1007/11814771_44.
[ BibTex | DOI | Web page ]
[Dem06b]: S. Demri. LTL over integer periodicity constraints. Theoretical Computer Science, 360(1-3):96--123, August 2006.
doi: 10.1016/j.tcs.2006.02.019.
[ BibTex | DOI | Web page | PDF ]
[JRV06]: F. Jacquemard, M. Rusinowitch, and L. Vigneron. Tree automata with equality constraints modulo equational theories. In Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR'06), volume 4130 of Lecture Notes in Artificial Intelligence, pages 557--571, Seattle, Washington, USA, August 2006. Springer-Verlag.
doi: 10.1007/11814771_45.
[ BibTex | DOI | Web page ]
[KS06]: A. Kučera and Ph. Schnoebelen. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. Theoretical Computer Science, 358(2-3):315--333, August 2006.
doi: 10.1016/j.tcs.2006.01.021.
[ BibTex | DOI | Web page | PS | PDF ]
[LLT06]: P. Lafourcade, D. Lugiez, and R. Treinen. ACUNh: Unification and Disunification Using Automata Theory. In Proceedings of the 20th International Workshop on Unification (UNIF'06), pages 6--20, Seattle, Washington, USA, August 2006.
[ BibTex | Web page | PS | PDF ]
[BJ06a]: A. Bouhoula and F. Jacquemard. Automating Sufficient Completeness Check for Conditional and Constrained TRS. In Proceedings of the 20th International Workshop on Unification (UNIF'06), Seattle, Washington, USA, August 2006.
[ BibTex | Web page | PDF ]
[MR06]: N. Markey and J.-F. Raskin. Model Checking Restricted Sets of Timed Paths. Theoretical Computer Science, 358(2-3):273--292, August 2006.
doi: 10.1016/j.tcs.2006.01.019.
[ BibTex | DOI | Web page | PS | PDF ]
[BJ06b]: A. Bouhoula and F. Jacquemard. Security Protocols Verification with Implicit Induction and Explicit Destructors. In Preliminary Proceedings of the 1st International Workshop on Security and Rewriting Techniques (SecReT'06), pages 37--44, Venice, Italy, July 2006.
[ BibTex | Web page | PDF ]
[BHR06b]: P. Bouyer, S. Haddad, and P.-A. Reynier. Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP'06) --- Part II, volume 4052 of Lecture Notes in Computer Science, pages 420--431, Venice, Italy, July 2006. Springer.
doi: 10.1007/11787006_36.
[ BibTex | DOI | Web page | PS | PDF ]
[BS06]: N. Bertrand and Ph. Schnoebelen. A short visit to the STS hierarchy. In Proceedings of the 12th International Workshop on Expressiveness in Concurrency (EXPRESS'05), volume 154 of Electronic Notes in Theoretical Computer Science, pages 59--69, San Francisco, California, USA, July 2006. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2006.05.007.
[ BibTex | DOI | Web page | PS | PDF ]
[CEFX06a]: R. Chevallier, E. Encrenaz-Tiphène, L. Fribourg, and W. Xu. Timing analysis of an embedded memory: SPSMALL. WSEAS Transactions on Circuits and Systems, 5(7):973--978, July 2006.
[ BibTex | Web page | PDF ]
[DKR06a]: S. Delaune, S. Kremer, and M. D. Ryan. Coercion-Resistance and Receipt-Freeness in Electronic Voting. In Proceedings of the 19th IEEE Computer Security Foundations Workshop (CSFW'06), pages 28--39, Venice, Italy, July 2006. IEEE Computer Society Press.
doi: 10.1109/CSFW.2006.8.
[ BibTex | DOI | Web page | PS | PDF ]
[DLLT06]: S. Delaune, P. Lafourcade, D. Lugiez, and R. Treinen. Symbolic Protocol Analysis in Presence of a Homomorphism Operator and phExclusive Or. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP'06) --- Part II, volume 4052 of Lecture Notes in Computer Science, pages 132--143, Venice, Italy, July 2006. Springer.
doi: 10.1007/11787006_12.
[ BibTex | DOI | Web page | PS | PDF ]
[CK06]: V. Cortier and S. Kremer, editors. Proceedings of the 2nd Workshop on Formal and Computational Cryptography (FCC'06), Venice, Italy, July 2006.
[ BibTex | Web page ]
[RS06]: A. Rabinovich and Ph. Schnoebelen. BTL_2 and the expressive power of ECTL^+. Information and Computation, 204(7):1023--1044, July 2006.
doi: 10.1016/j.ic.2005.07.006.
[ BibTex | DOI | Web page | PS | PDF ]
[BBLP06]: G. Behrmann, P. Bouyer, K. G. Larsen, and R. Pelánek. Lower and Upper Bounds in Zone-Based Abstractions of Timed Automata. International Journal on Software Tools for Technology Transfer, 8(3):204--215, June 2006.
doi: 10.1007/s10009-005-0190-0.
[ BibTex | DOI | Web page | PS | PDF ]
[BC06]: P. Bouyer and F. Chevalier. On the Control of Timed and Hybrid Systems. EATCS Bulletin, 89:79--96, June 2006.
[ BibTex | Web page | PS | PDF ]
[BBM06]: P. Bouyer, Th. Brihaye, and N. Markey. Improved Undecidability Results on Weighted Timed Automata. Information Processing Letters, 98(5):188--194, June 2006.
doi: 10.1016/j.ipl.2006.01.012.
[ BibTex | DOI | Web page | PS | PDF ]
[BH06b]: M. Bidoit and R. Hennicker. Proving Behavioral Refinements of COL-Specifications. In Algebra, Meaning and Computation --- Essays dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday, volume 4060 of Lecture Notes in Computer Science, pages 333--354, San Diego, California, USA, June 2006. Springer.
doi: 10.1007/11780274_18.
[ BibTex | DOI | Web page | PDF ]
[BHR06a]: P. Bouyer, S. Haddad, and P.-A. Reynier. Extended Timed Automata and Time Petri Nets. In Proceedings of the 6th International Conference on Application of Concurrency to System Design (ACSD'06), pages 91--100, Turku, Finland, June 2006. IEEE Computer Society Press.
doi: 10.1109/ACSD.2006.6.
[ BibTex | DOI | Web page | PS | PDF ]
[BL06]: P. Bouyer and F. Laroussinie. Vérification par automates temporisés. In Systèmes temps-réel 1 : techniques de description et de vérification, pages 121--150. Hermès, June 2006.
[ BibTex | Web page | PS | PDF ]
[Bol06]: B. Bollig. Formal Models of Communicating Systems --- Languages, Automata, and Monadic Second-Order Logic. Springer, June 2006.
[ BibTex | Web page ]
[BE06]: C. Braunstein and E. Encrenaz. Formalizing the incremental design and verification process of a pipelined protocol converter. In Proceedings of the 17th International Workshop on Rapid System Prototyping (RSP'06), pages 103--109, Chania, Crete, June 2006. IEEE Computer Society Press.
doi: 10.1109/RSP.2006.19.
[ BibTex | DOI | Web page | PS | PDF ]
[DKR06b]: S. Delaune, S. Kremer, and M. D. Ryan. Verifying Properties of Electronic Voting Protocols. In Proceedings of the IAVoSS Workshop On Trustworthy Elections (WOTE'06), pages 45--52, Cambridge, UK, June 2006.
[ BibTex | Web page | PS | PDF ]
[DLS06]: S. Demri, F. Laroussinie, and Ph. Schnoebelen. A Parametric Analysis of the State Explosion Problem in Model Checking. Journal of Computer and System Sciences, 72(4):547--575, June 2006.
doi: 10.1016/j.jcss.2005.11.003.
[ BibTex | DOI | Web page | PS | PDF ]
[Ber06a]: V. Bernat. Théories de l'intrus pour la vérification des protocoles cryptographiques. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2006.
[ BibTex | Web page | PS | PDF ]
[Del06c]: S. Delaune. Vérification des protocoles cryptographiques et propriétés algébriques. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2006.
[ BibTex | Web page | PS | PDF ]
[Bro06]: R. Brochenin. Techniques d'automates pour raisonner sur la mémoire. Rapport de Master, Master Recherche Informatique de Lyon --- Informatique Fondamentale, Lyon, France, June 2006.
[ BibTex | Web page | PS ]
[OG06]: J. Olivain and J. Goubault-Larrecq. Detecting Subverted Cryptographic Protocols by Entropy Checking. Research Report LSV-06-13, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2006. 19 pages.
[ BibTex | Web page | PDF ]
[Gas06a]: P. Gastin. Distributed synthesis: synchronous and asynchronous semantics. Invited talk, 34ème École de Printemps en Informatique Théorique, Ile de Ré, France, May 2006.
[ BibTex ]
[Gas06d]: P. Gastin. Refinements and Abstractions of Signal-Event (Timed) Languages. Invited talk, 22nd Conference on Mathematical Foundations of Programming Semantics (MFPS'06), May 2006.
[ BibTex ]
[Bou06]: P. Bouyer. Weighted Timed Automata: Model-Checking and Games. In Proceedings of the 22nd Conference on Mathematical Foundations of Programming Semantics (MFPS'06), volume 158 of Electronic Notes in Theoretical Computer Science, pages 3--17, Genova, Italy, May 2006. Elsevier Science Publishers. Invited paper.
doi: 10.1016/j.entcs.2006.04.002.
[ BibTex | DOI | Web page | PS | PDF ]
[FGRV06]: A. Finkel, G. Geeraerts, J.-F. Raskin, and L. Van Begin. On the ω-Language Expressive Power of Extended Petri Nets. Theoretical Computer Science, 356(3):374--386, May 2006.
doi: 10.1016/j.tcs.2006.02.008.
[ BibTex | DOI | Web page | PDF ]
[DG06a]: V. Diekert and P. Gastin. From local to global temporal logics over Mazurkiewicz traces. Theoretical Computer Science, 356(1-2):126--135, May 2006.
doi: 10.1016/j.tcs.2006.01.035.
[ BibTex | DOI | Web page | PDF ]
[BK06]: B. Bollig and D. Kuske. Distributed Muller Automata and Logics. Research Report LSV-06-11, Laboratoire Spécification et Vérification, ENS Cachan, France, May 2006. 23 pages.
[ BibTex | Web page | PS | PDF ]
[BFLS06]: S. Bardin, A. Finkel, É. Lozes, and A. Sangnier. From Pointer Systems to Counter Systems Using Shape Analysis. In Proceedings of the 5th International Workshop on Automated Verification of Infinite-State Systems (AVIS'06), Vienna, Austria, April 2006.
[ BibTex | Web page | PS | PDF ]
[BDCD⁺06]: J. Boender, R. Di Cosmo, B. Durak, X. Leroy, F. Mancinelli, M. Morgado, D. Pinheiro, R. Treinen, P. Trezentos, and J. Vouillon. News from the EDOS project: improving the maintenance of free software distributions. In Proceedings of the International Workshop on Free Software (IWFS'06), pages 199--207, Porto Allegre, Brazil, April 2006.
[ BibTex | Web page | PDF ]
[BH06a]: M. Bidoit and R. Hennicker. Constructor-Based Observational Logic. Journal of Logic and Algebraic Programming, 67(1-2):3--51, April-May 2006.
doi: 10.1016/j.jlap.2005.09.002.
[ BibTex | DOI | Web page | PDF ]
[ABW06]: M. Abadi, M. Baudet, and B. Warinschi. Guessing Attacks and the Computational Soundness of Static Equivalence. In Proceedings of the 9th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'06), volume 3921 of Lecture Notes in Computer Science, pages 398--412, Vienna, Austria, March 2006. Springer.
doi: 10.1007/11690634_27.
[ BibTex | DOI | Web page | PS | PDF ]
[BKSS06]: B. Bollig, C. Kern, M. Schlütter, and V. Stolz. MSCan: A Tool for Analyzing MSC Specifications. In Proceedings of the 12th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'06), volume 3920 of Lecture Notes in Computer Science, pages 455--458, Vienna, Austria, March 2006. Springer.
doi: 10.1007/11691372_32.
[ BibTex | DOI | Web page | PS | PDF ]
[Gas06e]: P. Gastin. Weigthed logics and weighted automata. Invited talk, Workshop Weighted Automata: Theory and Applications, Leipzig, Germany, March 2006.
[ BibTex ]
[BMR06]: P. Bouyer, N. Markey, and P.-A. Reynier. Robust Model-Checking of Linear-Time Properties in Timed Automata. In Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN'06), volume 3887 of Lecture Notes in Computer Science, pages 238--249, Valdivia, Chile, March 2006. Springer.
doi: 10.1007/11682462_25.
[ BibTex | DOI | Web page | PS | PDF ]
[Del06a]: S. Delaune. Easy Intruder Deduction Problems with Homomorphisms. Information Processing Letters, 97(6):213--218, March 2006.
doi: 10.1016/j.ipl.2005.11.008.
[ BibTex | DOI | Web page | PS | PDF ]
[LMS06]: F. Laroussinie, N. Markey, and Ph. Schnoebelen. Efficient Timed Model Checking for Discrete-Time Systems. Theoretical Computer Science, 353(1-3):249--271, March 2006.
doi: 10.1016/j.tcs.2005.11.020.
[ BibTex | DOI | Web page | PS | PDF ]
[MS06]: N. Markey and Ph. Schnoebelen. Mu-Calculus Path Checking. Information Processing Letters, 97(6):225--230, March 2006.
doi: 10.1016/j.ipl.2005.11.010.
[ BibTex | DOI | Web page | PS | PDF ]
[FMP06]: L. Fribourg, S. Messika, and C. Picaronny. Coupling and Self-Stabilization. Distributed Computing, 18(3):221--232, February 2006.
doi: 10.1007/s00446-005-0142-7.
[ BibTex | DOI | Web page | PS | PDF ]
[Ber06c]: N. Bertrand. SuMo -- Reachability analysis for lossy channels, February 2006. See [BBS06c] for a description. Written in OCaml (3000 lines).
[ BibTex ]
[CL06]: F. Cassez and F. Laroussinie. Contrôle des applications temps-réel : modèles temporisés et hybrides. Technique et Science Informatiques, 25(3), 2006.
[ BibTex | Web page ]
[BBS06a]: C. Baier, N. Bertrand, and Ph. Schnoebelen. A note on the attractor-property of infinite-state Markov chains. Information Processing Letters, 97(2):58--63, January 2006.
doi: 10.1016/j.ipl.2005.09.011.
[ BibTex | DOI | Web page | PS | PDF ]
[CDL06]: V. Cortier, S. Delaune, and P. Lafourcade. A Survey of Algebraic Properties Used in Cryptographic Protocols. Journal of Computer Security, 14(1):1--43, 2006.
[ BibTex | Web page | PS | PDF ]
[CKS06]: R. Chadha, S. Kremer, and A. Scedrov. Formal Analysis of Multi-Party Contract Signing. Journal of Automated Reasoning, 36(1-2):39--83, January 2006.
doi: 10.1007/s10817-005-9019-5.
[ BibTex | DOI | Web page | PDF ]
[DJ06]: S. Delaune and F. Jacquemard. Decision Procedures for the Security of Protocols with Probabilistic Encryption against Offline Dictionary Attacks. Journal of Automated Reasoning, 36(1-2):85--124, January 2006.
doi: 10.1007/s10817-005-9017-7.
[ BibTex | DOI | Web page | PS ]
[Bau06]: M. Baudet. Random Polynomial-Time Attacks and Dolev-Yao Models. Journal of Automata, Languages and Combinatorics, 11(1):7--21, 2006.
[ BibTex | Web page | PS | PDF ]
[Dem06a]: S. Demri. Linear-Time Temporal Logics with Presburger Constraints: An Overview. Journal of Applied Non-Classical Logics, 16(3-4):311--347, 2006.
[ BibTex | Web page | PDF ]
[AGH⁺06]: S. Anantharaman, P. Gastin, G. Hains, J. Mullins, and M. Rusinowitch, editors. Selected papers of the International Workshop on Security Analysis of Systems: Formalisms and Tools (SASYFT'04), volume 11, Orléans, France, 2006.
[ BibTex ]
[BCM05]: P. Bouyer, F. Chevalier, and N. Markey. On the Expressiveness of TPTL and MTL. In Proceedings of the 25th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05), volume 3821 of Lecture Notes in Computer Science, pages 432--443, Hyderabad, India, December 2005. Springer.
doi: 10.1007/11590156_35.
[ BibTex | DOI | Web page | PS | PDF ]
[Gas05a]: R. Gascon. Verifying qualitative and quantitative properties with LTL over concrete domains. In Proceedings of the 4th Workshop on Methods for Modalities (M4M-4), volume 194 of Informatik Bericht, pages 54--61, Berlin, Germany, December 2005. Humboldt Universität zu Berlin.
[ BibTex | Web page | PS | PDF ]
[Lar05b]: F. Laroussinie. Timed modal logics for the verification of real-time systems. In Proceedings of the 4th Workshop on Methods for Modalities (M4M-4), volume 194 of Informatik Bericht, pages 293--305, Berlin, Germany, December 2005. Humboldt Universität zu Berlin.
[ BibTex | Web page | PS | PDF ]
[KLT05]: S. Kremer, Y. Lakhnech, and R. Treinen. The Prouvé Manual: Specifications, Semantics, and Logics. Technical Report 7, projet RNTL PROUVÉ, December 2005. 49 pages.
[ BibTex | Web page | PS | PDF ]
[PR05b]: S. Pinchinat and S. Riedweg. On the Architectures in Decentralized Supervisory Control. In Proceedings of the 44th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC'05), pages 12--17, Seville, Spain, December 2005. IEEE Control System Society.
[ BibTex | Web page | PS | PDF ]
[Bac05]: M. Baclet. Applications du model-checking à des problèmes de vérification de systèmes sur puce. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2005.
[ BibTex | Web page | PDF ]
[Lar05a]: F. Laroussinie. Model checking temporisé --- Algorithmes efficaces et complexité. Mémoire d'habilitation, Université Paris 7, Paris, France, December 2005.
[ BibTex | Web page | PDF ]
[ABRS05]: P. A. Abdulla, N. Bertrand, A. Rabinovich, and Ph. Schnoebelen. Verification of Probabilistic Systems with Faulty Communication. Information and Computation, 202(2):141--165, November 2005.
doi: 10.1016/j.ic.2005.05.008.
[ BibTex | DOI | Web page | PS | PDF ]
[Bau05]: M. Baudet. Deciding Security of Protocols against Off-line Guessing Attacks. In Proceedings of the 12th ACM Conference on Computer and Communications Security (CCS'05), pages 16--25, Alexandria, Virginia, USA, November 2005. ACM Press.
doi: 10.1145/1102120.1102125.
[ BibTex | DOI | Web page | PS | PDF ]
[Gas05b]: P. Gastin. On the synthesis of distributed controllers. Invited talk, Workshop Perspectives in Verification, in honor of Wolfgang Thomas on the occasion of his Doctorate Honoris Causa, Cachan, France, November 2005.
[ BibTex ]
[BLR05]: P. Bouyer, F. Laroussinie, and P.-A. Reynier. Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. In Proceedings of the 3rd International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'05), volume 3829 of Lecture Notes in Computer Science, pages 112--126, Uppsala, Sweden, November 2005. Springer.
doi: 10.1007/11603009_10.
[ BibTex | DOI | Web page | PS | PDF ]
[CF05]: G. Cécé and A. Finkel. Verification of Programs with Half-Duplex Communication. Information and Computation, 202(2):166--190, November 2005.
doi: 10.1016/j.ic.2005.05.006.
[ BibTex | DOI | Web page | PDF ]
[DZG05]: S. Dal Zilio and R. Gascon. Resource Bound Certification for a Tail-Recursive Virtual Machine. In Proceedings of the 3rd Asian Symposium on Programming Languages and Systems (APLAS'05), volume 3780 of Lecture Notes in Computer Science, pages 247--263, Tsukuba, Japan, November 2005. Springer.
doi: 10.1007/11575467_17.
[ BibTex | DOI | Web page | PS | PDF ]
[VG05]: K. N. Verma and J. Goubault-Larrecq. Karp-Miller Trees for a Branching Extension of VASS. Discrete Mathematics & Theoretical Computer Science, 7(1):217--230, November 2005.
[ BibTex | Web page | PS | PDF ]
[LS05b]: D. Lugiez and Ph. Schnoebelen. Decidable first-order transition logics for PA-processes. Information and Computation, 203(1):75--113, November 2005.
doi: 10.1016/j.ic.2005.02.003.
[ BibTex | DOI | Web page | PS | PDF ]
[S⁺05]: Ph. Schnoebelen et al. ACI Sécurité Informatique PERSÉE --- Rapport à mi-parcours, November 2005. 8 pages.
[ BibTex ]
[DKK05]: S. Delaune, F. Klay, and S. Kremer. Spécification du protocole de vote électronique. Technical Report 6, projet RNTL PROUVÉ, November 2005. 19 pages.
[ BibTex | Web page | PS | PDF ]
[Tre05]: R. Treinen. Résolution symbolique de contraintes. Mémoire d'habilitation, Université Paris-Sud 11, Orsay, France, November 2005.
[ BibTex | Web page | PS | PDF ]
[FL05]: A. Finkel and J. Leroux. The Convex Hull of a Regular Set of Integer Vectors is Polyhedral and Effectively Computable. Information Processing Letters, 96(1):30--35, October 2005.
doi: 10.1016/j.ipl.2005.04.004.
[ BibTex | DOI | Web page | PS | PDF ]
[BFLS05]: S. Bardin, A. Finkel, J. Leroux, and Ph. Schnoebelen. Flat acceleration in symbolic model checking. In Proceedings of the 3rd International Symposium on Automated Technology for Verification and Analysis (ATVA'05), volume 3707 of Lecture Notes in Computer Science, pages 474--488, Taipei, Taiwan, October 2005. Springer.
doi: 10.1007/11562948_35.
[ BibTex | DOI | Web page | PS | PDF ]
[BH05]: M. Bidoit and R. Hennicker. Externalized and Internalized Notions of Behavioral Refinement. In Proceedings of the 2nd International Colloquium on Theoretical Aspects of Computing (ICTAC'05), volume 3722 of Lecture Notes in Computer Science, pages 334--350, Hanoi, Vietnam, October 2005. Springer.
doi: 10.1007/11560647_22.
[ BibTex | DOI | Web page | PDF ]
[AMRT05]: K. Altisen, N. Markey, P.-A. Reynier, and S. Tripakis. Implémentabilité des automates temporisés. In Actes du 5ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'05), pages 395--406, Autrans, France, October 2005. Hermès.
[ BibTex | Web page | PS | PDF ]
[BCKT05]: P. Bouyer, F. Chevalier, M. Krichen, and S. Tripakis. Observation partielle des systèmes temporisés. In Actes du 5ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'05), pages 381--393, Autrans, France, October 2005. Hermès.
[ BibTex | Web page | PS | PDF ]
[ABC⁺05]: K. Altisen, P. Bouyer, T. Cachat, F. Cassez, and G. Gardey. Introduction au contrôle des systèmes temps-réel. In Actes du 5ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'05), pages 367--380, Autrans, France, October 2005. Hermès.
[ BibTex | Web page | PS | PDF ]
[Dem05b]: S. Demri. A reduction from DLP to PDL. Journal of Logic and Computation, 15(5):767--785, October 2005.
doi: 10.1093/logcom/exi043.
[ BibTex | DOI | Web page | PDF ]
[DN05]: S. Demri and D. Nowak. Reasoning about transfinite sequences (extended abstract). In Proceedings of the 3rd International Symposium on Automated Technology for Verification and Analysis (ATVA'05), volume 3707 of Lecture Notes in Computer Science, pages 248--262, Taipei, Taiwan, October 2005. Springer.
doi: 10.1007/11562948_20.
[ BibTex | DOI | Web page | PS | PDF ]
[LLT05b]: P. Lafourcade, D. Lugiez, and R. Treinen. Intruder Deduction for the Equational Theory of Exclusive-or with Distributive Encryption. Research Report LSV-05-19, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2005. 39 pages.
[ BibTex | Web page | PS | PDF ]
[Bar05]: S. Bardin. Vers un model checking avec accélération plate de systèmes hétérogènes. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2005.
[ BibTex | Web page | PDF ]
[Zha05]: Y. Zhang. Cryptographic logical relations -- What is the contextual equivalence for cryptographic protocols and how to prove it? Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2005.
[ BibTex | Web page | PS | PDF ]
[BBG⁺05]: H. Bel mokadem, B. Bérard, V. Gourcuff, J.-M. Roussel, and O. De Smet. Verification of a timed multitask system with Uppaal. In Proceedings of the 10th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'05), pages 347--354, Catania, Italy, September 2005. IEEE Industrial Electronics Society.
[ BibTex | Web page | PS | PDF ]
[DKR05]: S. Delaune, S. Kremer, and M. D. Ryan. Receipt-Freeness: Formal Definition and Fault Attacks (Extended Abstract). In Proceedings of the Workshop Frontiers in Electronic Elections (FEE 2005), Milan, Italy, September 2005.
[ BibTex | Web page | PDF ]
[LNZ05]: S. Lasota, D. Nowak, and Y. Zhang. On completeness of logical relations for monadic types. In Proceedings of the 3rd APPSEM II Workshop (APPSEM'05), Frauenchiemsee, Germany, September 2005.
[ BibTex | Web page | PDF ]
[Pin05]: S. Pinot. Analyse de stabilité d'algorithme distribués probabilistes. Rapport de Master, Master de Logique Mathématique et Fondements de l'Informatique, Paris, France, September 2005.
[ BibTex | Web page | PS | PDF ]
[Szn05]: N. Sznajder. Synthèse de contrôleur pour les systèmes distribués synchrones. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2005.
[ BibTex | Web page | PDF ]
[Bou05e]: P. Bouyer. Optimal Timed Games. Invited talk, 5th International Workshop on Automated Verification of Critical Systems (AVoCS'05), Warwick, UK, September 2005.
[ BibTex ]
[Bou05c]: P. Bouyer. An Introduction to Timed Automata. In Actes de la 4ème École Temps-Réel (ETR'05), pages 111--123, Nancy, France, September 2005.
[ BibTex | Web page | PDF ]
[Bou05b]: P. Bouyer. Foundations of Timed Systems. In Proc. of the ARTIST2 Summer School on Component & Modelling, Testing & Verification, and Statical Analysis of Embedded Systems, Nässlingen, Sweden, September-October 2005.
[ BibTex | Web page | PDF ]
[Bou05a]: F. Bouchy. Bibliothèque de méthodes pour la classification. Rapport de Master, Master Recherche Informatique, Tours, France, September 2005.
[ BibTex ]
[GRV05]: J. Goubault-Larrecq, M. Roger, and K. N. Verma. Abstraction and Resolution Modulo AC: How to Verify Diffie-Hellman-like Protocols Automatically. Journal of Logic and Algebraic Programming, 64(2):219--251, August 2005.
doi: 10.1016/j.jlap.2004.09.004.
[ BibTex | DOI | Web page | PS ]
[BBBL05]: H. Bel mokadem, B. Bérard, P. Bouyer, and F. Laroussinie. A New Modality for Almost Everywhere Properties in Timed Automata. In Proceedings of the 16th International Conference on Concurrency Theory (CONCUR'05), volume 3653 of Lecture Notes in Computer Science, pages 110--124, San Francisco, California, USA, August 2005. Springer.
doi: 10.1007/11539452_12.
[ BibTex | DOI | Web page | PS | PDF ]
[BCL05]: P. Bouyer, F. Cassez, and F. Laroussinie. Modal Logics for Timed Control. In Proceedings of the 16th International Conference on Concurrency Theory (CONCUR'05), volume 3653 of Lecture Notes in Computer Science, pages 81--94, San Francisco, California, USA, August 2005. Springer.
doi: 10.1007/11539452_10.
[ BibTex | DOI | Web page | PS | PDF ]
[Dem05a]: S. Demri. On the complexity of information logics. Invited talk, Workshop on Logical and Algebraic Foundations of Rough Sets, Regina, Canada, August 2005.
[ BibTex ]
[DG05a]: S. Demri and R. Gascon. Verification of Qualitative Z-Constraints. In Proceedings of the 16th International Conference on Concurrency Theory (CONCUR'05), volume 3653 of Lecture Notes in Computer Science, pages 518--532, San Francisco, California, USA, August 2005. Springer.
doi: 10.1007/11539452_39.
[ BibTex | DOI | Web page | PDF ]
[Gou05a]: J. Goubault-Larrecq. Deciding H_1 by Resolution. Information Processing Letters, 95(3):401--408, August 2005.
doi: 10.1016/j.ipl.2005.04.007.
[ BibTex | DOI | Web page | PDF ]
[MKR05]: A. Mukhamedov, S. Kremer, and E. Ritter. Analysis of a Multi-Party Fair Exchange Protocol and Formal Proof of Correctness in the Strand Space Model. In Revised Papers from the 9th International Conference on Financial Cryptography and Data Security (FC'05), volume 3570 of Lecture Notes in Computer Science, pages 255--269, Roseau, The Commonwealth Of Dominica, August 2005. Springer.
doi: 10.1007/11507840_23.
[ BibTex | DOI | Web page | PDF ]
[GK05]: P. Gastin and D. Kuske. Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces. In Proceedings of the 16th International Conference on Concurrency Theory (CONCUR'05), volume 3653 of Lecture Notes in Computer Science, pages 533--547, San Francisco, California, USA, August 2005. Springer.
doi: 10.1007/11539452_40.
[ BibTex | DOI | Web page | PS | PDF ]
[BJ05b]: A. Bouhoula and F. Jacquemard. Automatic Verification of Sufficient Completeness for Specifications of Complex Data Structures. Research Report LSV-05-17, Laboratoire Spécification et Vérification, ENS Cachan, France, August 2005. 14 pages.
[ BibTex | Web page | PS | PDF ]
[PR05a]: S. Pinchinat and S. Riedweg. A Decidable Class of Problems for Control under Partial Observation. Information Processing Letters, 95(4):454--465, August 2005.
doi: 10.1016/j.ipl.2005.04.011.
[ BibTex | DOI | Web page | PS | PDF ]
[The05]: The Artist Education Group. Guidelines for a graduate curriculum on embedded software and systems. ACM Transactions in Embedded Computing Systems, 4(3):587--611, August 2005.
doi: 10.1145/1086519.1086526.
[ BibTex | DOI | Web page | PDF ]
[Bou05i]: P. Bouyer. Weighted Timed Automata: Model-Checking and Games. Invited talk, Workshop CORTOS'06, Bonn, Germany, August 2005.
[ BibTex ]
[Bou05d]: P. Bouyer. Optimal Reachability Timed Games. Invited talk, 7th International Workshop on Verification of Infinite State Systems (INFINITY'05), San Francisco, USA, August 2005.
[ BibTex ]
[Bou05f]: P. Bouyer. Partial Observation of Timed Systems. Invited talk, 2nd Workshop on Games in Design and Verification, Edinburgh, Scotland, July 2005.
[ BibTex ]
[BCK05]: M. Baudet, V. Cortier, and S. Kremer. Computationally Sound Implementations of Equational Theories against Passive Adversaries. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), volume 3580 of Lecture Notes in Computer Science, pages 652--663, Lisboa, Portugal, July 2005. Springer.
doi: 10.1007/11523468_53.
[ BibTex | DOI | Web page | PDF ]
[FM05]: L. Fribourg and S. Messika. Brief Announcement: Coupling for Markov Decision Processes --- Application to Self-Stabilization with Arbitrary Schedulers. In Proceedings of the Twenty-Fourth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'05), page 322, Las Vegas, Nevada, USA, July 2005. ACM Press.
doi: 10.1145/1073814.1073875.
[ BibTex | DOI | Web page | PS | PDF ]
[DG05b]: M. Droste and P. Gastin. Weighted Automata and Weighted Logics. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), volume 3580 of Lecture Notes in Computer Science, pages 513--525, Lisboa, Portugal, July 2005. Springer.
doi: 10.1007/11523468_42.
[ BibTex | DOI | Web page | PS | PDF ]
[BJ05a]: A. Bouhoula and F. Jacquemard. Automated Induction for Complex Data Structures. Research Report LSV-05-11, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2005. 24 pages.
[ BibTex | Web page | PS | PDF ]
[OG05]: J. Olivain and J. Goubault-Larrecq. The Orchids Intrusion Detection Tool. In Proceedings of the 17th International Conference on Computer Aided Verification (CAV'05), volume 3576 of Lecture Notes in Computer Science, pages 286--290, Edinburgh, Scotland, UK, July 2005. Springer.
doi: 10.1007/11513988_28.
[ BibTex | DOI | Web page | PDF ]
[DdN05]: S. Demri and H. de Nivelle. Deciding Regular Grammar Logics with Converse through First-Order Logic. Journal of Logic, Language and Information, 14(3):289--319, June 2005.
doi: 10.1007/s10849-005-5788-9.
[ BibTex | DOI | Web page | PDF ]
[DLN05]: S. Demri, R. Lazić, and D. Nowak. On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. In Proceedings of the 12th International Symposium on Temporal Representation and Reasoning (TIME'05), pages 113--121, Burlington, Vermont, USA, June 2005. IEEE Computer Society Press.
doi: 10.1109/TIME.2005.28.
[ BibTex | DOI | Web page | PS | PDF ]
[BHS⁺05]: S. Bardin, F. Herbreteau, M. Sighireanu, G. Sutre, and A. Vincent. Intégration des outils PERSÉE (Proposition d'architecture). Délivrable 3.1 --- Partie 1 du Projet PERSÉE de l'ACI Sécurité Informatique, June 2005. 35 pages.
[ BibTex | Web page | PDF ]
[PR05c]: S. Pinchinat and S. Riedweg. You Can Always Compute Maximally Permissive Controllers Under Partial Observation When They Exist. In Proceedings of the 24th American Control Conference (ACC'05), pages 2287--2292, Portland, Oregon, USA, June 2005. IEEECSP.
[ BibTex | Web page | PS | PDF ]
[DFH⁺05]: M. Duflot, L. Fribourg, Th. Hérault, R. Lassaigne, F. Magniette, S. Messika, S. Peyronnet, and C. Picaronny. Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC. In Proceedings of the 4th International Workshop on Automated Verification of Critical Systems (AVoCS'04), volume 128 of Electronic Notes in Theoretical Computer Science, pages 195--214, London, UK, May 2005. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2005.04.012.
[ BibTex | DOI | Web page | PDF ]
[DFV05]: Ch. Darlot, A. Finkel, and L. Van Begin. About Fast and TReX Accelerations. In Proceedings of the 4th International Workshop on Automated Verification of Critical Systems (AVoCS'04), volume 128 of Electronic Notes in Theoretical Computer Science, pages 87--103, London, UK, May 2005. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2005.04.006.
[ BibTex | DOI | Web page | PDF ]
[KR05a]: S. Kremer and M. D. Ryan. Analysing the Vulnerability of Protocols to Produce Known-pair and Chosen-text Attacks. In Proceedings of the 2nd International Workshop on Security Issues in Coordination Models, Languages and Systems (SecCo'04), volume 128 of Electronic Notes in Theoretical Computer Science, pages 84--107, London, UK, May 2005. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2004.11.043.
[ BibTex | DOI | Web page | PDF ]
[BC05a]: M. Baclet and R. Chevallier. Timed Verification of the SPSMALL Memory. In Proceedings of the 1st International Conference on Memory Technology and Design (ICMTD'05), pages 89--92, Giens, France, May 2005.
[ BibTex | Web page | PDF ]
[FGRV05b]: A. Finkel, G. Geeraerts, J.-F. Raskin, and L. Van Begin. On the Omega-Language Expressive Power of Extended Petri Nets. In Proceedings of the 11th International Workshop on Expressiveness in Concurrency (EXPRESS'04), volume 128 of Electronic Notes in Theoretical Computer Science, pages 87--101, London, UK, April 2005. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2004.11.030.
[ BibTex | DOI | Web page | PDF ]
[Gou05b]: J. Goubault-Larrecq. Extensions of Valuations. Mathematical Structures in Computer Science, 15(2):271--297, April 2005.
doi: 10.1017/S096012950400461X.
[ BibTex | DOI | Web page | PS ]
[BCD05]: P. Bouyer, F. Chevalier, and D. D'Souza. Fault Diagnosis Using Timed Automata. In Proceedings of the 8th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'05), volume 3441 of Lecture Notes in Computer Science, pages 219--233, Edinburgh, Scotland, UK, April 2005. Springer.
doi: 10.1007/b106850.
[ BibTex | DOI | Web page | PS | PDF ]
[CD05]: H. Comon-Lundh and S. Delaune. The finite variant property: How to get rid of some algebraic properties. In Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA'05), volume 3467 of Lecture Notes in Computer Science, pages 294--307, Nara, Japan, April 2005. Springer.
doi: 10.1007/b135673.
[ BibTex | DOI | Web page | PS | PDF ]
[B⁺05]: P. Bouyer et al. ACI Sécurité Informatique CORTOS << Control and Observation of Real-Time Open Systems >> --- Rapport à mi-parcours, April 2005. 6 pages.
[ BibTex | Web page | PDF ]
[KR05b]: S. Kremer and M. D. Ryan. Analysis of an Electronic Voting Protocol in the Applied Pi-Calculus. In Programming Languages and Systems --- Proceedings of the 14th European Symposium on Programming (ESOP'05), volume 3444 of Lecture Notes in Computer Science, pages 186--200, Edinburgh, Scotland, UK, April 2005. Springer.
doi: 10.1007/b107380.
[ BibTex | DOI | Web page | PS | PDF ]
[LLT05a]: P. Lafourcade, D. Lugiez, and R. Treinen. Intruder Deduction for AC-like Equational Theories with Homomorphisms. In Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA'05), volume 3467 of Lecture Notes in Computer Science, pages 308--322, Nara, Japan, April 2005. Springer.
doi: 10.1007/b135673.
[ BibTex | DOI | Web page | PS | PDF ]
[LS05a]: F. Laroussinie and J. Sproston. Model Checking Durational Probabilistic Systems. In Proceedings of the 8th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'05), volume 3441 of Lecture Notes in Computer Science, pages 140--154, Edinburgh, Scotland, UK, April 2005. Springer.
doi: 10.1007/b106850.
[ BibTex | DOI | Web page | PS | PDF ]
[Bou05h]: P. Bouyer. Timed Automata and Extensions: Decidability Limits. Invited talk, 5èmes Journées Systèmes Infinis (JSI'05), Cachan, France, March 2005.
[ BibTex ]
[Bou05g]: P. Bouyer. Synthesis of Timed Systems. Invited lecture, Spring School on Infinite Games and Their Applications, Bonn, Germany, March 2005.
[ BibTex ]
[BDKV05]: L. Bozga, S. Delaune, F. Klay, and L. Vigneron. Retour d'expérience sur la validation du porte-monnaie électronique. Technical Report 5, projet RNTL PROUVÉ, March 2005. 29 pages.
[ BibTex | Web page | PS ]
[BCFL05]: P. Bouyer, F. Cassez, E. Fleury, and K. G. Larsen. Synthesis of Optimal Strategies Using HyTech. In Proceedings of the Workshop on Games in Design and Verification (GDV'04), volume 119 of Electronic Notes in Theoretical Computer Science, pages 11--31, Boston, Massachusetts, USA, February 2005. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2004.07.006.
[ BibTex | DOI | Web page | PS | PDF ]
[CC05]: H. Comon and V. Cortier. Tree Automata with One Memory, Set Constraints and Cryptographic Protocols. Theoretical Computer Science, 331(1):143--214, February 2005.
doi: 10.1016/j.tcs.2004.09.036.
[ BibTex | DOI | Web page | PS ]
[Cou05]: J.-M. Couvreur. A BDD-like Implementation of an Automata Package. In Revised Selected Papers of the 9th International Conference on Implementation and Application of Automata (CIAA'04), volume 3317 of Lecture Notes in Computer Science, pages 310--311, Kingston, Ontario, Canada, January 2005. Springer.
doi: 10.1007/b105090.
[ BibTex | DOI ]
[BS05]: B. Bouyssonouse and J. Sifakis, editors. Embedded Systems Design: The ARTIST Roadmap for Research and Development, volume 3436 of Lecture Notes in Computer Science. Springer, 2005.
doi: 10.1007/b106761.
[ BibTex | DOI | Web page ]
[GP05]: J. Goubault-Larrecq and F. Parrennes. Cryptographic Protocol Analysis on Real C Code. In Proceedings of the 6th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'05), volume 3385 of Lecture Notes in Computer Science, pages 363--379, Paris, France, January 2005. Springer.
doi: 10.1007/b105073.
[ BibTex | DOI | Web page | PDF ]
[FGRV05a]: A. Finkel, G. Geeraerts, J.-F. Raskin, and L. Van Begin. A counter-example the the minimal coverability tree algorithm. Technical Report 535, Université Libre de Bruxelles, Belgium, 2005.
[ BibTex | Web page | PDF ]
[BC05b]: P. Bouyer and F. Chevalier. On Conciseness of Extensions of Timed Automata. Journal of Automata, Languages and Combinatorics, 10(4):393--405, 2005.
[ BibTex | Web page | PS | PDF ]
[Dem05c]: S. Demri. Temporal logics, 2005. Course notes, Master Parisien de Recherche en Informatique, Paris, France.
[ BibTex | Web page | PDF ]
[Bou04c]: P. Bouyer. Timed Automata --- From Theory to Implementation. Invited tutorial, 6th Winter School on Modelling and Verifying Parallel Processes (MOVEP'04), Brussels, Belgium, December 2004. 27 pages.
[ BibTex ]
[Gas04a]: P. Gastin. Basics of model checking. Invited tutorial, 6th Winter School on Modelling and Verifying Parallel Processes (MOVEP'04), Brussels, Belgium, December 2004.
[ BibTex ]
[BCFL04]: P. Bouyer, F. Cassez, E. Fleury, and K. G. Larsen. Optimal Strategies in Priced Timed Game Automata. In Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'04), volume 3328 of Lecture Notes in Computer Science, pages 148--160, Chennai, India, December 2004. Springer.
[ BibTex | Web page | PS | PDF ]
[Mes04]: S. Messika. Méthodes probabilistes pour la vérification des systèmes distribués. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2004.
[ BibTex | Web page | PDF ]
[BCC⁺04]: V. Bernat, H. Comon-Lundh, V. Cortier, S. Delaune, F. Jacquemard, P. Lafourcade, Y. Lakhnech, and L. Mazaré. Sufficient conditions on properties for an automated verification: theoretical report on the verification of protocols for an extended model of the intruder. Technical Report 4, projet RNTL PROUVÉ, December 2004. 33 pages.
[ BibTex | Web page | PS ]
[GLZ04]: P. Gastin, B. Lerman, and M. Zeitoun. Distributed games with causal memory are decidable for series-parallel systems. In Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'04), volume 3328 of Lecture Notes in Computer Science, pages 275--286, Chennai, India, December 2004. Springer.
[ BibTex | Web page | PS | PDF ]
[DG04]: V. Diekert and P. Gastin. Local temporal logic is expressively complete for cograph dependence alphabets. Information and Computation, 195(1-2):30--52, November 2004.
doi: 10.1016/j.ic.2004.08.001.
[ BibTex | DOI | Web page | PS | PDF ]
[FMP04a]: A. Finkel, P. McKenzie, and C. Picaronny. A Well-Structured Framework for Analysing Petri Net Extensions. Information and Computation, 195(1-2):1--29, November 2004.
doi: 10.1016/j.ic.2004.01.005.
[ BibTex | DOI | Web page | PS ]
[DK04]: S. Delaune and F. Klay. Vérification automatique appliquée à un protocole de commerce électronique. In Actes des 6èmes Journées Doctorales Informatique et Réseau (JDIR'04), pages 260--269, Lannion, France, November 2004.
[ BibTex | Web page | PDF ]
[BF04]: S. Bardin and A. Finkel. Composition of accelerations to verify infinite heterogeneous systems. In Proceedings of the 2nd International Symposium on Automated Technology for Verification and Analysis (ATVA'04), volume 3299 of Lecture Notes in Computer Science, pages 248--262, Taipei, Taiwan, October-November 2004. Springer.
[ BibTex | Web page | PS ]
[FMP04b]: L. Fribourg, S. Messika, and C. Picaronny. Coupling and Self-Stabilization. In Proceedings of the 18th International Symposium on Distributed Computing (DISC'04), volume 3274 of Lecture Notes in Computer Science, pages 201--215, Amsterdam, The Netherlands, October 2004. Springer.
[ BibTex | Web page | PDF ]
[Ler04b]: J. Leroux. Disjunctive Invariants for Numerical Systems. In Proceedings of the 2nd International Symposium on Automated Technology for Verification and Analysis (ATVA'04), volume 3299 of Lecture Notes in Computer Science, pages 93--107, Taipei, Taiwan, October-November 2004. Springer.
[ BibTex | Web page | PS ]
[DJ04a]: S. Delaune and F. Jacquemard. A Decision Procedure for the Verification of Security Protocols with Explicit Destructors. In Proceedings of the 11th ACM Conference on Computer and Communications Security (CCS'04), pages 278--287, Washington, D.C., USA, October 2004. ACM Press.
[ BibTex | Web page | PS ]
[Bou04d]: P. Bouyer. Timed Automata --- From Theory to Implementation. Invited tutorial, 1st International Conference on the Quantitative Evaluation of System (QEST'04), Twente, The Netherlands, September 2004.
[ BibTex ]
[Che04]: F. Chevalier. Détection d'erreurs dans les systèmes temporisés. Rapport de DEA, DEA Algorithmique, Paris, France, September 2004. 59 pages.
[ BibTex | Web page | PS ]
[DDMR04]: M. De Wulf, L. Doyen, N. Markey, and J.-F. Raskin. Robustness and Implementability of Timed Automata. In Proceedings of the Joint Conferences Formal Modelling and Analysis of Timed Systems (FORMATS'04) and Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'04), volume 3253 of Lecture Notes in Computer Science, pages 118--133, Grenoble, France, September 2004. Springer.
[ BibTex | Web page | PS | PDF ]
[GLNZ04]: J. Goubault-Larrecq, S. Lasota, D. Nowak, and Y. Zhang. Complete Lax Logical Relations for Cryptographic Lambda-Calculi. In Proceedings the 18th International Workshop on Computer Science Logic (CSL'04), volume 3210 of Lecture Notes in Computer Science, pages 400--414, Karpacz, Poland, September 2004. Springer.
[ BibTex | Web page | PS ]
[MS04b]: N. Markey and Ph. Schnoebelen. Symbolic Model Checking for Simply-Timed Systems. In Proceedings of the Joint Conferences Formal Modelling and Analysis of Timed Systems (FORMATS'04) and Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'04), volume 3253 of Lecture Notes in Computer Science, pages 102--117, Grenoble, France, September 2004. Springer.
[ BibTex | Web page | PS | PDF ]
[MS04c]: N. Markey and Ph. Schnoebelen. TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems. In Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST'04), pages 330--331, Enschede, The Netherlands, September 2004. IEEE Computer Society Press.
doi: 10.1109/QEST.2004.10028.
[ BibTex | DOI | Web page | PS | PDF ]
[Rat04]: B. Ratti. Automates d'arbre d'ordre deux. Rapport de DEA, DEA Programmation, Paris, France, September 2004. 45 pages.
[ BibTex | Web page | PS ]
[Rey04]: P.-A. Reynier. Analyse en avant des automates temporisés. Rapport de DEA, DEA Algorithmique, Paris, France, September 2004. 68 pages.
[ BibTex | Web page | PS ]
[BHKB04]: M. Bidoit, R. Hennicker, A. Knapp, and H. Baumeister. Glass-Box and Black-Box Views on Object-Oriented Specifications. In Proceedings of the 2nd IEEE International Conference on Software Engineering and Formal Methods (SEFM'04), pages 208--217, Beijing, China, September 2004. IEEE Computer Society Press.
doi: 10.1109/SEFM.2004.10014.
[ BibTex | DOI | Web page | PDF ]
[Oli04b]: J. Olivain. Net-entropy v1.0: An entropy checker for ciphered network connections, September 2004.
[ BibTex | Web page ]
[BDFP04]: P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Updatable Timed Automata. Theoretical Computer Science, 321(2-3):291--345, August 2004.
doi: 10.1016/j.tcs.2004.04.003.
[ BibTex | DOI | Web page | PS | PDF ]
[KS04]: A. Kučera and Ph. Schnoebelen. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. In Proceedings of the 15th International Conference on Concurrency Theory (CONCUR'04), volume 3170 of Lecture Notes in Computer Science, pages 372--386, London, UK, August 2004. Springer.
doi: 10.1007/978-3-540-28644-8_24.
[ BibTex | DOI | Web page | PDF ]
[LMS04]: F. Laroussinie, N. Markey, and Ph. Schnoebelen. Model Checking Timed Automata with One or Two Clocks. In Proceedings of the 15th International Conference on Concurrency Theory (CONCUR'04), volume 3170 of Lecture Notes in Computer Science, pages 387--401, London, UK, August 2004. Springer.
doi: 10.1007/978-3-540-28644-8_25.
[ BibTex | DOI | Web page | PS | PDF ]
[LS04]: J. Leroux and G. Sutre. On Flatness for 2-dimensional Vector Addition Systems with States. In Proceedings of the 15th International Conference on Concurrency Theory (CONCUR'04), volume 3170 of Lecture Notes in Computer Science, pages 402--416, London, UK, August 2004. Springer.
doi: 10.1007/978-3-540-28644-8_26.
[ BibTex | DOI | Web page | PS ]
[Ler04a]: J. Leroux. The Affine Hull of a Binary Automaton is Computable in Polynomial Time. In Proceedings of the 5th International Workshop on Verification of Infinite State Systems (INFINITY'03), volume 98 of Electronic Notes in Theoretical Computer Science, pages 89--104, Marseilles, France, August 2004. Elsevier Science Publishers.
[ BibTex | Web page | PS ]
[MR04]: N. Markey and J.-F. Raskin. Model Checking Restricted Sets of Timed Paths. In Proceedings of the 15th International Conference on Concurrency Theory (CONCUR'04), volume 3170 of Lecture Notes in Computer Science, pages 432--447, London, UK, August 2004. Springer.
doi: 10.1007/978-3-540-28644-8_28.
[ BibTex | DOI | Web page | PS | PDF ]
[Sch04a]: Ph. Schnoebelen, editor. Proceedings of the 5th International Workshop on Verification of Infinite State Systems (INFINITY'03), volume 98 of Electronic Notes in Theoretical Computer Science, Marseilles, France, August 2004. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2003.10.001.
[ BibTex | DOI ]
[Tre04a]: R. Treinen. The PROUVÉ Specification Language. Technical Report 3, Projet RNTL PROUVÉ, August 2004. 10 pages.
[ BibTex | Web page | PS ]
[BBP04]: B. Bérard, P. Bouyer, and A. Petit. Analysing the PGM Protocol with Uppaal. International Journal of Production Research, 42(14):2773--2791, July 2004.
[ BibTex | Web page | PS | PDF ]
[FL04a]: A. Finkel and J. Leroux. Image Computation in Infinite State Model Checking. In Proceedings of the 16th International Conference on Computer Aided Verification (CAV'04), volume 3114 of Lecture Notes in Computer Science, pages 361--371, Boston, Massachusetts, USA, July 2004. Springer.
[ BibTex | Web page | PS ]
[BH04]: M. Bidoit and R. Hennicker. Glass Box and Black Box Views of State-Based System Specifications. In Proceedings of the 10th International Conference on Algebraic Methodology and Software Technology (AMAST'04), volume 3116 of Lecture Notes in Computer Science, page 19, Stirling, UK, July 2004. Springer. Invited talk.
[ BibTex ]
[BJ04]: A. Bouhoula and F. Jacquemard. Constrained Tree Grammars to Pilot Automated Proof by Induction. In Proceedings of the 5th Workshop on Strategies in Automated Deduction (STRATEGIES'04), pages 64--78, Cork, Ireland, July 2004.
[ BibTex | Web page | PDF ]
[Oli04a]: J. Olivain. EVTGEN v1.0: A Programmable Generic Generator of Event Sequences, July 2004. Written in C (about 5000 lines).
[ BibTex | Web page ]
[Cou04]: J.-M. Couvreur. Contribution à l'algorithmique de la vérification. Mémoire d'habilitation, Université de Bordeaux I, Bordeaux, France, July 2004.
[ BibTex | Web page | PDF ]
[Rob04]: A. Robin. Aux frontières de la décidabilité... Rapport de DEA, DEA Algorithmique, Paris, France, July 2004. 33 pages.
[ BibTex | Web page | PS ]
[Hug04]: Th. Hugel. SSP: Stochastic Shortest Paths, July 2004. Written in Caml (about 500 lines).
[ BibTex ]
[DFH⁺04]: M. Duflot, L. Fribourg, Th. Hérault, R. Lassaigne, F. Magniette, S. Messika, S. Peyronnet, and C. Picaronny. Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC. Contract Report (Lot 4.2 fourniture 2), projet RNTL Averroes, June 2004. 22 pages.
[ BibTex | Web page | PS ]
[Bau04]: M. Baudet. Random Polynomial-Time Attacks and Dolev-Yao Models. In Proceedings of the Workshop on Security of Systems: Formalism and Tools (SASYFT'04), Orléans, France, June 2004.
[ BibTex | Web page | PS | PDF ]
[BBD04]: M. Ben Gaid, B. Bérard, and O. De Smet. Modélisation et vérification d'un évaporateur en Uppaal. In Actes du 6ème Atelier sur les Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL'04), pages 223--238, Besançon, France, June 2004.
[ BibTex | Web page | PS | PDF ]
[BDF04a]: S. Bardin, Ch. Darlot, and A. Finkel. FAST: un model-checker pour systèmes à compteurs. In Actes du 6ème Atelier sur les Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL'04), pages 377--380, Besançon, France, June 2004.
[ BibTex | Web page | PS ]
[BP04a]: S. Bardin and L. Petrucci. COAST: des réseaux de Petri à la planification assistée. In Actes du 6ème Atelier sur les Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL'04), pages 285--298, Besançon, France, June 2004.
[ BibTex | Web page | PS ]
[BP04b]: S. Bardin and L. Petrucci. From PNML to Counter Systems for Accelerating Petri Nets with FAST. In Proceedings of the Workshop on Interchange Format for Petri Nets, pages 26--40, Bologna, Italy, June 2004.
[ BibTex | Web page | PS ]
[BDF⁺04b]: S. Bardin, Ch. Darlot, A. Finkel, J. Leroux, and L. Van Begin. FAST v1.5: Fast Acceleration of Symbolic Transition Systems. Available at http://www.lsv.ens-cachan.fr/fast/, June 2004.
[ BibTex | Web page ]
[FMP04c]: L. Fribourg, S. Messika, and C. Picaronny. Mixing Time of the Asymmetric Simple Exclusion Problem on a Ring with Two Particles. Research Report LSV-04-12, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2004. 15 pages.
[ BibTex | Web page | PS ]
[Mar04b]: N. Markey. TSMV: model-checking symbolique de systèmes simplement temporisés. In Actes du 6ème Atelier sur les Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL'04), pages 349--352, Besançon, France, June 2004.
[ BibTex | Web page | PS | PDF ]
[BDKT04]: L. Bozga, S. Delaune, F. Klay, and R. Treinen. Spécification du protocole de porte-monnaie électronique. Technical Report 1, projet RNTL PROUVÉ, June 2004. 12 pages.
[ BibTex | Web page | PS ]
[CDL04]: V. Cortier, S. Delaune, and P. Lafourcade. A Survey of Algebraic Properties Used in Cryptographic Protocols. Technical Report 2, projet RNTL PROUVÉ, June 2004. 19 pages.
[ BibTex | Web page | PS ]
[BCG⁺04]: F. Bréant, J.-M. Couvreur, F. Gilliers, F. Kordon, I. Mounier, E. Paviot-Adet, D. Poitrenaud, D. M. Regep, and G. Sutre. Modeling and Verifying Behavioral Aspects. In Formal Methods for Embedded Distributed Systems: How to Master the Complexity, chapter 6, pages 171--211. Kluwer Academic Publishers, June 2004.
[ BibTex ]
[DJ04b]: S. Delaune and F. Jacquemard. A Theory of Dictionary Attacks and its Complexity. In Proceedings of the 17th IEEE Computer Security Foundations Workshop (CSFW'04), pages 2--15, Asilomar, Pacific Grove, California, USA, June 2004. IEEE Computer Society Press.
[ BibTex | Web page | PS ]
[MJ04]: O. Michel and F. Jacquemard. An Analysis of the Needham-Schroeder Public-Key Protocol with MGS. In Proceedings of the 5th Workshop on Membrane Computing (WMC'04), pages 295--315, Milano, Italy, June 2004.
[ BibTex | Web page | PDF ]
[BPP04]: M. Baclet, R. Pacalet, and A. Petit. Register Transfer Level Simulation. Research Report LSV-04-10, Laboratoire Spécification et Vérification, ENS Cachan, France, May 2004. 15 pages.
[ BibTex | Web page | PS ]
[BC04a]: M. Baclet and R. Chevallier. Using UPPAAL to Verify an On-Chip Memory. Research Report LSV-04-11, Laboratoire Spécification et Vérification, ENS Cachan, France, May 2004. 12 pages.
[ BibTex | Web page | PS ]
[BC04b]: M. Baclet and R. Chevallier. Using UPPAAL to verify an on-chip memory. Contract Report (Work Package 3.2 Fourniture 1), projet T126 MEDEA+ Blueberries, May 2004. 12 pages.
[ BibTex | Web page | PS ]
[Bou04b]: P. Bouyer. Forward Analysis of Updatable Timed Automata. Formal Methods in System Design, 24(3):281--320, May 2004.
doi: 10.1023/B:FORM.0000026093.21513.31.
[ BibTex | DOI | Web page | PS | PDF ]
[Now04]: D. Nowak. Logical Relations for Monadic Types. Invited talk, International Workshop on Formal Methods and Security (IWFMS'04), Nanjing, China, May 2004.
[ BibTex ]
[Mar04a]: N. Markey. Past is for Free: On the Complexity of Verifying Linear Temporal Properties with Past. Acta Informatica, 40(6-7):431--458, May 2004.
doi: 10.1007/s00236-003-0136-5.
[ BibTex | DOI | Web page | PS | PDF ]
[Bou04e]: P. Bouyer. Timed Models for Concurrent Systems. Invited lecture, 32nd Spring School on Theoretical Computer Science (Concurrency Theory), Luminy, France, April 2004.
[ BibTex ]
[Gas04b]: P. Gastin. Specifications for distributed systems. Invited lecture, 32nd Spring School on Theoretical Computer Science (Concurrency Theory), Luminy, France, April 2004.
[ BibTex ]
[BFN04]: S. Bardin, A. Finkel, and D. Nowak. Toward Symbolic Verification of Programs Handling Pointers. In Proceedings of the 3rd International Workshop on Automated Verification of Infinite-State Systems (AVIS'04), Barcelona, Spain, April 2004.
[ BibTex | Web page | PS ]
[BS04]: N. Bertrand and Ph. Schnoebelen. Verifying Nondeterministic Channel Systems With Probabilistic Message Losses. In Proceedings of the 3rd International Workshop on Automated Verification of Infinite-State Systems (AVIS'04), Barcelona, Spain, April 2004.
[ BibTex | Web page | PDF ]
[FL04b]: A. Finkel and J. Leroux. Polynomial Time Image Computation With Interval-Definable Counters Systems. In Proceedings of the 11th International SPIN Workshop on Model Checking Software (SPIN'04), volume 2989 of Lecture Notes in Computer Science, pages 182--197, Barcelona, Spain, April 2004. Springer.
[ BibTex | Web page | PS ]
[BBL04]: P. Bouyer, E. Brinksma, and K. G. Larsen. Staying Alive As Cheaply As Possible. In Proceedings of the 7th International Conference on Hybrid Systems: Computation and Control (HSCC'04), volume 2993 of Lecture Notes in Computer Science, pages 203--218, Philadelphia, Pennsylvania, USA, March 2004. Springer.
[ BibTex | Web page | PS | PDF ]
[BBLP04]: G. Behrmann, P. Bouyer, K. G. Larsen, and R. Pelánek. Lower and Upper Bounds in Zone Based Abstractions of Timed Automata. In Proceedings of the 10th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'04), volume 2988 of Lecture Notes in Computer Science, pages 312--326, Barcelona, Spain, March 2004. Springer.
[ BibTex | Web page | PS | PDF ]
[BFL04]: S. Bardin, A. Finkel, and J. Leroux. FASTer Acceleration of Counter Automata in Practice. In Proceedings of the 10th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'04), volume 2988 of Lecture Notes in Computer Science, pages 576--590, Barcelona, Spain, March 2004. Springer.
[ BibTex | Web page | PS ]
[CC04]: H. Comon-Lundh and V. Cortier. Security Properties: Two Agents are Sufficient. Science of Computer Programming, 50(1-3):51--71, March 2004.
[ BibTex | Web page | PS ]
[DCMM04]: J. M. Davoren, V. Coulthard, N. Markey, and Th. Moor. Non-deterministic Temporal Logics for General Flow Systems. In Proceedings of the 7th International Conference on Hybrid Systems: Computation and Control (HSCC'04), volume 2993 of Lecture Notes in Computer Science, pages 280--295, Philadelphia, Pennsylvania, USA, March 2004. Springer.
[ BibTex | Web page | PS | PDF ]
[Dem04b]: S. Demri. LTL over Integer Periodicity Constraints. In Proceedings of the 7th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'04), volume 2987 of Lecture Notes in Computer Science, pages 121--135, Barcelona, Spain, March 2004. Springer.
[ BibTex | Web page | PS | PDF ]
[Com04]: H. Comon-Lundh. Intruder Theories (Ongoing Work). In Proceedings of the 7th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'04), volume 2987 of Lecture Notes in Computer Science, pages 1--4, Barcelona, Spain, March 2004. Springer. Invited talk.
[ BibTex ]
[Bou04a]: P. Bouyer. Automates temporisés, de la théorie à l'implémentation. Invited talk, Journées Formalisation des Activit?s Concurrentes (FAC'04), Toulouse, France, March 2004.
[ BibTex ]
[DFP04]: M. Duflot, L. Fribourg, and C. Picaronny. Randomized Dining Philosophers Without Fairness Assumption. Distributed Computing, 17(1):65--76, February 2004.
doi: 10.1007/s00446-003-0102-z.
[ BibTex | DOI | Web page | PS ]
[BM04]: M. Bidoit and P. D. Mosses. CASL User Manual --- Introduction to Using the Common Algebraic Specification Language, volume 2900 of Lecture Notes in Computer Science. Springer, 2004.
doi: 10.1007/b11968.
[ BibTex | DOI | Web page ]
[Sch04b]: Ph. Schnoebelen. The Verification of Probabilistic Lossy Channel Systems. In Validation of Stochastic Systems: A Guide to Current Research, volume 2925 of Lecture Notes in Computer Science, pages 445--465. Springer, 2004.
[ BibTex | Web page | PS | PDF ]
[BST04]: M. Bidoit, D. Sannella, and A. Tarlecki. Toward Component-Oriented Formal Software Development: An Algebraic Approach. In Revised Papers of the 9th International Workshop on Radical Innovations of Software and Systems Engineering in the Future (RISSEF'02), volume 2941 of Lecture Notes in Computer Science, pages 75--90, Venice, Italy, 2004. Springer.
[ BibTex | Web page | PS | PDF ]
[MS04a]: N. Markey and Ph. Schnoebelen. A PTIME-Complete Matching Problem for SLP-Compressed Words. Information Processing Letters, 90(1):3--6, January 2004.
doi: 10.1016/j.ipl.2004.01.002.
[ BibTex | DOI | Web page | PS | PDF ]
[Tre04b]: R. Treinen. RTALOOP: The RTA List of Open Problems. Web site at http://www.lsv.ens-cachan.fr/rtaloop/, started 1997, 2004. Size as of July 2004: 100 problems, 90 pages, 432 references.
[ BibTex | Web page ]
[Dem04a]: S. Demri. Complexité algorithmique de variantes de LTL pour la vérification, 2004. Course notes, DEA Algorithmique, Paris, France.
[ BibTex | Web page | PDF ]
[Cor03a]: V. Cortier. A Guide for SECURIFY. Technical Report 13, projet RNTL EVA, December 2003. 9 pages.
[ BibTex | Web page | PDF ]
[Ler03]: J. Leroux. Algorithmique de la vérification des systèmes à compteurs. Approximation et accélération. Implémentation de l'outil FAST. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2003.
[ BibTex | Web page | PS ]
[BL03]: B. Bérard and F. Laroussinie. Vérification compositionnelle des p-automates. Contract Report (Lot 4.1 fourniture 1), Projet RNTL Averroes, November 2003. 16 pages.
[ BibTex ]
[BFN03b]: S. Bardin, A. Finkel, and D. Nowak. Rapport final. Contract Report P11L03/F01304/0 + 50.0241, collaboration entre EDF et le LSV, November 2003. 50 pages.
[ BibTex ]
[CJ03]: H. Comon and F. Jacquemard. Ground Reducibility is EXPTIME-complete. Information and Computation, 187(1):123--153, November 2003.
[ BibTex | Web page | PS | PDF ]
[GB03a]: A. Galland and M. Baudet. Controlling and Optimizing the Usage of One Resource. In Proceedings of the 1st Asian Symposium on Programming Languages and Systems (APLAS'03), volume 2895 of Lecture Notes in Computer Science, pages 195--211, Beijing, China, November 2003. Springer.
[ BibTex | Web page | PS | PDF ]
[KNT03]: M. Kerbœuf, D. Nowak, and J.-P. Talpin. Formal Proof of a Polychronous Protocol for Loosely Time-Triggered Architectures. In Proceedings of the 5th International Conference on Formal Engineering Methods (ICFEM'03), volume 2885 of Lecture Notes in Computer Science, pages 359--374, Singapore, November 2003. Springer.
[ BibTex | Web page | PS ]
[Del03c]: S. Delaune. Vérification de protocoles de sécurité dans un modèle de l'intrus étendu. Research Report LSV-03-15, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2003.
[ BibTex | Web page | PS ]
[BBP03]: B. Bérard, P. Bouyer, and A. Petit. Une analyse du protocole PGM avec UPPAAL. In Actes du 4ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'03), pages 415--430, Metz, France, October 2003. Hermès.
[ BibTex | Web page | PS ]
[BP03]: M. Baclet and R. Pacalet. Vérifications du protocole VCI. In Actes du 4ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'03), pages 431--445, Metz, France, October 2003. Hermès.
[ BibTex | Web page | PS ]
[GB03b]: A. Galland and M. Baudet. Économiser l'or du banquier. In Actes de la 3ème Conférence Française sur les Systèmes d'Exploitation (CFSE'03), pages 638--649, La Colle sur Loup, France, October 2003. INRIA.
[ BibTex | Web page | PS | PDF ]
[DDG⁺03]: S. Demri, M. Ducassé, J. Goubault-Larrecq, L. Mé, J. Olivain, C. Picaronny, J.-Ph. Pouzol, É. Totel, and B. Vivinis. Algorithmes de détection et langages de signatures. Contract Report (Sous-projet 3, livrable 3), projet RNTL DICO, October 2003. 72 pages.
[ BibTex ]
[Rog03b]: M. Roger. Raffinements de la résolution et vérification de protocoles cryptographiques. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2003.
[ BibTex | Web page | PS ]
[MS03b]: N. Markey and Ph. Schnoebelen. TSMV v1.0. Available at http://www.lsv.ens-cachan.fr/~markey/TSMV/, October 2003. See description in [MS04b]. Written in C (about 4000 lines on top of NuSMV v2.1.2).
[ BibTex | Web page ]
[Ber03]: V. Bernat. Towards a Logic for Verification of Security Protocols. In Proceedings of the Workshop on Security Protocols Verification (SPV'03), pages 31--35, Marseilles, France, September 2003.
[ BibTex | Web page | PS ]
[Del03a]: S. Delaune. Intruder Deduction Problem in Presence of Guessing Attacks. In Proceedings of the Workshop on Security Protocols Verification (SPV'03), pages 26--30, Marseilles, France, September 2003.
[ BibTex | Web page | PDF ]
[Del03b]: S. Delaune. Vérification de protocoles de sécurité dans un modèle de l'intrus étendu. Rapport de DEA, DEA Programmation, Paris, France, September 2003.
[ BibTex | Web page | PS ]
[Dem03a]: S. Demri. (Modal) Logics for Semistructured Data (Bis). Invited talk, 3rd Workshop on Methods for Modalities (M4M'03), Nancy, France, September 2003.
[ BibTex ]
[DdN03]: S. Demri and H. de Nivelle. Relational Translations into GF2. In Proceedings of the 3rd Workshop on Methods for Modalities (M4M-3), pages 93--108, Nancy, France, September 2003.
[ BibTex ]
[Jac03c]: F. Jacquemard. Reachability and Confluence are Indecidable for Flat Term Rewriting Systems. Information Processing Letters, 87(5):265--270, September 2003.
[ BibTex | Web page | PS ]
[Bac03]: M. Baclet. Logical Characterization of Aperiodic Data Languages. Research Report LSV-03-12, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2003. 16 pages.
[ BibTex | Web page | PS ]
[Boi03]: A. Boisseau. Abstractions pour la vérification de propriétés de sécurité de protocoles cryptographiques. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2003.
[ BibTex | Web page | PS | PDF ]
[Duf03]: M. Duflot. Algorithmes distribués sur des anneaux paramétrés --- Preuves de convergence probabiliste et déterministe. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2003.
[ BibTex | Web page | PS ]
[Ver03a]: K. N. Verma. Automates d'arbres bidirectionnels modulo théories équationnelles. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2003.
[ BibTex | Web page | PS ]
[CSS03]: J.-M. Couvreur, N. Saheb, and G. Sutre. An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems. In Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'03), volume 2850 of Lecture Notes in Artificial Intelligence, pages 361--375, Almaty, Kazakhstan, September 2003. Springer.
[ BibTex | Web page | PS ]
[Lar03]: F. Laroussinie. Automates temporisés et hybrides, modélisation et vérification. Invited lecture, école d'été ETR 2003 (École Temps Réel), Toulouse, France, September 2003.
[ BibTex ]
[Ben03]: M. Ben Gaid. Modélisation et vérification des aspects temporisés des langages pour automates programmables industriels. Rapport de DEA, DEA Informatique Distribuée, Orsay, France, September 2003. 68 pages.
[ BibTex | Web page | PDF ]
[Ver03b]: K. N. Verma. On Closure under Complementation of Equational Tree Automata for Theories Extending AC. In Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'03), volume 2850 of Lecture Notes in Artificial Intelligence, pages 183--195, Almaty, Kazakhstan, September 2003. Springer.
[ BibTex | Web page | PS ]
[BFN03a]: S. Bardin, A. Finkel, and D. Nowak. Note de synthèse à 10 mois. Contract Report P11L03/F01304/0 + 50.0241, collaboration entre EDF et le LSV, August 2003. 21 pages.
[ BibTex ]
[BFL⁺03b]: S. Bardin, A. Finkel, J. Leroux, L. Petrucci, and L. Worobel. FAST User's Manual, August 2003. 33 pages.
[ BibTex | Web page | PS ]
[Wor03]: L. Worobel. INTERFAST v1.0: A GUI for FAST, August 2003. See [BFL⁺03b] for description. Written in Java (6300 lines) and C (1600 lines), using Java Cup.
[ BibTex | Web page ]
[MS03a]: N. Markey and Ph. Schnoebelen. Model Checking a Path (Preliminary Report). In Proceedings of the 14th International Conference on Concurrency Theory (CONCUR'03), volume 2761 of Lecture Notes in Computer Science, pages 251--265, Marseilles, France, August 2003. Springer.
doi: 10.1007/b11938.
[ BibTex | DOI | Web page | PS | PDF ]
[ZN03]: Y. Zhang and D. Nowak. Logical Relations for Dynamic Name Creation. In Proceedings of the 17th International Workshop on Computer Science Logic (CSL'03), volume 2803 of Lecture Notes in Computer Science, pages 575--588, Vienna, Austria, August 2003. Springer.
[ BibTex | Web page | PS ]
[BDMP03]: P. Bouyer, D. D'Souza, P. Madhusudan, and A. Petit. Timed Control with Partial Observability. In Proceedings of the 15th International Conference on Computer Aided Verification (CAV'03), volume 2725 of Lecture Notes in Computer Science, pages 180--192, Boulder, Colorado, USA, July 2003. Springer.
[ BibTex | Web page | PS | PDF ]
[BFNS03]: S. Bardin, A. Finkel, D. Nowak, and Ph. Schnoebelen. Note de synthèse à 6 mois. Contract Report P11L03/F01304/0 + 50.0241, collaboration entre EDF et le LSV, July 2003. 43 pages.
[ BibTex ]
[Jac03a]: F. Jacquemard. The EVA Translator, version 2. Technical Report 9, projet RNTL EVA, July 2003. 38 pages.
[ BibTex | Web page | PDF ]
[Jac03b]: F. Jacquemard. The EVA translator, version 2, July 2003. See [Jac03a] for description. Written in OCaml (about 11000 lines).
[ BibTex ]
[BFLP03]: S. Bardin, A. Finkel, J. Leroux, and L. Petrucci. FAST: Fast Acceleration of Symbolic Transition Systems. In Proceedings of the 15th International Conference on Computer Aided Verification (CAV'03), volume 2725 of Lecture Notes in Computer Science, pages 118--121, Boulder, Colorado, USA, July 2003. Springer.
[ BibTex | Web page | PS ]
[BFL03a]: S. Bardin, A. Finkel, and J. Leroux. FAST v1.0: Fast Acceleration of Symbolic Transition Systems, July 2003. See [BFLP03] for description. Written in C++ (about 4400 lines on top of the MONA v1.4 library).
[ BibTex | Web page ]
[FMP03b]: L. Fribourg, S. Messika, and C. Picaronny. Traces of Randomized Distributed Algorithms As Markov Fields. Application to Rapid Mixing. Research Report LSV-03-10, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2003. 19 pages.
[ BibTex | Web page | PS ]
[Jac03d]: F. Jacquemard. SPORE: Security Protocols Open REpository, July 2003. Works with Perl scripts (about 1200 lines) and contains about 50 protocol descriptions (as of Aug. 2004).
[ BibTex | Web page ]
[CC03a]: H. Comon-Lundh and V. Cortier. New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols. In Proceedings of the 14th International Conference on Rewriting Techniques and Applications (RTA'03), volume 2706 of Lecture Notes in Computer Science, pages 148--164, Valencia, Spain, June 2003. Springer.
[ BibTex | Web page | PS ]
[PKBQ03]: L. Petrucci, L. M. Kristensen, J. Billington, and Z. H. Qureshi. Developing a Formal Specification for the Mission System of a Maritime Surveillance Aircraft. In Proceedings of the 3rd International Conference on Application of Concurrency to System Design (ACSD'03), pages 92--101, Guimarães, Portugal, June 2003. IEEE Computer Society Press.
[ BibTex | Web page | PS ]
[LN03]: R. Lazić and D. Nowak. On a Semantic Definition of Data Independence. In Proceedings of the 6th International Conference on Typed Lambda Calculi and Applications (TLCA'03), volume 2701 of Lecture Notes in Computer Science, pages 226--240, Valencia, Spain, June 2003. Springer.
[ BibTex | Web page | PS ]
[Sch03c]: Ph. Schnoebelen. Oracle circuits for branching-time model checking. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP'03), volume 2719 of Lecture Notes in Computer Science, pages 790--801, Eindhoven, The Netherlands, June 2003. Springer.
[ BibTex | Web page | PS | PDF ]
[CS03b]: H. Comon-Lundh and V. Shmatikov. Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive Or. In Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), pages 271--280, Ottawa, Canada, June 2003. IEEE Computer Society Press.
[ BibTex ]
[BCvH⁺03]: J. Billington, S. Christensen, K. M. van Hee, E. Kindler, O. Kummer, L. Petrucci, R. Post, Ch. Stehno, and M. Weber. The Petri Net Markup Language: Concepts, Technology and Tools. In Proceedings of the 24th International Conference on Applications and Theory of Petri Nets (ICATPN'03), volume 2679 of Lecture Notes in Computer Science, pages 483--505, Eindhoven, The Netherlands, June 2003. Springer. Invited paper.
[ BibTex | Web page | PS ]
[Ver03c]: K. N. Verma. Two-Way Equational Tree Automata for AC-like Theories: Decidability and Closure Properties. In Proceedings of the 14th International Conference on Rewriting Techniques and Applications (RTA'03), volume 2706 of Lecture Notes in Computer Science, pages 180--196, Valencia, Spain, June 2003. Springer.
[ BibTex | Web page | PS ]
[ABBL03]: L. Aceto, P. Bouyer, A. Burgueño, and K. G. Larsen. The Power of Reachability Testing for Timed Automata. Theoretical Computer Science, 300(1-3):411--475, May 2003.
doi: 10.1016/S0304-3975(02)00334-1.
[ BibTex | DOI | Web page | PS ]
[BPT03]: P. Bouyer, A. Petit, and D. Thérien. An Algebraic Approach to Data Languages and Timed Languages. Information and Computation, 182(2):137--162, May 2003.
[ BibTex | Web page | PS | PDF ]
[Dem03b]: S. Demri. A Polynomial-Space Construction of Tree-Like Models for Logics with Local Chains of Modal Connectives. Theoretical Computer Science, 300(1-3):235--258, May 2003.
doi: 10.1016/S0304-3975(02)00082-8.
[ BibTex | DOI | Web page | PS | PDF ]
[J⁺03]: B. Jonsson et al. Roadmap on Component-based Design and Integration Platforms. Contract Report (Deliverable W1.A2.N1.Y1), European Project IST-2001-34820 "ARTIST" Advanced Real-Time Systems, May 2003. 78 pages.
[ BibTex ]
[Sch03b]: Ph. Schnoebelen. Model Checking Branching-Time Temporal Logics. Invited talk, Franco-Israeli Workshop on Semantics and Verification of Hardware and Software Systems, Tel-Aviv, Israel, May 2003.
[ BibTex ]
[BBFL03]: G. Behrmann, P. Bouyer, E. Fleury, and K. G. Larsen. Static Guard Analysis in Timed Automata Verification. In Proceedings of the 9th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'03), volume 2619 of Lecture Notes in Computer Science, pages 254--277, Warsaw, Poland, April 2003. Springer.
[ BibTex | Web page | PS | PDF ]
[BS03]: N. Bertrand and Ph. Schnoebelen. Model Checking Lossy Channels Systems Is Probably Decidable. In Proceedings of the 6th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'03), volume 2620 of Lecture Notes in Computer Science, pages 120--135, Warsaw, Poland, April 2003. Springer.
[ BibTex | Web page | PS | PDF ]
[CC03b]: H. Comon-Lundh and V. Cortier. Security properties: two agents are sufficient. In Proceedings of the 12th European Symposium on Programming (ESOP'03), volume 2618 of Lecture Notes in Computer Science, pages 99--113, Warsaw, Poland, April 2003. Springer.
[ BibTex | Web page | PS ]
[FMP03a]: L. Fribourg, S. Messika, and C. Picaronny. On the Absence of Phase Transition in Randomized Distributed Algorithms. Research Report LSV-03-7, Laboratoire Spécification et Vérification, ENS Cachan, France, April 2003. 17 pages.
[ BibTex | Web page | PS ]
[Mar03a]: N. Markey. Logiques temporelles pour la vérification: expressivité, complexité, algorithmes. Thèse de doctorat, Laboratoire d'Informatique Fondamentale d'Orléans, France, April 2003.
[ BibTex | Web page | PS | PDF ]
[BHK03]: M. Bidoit, R. Hennicker, and A. Kurz. Observational Logic, Constructor-Based Logic, and their Duality. Theoretical Computer Science, 298(3):471--510, April 2003.
[ BibTex | Web page | PS ]
[Cor03b]: V. Cortier. Vérification automatique des protocoles cryptographiques. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, March 2003.
[ BibTex | Web page | PS ]
[LST03]: F. Laroussinie, Ph. Schnoebelen, and M. Turuani. On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. Theoretical Computer Science, 297(1-3):297--315, March 2003.
doi: 10.1016/S0304-3975(02)00644-8.
[ BibTex | DOI | Web page | PS ]
[Bou03]: P. Bouyer. Untameable Timed Automata! In Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS'03), volume 2607 of Lecture Notes in Computer Science, pages 620--631, Berlin, Germany, February 2003. Springer.
[ BibTex | Web page | PS | PDF ]
[CT03]: H. Comon-Lundh and R. Treinen. Easy Intruder Deductions. In Verification: Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, volume 2772 of Lecture Notes in Computer Science, pages 225--242. Springer, February 2003. Invited paper.
[ BibTex | Web page | PS ]
[FPS03]: A. Finkel, S. Purushothaman Iyer, and G. Sutre. Well-Abstracted Transition Systems: Application to FIFO Automata. Information and Computation, 181(1):1--31, February 2003.
[ BibTex | Web page | PS ]
[Mar03b]: N. Markey. Temporal Logic with Past is Exponentially More Succinct. EATCS Bulletin, 79:122--128, February 2003.
[ BibTex | Web page | PS | PDF ]
[Gou03]: J. Goubault-Larrecq, editor. Proceedings of the 1st Workshop on Logical Aspects of Cryptographic Protocol Verification (LACPV 2001), volume 55 of Electronic Notes in Theoretical Computer Science, Paris, France, January 2003. Elsevier Science Publishers.
doi: 10.1016/S1571-0661(05)80576-6.
[ BibTex | DOI ]
[ADdR03]: N. Alechina, S. Demri, and M. de Rijke. A Modal Perspective on Path Constraints. Journal of Logic and Computation, 13(6):939--956, 2003.
[ BibTex | Web page | PS | PDF ]
[BFKM03]: B. Bérard, L. Fribourg, F. Klay, and J.-F. Monin. A Compared Study of Two Correctness Proofs for the Standardized Algorithm of ABR Conformance. Formal Methods in System Design, 22(1):59--86, January 2003.
doi: 10.1023/A:1021704214464.
[ BibTex | DOI | Web page | PS ]
[CNNR03]: H. Comon, P. Narendran, R. Nieuwenhuis, and M. Rusinowitch. Deciding the Confluence of Ordered Term Rewrite Systems. ACM Transactions on Computational Logic, 4(1):33--55, January 2003.
[ BibTex ]
[GG03]: J. Goubault-Larrecq and É. Goubault. On the Geometry of Intuitionistic S4 Proofs. Homology, Homotopy and Applications, 5(2):137--209, 2003.
[ BibTex | Web page | PS ]
[DW03]: Ph. David and H. Waeselynck, editors. Logiciel libre et sûreté de fonctionnement: cas des systèmes critiques. Hermès, 2003.
[ BibTex | Web page ]
[CS03a]: H. Comon-Lundh and V. Shmatikov. Constraint Solving, Exclusive Or and the Decision of Confidentiality for Security Protocols Assuming a Bounded Number of Sessions. Research Report LSV-03-1, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2003. 17 pages.
[ BibTex | Web page | PS ]
[Rog03a]: M. Roger. MOP: MOdular Prover, 2003. See description in [?]. Written in OCaml (9611 lines).
[ BibTex ]
[CP03]: J.-M. Couvreur and D. Poitrenaud. Dépliage pour la vérification de propriétés temporelles. In Vérification et mise en œuvre des réseaux de Petri --- Tome 2, chapter 3, pages 127--161. Hermès, January 2003.
[ BibTex ]
[Sch03a]: Ph. Schnoebelen. The Complexity of Temporal Logic Model Checking. In Selected Papers from the 4th Workshop on Advances in Modal Logics (AiML'02), pages 393--436, Toulouse, France, 2003. King's College Publication. Invited paper.
[ BibTex | Web page | PS | PDF ]
[CD03]: V. Cortier and S. Delaune. Securify version 2, 2003. See [Cor03a] for description. Written in Caml (about 3300 lines).
[ BibTex | Web page ]
[Pet03]: L. Petrucci. symprod: construction et analyse du produit synchronisé modulaire d'automates, 2003.
[ BibTex ]
[DD02]: S. Demri and D. D'Souza. An Automata-Theoretic Approach to Constraint LTL. In Proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02), volume 2556 of Lecture Notes in Computer Science, pages 121--132, Kanpur, India, December 2002. Springer.
[ BibTex | Web page | PS ]
[FL02]: A. Finkel and J. Leroux. How To Compose Presburger-Accelerations: Applications to Broadcast Protocols. In Proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02), volume 2556 of Lecture Notes in Computer Science, pages 145--156, Kanpur, India, December 2002. Springer.
[ BibTex | Web page | PS ]
[LN02]: R. Lazić and D. Nowak. On a Semantic Definition of Data Independence. Research Report CS-RR-392, Department of Computer Science, University of Warwick, UK, December 2002. 19 pages.
[ BibTex | Web page | PS ]
[Bla02]: B. Blanc. Prise en compte de principes architecturaux lors de la formalisation des besoins. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2002.
[ BibTex | Web page | PS ]
[Fle02]: E. Fleury. Automates temporisés avec mises à jour. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2002.
[ BibTex | Web page | PS ]
[HS02a]: N. Halbwachs and Ph. Schnoebelen. Vérification de propriétés quantitatives. Final report, Action Spécifique 22 du Département STIC du CNRS, December 2002.
[ BibTex ]
[Pet02]: L. Petrucci. Modélisation, vérification et applications. Mémoire d'habilitation, Université d'Évry, France, December 2002.
[ BibTex | Web page | PS ]
[Gou02h]: J. Goubault-Larrecq. Un algorithme pour l'analyse de logs. Research Report LSV-02-18, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2002. 33 pages.
[ BibTex | Web page | PS ]
[Bou02a]: P. Bouyer. A Logical Characterization of Data Languages. Information Processing Letters, 84(2):75--85, October 2002.
[ BibTex | Web page | PS ]
[KBP⁺02]: L. M. Kristensen, J. Billington, L. Petrucci, Z. H. Qureshi, and R. Kiefer. Formal specification and analysis of airborne mission systems. In Proceedings of the 21st IEEE Digital Avionics Systems Conference (DASC'02), volume 1, pages 4.D.4.1--4.D.4.13, Irvine, California, USA, October 2002. IEEE Aerospace and Electronic Systems Society.
[ BibTex | Web page | PS ]
[PKB02]: L. Petrucci, L. M. Kristensen, and J. Billington. Modelling and Analysis of Airborne Mission Systems. Final report, phase 4, DSTO/UniSA contract, October 2002. 68 pages.
[ BibTex ]
[Cor02a]: V. Cortier. About the Decision of Reachability for Register Machines. Informatique Théorique et Applications, 36(4):341--358, October-December 2002.
[ BibTex | Web page | PS ]
[Bac02]: M. Baclet. Langages de données. Rapport de DEA, DEA Algorithmique, Paris, France, September 2002.
[ BibTex | Web page | PS ]
[Ber02b]: V. Bernat. Transformation de l'authentification en secret. Rapport de DEA, DEA Algorithmique, Paris, France, September 2002.
[ BibTex ]
[GLN02]: J. Goubault-Larrecq, S. Lasota, and D. Nowak. Logical Relations for Monadic Types. In Proceedings of the 16th International Workshop on Computer Science Logic (CSL'02), volume 2471 of Lecture Notes in Computer Science, pages 553--568, Edinburgh, Scotland, UK, September 2002. Springer.
[ BibTex | Web page | PS ]
[HS02b]: S. Hornus and Ph. Schnoebelen. On Solving Temporal Logic Queries. In Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology (AMAST'02), volume 2422 of Lecture Notes in Computer Science, pages 163--177, Saint Gilles les Bains, Reunion Island, France, September 2002. Springer.
[ BibTex | Web page | PS | PDF ]
[Gou02b]: J. Goubault-Larrecq. Higher-Order Positive Set Constraints. In Proceedings of the 16th International Workshop on Computer Science Logic (CSL'02), volume 2471 of Lecture Notes in Computer Science, pages 473--489, Edinburgh, Scotland, UK, September 2002. Springer.
[ BibTex | Web page | PS ]
[Gou02a]: J. Goubault-Larrecq, editor. Actes du 1er Workshop International sur la Sécurité des Communications sur Internet (SECI'02), Tunis, Tunisia, September 2002. INRIA.
[ BibTex | Web page ]
[Gou02i]: J. Goubault-Larrecq. Vérification de protocoles cryptographiques: la logique à la rescousse! In Actes du 1er Workshop International sur la Sécurité des Communications sur Internet (SECI'02), pages 119--152, Tunis, Tunisia, September 2002. INRIA. Invited paper.
[ BibTex | Web page | PS ]
[GV02]: J. Goubault-Larrecq and K. N. Verma. Alternating Two-Way AC-Tree Automata. Research Report LSV-02-11, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2002. 21 pages.
[ BibTex | Web page | PS ]
[FMP02]: L. Fribourg, S. Messika, and C. Picaronny. Traces of Randomized Distributed Algorithms as Gibbs Fields. Research Report LSV-02-12, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2002. 16 pages.
[ BibTex | Web page | PS ]
[Las02b]: S. Lasota. A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes. Research Report LSV-02-13, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2002. 16 pages.
[ BibTex | Web page | PS ]
[Bau02]: M. Baudet. Contrôle de ressource et évitement des interblocages sur la mémoire. Rapport de DEA, DEA Programmation, Paris, France, September 2002.
[ BibTex | Web page | PS | PDF ]
[Ber02c]: N. Bertrand. Vérification de canaux à pertes stochastiques. Rapport de DEA, DEA Algorithmique, Paris, France, September 2002.
[ BibTex | Web page | PS ]
[ABK⁺02]: E. Astesiano, M. Bidoit, H. Kirchner, B. Krieg-Brückner, P. D. Mosses, D. Sannella, and A. Tarlecki. CASL: The Common Algebraic Specification Language. Theoretical Computer Science, 286(2):153--196, September 2002.
[ BibTex | Web page | PS ]
[Mes02]: S. Messika. Vérification paramétrée de réseaux à processus probabiliste. Application du théorème de Hammersley et Clifford aux algorithmes distribués. Rapport de DEA, DEA Logique et Fondements de l'Informatique, Paris, France, September 2002.
[ BibTex | Web page | PS ]
[Sch02b]: Ph. Schnoebelen. Verifying Lossy Channel Systems has Nonprimitive Recursive Complexity. Information Processing Letters, 83(5):251--261, September 2002.
doi: 10.1016/S0020-0190(01)00337-4.
[ BibTex | DOI | Web page | PS | PDF ]
[Zha02]: Y. Zhang. Logical Relations For Names. Rapport de DEA, DEA Programmation, Paris, France, September 2002.
[ BibTex | Web page | PS ]
[BST02b]: M. Bidoit, D. Sannella, and A. Tarlecki. Global Development via Local Observational Construction Steps. In Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS'02), volume 2420 of Lecture Notes in Computer Science, pages 1--24, Warsaw, Poland, August 2002. Springer. Invited paper.
[ BibTex | Web page | PS ]
[DFP02]: M. Duflot, L. Fribourg, and C. Picaronny. Randomized Dining Philosophers without Fairness Assumption. In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (IFIP TCS'02), volume 223 of IFIP Conference Proceedings, pages 169--180, Montréal, Québec, Canada, August 2002. Kluwer Academic Publishers.
[ BibTex | Web page | PS ]
[FRSV02]: A. Finkel, J.-F. Raskin, M. Samuelides, and L. Van Begin. Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. In Proceedings of the 4th International Workshop on Verification of Infinite State Systems (INFINITY'02), volume 68 of Electronic Notes in Theoretical Computer Science, pages 121--144, Brno, Czech Republic, August 2002. Elsevier Science Publishers.
[ BibTex | Web page | PS ]
[MS02]: B. Masson and Ph. Schnoebelen. On Verifying Fair Lossy Channel Systems. In Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS'02), volume 2420 of Lecture Notes in Computer Science, pages 543--555, Warsaw, Poland, August 2002. Springer.
[ BibTex | Web page ]
[Mar02]: N. Markey. Past is for Free: On the Complexity of Verifying Linear Temporal Properties with Past. In Proceedings of the 9th International Workshop on Expressiveness in Concurrency (EXPRESS'02), volume 68 of Electronic Notes in Theoretical Computer Science, pages 87--104, Brno, Czech Republic, August 2002. Elsevier Science Publishers.
doi: 10.1016/S1571-0661(05)80366-4.
[ BibTex | DOI | Web page | PS | PDF ]
[PKG⁺02]: L. Petrucci, L. M. Kristensen, G. E. Gallasch, M. Elliot, P. Dauchy, J. Billington, and M. Aziz. Modelling and Analysis of Airborne Mission Systems. Contract Report Final report for phase 3, DSTO/UniSA contract, August 2002. 79 pages.
[ BibTex ]
[AL02]: L. Aceto and F. Laroussinie. Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics. Journal of Logic and Algebraic Programming, 52-53:7--51, August 2002.
doi: 10.1016/S1567-8326(02)00022-X.
[ BibTex | DOI | Web page | PS ]
[BBP02]: B. Bérard, P. Bouyer, and A. Petit. Analysing the PGM Protocol with UPPAAL. In Proceedings of the 2nd Workshop on Real-Time Tools (RT-TOOLS'02), Copenhagen, Denmark, August 2002. Uppsala University.
[ BibTex | Web page | PS ]
[Las02a]: S. Lasota. Decidability of Strong Bisimilarity for Timed BPP. In Proceedings of the 13th International Conference on Concurrency Theory (CONCUR'02), volume 2421 of Lecture Notes in Computer Science, pages 562--578, Brno, Czech Republic, August 2002. Springer.
[ BibTex | Web page | PS ]
[BST02a]: M. Bidoit, D. Sannella, and A. Tarlecki. Architectural Specifications in CASL. Formal Aspects of Computing, 13(3-5):252--273, July 2002.
doi: 10.1007/s001650200012.
[ BibTex | DOI | Web page | PS ]
[LMS02b]: F. Laroussinie, N. Markey, and Ph. Schnoebelen. Temporal Logic with Forgettable Past. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), pages 383--392, Copenhagen, Denmark, July 2002. IEEE Computer Society Press.
doi: 10.1109/LICS.2002.1029846.
[ BibTex | DOI | Web page | PS | PDF ]
[Gou02f]: J. Goubault-Larrecq. SKInT Labels. Research Report LSV-02-7, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2002. 15 pages.
[ BibTex | Web page | PS ]
[Gou02c]: J. Goubault-Larrecq. A Note on the Completeness of Certain Refinements of Resolution. Research Report LSV-02-8, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2002. 16 pages.
[ BibTex | Web page | PS ]
[LS02a]: A. Labroue and Ph. Schnoebelen. An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. Nordic Journal of Computing, 9(2):118--144, July 2002.
[ BibTex | Web page | PS ]
[GPD⁺02]: J. Goubault-Larrecq, J.-Ph. Pouzol, S. Demri, L. Mé, and P. Carle. Langages de détection d'attaques par signatures. Contract Report (Sous-projet 3, livrable 1), Projet RNTL DICO, June 2002. 30 pages.
[ BibTex ]
[PKBQ02]: L. Petrucci, L. M. Kristensen, J. Billington, and Z. H. Qureshi. Towards Formal Specification and Analysis of Avionics Mission Systems. In Proceedings of the Workshops on Software Ingineering and Formal Methods and Formal Methods Applied to Defence Systems, volume 12 of Conferences in Research and Practice in Information Technology, pages 95--104, Adelaide, Australia, June 2002. Australian Computer Society.
[ BibTex | Web page | PS ]
[Mag02]: F. Magniette. Preuves d'algorithmes auto-stabilisants. Thèse de doctorat, Université Paris-Sud 11, Orsay, France, June 2002.
[ BibTex | Web page | PS ]
[Sch02a]: Ph. Schnoebelen. Temporal Logic and Verification. Invited tutorial, 5th Summer School on Modelling and Verifying Parallel Processes (MOVEP'02), Nantes, France, June 2002.
[ BibTex ]
[Gou02d]: J. Goubault-Larrecq. Outils CPV et CPV2. Contract Report 8, Projet RNTL EVA, May 2002. 7 pages.
[ BibTex | Web page | PDF ]
[Cor02c]: V. Cortier. Outil de vérification SECURIFY. Contract Report 7, projet RNTL EVA, May 2002. 6 pages.
[ BibTex | Web page | PDF ]
[DS02b]: S. Demri and Ph. Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases. Information and Computation, 174(1):84--103, April 2002.
doi: 10.1006/inco.2001.3094.
[ BibTex | DOI | Web page | PS | PDF ]
[HCF⁺02]: F. Herbreteau, F. Cassez, A. Finkel, O. F. Roux, and G. Sutre. Verification of Embedded Reactive Fiffo Systems. In Proceedings of the 5th Latin American Symposium on Theoretical Informatics (LATIN'02), volume 2286 of Lecture Notes in Computer Science, pages 400--414, Cancun, Mexico, April 2002. Springer.
[ BibTex | Web page | PS ]
[LMS02a]: F. Laroussinie, N. Markey, and Ph. Schnoebelen. On Model Checking Durational Kripke Structures (Extended Abstract). In Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'02), volume 2303 of Lecture Notes in Computer Science, pages 264--279, Grenoble, France, April 2002. Springer.
[ BibTex | Web page | PS | PDF ]
[Boi02]: A. Boisseau. Signatures électroniques de contrats. Research Report LSV-02-4, Laboratoire Spécification et Vérification, ENS Cachan, France, April 2002. 22 pages.
[ BibTex | Web page | PS ]
[Bou02b]: P. Bouyer. Modèles et algorithmes pour la vérification des systèmes temporisés. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, April 2002.
[ BibTex | Web page | PS | PDF ]
[Bér02a]: B. Bérard. Vérification de modèles temporisés. Mémoire d'habilitation, Université Paris 7, Paris, France, April 2002.
[ BibTex | Web page | PS ]
[BH02]: M. Bidoit and R. Hennicker. On the Integration of Observability and Reachability Concepts. In Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'02), volume 2303 of Lecture Notes in Computer Science, pages 21--36, Grenoble, France, April 2002. Springer.
[ BibTex | Web page | PS ]
[DLS02]: S. Demri, F. Laroussinie, and Ph. Schnoebelen. A Parametric Analysis of the State Explosion Problem in Model Checking (Extended Abstract). In Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS'02), volume 2285 of Lecture Notes in Computer Science, pages 620--631, Antibes Juan-les-Pins, France, March 2002. Springer.
[ BibTex | Web page | PS | PDF ]
[Cor02b]: V. Cortier. Observational Equivalence and Trace Equivalence in an Extension of Spi-calculus. Application to Cryptographic Protocols Analysis. Extended Version. Research Report LSV-02-3, Laboratoire Spécification et Vérification, ENS Cachan, France, March 2002. 33 pages.
[ BibTex | Web page | PS ]
[LS02c]: D. Lugiez and Ph. Schnoebelen. The Regular Viewpoint on PA-Processes. Theoretical Computer Science, 274(1-2):89--115, March 2002.
doi: 10.1016/S0304-3975(00)00306-6.
[ BibTex | DOI | Web page | PS | PDF ]
[LS02b]: A. Labroue and Ph. Schnoebelen. An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems. In Proceedings of the 8th International Workshop on Expressiveness in Concurrency (EXPRESS'01), volume 52 of Electronic Notes in Theoretical Computer Science, pages 1--20, Aalborg, Denmark, February 2002. Elsevier Science Publishers.
doi: 10.1016/S1571-0661(04)00213-0.
[ BibTex | DOI | Web page | PS | PDF ]
[BP02]: P. Bouyer and A. Petit. A KleeneashBüchi-like Theorem for Clock Languages. Journal of Automata, Languages and Combinatorics, 7(2):167--186, 2002.
[ BibTex | Web page | PS ]
[DO02]: S. Demri and E. Orlowska. Incomplete Information: Structure, Inference, Complexity. EATCS Monographs. Springer, 2002.
[ BibTex | Web page ]
[DS02a]: S. Demri and U. Sattler. Automata-Theoretic Decision Procedures for Information Logics. Fundamenta Informaticae, 53(1):1--22, 2002.
[ BibTex | Web page | PS | PDF ]
[HHB02]: R. Hennicker, H. Hußmann, and M. Bidoit. On the Precise Meaning of OCL Constraints. In Object Modeling with the OCL --- The Rationale behind the Object Constraint Language, volume 2263 of Lecture Notes in Computer Science, pages 69--84. Springer, 2002.
[ BibTex | Web page | PS ]
[Gou02g]: J. Goubault-Larrecq. Special Issue on Models and Methods for Cryptographic Protocol Verification. Journal of Telecommunications and Information Technology, 4/2002, 2002.
[ BibTex | Web page ]
[Gou02e]: J. Goubault-Larrecq. Sécurité, modélisation et analyse de protocoles cryptographiques. Phœbus, la revue de la sûreté de fonctionnement, 20, 2002.
[ BibTex | Web page ]
[Lab02]: A. Labroue. Méthodes algébriques pour la vérification des systèmes infinis. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2002.
[ BibTex | Web page | PS ]
[CS02]: H. Comon and V. Shmatikov. Is it Possible to Decide whether a Cryptographic Protocol is Secure or not? Journal of Telecommunications and Information Technology, 4/2002:5--15, 2002.
[ BibTex | Web page | PDF ]
[Cor02d]: V. Cortier. Securify version 1. Available at http://www.lsv.ens-cachan.fr/~cortier/EVA/securify.tar.gz, 2002. Started 2001. See [Cor02c] for description. Written in Caml (about 3200 lines).
[ BibTex ]
[CC01]: H. Comon and V. Cortier. Tree Automata with One Memory, Set Constraints and Cryptographic Protocols. Research Report LSV-01-13, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2001. 98 pages.
[ BibTex | Web page | PS ]
[PKD⁺01]: L. Petrucci, L. M. Kristensen, P. Dauchy, M. Aziz, and J. Billington. Modelling and analysis of airborne mission systems. Progress Report 1, DSTO/UniSA contract, December 2001. 54 pages.
[ BibTex ]
[Can01]: G. Canet. Vérification des programmes écrits dans les langages de programmation IL et ST définis par la norme IEC 61131-3. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2001.
[ BibTex | Web page | PS ]
[Nar01]: G. A. Narboni. Un cas remarquable de systèmes linéaires: les systèmes monotones. Résolution et application à la vérification formelle de programmes. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2001.
[ BibTex | Web page | PS ]
[BBP01]: B. Bérard, P. Bouyer, and A. Petit. Modélisation du protocole PGM et de certaines de ses propriétés en UPPAAL. Contract Report 4.4, projet RNRT Calife, November 2001. 18 pages.
[ BibTex ]
[JL01]: F. Jacquemard and D. Le Métayer. Langage de spécification de protocoles cryptographiques de EVA: syntaxe concrète. Technical Report 1, projet RNTL EVA, November 2001. 25 pages.
[ BibTex | Web page | PDF ]
[BFJL01]: D. Bolignano, F. Fiorenza, F. Jacquemard, and D. Le Métayer. EVA test base. Technical Report 4, projet RNTL EVA, November 2001. 55 pages.
[ BibTex | Web page | PS | PDF ]
[Gou01b]: J. Goubault-Larrecq. Les syntaxes et la sémantique du langage de spécification EVA. Contract Report 3, projet RNTL EVA, November 2001. 32 pages.
[ BibTex | Web page | PS | PDF ]
[Gou01a]: J. Goubault-Larrecq. Higher-Order Automata, Pushdown Systems, and Set Constraints. Research Report LSV-01-9, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2001. 15 pages.
[ BibTex | Web page | PS ]
[DFP01]: M. Duflot, L. Fribourg, and C. Picaronny. Randomized Finite-State Distributed Algorithms as Markov Chains. In Proceedings of the 15th International Symposium on Distributed Computing (DISC'01), volume 2180 of Lecture Notes in Computer Science, pages 240--254, Lisbon, Portugal, October 2001. Springer.
[ BibTex | Web page | PS ]
[Sch01a]: Ph. Schnoebelen. Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems. In Proceedings of the 4th International Workshop on Theoretical Aspects of Computer Software (TACS'01), volume 2215 of Lecture Notes in Computer Science, pages 385--399, Sendai, Japan, October 2001. Springer.
[ BibTex | Web page | PS | PDF ]
[CGN01]: H. Comon, G. Godoy, and R. Nieuwenhuis. The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. In Proceedings of the 42nd Symposium on Foundations of Computer Science (FOCS'01), pages 298--307, Las Vegas, Nevada, USA, October 2001. IEEE Computer Society Press.
[ BibTex | Web page | PS ]
[Sch01b]: Ph. Schnoebelen. Spécification et vérification des systèmes concurrents. Mémoire d'habilitation, Université Paris 7, Paris, France, October 2001.
[ BibTex | Web page | PS ]
[ADdR01]: N. Alechina, S. Demri, and M. de Rijke. Path Constraints from a Modal Logic Point of View (Extended Abstract). In Proceedings of the 8th International Workshop on Knowledge Representation meets Databases (KRDB'01), volume 45 of CEUR Workshop Proceedings, Rome, Italy, September 2001. RWTH Aachen, Germany.
[ BibTex | Web page | PS ]
[Fri01]: L. Fribourg, editor. Proceedings of the 15th International Workshop on Computer Science Logic (CSL'01), volume 2142 of Lecture Notes in Computer Science, Paris, France, September 2001. Springer.
[ BibTex | Web page ]
[BP01]: G. Berthelot and L. Petrucci. Specification and Validation of a Concurrent System: An Educational Project. International Journal on Software Tools for Technology Transfer, 3(4):372--381, September 2001.
doi: 10.1007/s100090100064.
[ BibTex | DOI | Web page | PS ]
[Gou01d]: J. Goubault-Larrecq. Well-Founded Recursive Relations. In Proceedings of the 15th International Workshop on Computer Science Logic (CSL'01), volume 2142 of Lecture Notes in Computer Science, pages 484--497, Paris, France, September 2001. Springer.
[ BibTex | Web page | PS ]
[RG01a]: X. Rival and J. Goubault-Larrecq. Experiments with Finite Tree Automata in Coq. In Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'01), volume 2152 of Lecture Notes in Computer Science, pages 362--377, Edinburgh, Scotland, UK, September 2001. Springer.
[ BibTex | Web page | PS ]
[Cor01]: P. Corbineau. Autour de la clôture de congruence avec Coq. Master's thesis, DEA Programmation, Paris, France, September 2001.
[ BibTex | Web page | PS ]
[Hor01]: S. Hornus. Requêtes en logique temporelle. Master's thesis, DEA Algorithmique, Paris, France, September 2001.
[ BibTex | Web page | PS ]
[Pic01]: É. Pichon. Preuves observationnelles. Master's thesis, DEA Programmation, Paris, France, September 2001.
[ BibTex ]
[BPT01]: P. Bouyer, A. Petit, and D. Thérien. An Algebraic Characterization of Data and Timed Languages. In Proceedings of the 12th International Conference on Concurrency Theory (CONCUR'01), volume 2154 of Lecture Notes in Computer Science, pages 248--261, Aalborg, Denmark, August 2001. Springer.
[ BibTex | Web page | PS ]
[DFN01]: M. Duflot, L. Fribourg, and U. Nilsson. Unavoidable Configurations of Parameterized Rings of Processes. In Proceedings of the 12th International Conference on Concurrency Theory (CONCUR'01), volume 2154 of Lecture Notes in Computer Science, pages 472--486, Aalborg, Denmark, August 2001. Springer.
[ BibTex | Web page | PS ]
[Pet01]: A. Petit. About Extensions of Timed Automata. Invited talk, 8th International Workshop on Expressiveness in Concurrency (EXPRESS'01), Aalborg, Denmark, August 2001.
[ BibTex ]
[BCF01]: G. Berry, H. Comon, and A. Finkel, editors. Proceedings of the 13th International Conference on Computer Aided Verification (CAV'01), volume 2102 of Lecture Notes in Computer Science, Paris, France, July 2001. Springer.
[ BibTex | Web page ]
[Gou01c]: J. Goubault-Larrecq. Une proposition de langage de description de protocoles cryptographiques. Contract Report 2, projet RNTL EVA, July 2001. 12 pages.
[ BibTex ]
[CCM01]: H. Comon, V. Cortier, and J. Mitchell. Tree Automata with One Memory, Set Constraints and Ping-Pong Protocols. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP'01), volume 2076 of Lecture Notes in Computer Science, pages 682--693, Heraklion, Crete, Grece, July 2001. Springer.
[ BibTex | Web page | PS ]
[BT01]: B. Blanc and F. Tort. Co-développement de spécifications algébriques. In Actes du 4ème Atelier sur les Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL'01), pages 141--156, Nancy, France, June 2001.
[ BibTex | Web page | PS ]
[RG01b]: M. Roger and J. Goubault-Larrecq. Log Auditing through Model Checking. In Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW'01), pages 220--236, Cape Breton, Nova Scotia, Canada, June 2001. IEEE Computer Society Press.
[ BibTex | Web page | PS ]
[CMR01]: V. Cortier, J. K. Millen, and H. Rueß. Proving Secrecy is Easy Enough. In Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW'01), pages 97--110, Cape Breton, Nova Scotia, Canada, June 2001. IEEE Computer Society Press.
[ BibTex | Web page | PS ]
[CCR01]: G. Canet, S. Couffin, and O. Rossi. Validation dans le cadre de l'utilisation des SFC, LD et ST. Final report, tâches 4, 5 et 6, projet VULCAIN, May 2001. 393 pages.
[ BibTex ]
[BB01]: M. Bidoit and A. Boisseau. Algebraic Abstractions. In Recent Trends in Algebraic Development Techniques --- Selected Papers of the 15th International Workshop on Algebraic Development Techniques (WADT'01), volume 2267 of Lecture Notes in Computer Science, pages 21--47, Genova, Italy, April 2001. Springer.
[ BibTex | Web page | PS ]
[BM01]: M. Bidoit and P. D. Mosses. A Gentle Introduction to CASL v1.0.1. Invited tutorial, CoFI Workshop at the 4th European Joint Conferences on Theory and Practice of Software (ETAPS 2001), Genova, Italy, April 2001.
[ BibTex | Web page ]
[BHK01]: M. Bidoit, R. Hennicker, and A. Kurz. On the Duality between Observability and Reachability. In Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'01), volume 2030 of Lecture Notes in Computer Science, pages 72--87, Genova, Italy, April 2001. Springer.
[ BibTex | Web page | PS ]
[FS01]: A. Finkel and Ph. Schnoebelen. Well-Structured Transition Systems Everywhere! Theoretical Computer Science, 256(1-2):63--92, April 2001.
doi: 10.1016/S0304-3975(00)00102-X.
[ BibTex | DOI | Web page | PS | PDF ]
[LMS01]: F. Laroussinie, N. Markey, and Ph. Schnoebelen. Model checking CTL^+ and FCTL is hard. In Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'01), volume 2030 of Lecture Notes in Computer Science, pages 318--331, Genova, Italy, April 2001. Springer.
[ BibTex | Web page | PS | PDF ]
[BBFM01]: J. Beauquier, B. Bérard, L. Fribourg, and F. Magniette. Proving Convergence of Self-Stabilizing Systems Using First-Order Rewriting and Regular Languages. Distributed Computing, 14(2):83--95, 2001.
doi: 10.1007/PL00008931.
[ BibTex | DOI | Web page | PS ]
[CMT01]: H. Comon, C. Marché, and R. Treinen, editors. Revised Lectures of the International Summer School on Constraints in Computational Logics (CCL'99), volume 2002 of Lecture Notes in Computer Science, Gif-sur-Yvette, France, 2001. Springer.
[ BibTex | Web page ]
[CK01]: H. Comon and C. Kirchner. Constraint Solving on Terms. In Revised Lectures of the International Summer School on Constraints in Computational Logics (CCL'99), volume 2002 of Lecture Notes in Computer Science, pages 47--103, Gif-sur-Yvette, France, 2001. Springer.
[ BibTex ]
[Com01]: H. Comon. Inductionless Induction. In Handbook of Automated Reasoning, volume 1, chapter 14, pages 913--962. Elsevier Science Publishers, 2001.
[ BibTex | Web page | PS ]
[BBF⁺01]: B. Bérard, M. Bidoit, A. Finkel, F. Laroussinie, A. Petit, L. Petrucci, and Ph. Schnoebelen. Systems and Software Verification. Model-Checking Techniques and Tools. Springer, 2001.
[ BibTex | Web page ]
[BBD⁺01]: É. Badouel, S. Boucheron, A. Dicky, A. Petit, M. Santha, P. Weil, and M. Zeitoun. Problèmes d'informatique fondamentale, volume 13 of Scopos. Springer, 2001.
[ BibTex | Web page ]
[VGPA00]: K. N. Verma, J. Goubault-Larrecq, S. Prasad, and S. Arun-Kumar. Reflecting BDDs in Coq. In Proceedings of the 6th Asian Computing Science Conference (ASIAN 2000), volume 1961 of Lecture Notes in Computer Science, pages 162--181, Penang, Malaysia, November 2000. Springer.
[ BibTex | Web page | PS ]
[BJL00]: A. Boisseau, F. Jacquemard, and D. Le Métayer. Exemple de modélisation de protocoles cryptographiques. Projet EVA, note interne, November 2000.
[ BibTex ]
[NDF00]: U. Nilsson, M. Duflot, and L. Fribourg. STABILO, a tool computing inevitable configurations in distributed protocols, November 2000. See description in [DFN01]. Written in PROLOG (about 500 lines on top of Gertjan van Noord's finite automata package).
[ BibTex ]
[Gou00a]: J. Goubault-Larrecq. Analyse de protocoles cryptographiques. Invited lecture, Journées ASPROM, Paris, France, October 2000.
[ BibTex ]
[Sut00]: G. Sutre. Abstraction et accélération de systèmes infinis. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2000.
[ BibTex | Web page | PS ]
[DCR⁺00]: O. De Smet, S. Couffin, O. Rossi, G. Canet, J.-J. Lesage, Ph. Schnoebelen, and H. Papini. Safe Programming of PLC Using Formal Verification Methods. In Proceedings of the 4th International PLCopen Conference on Industrial Control Programming (ICP 2000), pages 73--78, Utrecht, The Netherlands, October 2000. PLCopen.
[ BibTex | Web page | PS ]
[CCL⁺00]: G. Canet, S. Couffin, J.-J. Lesage, A. Petit, and Ph. Schnoebelen. Towards the Automatic Verification of PLC Programs Written in Instruction List. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (SMC 2000), pages 2449--2454, Nashville, Tennessee, USA, October 2000. Argos Press.
doi: 10.1109/ICSMC.2000.884359.
[ BibTex | DOI | Web page | PS ]
[Fri00c]: L. Fribourg. Petri Nets, Flat Languages and Linear Arithmetic. In Proceedings of the 9th International Workshop on Functional and Logic Programming (WFLP 2000), pages 344--365, Benicassim, Spain, September 2000. Universidad Politécnica de Valencia, Spain. Invited lecture.
[ BibTex | Web page | PS ]
[Boi00]: A. Boisseau. Vérification de protocoles cryptographiques. Rapport de DEA, DEA Programmation, Paris, France, September 2000.
[ BibTex ]
[Duf00]: M. Duflot. Configurations récurrentes pour les anneaux de processus --- Application à l'auto-stabilisation. Rapport de DEA, DEA Algorithmique, Paris, France, September 2000.
[ BibTex | Web page | PS ]
[RS00]: O. Rossi and Ph. Schnoebelen. Formal modeling of timed function blocks for the automatic verification of Ladder Diagram programs. In Proceedings of the 4th International Conference on Automation of Mixed Processes: Hybrid Dynamic Systems (ADPM 2000), pages 177--182, Dortmund, Germany, September 2000. Shaker Verlag.
[ BibTex | Web page | PS ]
[BDFP00b]: P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Expressiveness of Updatable Timed Automata. In Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS 2000), volume 1893 of Lecture Notes in Computer Science, pages 232--242, Bratislava, Slovakia, August 2000. Springer.
[ BibTex | Web page | PS ]
[FPS00]: A. Finkel, S. Purushothaman Iyer, and G. Sutre. Well-Abstracted Transition Systems. In Proceedings of the 11th International Conference on Concurrency Theory (CONCUR 2000), volume 1877 of Lecture Notes in Computer Science, pages 566--580, Pennsylvania State University, Pennsylvania, USA, August 2000. Springer.
[ BibTex | Web page | PS ]
[FS00a]: A. Finkel and G. Sutre. An Algorithm Constructing the Semilinear Post* for 2-Dim ResetashTransfer VASS. In Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS 2000), volume 1893 of Lecture Notes in Computer Science, pages 353--362, Bratislava, Slovakia, August 2000. Springer.
[ BibTex | Web page | PS ]
[CC00]: H. Comon and V. Cortier. Flatness is not a Weakness. In Proceedings of the 14th International Workshop on Computer Science Logic (CSL 2000), volume 1862 of Lecture Notes in Computer Science, pages 262--276, Fischbachau, Germany, August 2000. Springer.
[ BibTex | Web page | PS ]
[BD00]: B. Bérard and C. Dufourd. Timed Automata and Additive Clock Constraints. Information Processing Letters, 75(1-2):1--7, July 2000.
[ BibTex | Web page | PS ]
[CL00]: F. Cassez and F. Laroussinie. Model-Checking for Hybrid Systems by Quotienting and Constraints Solving. In Proceedings of the 12th International Conference on Computer Aided Verification (CAV 2000), volume 1855 of Lecture Notes in Computer Science, pages 373--388, Chicago, Illinois, USA, July 2000. Springer.
[ BibTex | Web page | PS ]
[Pet00]: L. Petrucci. Design and Validation of a Controller. In Proceedings of the 4th World Multiconference on Systemics, Cybernetics and Informatics (SCI 2000), pages 684--688, Orlando, Florida, USA, July 2000.
[ BibTex | Web page | PS ]
[BDFP00a]: P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Are Timed Automata Updatable? In Proceedings of the 12th International Conference on Computer Aided Verification (CAV 2000), volume 1855 of Lecture Notes in Computer Science, pages 464--479, Chicago, Illinois, USA, July 2000. Springer.
[ BibTex | Web page | PS ]
[CDP⁺00]: G. Canet, B. Denis, A. Petit, O. Rossi, and Ph. Schnoebelen. Un cadre pour la vérification automatique de programmes IL. In Actes de la 1ère Conférence Internationale Francophone d'Automatique (CIFA 2000), pages 693--698, Lille, France, July 2000. Union des Chercheurs Ingénieurs et Scientifiques, Villeneuve d'Ascq, France.
[ BibTex | Web page | PS ]
[FL00]: A. Finkel and J. Leroux. A Finite Covering Tree for Analysing Entropic Broadcast Protocols. In Proceedings of the International Workshop on Verification and Computational Logic (VCL 2000), London, UK, July 2000. University of Southampton, Southampton, UK.
[ BibTex | Web page | PS ]
[LS00d]: D. Lugiez and Ph. Schnoebelen. Decidable First-Order Transition Logics for PA-Processes. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP 2000), volume 1853 of Lecture Notes in Computer Science, pages 342--353, Geneva, Switzerland, July 2000. Springer.
[ BibTex | Web page | PS ]
[BEF⁺00]: A. Bouajjani, J. Esparza, A. Finkel, O. Maler, P. Rossmanith, B. Willems, and P. Wolper. An Efficient Automata Approach to some Problems on Context-Free Grammars. Information Processing Letters, 74(5-6):221--227, June 2000.
[ BibTex | Web page | PS ]
[BP00b]: G. Berthelot and L. Petrucci. Specification and Validation of a Concurrent System: An Educational Project. In Proceedings of the Workshop on Practical Use of High-Level Petri Nets, pages 55--72, Århus, Denmark, June 2000.
[ BibTex | Web page ]
[SS00]: Ph. Schnoebelen and N. Sidorova. Bisimulation and the Reduction of Petri Nets. In Proceedings of the 21st International Conference on Applications and Theory of Petri Nets (ICATPN 2000), volume 1825 of Lecture Notes in Computer Science, pages 409--423, Århus, Denmark, June 2000. Springer.
[ BibTex | Web page | PS ]
[Pad00]: V. Padovani. Decidability of Fourth-Order Matching. Mathematical Structures in Computer Science, 10(3):361--372, June 2000.
[ BibTex ]
[Mar00]: N. Markey. Complexité de la logique temporelle avec passé. Rapport de DEA, DEA Algorithmique, Paris, France, June 2000.
[ BibTex ]
[Gou00b]: J. Goubault-Larrecq. A Method for Automatic Cryptographic Protocol Verification (Extended Abstract). In Proceedings of the Workshops of the 15th International Parallel and Distributed Processing Symposium, volume 1800 of Lecture Notes in Computer Science, pages 977--984, Cancun, Mexico, May 2000. Springer.
[ BibTex | Web page | PS ]
[CN00]: H. Comon and R. Nieuwenhuis. Inductive Proofs = I-Axiomatization + First-Order Consistency. Information and Computation, 159(1-2):151--186, May-June 2000.
[ BibTex | Web page | PS ]
[BCF⁺00]: B. Bérard, P. Castéran, E. Fleury, L. Fribourg, J.-F. Monin, Ch. Paulin, A. Petit, and D. Rouillard. Document de spécification du modèle commun. Fourniture 1.1 du projet RNRT Calife, April 2000.
[ BibTex ]
[LST00]: F. Laroussinie, Ph. Schnoebelen, and M. Turuani. On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. In Proceedings of the 4th Latin American Symposium on Theoretical Informatics (LATIN 2000), volume 1776 of Lecture Notes in Computer Science, pages 437--446, Punta del Este, Uruguay, April 2000. Springer.
doi: 10.1007/10719839_43.
[ BibTex | DOI | Web page | PS | PDF ]
[BBP00]: F. Belala, M. Bettaz, and L. Petrucci-Dauchy. Concurrent systems analysis using ECATNets. Logic Journal of the IGPL, 8(2):149--164, March 2000.
doi: 10.1093/jigpal/8.2.149.
[ BibTex | DOI | Web page | PS | PDF ]
[BLS00]: B. Bérard, A. Labroue, and Ph. Schnoebelen. Verifying Performance Equivalence for Timed Basic Parallel Processes. In Proceedings of the 3rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2000), volume 1784 of Lecture Notes in Computer Science, pages 35--47, Berlin, Germany, March 2000. Springer.
[ BibTex | Web page | PS ]
[LS00b]: F. Laroussinie and Ph. Schnoebelen. The State-Explosion Problem from Trace to Bisimulation Equivalence. In Proceedings of the 3rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2000), volume 1784 of Lecture Notes in Computer Science, pages 192--207, Berlin, Germany, March 2000. Springer.
[ BibTex | Web page | PS ]
[Sch00]: Ph. Schnoebelen. Le problème de l'explosion du nombre d'états. Invited talk, 8ème Journées Montoises d'Informatique Théorique (JM 2000), Marne-la-Vallée, France, March 2000.
[ BibTex ]
[FS00b]: A. Finkel and G. Sutre. Decidability of Reachability Problems for Classes of Two-Counter Automata. In Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000), volume 1770 of Lecture Notes in Computer Science, pages 346--357, Lille, France, February 2000. Springer.
doi: 10.1007/3-540-46541-3_29.
[ BibTex | DOI | Web page | PS ]
[Com00]: H. Comon. Sequentiality, Monadic Second Order Logic and Tree Automata. Information and Computation, 157(1-2):25--51, February-March 2000.
[ BibTex | Web page | PS ]
[Wil00]: N. Williams. Application des spécifications algébriques à la rétro-ingénierie de codes Fortran. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, February 2000.
[ BibTex | Web page | PS ]
[BP00a]: B. Bérard and C. Picaronny. Accepting Zeno Words: A Way Toward Timed Refinements. Acta Informatica, 37(1):45--81, 2000.
[ BibTex | Web page | PS ]
[Fri00b]: L. Fribourg. Document de synthèse sur les techniques d'abstraction. Fourniture 4.1 du projet RNRT Calife, January 2000.
[ BibTex ]
[BFP00]: P. Bouyer, E. Fleury, and A. Petit. Document de synthèse sur les procédures de vérification des systèmes temps réel : Les automates temporisés. Fourniture 4.2 du projet RNRT Calife, January 2000.
[ BibTex ]
[Fri00a]: L. Fribourg. Constraint Logic Programming Applied to Model Checking. In Proceedings of the 9th International Workshop on Logic Program Synthesis and Transformation (LOPSTR'99), volume 1817 of Lecture Notes in Computer Science, pages 31--42, Venezia, Italy, 2000. Springer. Invited tutorial.
[ BibTex | Web page | PS ]
[BS00]: B. Bérard and L. Sierra. Comparing Verification with HyTech, Kronos and Uppaal on the Railroad Crossing Example. Research Report LSV-00-2, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2000.
[ BibTex | Web page | PS ]
[CP00]: S. Christensen and L. Petrucci. Modular Analysis of Petri Nets. The Computer Journal, 43(3):224--242, 2000.
[ BibTex | Web page | PS ]
[LS00a]: F. Laroussinie and Ph. Schnoebelen. Specification in CTL+Past for verification in CTL. Information and Computation, 156(1-2):236--263, January 2000.
doi: 10.1006/inco.1999.2817.
[ BibTex | DOI | Web page | PS ]
[LS00c]: I. A. Lomazova and Ph. Schnoebelen. Some Decidability Results for Nested Petri Nets. In Proceedings of the 3rd International Andrei Ershov Memorial Conference on Perspectives of System Informatics (PSI'99), volume 1755 of Lecture Notes in Computer Science, pages 208--220, Novosibirsk, Russia, 2000. Springer.
[ BibTex | Web page | PS ]
[Lar00]: F. Laroussinie. HCMC: An Extension of CMC for Hybrid Systems. Available at http://www.lsv.ens-cachan.fr/~fl/cmcweb.html, 2000. See [CL00] for description. Written in C++ (about 26000 lines).
[ BibTex | Web page ]
[CDJK99]: H. Comon, M. Dincbas, J.-P. Jouannaud, and C. Kirchner. A Methodological View of Constraint Solving. Constraints, 4(4):337--361, December 1999.
[ BibTex | Web page | PS ]
[Mey99]: R. Meyer. Contributions à l'étude des logiques temporelles sur les traces. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 1999.
[ BibTex | Web page | PS ]
[Jur99]: Y. Jurski. Expression de la relation binaire d'accessibilité pour les automates à compteurs plats et les automates temporisés. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, October 1999.
[ BibTex | Web page | PS ]
[BHTW99]: M. Bidoit, R. Hennicker, F. Tort, and M. Wirsing. Correct Realization of Interface Constraints with OCL. In Proceedings of the 2nd International Conference on the Unified Modeling Language (UML'99), volume 1723 of Lecture Notes in Computer Science, pages 399--415, Fort Collins, Colorado, USA, October 1999. Springer.
[ BibTex | Web page | PS ]
[Wil99]: N. Williams-Preston. New Type Signatures for Legacy Fortran Subroutines. In Proceedings of the ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE'99), pages 76--85, Toulouse, France, September 1999. ACM Press.
[ BibTex | Web page | PS ]
[BBF99]: J. Beauquier, B. Bérard, and L. Fribourg. A New Rewrite Method for Proving Convergence of Self-Stabilizing Systems. In Proceedings of the 13th International Symposium on Distributed Computing (DISC'99), volume 1693 of Lecture Notes in Computer Science, pages 240--253, Bratislava, Slovak republic, September 1999. Springer.
[ BibTex | Web page | PS ]
[Bla99]: B. Blanc. Modélisation et spécification d'architectures logicielles. Rapport de DEA, DEA Programmation, Paris, France, September 1999.
[ BibTex | Web page | PS ]
[Cor99]: V. Cortier. Vérification de systèmes à compteurs. Rapport de DEA, DEA de Logique, Paris, France, September 1999.
[ BibTex | Web page | PS ]
[AL99]: L. Aceto and F. Laroussinie. Is your Model Checker on Time? In Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science (MFCS'99), volume 1672 of Lecture Notes in Computer Science, pages 125--136, Szklarska Poreba, Poland, September 1999. Springer.
[ BibTex | Web page | PS ]
[Ler99]: J. Leroux. Vérification des systèmes paramétrés. Rapport de DEA, DEA Algorithmique, Paris, France, September 1999.
[ BibTex ]
[BH99]: M. Bidoit and R. Hennicker. Observer Complete Definitions are Behaviourally Coherent. In Proceedings of the OBJ/CafeOBJ/Maude Workshop at Formal Methods (FM'99), pages 83--94, Toulouse, France, September 1999. Theta, Bucharest, Romania.
[ BibTex | Web page | PS ]
[Tur99]: M. Turuani. Logique temporelle temporisée pour la vérification de programmes : expressivité et complexité. Rapport de DEA, DEA Programmation, Paris, France, September 1999.
[ BibTex | Web page | PS ]
[BF99b]: B. Bérard and L. Fribourg. Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic. In Proceedings of the 10th International Conference on Concurrency Theory (CONCUR'99), volume 1664 of Lecture Notes in Computer Science, pages 178--193, Eindhoven, The Netherlands, August 1999. Springer.
[ BibTex | Web page | PS ]
[CJ99]: H. Comon and Y. Jurski. Timed Automata and the Theory of Real Numbers. In Proceedings of the 10th International Conference on Concurrency Theory (CONCUR'99), volume 1664 of Lecture Notes in Computer Science, pages 242--257, Eindhoven, The Netherlands, August 1999. Springer.
[ BibTex | Web page | PS ]
[DF99]: C. Dufourd and A. Finkel. A Polynomial λ-Bisimilar Normalization for Reset Petri Nets. Theoretical Computer Science, 222(1-2):187--194, July 1999.
[ BibTex | Web page | PS ]
[BP99]: P. Bouyer and A. Petit. Decomposition and Composition of Timed Automata. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP'99), volume 1644 of Lecture Notes in Computer Science, pages 210--219, Prague, Czech Republic, July 1999. Springer.
[ BibTex | Web page | PS ]
[BF99a]: B. Bérard and L. Fribourg. Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol. In Proceedings of the 11th International Conference on Computer Aided Verification (CAV'99), volume 1633 of Lecture Notes in Computer Science, pages 96--107, Trento, Italy, July 1999. Springer.
[ BibTex | Web page | PS ]
[CGJV99]: V. Cortier, H. Ganzinger, F. Jacquemard, and M. Veanes. Decidable Fragments of Simultaneous Rigid Reachability. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP'99), volume 1644 of Lecture Notes in Computer Science, pages 250--260, Prague, Czech Republic, July 1999. Springer.
[ BibTex | Web page | PS ]
[DJS99]: C. Dufourd, P. Jančar, and Ph. Schnoebelen. Boundedness of Reset P/T Nets. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP'99), volume 1644 of Lecture Notes in Computer Science, pages 301--310, Prague, Czech Republic, July 1999. Springer.
[ BibTex | Web page | PS ]
[EFM99]: J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS'99), pages 352--359, Trento, Italy, July 1999. IEEE Computer Society Press.
[ BibTex | Web page | PS ]
[MT99]: R. Meyer and P. S. Thiagarajan. LTrL Based Model-Checking for a Restricted Class of Signal Transition Graphs. In Proceedings of the 2nd International Workshop on Hardware Design and Petri Nets (HWPN'99), pages 3--14, Williamsburg, Virginia, USA, June 1999. Kluwer Academic Publishers.
[ BibTex ]
[CP99]: H. Comon and V. Padovani. Report on Specification Validation in Telecommunication Services. Contract report, June 1999.
[ BibTex ]
[PCLT99]: V. Padovani, H. Comon, J. Leneutre, and R. Tingaud. A Formal Verification of Telephone Supplementary Service Interactions. Research Report LSV-99-5, Laboratoire Spécification et Vérification, ENS Cachan, France, May 1999.
[ BibTex | Web page | PS ]
[SBB⁺99]: Ph. Schnoebelen, B. Bérard, M. Bidoit, F. Laroussinie, and A. Petit. Vérification de logiciels : techniques et outils du model-checking. Vuibert, April 1999.
[ BibTex | Web page ]
[Sut99]: G. Sutre. Vérification des automates à file réactifs : un modèle pour les systémes réactifs écrits en Electre. In Actes du 2ème Congrès sur la Modélisation des Systèmes Réactifs (MSR'99), pages 71--78, Cachan, France, March 1999. Hermès.
[ BibTex ]
[FMP99]: A. Finkel, P. McKenzie, and C. Picaronny. A Well-Structured Framework for Analysing Petri Net Extensions. Research Report LSV-99-2, Laboratoire Spécification et Vérification, ENS Cachan, France, February 1999.
[ BibTex | Web page | PS ]
[Sch99]: Ph. Schnoebelen. Decomposable Regular Languages and the Shuffle Operator. EATCS Bulletin, 67:283--289, February 1999.
[ BibTex | Web page | PS | PDF ]
[Pet99b]: L. Petrucci. Promela et Spin : exercices corrigés, 1999.
[ BibTex ]
[Pet99c]: L. Petrucci. Un exemple de langage parallèle asynchrone : Promela. Polycopié de cours, IEE, Évry, France, 1999.
[ BibTex ]
[Pet99a]: L. Petrucci. Promela et Spin : exercices. Polycopié, IEE, Évry, France, 1999.
[ BibTex ]
[HCRT99]: H. Hußmann, M. Cerioli, G. Reggio, and F. Tort. Abstract Data Types and UML Models. Technical Report DISI-TR-99-15, DISI, Universitá di Genova, Italy, 1999.
[ BibTex ]
[BST99]: M. Bidoit, D. Sannella, and A. Tarlecki. Architectural Specifications in CASL. In Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of Lecture Notes in Computer Science, pages 341--357, Amazonia, Brasil, January 1999. Springer.
[ BibTex | Web page | PS | PDF ]
[HB99]: R. Hennicker and M. Bidoit. Observational Logic. In Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of Lecture Notes in Computer Science, pages 263--277, Amazonia, Brasil, January 1999. Springer.
[ BibTex | Web page | PS ]
[BCH99]: M. Bidoit, M. V. Cengarle, and R. Hennicker. Proof systems for structured specifications and their refinements. In Algebraic Foundations of Systems Specification, chapter 11, pages 385--433. Springer, 1999.
[ BibTex | Web page | PS ]
[SFRC99]: G. Sutre, A. Finkel, O. F. Roux, and F. Cassez. Effective Recognizability and Model Checking of Reactive Fiffo Automata. In Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of Lecture Notes in Computer Science, pages 106--123, Amazonia, Brasil, January 1999. Springer.
[ BibTex | Web page | PS ]
[ABBL98]: L. Aceto, P. Bouyer, A. Burgueño, and K. G. Larsen. The Power of Reachability Testing for Timed Automata. In Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'98), volume 1530 of Lecture Notes in Computer Science, pages 245--256, Chennai, India, December 1998. Springer.
[ BibTex | Web page | PS ]
[CP98c]: H. Comon and V. Padovani. Specifications Consistency Verification. Final Report. Contract Report MAR/UAO/C/98/0080, December 1998. 280 pages.
[ BibTex ]
[BDGP98]: B. Bérard, V. Diekert, P. Gastin, and A. Petit. Characterization of the Expressive Power of Silent Transitions in Timed Automata. Fundamenta Informaticae, 36(2):145--182, November 1998.
[ BibTex | Web page | PS ]
[BH98]: M. Bidoit and R. Hennicker. Modular Correctness Proofs of Behavioural Implementations. Acta Informatica, 35(11):951--1005, November 1998.
doi: 10.1007/s002360050149.
[ BibTex | DOI ]
[LL98]: F. Laroussinie and K. G. Larsen. CMC: A Tool for Compositional Model-Checking of Real-Time Systems. In Proceedings of IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE'XI) and Protocol Specification, Testing and Verification (PSTV'XVIII), volume 135 of IFIP Conference Proceedings, pages 439--456, Paris, France, November 1998. Kluwer Academic Publishers.
[ BibTex | Web page | PS ]
[CDF98]: G. Cécé, P.-É. Deutsch, and A. Finkel. FORMAashSSCOP --- LSV, bilan de l'année 1998. Contract report, FORMA, November 1998.
[ BibTex ]
[Pet98]: A. Petit. Le model-checking, une technique de vérification en plein essor. Introduction. Contract report, EDF/DER/MOS - LSV, October 1998.
[ BibTex ]
[LPS98]: F. Laroussinie, A. Petit, and Ph. Schnoebelen. Le model-checking, une technique de vérification en plein essor. I --- Principes et techniques. Contract report, EDF/DER/MOS - LSV, October 1998.
[ BibTex ]
[Sch98a]: Ph. Schnoebelen. Le model-checking, une technique de vérification en plein essor. III --- Spécifier pour vérifier. Contract report, EDF/DER/MOS - LSV, October 1998.
[ BibTex ]
[BCD⁺98]: B. Bérard, G. Cécé, C. Dufourd, A. Finkel, F. Laroussinie, A. Petit, Ph. Schnoebelen, and G. Sutre. Le model-checking, une technique de vérification en plein essor. II --- Quelques outils. Contract report, EDF/DER/MOS - LSV, October 1998.
[ BibTex ]
[CP98b]: S. Christensen and L. Petrucci. How to Determine and Use Place Flows in Coloured Petri Nets. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (SMC 2000), pages 66--71, San Diego, California, USA, October 1998. Argos Press.
[ BibTex ]
[Duf98]: C. Dufourd. Réseaux de Petri avec ResetashTransfert : décidabilité et indécidabilité. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, October 1998.
[ BibTex | Web page | PS ]
[GMPW98]: G. Guaiana, R. Meyer, A. Petit, and P. Weil. An Extension of the Wreath Product Principle for Finite Mazurkiewicz Traces. Information Processing Letters, 67(6):277--282, September 1998.
[ BibTex | Web page | PS ]
[CP98d]: H. Comon and V. Padovani. Specifications Consistency Verification. Intermediate Report. Contract Report MAR/UAO/C/98/0051, September 1998.
[ BibTex ]
[LS98]: D. Lugiez and Ph. Schnoebelen. The Regular Viewpoint on PA-Processes. In Proceedings of the 9th International Conference on Concurrency Theory (CONCUR'98), volume 1466 of Lecture Notes in Computer Science, pages 50--66, Nice, France, September 1998. Springer.
doi: 10.1007/BFb0055615.
[ BibTex | DOI | Web page | PS | PDF ]
[DM98]: M. Duflot and N. Markey. Évaluation de l'outil UPPAAL sur le problème de l'ICC. Contract report, EDF/DER/MOS - LSV, September 1998.
[ BibTex ]
[GMP98]: P. Gastin, R. Meyer, and A. Petit. A (non-elementary) modular decision procedure for LTrL. In Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS'98), volume 1450 of Lecture Notes in Computer Science, pages 356--365, Brno, Czech Republic, August 1998. Springer.
[ BibTex | Web page | PS ]
[Fin98]: A. Finkel. Analyse des systèmes infinis bien structurés ou << reconnaissables >>. Invited tutorial, 3ème École d'été Modélisation et Vérification des Processus Parallèles (MOVEP'98), Nantes, France, July 1998.
[ BibTex ]
[Lab98]: A. Labroue. Conditions de vivacité dans les automates temporisés. Rapport de DEA, DEA Informatique, Orsay, France, July 1998.
[ BibTex | Web page | PS ]
[DFS98]: C. Dufourd, A. Finkel, and Ph. Schnoebelen. Reset Nets between Decidability and Undecidability. In Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP'98), volume 1443 of Lecture Notes in Computer Science, pages 103--115, Aalborg, Denmark, July 1998. Springer.
doi: 10.1007/BFb0055044.
[ BibTex | DOI | Web page | PS ]
[Sch98b]: Ph. Schnoebelen. Regular Tree Languages for Process Algebra. Invited lecture, 3rd International Workshop on Verification of Infinite State Systems (INFINITY'98), Aalborg, Denmark, July 1998.
[ BibTex ]
[BP98]: K. Barkaoui and L. Petrucci. Structural Analysis of Workflow Nets with Shared Resources. In Proceedings of Workflow Management: Net-Based Concepts, Models, Techniques and Tools (WFM'98), volume 98/7 of Computing Science Report, pages 82--95, Lisbon, Portugal, June 1998. Eindhoven University of Technology, Eindhoven, The Netherlands.
[ BibTex | Web page | PS ]
[AGP⁺98]: L. Albert, P. Gastin, B. Petazzoni, A. Petit, N. Puech, and P. Weil. Cours et exercices d'informatique, Classes préparatoires, premier et second cycles universitaires. Vuibert, June 1998.
[ BibTex ]
[Bou98]: P. Bouyer. Automates temporisés et modularité. Rapport de DEA, DEA Algorithmique, Paris, France, June 1998.
[ BibTex | Web page | PS ]
[CJ98b]: H. Comon and Y. Jurski. Multiple Counters Automata, Safety Analysis and Presburger Arithmetic. In Proceedings of the 10th International Conference on Computer Aided Verification (CAV'98), volume 1427 of Lecture Notes in Computer Science, pages 268--279, Vancouver, British Columbia, Canada, June 1998. Springer.
[ BibTex | Web page | PS ]
[CNNR98]: H. Comon, P. Narendran, R. Nieuwenhuis, and M. Rusinowitch. Decision Problems in Ordered Rewriting. In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS'98), pages 276--286, Indianapolis, Indiana, USA, June 1998. IEEE Computer Society Press.
[ BibTex | Web page | PS ]
[Com98b]: H. Comon. Completion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules. Journal of Symbolic Computation, 25(4):397--420, April 1998.
[ BibTex | Web page | PS ]
[Com98c]: H. Comon. Completion of Rewrite Systems with Membership Constraints. Part II: Constraint Solving. Journal of Symbolic Computation, 25(4):421--454, April 1998.
[ BibTex | Web page | PS ]
[FS98]: A. Finkel and Ph. Schnoebelen. Fundamental Structures in Well-Structured Infinite Transition Systems. In Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN'98), volume 1380 of Lecture Notes in Computer Science, pages 102--118, Campinas, Brasil, April 1998. Springer.
doi: 10.1007/BFb0054314.
[ BibTex | DOI | Web page | PS ]
[VF98]: M. Veloso Peixoto and L. Fribourg. Unfolding Parametric Automata. In Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN'98), volume 1380 of Lecture Notes in Computer Science, pages 88--101, Campinas, Brasil, April 1998. Springer.
[ BibTex ]
[Fri98]: L. Fribourg. A Closed-Form Evaluation for Extended Timed Automata. Research Report LSV-98-2, Laboratoire Spécification et Vérification, ENS Cachan, France, March 1998.
[ BibTex | Web page | PS ]
[Com98a]: H. Comon. About proofs by consistency. In Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA'98), volume 1379 of Lecture Notes in Computer Science, pages 136--137, Tsukuba, Japan, March 1998. Springer. Invited lecture.
[ BibTex ]
[Lar98]: F. Laroussinie. Analyse de l'ICC: modélisation. Contract report, EDF/DER/MOS - LSV, March 1998.
[ BibTex ]
[MP98]: R. Meyer and A. Petit. Expressive Completeness of LTrL on Finite Traces: An Algebraic Proof. In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS'98), volume 1373 of Lecture Notes in Computer Science, pages 533--543, Paris, France, February 1998. Springer.
[ BibTex ]
[DS98]: S. Demri and Ph. Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS'98), volume 1373 of Lecture Notes in Computer Science, pages 61--72, Paris, France, February 1998. Springer.
doi: 10.1007/BFb0028549.
[ BibTex | DOI | Web page | PS ]
[BF98]: Z. Bouziane and A. Finkel. The Equivalence Problem for Commutative Semigroups and Reversible Petri Nets is Complete in Exponential Space under Log-Lin Reducibility. In Proceedings of the International Conference in Semigroups and its Related Topics, pages 63--76, Kunming, China, 1998. Springer.
[ BibTex ]
[BBP98]: B. Bérard, M. Bidoit, and A. Petit. Recommandations sur le cahier des charges SRC. Contract report, EDF/DER/MOS - LSV, 1998.
[ BibTex ]
[CFG98]: Ch. Collet, A. Finkel, and R. Gherbi. CapRe: A Gaze Tracking System in Man-Machine Interaction. Journal of Advanced Computational Intelligence, 2(3):77--81, 1998.
[ BibTex | Web page | PS ]
[CP98a]: Ch. Cérin and A. Petit. Application of Algebraic Techniques to Compute the Efficiency Measure for Multithreaded Architecture. In Proceedings of the Workshop on Multithreaded Execution, Architecture and Compilation (MTEAC'98), Las Vegas, Nevada, USA, January 1998.
[ BibTex | Web page | PS ]
[Céc98]: G. Cécé. Vérification, analyse et approximations symboliques des automates communicants. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, January 1998.
[ BibTex | Web page | PS ]
[CJ98a]: H. Comon and Y. Jurski. Higher-order matching and tree automata. In Selected Papers from the 11th International Workshop on Computer Science Logic (CSL'97), volume 1414 of Lecture Notes in Computer Science, pages 157--176, Århus, Denmark, 1998. Springer. Invited lecture.
[ BibTex | Web page | PS ]
[Sif98]: J. Sifakis. Action FORMA. Bilan de la première année. Contract report, DSP-STTC/CNRS/MENRT, January 1998.
[ BibTex ]
[DF97]: C. Dufourd and A. Finkel. Polynomial-Time Many-One Reductions for Petri Nets. In Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'97), volume 1346 of Lecture Notes in Computer Science, pages 312--326, Kharagpur, India, December 1997. Springer.
[ BibTex | Web page | PS | PDF ]
[Wil97]: N. Williams-Preston. An Experiment in Reverse Engineering Using Algebraic Specifications. Research Report LSV-97-10, Laboratoire Spécification et Vérification, ENS Cachan, France, November 1997.
[ BibTex | Web page | PS | PDF ]
[BB97]: B. Bérard and M. Bidoit. Contribution du LSV à l'opération 2 << Étude de cas SRIC >>. Contract report, Action FORMA, October 1997. 29 pages.
[ BibTex ]
[CFG97b]: Ch. Collet, A. Finkel, and R. Gherbi. Gaze Capture System in Man-Machine Interaction. In Proceedings of the IEEE International Conference on Intelligent Engineering Systems (INES'97), pages 557--581, Budapest, Hungary, September 1997. IEEE Press.
[ BibTex | Web page | PS | PDF ]
[KS97a]: O. Kouchnarenko and Ph. Schnoebelen. A Formal Framework for the Analysis of Recursive-Parallel Programs. In Proceedings of the 4th International Conference on Parallel Computing Technologies (PaCT'97), volume 1277 of Lecture Notes in Computer Science, pages 45--59, Yaroslavl, Russia, September 1997. Springer.
doi: 10.1007/3-540-63371-5_6.
[ BibTex | DOI | Web page | PS | PDF ]
[LS97]: F. Laroussinie and Ph. Schnoebelen. Specification in CTL+Past, Verification in CTL. In Proceedings of the 4th International Workshop on Expressiveness in Concurrency (EXPRESS'97), volume 7 of Electronic Notes in Theoretical Computer Science, pages 161--184, Santa Margherita Ligure, Italy, September 1997. Elsevier Science Publishers.
doi: 10.1016/S1571-0661(05)80472-4.
[ BibTex | DOI | Web page | PS | PDF ]
[Sut97]: G. Sutre. Vérification de propriétés sur les automates à file réactifs produits par compilation de programmes Electre. Rapport de DEA, DEA Algorithmique, Paris, France, September 1997.
[ BibTex | Web page | PS | PDF ]
[BP97b]: B. Bérard and C. Picaronny. Accepting Zeno Words without Making Time Stand Still. In Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS'97), volume 1295 of Lecture Notes in Computer Science, pages 149--158, Bratislava, Slovakia, August 1997. Springer.
[ BibTex | Web page | PS | PDF ]
[MP97]: R. Meyer and A. Petit. Decomposition of TrPTL Formulas. In Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS'97), volume 1295 of Lecture Notes in Computer Science, pages 418--427, Bratislava, Slovakia, August 1997. Springer.
[ BibTex | Web page | PS | PDF ]
[FWW97]: A. Finkel, B. Willems, and P. Wolper. A Direct Symbolic Approach to Model Checking Pushdown Systems (Extended Abstract). In Proceedings of the 2nd International Workshop on Verification of Infinite State Systems (INFINITY'97), volume 9 of Electronic Notes in Theoretical Computer Science, pages 27--39, Bologna, Italy, July 1997. Elsevier Science Publishers.
[ BibTex | Web page | PS | PDF ]
[BF97]: Z. Bouziane and A. Finkel. Cyclic Petri Net Reachability Sets are Semi-Linear Effectively Constructible. In Proceedings of the 2nd International Workshop on Verification of Infinite State Systems (INFINITY'97), volume 9 of Electronic Notes in Theoretical Computer Science, pages 15--24, Bologna, Italy, July 1997. Elsevier Science Publishers.
[ BibTex | Web page | PS | PDF ]
[CJ97]: H. Comon and F. Jacquemard. Ground Reducibility is EXPTIME-Complete. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97), pages 26--34, Warsaw, Poland, July 1997. IEEE Computer Society Press.
[ BibTex | Web page | PS | PDF ]
[Com97a]: H. Comon. Applications of Tree Automata in Rewriting and Lambda-Calculus. Invited lecture, 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97), Warsaw, Poland, July 1997.
[ BibTex ]
[FO97b]: L. Fribourg and H. Olsén. Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic. In Proceedings of the 8th International Conference on Concurrency Theory (CONCUR'97), volume 1243 of Lecture Notes in Computer Science, pages 213--227, Warsaw, Poland, July 1997. Springer.
[ BibTex | Web page | PS | PDF ]
[FO97c]: L. Fribourg and H. Olsén. Reachability Sets of Parametrized Rings As Regular Languages. In Proceedings of the 2nd International Workshop on Verification of Infinite State Systems (INFINITY'97), volume 9 of Electronic Notes in Theoretical Computer Science, page 40, Bologna, Italy, July 1997. Elsevier Science Publishers.
[ BibTex | Web page | PS | PDF ]
[CF97]: G. Cécé and A. Finkel. Programs with Quasi-Stable Channels are Effectively Recognizable. In Proceedings of the 9th International Conference on Computer Aided Verification (CAV'97), volume 1254 of Lecture Notes in Computer Science, pages 304--315, Haifa, Israel, June 1997. Springer.
[ BibTex | Web page | PS | PDF ]
[BP97a]: F. Belala and L. Petrucci. Sémantique des ECATNets en termes de CPNets : application à un exemple de production. In Actes de la 1ère Conférence Francophone de Modélisation et de Simulation (MOSIM'97), Rouen, France, June 1997. Hermès.
[ BibTex ]
[MBBP97]: M. Maouche, M. Bettaz, G. Berthelot, and L. Petrucci. Du vrai parallélisme dans les réseaux algébriques et de son application dans les systèmes de production. In Actes de la 1ère Conférence Francophone de Modélisation et de Simulation (MOSIM'97), pages 417--424, Rouen, France, June 1997. Hermès.
[ BibTex ]
[Com97b]: H. Comon, editor. Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA'97), volume 1232 of Lecture Notes in Computer Science. Springer, June 1997.
[ BibTex | Web page ]
[Com97c]: H. Comon. Une approche logique des contrôles logiques. Rapport de contrat EDF/DER/MOS--LSV, June 1997.
[ BibTex ]
[BPR97]: M. Bidoit, Ch. Pellen, and J. Ryckbosch. Plan de Défense --- Formalisation du cahier des charges du Point Central à l'aide de spécifications algébriques. In Application des techniques formelles au logiciel, ARAGO 20, chapter 7, pages 123--132. Observatoire Français des Techniques Avancées, June 1997.
[ BibTex ]
[CFG97a]: Ch. Collet, A. Finkel, and R. Gherbi. CapRe : un système de capture du regard dans un contexte d'interaction homme-machine. In Actes des 6èmes Journées Internationales Interfaces, pages 36--39, Montpellier, France, May 1997.
[ BibTex | Web page | PS | PDF ]
[Duf97]: C. Dufourd. Une extension d'un résultat d'indécidabilité pour les automates temporisés. In Actes des 9èmes Rencontres Francophones du Parallélisme (RENPAR'97), pages 219--222, Lausanne, Switzerland, May 1997.
[ BibTex | Web page | PS | PDF ]
[Céc97]: G. Cécé. Les programmes utilisant des canaux quasi-stables sont effectivement reconnaissables. In Actes des 9èmes Rencontres Francophones du Parallélisme (RENPAR'97), pages 215--218, Lausanne, Switzerland, May 1997.
[ BibTex ]
[CT97]: H. Comon and R. Treinen. The First-Order Theory of Lexicographic Path Orderings is Undecidable. Theoretical Computer Science, 176(1-2):67--87, April 1997.
[ BibTex | Web page | PS | PDF ]
[KLL⁺97]: K. J. Kristoffersen, F. Laroussinie, K. G. Larsen, P. Pettersson, and W. Yi. A Compositional Proof of a Real-Time Mutual Exclusion Protocol. In Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development (TAPSOFT'97), volume 1214 of Lecture Notes in Computer Science, pages 565--579, Lille, France, April 1997. Springer.
doi: 10.1007/BFb0030626.
[ BibTex | DOI | Web page | PS | PDF ]
[BD97]: M. Bidoit and M. Dauchet, editors. Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development (TAPSOFT'97), volume 1214 of Lecture Notes in Computer Science. Lille, France, Springer, April 1997.
[ BibTex | Web page ]
[Fin97]: A. Finkel. Algorithms and Semi-Algorithms for Infinite State Systems. In Proceedings of the Grenoble-Alpes d'Huez European School of Computer Science, Methods and Tools for the Verification of Infinite State Systems, pages 189--190, Grenoble, France, March 1997. Invited tutorial.
[ BibTex ]
[FM97]: A. Finkel and P. McKenzie. Verifying Identical Communicating Processes is Undecidable. Theoretical Computer Science, 174(1-2):217--230, March 1997.
[ BibTex | Web page | PS | PDF ]
[DGP97]: V. Diekert, P. Gastin, and A. Petit. Removing ε-Transitions in Timed Automata. In Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS'97), volume 1200 of Lecture Notes in Computer Science, pages 583--594, Lübeck, Germany, February 1997. Springer.
[ BibTex | Web page | PS | PDF ]
[HWB97]: R. Hennicker, M. Wirsing, and M. Bidoit. Proof Systems for Structured Specifications with Observability Operators. Theoretical Computer Science, 173(2):393--443, February 1997.
[ BibTex ]
[CFG97c]: Ch. Collet, A. Finkel, and R. Gherbi. Prise en compte dynamique des attitudes perceptive de l'usager. Rapport de synthèse (version IV de l'Action Inter-PRC 10.2 GDR-PRC ISIS & CHM : << Interaction Système-Environnement pour l'Interprétation des Signaux et des Images >>, 1997.
[ BibTex ]
[CCP97]: B. Charron-Bost, R. Cori, and A. Petit. Introduction à l'algorithmique en mémoire partagée. RAIRO Informatique Théorique et Applications, 31(2):97--148, 1997.
[ BibTex | Web page | PS | PDF ]
[BCK⁺97]: J.-C. Bajard, H. Comon, C. Kenyon, D. Krob, M. Morvan, J.-M. Muller, A. Petit, and Y. Robert. Exercices d'algorithmique (oraux d'ENS). Vuibert, January 1997.
[ BibTex ]
[KS97b]: O. Kouchnarenko and Ph. Schnoebelen. A Model for Recursive-Parallel Programs. In Proceedings of the 1st International Workshop on Verification of Infinite State Systems (INFINITY'96), volume 5 of Electronic Notes in Theoretical Computer Science, page 30, Pisa, Italy, 1997. Elsevier Science Publishers.
doi: 10.1016/S1571-0661(05)82512-5.
[ BibTex | DOI | Web page | PS | PDF ]
[FO97a]: L. Fribourg and H. Olsén. A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters. Constraints, 2(3-4):305--335, 1997.
[ BibTex | Web page | PS | PDF ]
[LS96]: F. Laroussinie and Ph. Schnoebelen. Translations for Model-Checking Temporal Logic with Past. In Actes des 5èmes Journées sur la Formalisation des Activités Concurrentes (FAC'96), pages 17--19, Toulouse, France, February 1996. Invited talk.
[ BibTex ]
[SL95]: Ph. Schnoebelen and F. Laroussinie. Temporal Logic with Past for the Specification and Verification of Reactive Systems. In Proceedings of the Conference Problèmes Actuels des Sciences Naturelles et Humaines, pages 143--146, Yaroslavl, Russia, November 1995. Yaroslavl University Press. Invited talk.
[ BibTex ]
[Fri91]: L. Fribourg. Automatic Generation of Simplification Lemmas for Inductive Proofs. In Proceedings of the 8th International Conference on Logic Programming (ICLP'91), pages 103--116, San Diego, California, USA, October 1991. MIT Press.
[ BibTex ]
[CF91]: P. H. Cheong and L. Fribourg. Efficient Integration of Simplification into Prolog. In Proceedings of the 3rd International Symposium on Programming Language Implementation and Logic Programming (PLILP'91), volume 528 of Lecture Notes in Computer Science, pages 359--370, Passau, Germany, August 1991. Springer-Verlag.
[ BibTex ]
[BS90]: Z. Belmesk and Ph. Schnoebelen. Une généralisation des présentations FP2 basée sur la théorie des réseaux. Research Report 832-I, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, November 1990.
[ BibTex ]
[Fri90a]: L. Fribourg. Contribution à la vérification des programmes logiques. Mémoire d'habilitation, Université Paris 7, Paris, France, October 1990.
[ BibTex ]
[Sch90]: Ph. Schnoebelen. Congruence Properties of the Process Equivalence Induced by Temporal Logic. Research Report 831-I, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, October 1990.
[ BibTex ]
[Fri90c]: L. Fribourg. A New Presburger Arithmetic Decision Procedure Based on Extended Prolog Execution. In Proceedings of the 2nd International Workshop on Programming Language Implementation and Logic Programming (PLILP'90), volume 456 of Lecture Notes in Computer Science, pages 174--188, Linköping, Sweden, August 1990. Springer-Verlag.
[ BibTex ]
[Fri90b]: L. Fribourg. Extracting Logic Programs from Proofs that use Extended Prolog Execution and Induction. In Proceedings of the 7th International Conference on Logic Programming (ICLP'90), pages 685--699, Jerusalem, Israel, June 1990. MIT Press.
[ BibTex ]
[JHI⁺89]: Ph. Jorrand, J.-M. Hufflen, M. B. Ibáñez, T. Karasek, S. Rogé, Ph. Schnoebelen, and A. Véron. Parallel Specification of the Connection Method on an FP2 Machine. Esprit Project 415, Deliverable D17, October 1989.
[ BibTex ]
[Fri89b]: L. Fribourg. A Strong Restriction of the Inductive Completion Procedure. Journal of Symbolic Computation, 8(3):253--276, September 1989.
[ BibTex ]
[Fri89a]: L. Fribourg. Proofs by Combinatory Induction on Recursively Reducible Expressions. In Resolution of Equations in Algebraic Structures, chapter 5, pages 117--141. Academic Press, March 1989.
[ BibTex ]
[Fri88b]: L. Fribourg. Functional Extensions to Prolog: Are They Needed? In Proceedings of the 1st International Workshop on Algebraic and Logic Programming (ALP'88), volume 343 of Lecture Notes in Computer Science, pages 21--29, Gaussig, German Democratic Republic, November 1988. Springer-Verlag. Invited paper.
[ BibTex ]
[Fri88a]: L. Fribourg. Equivalence-Preserving Transformations of Inductive Properties of Prolog Programs. In Proceedings of the 5th International Conference and Symposium on Logic Programming (ICLP/SLP'88), pages 893--908, Seattle, Washington, USA, August 1988. MIT Press.
[ BibTex ]
[SLC88]: Ph. Schnoebelen, D. Lugiez, and H. Comon. A Semantics for Polymorphic Subtypes in Computer Algebra. Research Report 711, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, March 1988.
[ BibTex ]
[BCFG86]: L. Bougé, N. Choquet, L. Fribourg, and M.-C. Gaudel. Test Sets Generation From Algebraic Specifications Using Logic Programming. Journal of Systems and Software, 6(4):343--360, November 1986.
[ BibTex ]
[Fri86]: L. Fribourg. A Strong Restriction of the Inductive Completion Procedure. In Proceedings of the 13th International Colloquium on Automata, Languages and Programming (ICALP'86), volume 226 of Lecture Notes in Computer Science, pages 105--115, Rennes, France, July 1986. Springer-Verlag.
[ BibTex ]
[Sch86b]: Ph. Schnoebelen. μ-FP2: A Prototype Interpreter for FP2. Research Report 573, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, January 1986.
[ BibTex ]
[Sch86a]: Ph. Schnoebelen. About the Implementation of FP2. Research Report 574, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, January 1986.
[ BibTex ]
[Sch85a]: Ph. Schnoebelen. The Semantics of Concurrency in FP2. Research Report 558, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, October 1985.
[ BibTex ]
[Fri85a]: L. Fribourg. SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. In Proceedings of the 2nd IEEE Symposium on Logic Programming (SLP'85), pages 172--184, Boston, Massachusetts, USA, July 1985. IEEE Computer Society Press.
[ BibTex ]
[Sch85b]: Ph. Schnoebelen. Sémantique du parallélisme en FP2. Rapport de DEA, Université de Grenoble, France, June 1985.
[ BibTex ]
[CFM85]: N. Choquet, L. Fribourg, and A. Mauboussin. Runnable Protocol Specifications Using the Logic Interpreter SLOG. In Proceedings of the IFIP WG6.1 5th International Conference on Protocol Specification, Testing and Verification (PSTV'85), pages 149--168, Toulouse-Moissac, France, June 1985. North-Holland.
[ BibTex ]
[JHM⁺85]: Ph. Jorrand, J.-M. Hufflen, A. Marty, J.- Ch. Marty, and Ph. Schnoebelen. FP2: The Language and its Formal Definition. Research Report 537, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, May 1985.
[ BibTex ]
[BCFG85]: L. Bougé, N. Choquet, L. Fribourg, and M.-C. Gaudel. Application of Prolog to Test Sets Generation from Algebraic Specifications. In Proceedings of the 1st International Joint Conference on Theory and Practice of Software Development (TAPSOFT'89), Volume 2: Colloquium on Software Engineering (CSE), volume 186 of Lecture Notes in Computer Science, pages 261--275, Berlin, Germany, March 1985. Springer-Verlag.
[ BibTex ]
[Fri85b]: L. Fribourg. A Superposition Oriented Theorem Prover. Theoretical Computer Science, 35(2-3):129--164, February 1985.
[ BibTex ]
[Fri84c]: L. Fribourg. Oriented Equational Clauses as a Programming Language. Journal of Logic Programming, 1(2):165--177, August 1984.
[ BibTex ]
[Fri84b]: L. Fribourg. Oriented Equational Clauses as a Programming Language. In Proceedings of the 11th International Colloquium on Automata, Languages and Programming (ICALP'84), volume 172 of Lecture Notes in Computer Science, pages 162--173, Antwerp, Belgium, July 1984. Springer-Verlag.
[ BibTex ]
[Fri84a]: L. Fribourg. A Narrowing Procedure for Theories with Constructors. In Proceedings of the 7th International Conference on Automated Deduction (CADE'84), volume 170 of Lecture Notes in Computer Science, pages 259--281, Napa, California, USA, May 1984. Springer-Verlag.
[ BibTex ]
[Fri83]: L. Fribourg. A Superposition Oriented Theorem Prover. In Proceedings of the 8th International Joint Conference on Artificial Intelligence (IJCAI'83), pages 923--925, Karlsruhe, West Germany, August 1983. William Kaufmann.
[ BibTex ]
[Fri82]: L. Fribourg. Démonstration automatique: réfutation par superposition de clauses équationnelles. Thèse de doctorat, Université Paris 7, Paris, France, September 1982.
[ BibTex ]

This file was generated by bibtex2html 1.98.

Publications : LSV

About LSV