Publications : 2007

[BG07]

E. Bursztein and J. Goubault-Larrecq. A Logical Framework for Evaluating Network Resilience Against Faults and Attacks. In Proceedings of the 12th Asian Computing Science Conference (ASIAN'07), volume 4846 of Lecture Notes in Computer Science, pages 212--227, Doha, Qatar, December 2007. Springer.
doi: 10.1007/978-3-540-76929-3_20.
[ BibTex | DOI | Web page | PDF ]

[ABG07]

S. Akshay, B. Bollig, and P. Gastin. Automata and Logics for Timed Message Sequence Charts. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 290--302, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_24.
[ BibTex | DOI | Web page | PS | PDF ]

[CS07]

P. Chambart and Ph. Schnoebelen. Post Embedding Problem is not Primitive Recursive, with Applications to Channel Systems. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 265--276, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_22.
[ BibTex | DOI | Web page | PS | PDF ]

[CDD07]

V. Cortier, J. Delaitre, and S. Delaune. Safely Composing Security Protocols. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 352--363, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_29.
[ BibTex | DOI | Web page | PDF ]

[BBB⁺07]

C. Baier, N. Bertrand, P. Bouyer, Th. Brihaye, and M. Größer. Probabilistic and Topological Semantics for Timed Automata. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 179--191, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_15.
[ BibTex | DOI | Web page | PDF ]

[BKM07]

B. Bollig, D. Kuske, and I. Meinecke. Propositional Dynamic Logic for Message-Passing Systems. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 303--315, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_25.
[ BibTex | DOI | Web page | PS | PDF ]

[DKR07]

S. Delaune, S. Kremer, and M. D. Ryan. Symbolic Bisimulation for the Applied Pi-Calculus. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 133--145, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_11.
[ BibTex | DOI | Web page | PDF ]

[BBS07]

C. Baier, N. Bertrand, and Ph. Schnoebelen. Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Transactions on Computational Logic, 9(1), December 2007.
doi: 10.1145/1297658.1297663.
[ BibTex | DOI | Web page | PS | PDF ]

[Car07]

J.-L. Carré. Réécriture, confluence. Course notes, Préparation à l'agrégation, ENS Cachan, France, December 2007.
[ BibTex ]

[Bur07a]

E. Bursztein. NetQi v1rc1. Available at http://www.netqi.org/, December 2007. Written in C and Java (about 10000 lines).
[ BibTex | Web page ]

[Gas07a]

R. Gascon. Spécification et vérification de propriétés quantitatives sur des automates à contraintes. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2007.
[ BibTex | Web page | PS | PDF ]

[GPT07]

J. Goubault-Larrecq, C. Palamidessi, and A. Troina. A Probabilistic Applied Pi-Calculus. In Proceedings of the 5th Asian Symposium on Programming Languages and Systems (APLAS'07), volume 4807 of Lecture Notes in Computer Science, pages 175--290, Singapore, November-December 2007. Springer.
doi: 10.1007/978-3-540-76637-7_12.
[ BibTex | DOI | Web page | PDF ]

[GK07]

P. Gastin and D. Kuske. Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces. Fundamenta Informaticae, 80(1-3):169--197, November 2007.
[ BibTex | Web page | PDF ]

[CDG⁺07]

H. Comon-Lundh, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. November 2007.
[ BibTex | Web page ]

[Gas07b]

P. Gastin. Algorithmique. Course notes, Magistère STIC, ENS Cachan, France, November 2007.
[ BibTex ]

[Bur07b]

E. Bursztein. Time has something to tell us about network address translation. In Proceedings of the 12th Nordic Workshop on Secure IT Systems (NordSec'07), Reykjavik, Iceland, October 2007.
[ BibTex | Web page | PDF ]

[JR07]

F. Jacquemard and M. Rusinowitch. Rewrite Closure of Hedge-Automata Languages. Research Report LSV-07-31, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2007. 22 pages.
[ BibTex | Web page | PDF ]

[HIRV07]

P. Habermehl, R. Iosif, A. Rogalewicz, and T. Vojnar. Proving Termination of Tree Manipulating Programs. In Proceedings of the 5th International Symposium on Automated Technology for Verification and Analysis (ATVA'07), volume 4762 of Lecture Notes in Computer Science, pages 145--161, Tokyo, Japan, October 2007. Springer.
doi: 10.1007/978-3-540-75596-8_12.
[ BibTex | DOI | Web page | PS | PDF ]

[DR07]

S. Demri and A. Rabinovich. The complexity of temporal logic with until and since over ordinals. In Proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'07), volume 4790 of Lecture Notes in Artificial Intelligence, pages 531--545, Yerevan, Armenia, October 2007. Springer.
doi: 10.1007/978-3-540-75560-9_38.
[ BibTex | DOI | Web page | PDF ]

[DLL07]

S. Delaune, H. Lin, and Ch. Lynch. Protocol verification via rigidashflexible resolution. In Proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'07), volume 4790 of Lecture Notes in Artificial Intelligence, pages 242--256, Yerevan, Armenia, October 2007. Springer.
doi: 10.1007/978-3-540-75560-9_19.
[ BibTex | DOI | Web page | PDF ]

[CD07]

V. Cortier and S. Delaune. Deciding Knowledge in Security Protocols for Monoidal Equational Theories. In Proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'07), volume 4790 of Lecture Notes in Artificial Intelligence, pages 196--210, Yerevan, Armenia, October 2007. Springer.
doi: 10.1007/978-3-540-75560-9_16.
[ BibTex | DOI | Web page | PS | PDF ]

[CDP07]

F. Chevalier, D. D'Souza, and P. Prabhakar. Counter-free Input Determined Timed Automata. In Proceedings of the 5th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'07), volume 4763 of Lecture Notes in Computer Science, pages 82--97, Salzburg, Austria, October 2007. Springer.
doi: 10.1007/978-3-540-75454-1_8.
[ BibTex | DOI | Web page | PS | PDF ]

[BM07b]

P. Bouyer and N. Markey. Costs are Expensive! In Proceedings of the 5th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'07), volume 4763 of Lecture Notes in Computer Science, pages 53--68, Salzburg, Austria, October 2007. Springer.
doi: 10.1007/978-3-540-75454-1_6.
[ BibTex | DOI | Web page | PS | PDF ]

[Laf07d]

P. Lafourcade. Rapport final d'activité à 11 mois, contrat CNRS/DGA référence : 06 60 019 00 470 75 01 << Utilisation et exploitation des théories équationnelles dans l'analyse des protocoles cryptographiques >>. Contract report, DGA, October 2007. 6 pages.
[ BibTex | Web page | PS ]

[BGP07]

B. Bérard, P. Gastin, and A. Petit. Timed substitutions for regular signal-event languages. Formal Methods in System Design, 31(2):101--134, October 2007.
doi: 10.1007/s10703-007-0034-5.
[ BibTex | DOI | Web page | PDF ]

[BBBR07]

P. Bouyer, Th. Brihaye, V. Bruyère, and J.-F. Raskin. On the optimal reachability problem on weighted timed automata. Formal Methods in System Design, 31(2):135--175, October 2007.
doi: 10.1007/s10703-007-0035-4.
[ BibTex | DOI | Web page | PS | PDF ]

[Pro07]

A. ProNoBis. ProNoBis: Probability and Nondeterminism, Bisimulations and Security -- Rapport Final, October 2007.
[ BibTex | Web page | PDF ]

[GL07]

J. Goubault-Larrecq. Pronobis: Probability and nondeterminism, bisimulations and security. Rapport final ARC ProNoBis, October 2007.
[ BibTex ]

[Cha07]

P. Chambart. Canaux fiables et non-fiables : frontières de la décidabilité. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2007.
[ BibTex | Web page | PDF ]

[Da 07]

A. Da Costa. Propriétés de jeux multi-agents. Rapport de Master, Master de Logique Mathématique et Fondements de l'Informatique, Paris, France, September 2007.
[ BibTex | Web page | PDF ]

[Vil07]

J. Villard. Logique spatiale pour le pi-calcul appliqué. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2007.
[ BibTex | Web page | PDF ]

[Vac07]

C. Vacher. Accessibilité inverse dans les automates d'arbres à mémoire d'ordre supérieur. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2007.
[ BibTex | Web page | PDF ]

[CL07]

C. Cremers and P. Lafourcade. Comparing State Spaces in Automatic Security Protocol Verification. In Pre-proceedings of the 7th International Workshop on Automated Verification of Critical Systems (AVoCS'07), Oxford, UK, September 2007.
[ BibTex | Web page | PDF ]

[AMNK07]

S. Akshay, M. Mukund, and K. Narayan Kumar. Checking Coverage for Infinite Collections of Timed Scenarios. In Proceedings of the 18th International Conference on Concurrency Theory (CONCUR'07), volume 4703 of Lecture Notes in Computer Science, pages 181--196, Lisbon, Portugal, September 2007. Springer.
doi: 10.1007/978-3-540-74407-8_13.
[ BibTex | DOI | Web page | PDF ]

[ACD07]

M. Arnaud, V. Cortier, and S. Delaune. Combining algorithms for deciding knowledge in security protocols. In Proceedings of the 6th International Symposium on Frontiers of Combining Systems (FroCoS'07), volume 4720 of Lecture Notes in Artificial Intelligence, pages 103--117, Liverpool, UK, September 2007. Springer.
doi: 10.1007/978-3-540-74621-8_7.
[ BibTex | DOI | Web page | PS | PDF ]

[KM07]

S. Kremer and L. Mazaré. Adaptive Soundness of Static Equivalence. In Proceedings of the 12th European Symposium on Research in Computer Security (ESORICS'07), volume 4734 of Lecture Notes in Computer Science, pages 610--625, Dresden, Germany, September 2007. Springer.
doi: 10.1007/978-3-540-74835-9_40.
[ BibTex | DOI | Web page | PDF ]

[BLMO07]

Th. Brihaye, F. Laroussinie, N. Markey, and G. Oreiby. Timed Concurrent Game Structures. In Proceedings of the 18th International Conference on Concurrency Theory (CONCUR'07), volume 4703 of Lecture Notes in Computer Science, pages 445--459, Lisbon, Portugal, September 2007. Springer.
doi: 10.1007/978-3-540-74407-8_30.
[ BibTex | DOI | Web page | PS | PDF ]

[Gou07c]

J. Goubault-Larrecq. Continuous Previsions. In Proceedings of the 16th Annual EACSL Conference on Computer Science Logic (CSL'07), volume 4646 of Lecture Notes in Computer Science, pages 542--557, Lausanne, Switzerland, September 2007. Springer.
doi: 10.1007/978-3-540-74915-8_40.
[ BibTex | DOI | Web page | PDF ]

[OBRS07]

A. Ourghanlian, M. Bozga, A. Roglewicz, and A. Sangnier. Projet RNTL Averiles -- Fourniture F1.6 : Expérimentation, September 2007. 16 pages.
[ BibTex | Web page | PDF ]

[LLV07]

LIAFA, LSV, and Verimag. Projet RNTL Averiles -- Fourniture F1.4 : Prototypes d'outil, September 2007. 3 pages.
[ BibTex | Web page | PDF ]

[LCE⁺07c]

LIAFA, CRIL Technology, EDF R&D, LSV, and Verimag. Projet RNTL Averiles -- Fourniture F1.3 : Algorithmes de vérification, September 2007. 19 pages.
[ BibTex | Web page | PDF ]

[LCE⁺07b]

LIAFA, CRIL Technology, EDF R&D, LSV, and Verimag. Projet RNTL Averiles -- Fourniture F1.2 : Extraction de modèles, September 2007. 19 pages.
[ BibTex | Web page | PDF ]

[LCE⁺07a]

LIAFA, CRIL Technology, EDF R&D, LSV, and Verimag. Projet RNTL Averiles -- Fourniture F1.1 : Modèles, September 2007. 6 pages.
[ BibTex | Web page | PDF ]

[LCE⁺07d]

LIAFA, CRIL Technology, EDF R&D, LSV, and Verimag. Rapport à mi-parcours du projet RNTL Averiles (analyse et vérification de logiciels embarqués avec structures de mémoire dynamique, September 2007. 4 pages.
[ BibTex | Web page | PDF ]

[BHJS07]

A. Bouajjani, P. Habermehl, Y. Jurski, and M. Sighireanu. Rewriting Systems with Data -- A Framework for Reasoning About Systems with Unbounded Structures over Infinite Data Domains. In Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT'07), volume 4639 of Lecture Notes in Computer Science, pages 1--22, Budapest, Hungary, August 2007. Springer.
doi: 10.1007/978-3-540-74240-1_1.
[ BibTex | DOI | Web page | PS | PDF ]

[BGMNK07]

P. Bhateja, P. Gastin, M. Mukund, and K. Narayan Kumar. Local testing of message sequence charts is difficult. In Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT'07), volume 4639 of Lecture Notes in Computer Science, pages 76--87, Budapest, Hungary, August 2007. Springer.
doi: 10.1007/978-3-540-74240-1_8.
[ BibTex | DOI | Web page | PDF ]

[L⁺07]

F. Laroussinie et al. Projet DOTS (ANR-06-SETI-003) : Rapport à 6 mois, August 2007. 7 pages.
[ BibTex ]

[GO07]

P. Gastin and D. Oddoux. LTL2BA v1.1, August 2007. Written in C++ (about 4000 lines).
[ BibTex | Web page ]

[Laf07a]

P. Lafourcade. Intruder Deduction for the Equational Theory of phExclusive-or with Commutative and Distributive Encryption. In Proceedings of the 1st International Workshop on Security and Rewriting Techniques (SecReT'06), volume 171 of Electronic Notes in Theoretical Computer Science, pages 37--57, Venice, Italy, July 2007. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2007.02.054.
[ BibTex | DOI | Web page | PS | PDF ]

[BJ07b]

A. Bouhoula and F. Jacquemard. Verifying Regular Trace Properties of Security Protocols with Explicit Destructors and Implicit Induction. In Proceedings of the Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA'07), pages 27--44, Wroclaw, Poland, July 2007.
[ BibTex | Web page | PDF ]

[BE07]

C. Braunstein and E. Encrenaz. Using CTL formulae as component abstraction in a design and verification flow. In Proceedings of the 7th International Conference on Application of Concurrency to System Design (ACSD'07), pages 80--89, Bratislava, Slovak Republik, July 2007. IEEE Computer Society Press.
doi: 10.1109/ACSD.2007.76.
[ BibTex | DOI | Web page | PDF ]

[NT07]

M. Nesi and R. Treinen, editors. Preliminary Proceedings of the 2nd International Workshop on Security and Rewriting Techniques (SecReT'07), Paris, France, July 2007.
[ BibTex ]

[GM07]

P. Gastin and P. Moro. Minimal counter-example generation for SPIN. In Proceedings of the 14th International SPIN Workshop on Model Checking Software (SPIN'07), volume 4595 of Lecture Notes in Computer Science, pages 24--38, Berlin, Germany, July 2007. Springer.
doi: 10.1007/978-3-540-73370-6_4.
[ BibTex | DOI | Web page | PS | PDF ]

[Gou07b]

J. Goubault-Larrecq. Continuous Capacities on Continuous State Spaces. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP'07), volume 4596 of Lecture Notes in Computer Science, pages 764--776, Wroclaw, Poland, July 2007. Springer.
doi: 10.1007/978-3-540-73420-8_66.
[ BibTex | DOI | Web page | PDF ]

[BHPR07]

Th. Brihaye, Th. A. Henzinger, V. Prabhu, and J.-F. Raskin. Minimum-Time Reachability in Timed Games. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP'07), volume 4596 of Lecture Notes in Computer Science, pages 825--837, Wroclaw, Poland, July 2007. Springer.
doi: 10.1007/978-3-540-73420-8_71.
[ BibTex | DOI | Web page | PS | PDF ]

[CDS07]

V. Cortier, S. Delaune, and G. Steel. A Formal Theory of Key Conjuring. In Proceedings of the 20th IEEE Computer Security Foundations Symposium (CSF'07), pages 79--93, Venice, Italy, July 2007. IEEE Computer Society Press.
doi: 10.1109/CSF.2007.5.
[ BibTex | DOI | Web page | PS | PDF ]

[Gou07d]

J. Goubault-Larrecq. On Noetherian Spaces. In Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS'07), pages 453--462, Wroclaw, Poland, July 2007. IEEE Computer Society Press.
doi: 10.1109/LICS.2007.34.
[ BibTex | DOI | Web page | PDF ]

[BMOW07]

P. Bouyer, N. Markey, J. Ouaknine, and J. Worrell. The Cost of Punctuality. In Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS'07), pages 109--118, Wroclaw, Poland, July 2007. IEEE Computer Society Press.
doi: 10.1109/LICS.2007.49.
[ BibTex | DOI | Web page | PS | PDF ]

[SC07]

G. Steel and J. Courant. A formal model for detecting parallel key search attacks. In Proceedings of the 3rd Workshop on Formal and Computational Cryptography (FCC'07), Venice, Italy, July 2007.
[ BibTex | Web page | PDF ]

[Sch07]

Ph. Schnoebelen. Model Checking Branching-Time Logics. In Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME'07), page 5, Alicante, Spain, June 2007. IEEE Computer Society Press.
doi: 10.1109/TIME.2007.52.
[ BibTex | DOI | Web page | PS | PDF ]

[BCD07b]

S. Bursuc, H. Comon-Lundh, and S. Delaune. Deducibility Constraints, Equational Theory and Electronic Money. In Rewriting, Computation and Proof --- Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday, volume 4600 of Lecture Notes in Computer Science, pages 196--212, Cachan, France, June 2007. Springer.
doi: 10.1007/978-3-540-73147-4_10.
[ BibTex | DOI | Web page | PS ]

[CKK07]

H. Comon-Lundh, C. Kirchner, and H. Kirchner, editors. Rewriting, Computation and Proof --- Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday, volume 4600 of Lecture Notes in Computer Science, Cachan, France, June 2007. Springer.
doi: 10.1007/978-3-540-73147-4.
[ BibTex | DOI | Web page ]

[Che07]

F. Chevalier. Logiques pour les systèmes temporisés : contrôle et expressivité. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2007.
[ BibTex | Web page | PS | PDF ]

[Rey07b]

P.-A. Reynier. Vérification de systèmes temporisés et distribués : modèles, algorithmes et implémentabilité. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2007.
[ BibTex | Web page | PS | PDF ]

[Dem07]

S. Demri. Logiques pour la spécification et vérification. Mémoire d'habilitation, Université Paris 7, Paris, France, June 2007.
[ BibTex | Web page | PDF ]

[Enc07]

E. Encrenaz-Tiphène. Contributions pour la conception et la vérification de systèmes matériels embarqués. Mémoire d'habilitation, Université Paris 6, Paris, France, June 2007.
[ BibTex | Web page | PDF ]

[Boz07]

L. Bozzelli. Complexity results on branching-time pushdown model checking. Theoretical Computer Science, 379(1-2):286--297, June 2007.
doi: 10.1016/j.tcs.2007.03.049.
[ BibTex | DOI | Web page | PDF ]

[DG07a]

S. Demri and R. Gascon. The Effects of Bounding Syntactic Resources on Presburger LTL (Extended Abstract). In Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME'07), pages 94--104, Alicante, Spain, June 2007. IEEE Computer Society Press.
doi: 10.1109/TIME.2007.63.
[ BibTex | DOI | Web page | PDF ]

[BDL07b]

R. Brochenin, S. Demri, and É. Lozes. Reasoning about sequences of memory states. In Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS'07), volume 4514 of Lecture Notes in Computer Science, pages 100--114, New York, New York, USA, June 2007. Springer.
doi: 10.1007/978-3-540-72734-7_8.
[ BibTex | DOI | Web page | PDF ]

[LS07]

F. Laroussinie and J. Sproston. State Explosion in Almost-Sure Probabilistic Reachability. Information Processing Letters, 102(6):236--241, June 2007.
doi: 10.1016/j.ipl.2007.01.003.
[ BibTex | DOI | Web page | PDF ]

[BM07a]

B. Bollig and I. Meinecke. Weighted Distributed Systems and Their Logics. In Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS'07), volume 4514 of Lecture Notes in Computer Science, pages 54--68, New York, New York, USA, June 2007. Springer.
doi: 10.1007/978-3-540-72734-7_5.
[ BibTex | DOI | Web page | PS | PDF ]

[DDG07]

S. Demri, D. D'Souza, and R. Gascon. Decidable Temporal Logic with Repeating Values. In Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS'07), volume 4514 of Lecture Notes in Computer Science, pages 180--194, New York, New York, USA, June 2007. Springer.
doi: 10.1007/978-3-540-72734-7_13.
[ BibTex | DOI | Web page | PDF ]

[BBC07]

P. Bouyer, Th. Brihaye, and F. Chevalier. Weighted O-Minimal Hybrid Systems are more Decidable than Weighted Timed Automata! In Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS'07), volume 4514 of Lecture Notes in Computer Science, pages 69--83, New York, New York, USA, June 2007. Springer.
doi: 10.1007/978-3-540-72734-7_6.
[ BibTex | DOI | Web page | PS | PDF ]

[VG07]

K. N. Verma and J. Goubault-Larrecq. Alternating Two-Way AC-Tree Automata. Information and Computation, 205(6):817--869, June 2007.
doi: 10.1016/j.ic.2006.12.006.
[ BibTex | DOI | Web page | PS | PDF ]

[DG07b]

M. Droste and P. Gastin. Weighted automata and weighted logics. Theoretical Computer Science, 380(1-2):69--86, June 2007.
doi: 10.1016/j.tcs.2007.02.055.
[ BibTex | DOI | Web page | PS | PDF ]

[DK07]

S. Delaune and F. Klay. Synthèse des expérimentations. Technical Report 10, projet RNTL PROUVÉ, May 2007. 10 pages.
[ BibTex | Web page | PDF ]

[CDFP07]

N. Chamseddine, M. Duflot, L. Fribourg, and C. Picaronny. Determinate Probabilistic Timed Automata as Markov Chains with Parametric Costs. Research Report LSV-07-21, Laboratoire Spécification et Vérification, ENS Cachan, France, May 2007. 17 pages.
[ BibTex | Web page | PDF ]

[Bre07]

R. Bresciani. The ZRTP Protocol --- Security Considerations. Research Report LSV-07-20, Laboratoire Spécification et Vérification, ENS Cachan, France, May 2007. 23 pages.
[ BibTex | Web page | PS | PDF ]

[Gas07c]

P. Gastin. Langages formels. Course notes, Magistère STIC, ENS Cachan, France, May 2007.
[ BibTex ]

[Laf07c]

P. Lafourcade. Rapport d'activités à 6 mois, contrat CNRS/DGA référence : 06 60 019 00 470 75 01 << Utilisation et exploitation des théories équationnelles dans l'analyse des protocoles cryptographiques >>. Contract report, DGA, April 2007. 5 pages.
[ BibTex | Web page | PS ]

[LLT07]

P. Lafourcade, D. Lugiez, and R. Treinen. Intruder Deduction for the Equational Theory of Abelian Groups with Distributive Encryption. Information and Computation, 205(4):581--623, April 2007.
doi: 10.1016/j.ic.2006.10.008.
[ BibTex | DOI | Web page | PS | PDF ]

[BDL07a]

R. Brochenin, S. Demri, and É. Lozes. Reasoning about Sequences of Memory States. In Proceedings of the 1st Workshop on Heap Analysis and Verification (HAV'07), Braga, Portugal, March 2007.
[ BibTex | Web page | PDF ]

[Maz07]

L. Mazaré. Computationally Sound Analysis of Protocols using Bilinear Pairings. In Preliminary Proceedings of the 7th International Workshop on Issues in the Theory of Security (WITS'07), pages 6--21, Braga, Portugal, March 2007.
[ BibTex | Web page | PDF ]

[BK07]

B. Bollig and D. Kuske. Muller Message-Passing Automata and Logics. In Preliminary Proceedings of the 1st International Conference on Language and Automata Theory and Applications (LATA'07), Tarragona, Spain, March-April 2007.
[ BibTex | Web page | PS | PDF ]

[JLS07]

M. Jurdziński, F. Laroussinie, and J. Sproston. Model Checking Probabilistic Timed Automata with One or Two Clocks. In Proceedings of the 13th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'07), volume 4424 of Lecture Notes in Computer Science, pages 170--184, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71209-1_15.
[ BibTex | DOI | Web page | PDF ]

[DDSS07]

D. D'Aprile, S. Donatelli, A. Sangnier, and J. Sproston. From Time Petri Nets to Timed Automata: An Untimed Approach. In Proceedings of the 13th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'07), volume 4424 of Lecture Notes in Computer Science, pages 216--230, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71209-1_18.
[ BibTex | DOI | Web page | PS | PDF ]

[BKKL07]

B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. Replaying Play in and Play out: Synthesis of Design Models from Scenarios by Learning. In Proceedings of the 13th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'07), volume 4424 of Lecture Notes in Computer Science, pages 435--450, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71209-1_33.
[ BibTex | DOI | Web page | PS | PDF ]

[CJP07]

H. Comon-Lundh, F. Jacquemard, and N. Perrin. Tree Automata with Memory, Visibility and Structural Constraints. In Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'07), volume 4423 of Lecture Notes in Computer Science, pages 168--182, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71389-0_13.
[ BibTex | DOI | Web page | PDF ]

[LMO07]

F. Laroussinie, N. Markey, and G. Oreiby. On the Expressiveness and Complexity of ATL. In Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'07), volume 4423 of Lecture Notes in Computer Science, pages 243--257, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71389-0_18.
[ BibTex | DOI | Web page | PS | PDF ]

[BLM07]

P. Bouyer, K. G. Larsen, and N. Markey. Model-Checking One-Clock Priced Timed Automata. In Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'07), volume 4423 of Lecture Notes in Computer Science, pages 108--122, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71389-0_9.
[ BibTex | DOI | Web page | PS | PDF ]

[DD07]

S. Demri and D. D'Souza. An automata-theoretic approach to constraint LTL. Information and Computation, 205(3):380--415, March 2007.
doi: 10.1016/j.ic.2006.09.006.
[ BibTex | DOI | Web page | PDF ]

[BJ07a]

A. Bouhoula and F. Jacquemard. Tree Automata, Implicit Induction and Explicit Destructors for Security Protocol Verification. Research Report LSV-07-10, Laboratoire Spécification et Vérification, ENS Cachan, France, February 2007. 21 pages.
[ BibTex | Web page | PDF ]

[KL07]

B. Ksieżopolski and P. Lafourcade. Attack and Revison of an Electronic Auction Protocol using OFMC. Technical Report 549, Department of Computer Science, ETH Zurich, Switzerland, February 2007. 13 pages.
[ BibTex | Web page | PDF ]

[DN07]

S. Demri and D. Nowak. Reasoning about transfinite sequences. International Journal of Foundations of Computer Science, 18(1):87--112, February 2007.
doi: 10.1142/S0129054107004589.
[ BibTex | DOI | Web page | PS | PDF ]

[BCD07a]

S. Bursuc, H. Comon-Lundh, and S. Delaune. Associative-Commutative Deducibility Constraints. In Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS'07), volume 4393 of Lecture Notes in Computer Science, pages 634--645, Aachen, Germany, February 2007. Springer.
doi: 10.1007/978-3-540-70918-3_54.
[ BibTex | DOI | Web page | PS | PDF ]

[Laf07b]

P. Lafourcade. Rapport d'activités à 3 mois, contrat CNRS/DGA référence : 06 60 019 00 470 75 01 << Utilisation et exploitation des théories équationnelles dans l'analyse des protocoles cryptographiques >>. Contract report, DGA, January 2007. 3 pages.
[ BibTex | Web page | PS ]

[Gou07a]

J. Goubault-Larrecq. Believe It Or Not, GOI is a Model of Classical Linear Logic. Research Report LSV-07-03, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2007. 18 pages.
[ BibTex | Web page | PDF ]

[DO07]

S. Demri and E. Orlowska. Relative Nondeterministic Information Logic is EXPTIME-complete. Fundamenta Informaticae, 75(1-4):163--178, 2007.
[ BibTex | Web page | PDF ]

[Rey07a]

P.-A. Reynier. Diagonal constraints handled efficiently in UPPAAL. Research Report LSV-07-02, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2007. 4 pages.
[ BibTex | Web page | PS | PDF ]

[Bau07]

M. Baudet. Sécurité des protocoles cryptographiques : aspects logiques et calculatoires. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2007.
[ BibTex | Web page | PS | PDF ]

[DLN07]

S. Demri, R. Lazić, and D. Nowak. On the freeze quantifier in constraint LTL: Decidability and complexity. Information and Computation, 205(1):2--24, January 2007.
doi: 10.1016/j.ic.2006.08.003.
[ BibTex | DOI | Web page | PDF ]

[Com07]

H. Comon-Lundh. Soundness of abstract cryptography, 2007. Course notes (part 1), Symposium on Cryptography and Information Security (SCIS2008), Tokai, Japan.
[ BibTex | Web page | PDF ]

This file was generated by bibtex2html 1.98.