Publications : 2008

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

This file was generated by bibtex2html 1.98.