Publications : 2011

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

This file was generated by bibtex2html 1.98.