Publications : 2015

[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 ]

This file was generated by bibtex2html 1.98.

About LSV