Publications : 2006

[Gou06]
J. Goubault-Larrecq. Preuve et vérification pour la sécurité et la sûreté. In Encyclopédie de l'informatique et des systèmes d'information, chapter I.6, pages 683--703. Vuibert, December 2006.
BibTex | Web page ]
[BKŘS06]
L. Bozzelli, M. Křetínský, V. Řehák, and J. Strejček. On Decidability of LTL Model Checking for Process Rewrite Systems. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, pages 248--259, Kolkata, India, December 2006. Springer.
doi: 10.1007/11944836_24.
BibTex | DOI | Web page | PDF ]
[BLMR06]
P. Bouyer, K. G. Larsen, N. Markey, and J. I. Rasmussen. Almost Optimal Strategies in One-Clock Priced Timed Automata. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, pages 345--356, Kolkata, India, December 2006. Springer.
doi: 10.1007/11944836_32.
BibTex | DOI | Web page | PS | PDF ]
[Che06]
F. Chevalier. Decision procedures for timed logics. Invited talk, Advances and Issues in Timed Systems, Kolkata, India, December 2006.
BibTex ]
[Gas06c]
P. Gastin. Refinements and Abstractions of Signal-Event (Timed) Languages. Invited talk, Advances and Issues in Timed Systems, Kolkata, India, December 2006.
BibTex ]
[GSZ06]
P. Gastin, N. Sznajder, and M. Zeitoun. Distributed synthesis for well-connected architectures. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, pages 321--332, Kolkata, India, December 2006. Springer.
doi: 10.1007/11944836_30.
BibTex | DOI | Web page | PDF ]
[CDP06]
F. Chevalier, D. D'Souza, and P. Prabhakar. On continuous timed automata with input-determined guards. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, pages 369--380, Kolkata, India, December 2006. Springer.
doi: 10.1007/11944836_34.
BibTex | DOI | Web page | PS | PDF ]
[CKKW06]
V. Cortier, S. Kremer, R. Küsters, and B. Warinschi. Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, pages 176--187, Kolkata, India, December 2006. Springer.
doi: 10.1007/11944836_18.
BibTex | DOI | Web page | PS | PDF ]
[Del06b]
S. Delaune. An Undecidability Result for AGh. Theoretical Computer Science, 368(1-2):161--167, December 2006.
doi: 10.1016/j.tcs.2006.08.018.
BibTex | DOI | Web page | PS | PDF ]
[BBS06b]
C. Baier, N. Bertrand, and Ph. Schnoebelen. On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. In Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'06), volume 4246 of Lecture Notes in Artificial Intelligence, pages 347--361, Phnom Penh, Cambodia, November 2006. Springer.
doi: 10.1007/11916277_24.
BibTex | DOI | Web page | PS | PDF ]
[BG06]
L. Bozzelli and R. Gascon. Branching Time Temporal Logic Extended with Presburger Constraints. In Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'06), volume 4246 of Lecture Notes in Artificial Intelligence, pages 197--211, Phnom Penh, Cambodia, November 2006. Springer.
doi: 10.1007/11916277_14.
BibTex | DOI | Web page | PS | PDF ]
[TED06]
S. Taktak, E. Encrenaz, and J.-L. Desbarbieux. A Tool for Automatic Detection of Deadlock in Wormhole Networks on Chip. In Proceedings of the IEEE High Level Design Verification and Test Workshop (HLDVT'06), pages 203--210, Monterey, California, USA, November 2006. IEEE Computer Society Press.
doi: 10.1109/HLDVT.2006.319992.
BibTex | DOI | Web page | PDF ]
[DG06b]
V. Diekert and P. Gastin. Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Information and Computation, 204(11):1597--1619, November 2006.
doi: 10.1016/j.ic.2006.07.002.
BibTex | DOI | Web page | PDF ]
[Sch06]
Ph. Schnoebelen. De nouvelles applications pour le model-checking. Invited lecture, Journées à l'occasion des 20 ans du LIPN, Villetaneuse, France, November 2006.
BibTex ]
[KBL+06]
F. Klay, L. Bozga, Y. Lakhnech, L. Mazaré, S. Delaune, and S. Kremer. Retour d'expérience sur la validation du vote électronique. Technical Report 9, projet RNTL PROUVÉ, November 2006. 47 pages.
BibTex | Web page | PDF ]
[B+06]
P. Bouyer et al. ACI Sécurité Informatique CORTOS --- Rapport final, November 2006. 17 pages.
BibTex | Web page | PDF ]
[SBS06]
Ph. Schnoebelen, A. Bouajjani, and G. Sutre. ACI Sécurité Informatique PERSÉE --- Rapport final, November 2006. 12 pages.
BibTex | Web page | PDF ]
[Gas06b]
P. Gastin. GasTEX: Graphs and Automata Simplified in TEX (v2.8), November 2006. Written in TEX(about 2000 lines).
BibTex | Web page ]
[BBBL06]
H. Bel mokadem, B. Bérard, P. Bouyer, and F. Laroussinie. Timed temporal logics for abstracting transient states. In Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), volume 4218 of Lecture Notes in Computer Science, pages 337--351, Beijing, China, October 2006. Springer.
doi: 10.1007/11901914_26.
BibTex | DOI | Web page | PDF ]
[BHR06c]
P. Bouyer, S. Haddad, and P.-A. Reynier. Timed Unfoldings for Networks of Timed Automata. In Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), volume 4218 of Lecture Notes in Computer Science, pages 292--306, Beijing, China, October 2006. Springer.
doi: 10.1007/11901914_23.
BibTex | DOI | Web page | PS | PDF ]
[DFGvD06]
S. Demri, A. Finkel, V. Goranko, and G. van Drimmelen. Towards a model-checker for counter systems. In Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), volume 4218 of Lecture Notes in Computer Science, pages 493--507, Beijing, China, October 2006. Springer.
doi: 10.1007/11901914_36.
BibTex | DOI | Web page | PDF ]
[BGM06]
P. Bhateja, P. Gastin, and M. Mukund. A fresh look at testing for asynchronous communication. In Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), volume 4218 of Lecture Notes in Computer Science, pages 369--383, Beijing, China, October 2006. Springer.
doi: 10.1007/11901914_28.
BibTex | DOI | Web page | PS | PDF ]
[Mar06]
N. Markey. Verification of Multi-Agent Systems with ATL. Invited talk, FNRS meeting on "Synthesis and Verification", October 2006.
BibTex ]
[Ber06b]
N. Bertrand. Modèles stochastiques pour les pertes de messages dans les protocoles asynchrones et techniques de vérification automatique. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2006.
BibTex | Web page | PS | PDF ]
[G+06]
P. Gastin et al. ACI Sécurité Informatique VERSYDIS --- Rapport final, October 2006. 10 pages.
BibTex | Web page | PDF ]
[BBS06c]
C. Baier, N. Bertrand, and Ph. Schnoebelen. Symbolic verification of communicating systems with probabilistic message losses: liveness and fairness. In Proceedings of 26th IFIP WG6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'06), volume 4229 of Lecture Notes in Computer Science, pages 212--227, Paris, France, September 2006. Springer.
doi: 10.1007/11888116_17.
BibTex | DOI | Web page | PS | PDF ]
[MBDC+06]
F. Mancinelli, J. Boender, R. Di Cosmo, J. Vouillon, B. Durak, X. Leroy, and R. Treinen. Managing the Complexity of Large Free and Open Source Package-Based Software Distributions. In Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06), pages 199--208, Tokyo, Japan, September 2006. IEEE Computer Society Press.
doi: 10.1109/ASE.2006.49.
BibTex | DOI | Web page | PDF ]
[AB06]
E. Asarin and P. Bouyer, editors. Proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202 of Lecture Notes in Computer Science, Paris, France, September 2006. Springer.
doi: 10.1007/11867340.
BibTex | DOI | Web page ]
[BGP06b]
B. Bérard, P. Gastin, and A. Petit. Refinements and abstractions of signal-event (timed) languages. In Proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202 of Lecture Notes in Computer Science, pages 67--81, Paris, France, September 2006. Springer.
doi: 10.1007/11867340_6.
BibTex | DOI | Web page | PS | PDF ]
[BGP06a]
B. Bérard, P. Gastin, and A. Petit. Intersection of regular signal-event (timed) languages. In Proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202 of Lecture Notes in Computer Science, pages 52--66, Paris, France, September 2006. Springer.
doi: 10.1007/11867340_5.
BibTex | DOI | Web page | PS | PDF ]
[CEFX06b]
R. Chevallier, E. Encrenaz-Tiphène, L. Fribourg, and W. Xu. Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata. In Proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202 of Lecture Notes in Computer Science, pages 113--127, Paris, France, September 2006. Springer.
doi: 10.1007/11867340_9.
BibTex | DOI | Web page | PS | PDF ]
[LMO06]
F. Laroussinie, N. Markey, and G. Oreiby. Model Checking Timed ATL for Durational Concurrent Game Structures. In Proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202 of Lecture Notes in Computer Science, pages 245--259, Paris, France, September 2006. Springer.
doi: 10.1007/11867340_18.
BibTex | DOI | Web page | PS | PDF ]
[MOJ06]
I. Mitsuhashi, M. Oyamaguchi, and F. Jacquemard. The Confluence Problem for Flat TRSs. In Proceedings of the 8th International Conference on Artificial Intelligence and Symbolic Computation (AISC'06), volume 4120 of Lecture Notes in Artificial Intelligence, pages 68--81, Beijing, China, September 2006. Springer.
doi: 10.1007/11856290_8.
BibTex | DOI | Web page | PDF ]
[Laf06]
P. Lafourcade. Vérification des protocoles cryptographiques en présence de théories équationnelles. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2006. 209 pages.
BibTex | Web page | PS | PDF ]
[Bel06]
H. Bel mokadem. Vérification des propriétés temporisées des automates programmables industriels. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2006.
BibTex | Web page | PDF ]
[Nav06]
G. Naves. Accessibilité dans les automates temporisés à deux horloges. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2006.
BibTex | Web page | PS | PDF ]
[Aks06]
S. Akshay. Formal Specification and Verification of Timed Communicating Systems. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2006.
BibTex | Web page | PDF ]
[Bur06]
S. Bursuc. Contraintes de déductibilité modulo Associativité-Commutativité. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2006.
BibTex | Web page | PDF ]
[BP06]
M. Baclet and C. Pagetti. Around Hopcroft's Algorithm. In Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA'06), volume 4094 of Lecture Notes in Computer Science, pages 114--125, Taipei, Taiwan, August 2006. Springer-Verlag.
doi: 10.1007/11812128_12.
BibTex | DOI | Web page | PDF ]
[BM06]
P. Bouyer and P. Madhusudan, editors. Proceedings of the 3rd Workshop on Games in Design and Verification (GDV'06), Seattle, Washington, USA, August 2006.
BibTex ]
[BBC06a]
P. Bouyer, L. Bozzelli, and F. Chevalier. Controller Synthesis for MTL Specifications. In Proceedings of the 17th International Conference on Concurrency Theory (CONCUR'06), volume 4137 of Lecture Notes in Computer Science, pages 450--464, Bonn, Germany, August 2006. Springer.
doi: 10.1007/11817949_30.
BibTex | DOI | Web page | PS | PDF ]
[BBC06b]
P. Bouyer, Th. Brihaye, and F. Chevalier. Control in o-Minimal Hybrid Systems. In Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pages 367--378, Seattle, Washington, USA, August 2006. IEEE Computer Society Press.
doi: 10.1109/LICS.2006.22.
BibTex | DOI | Web page | PS | PDF ]
[BLP06]
S. Bardin, J. Leroux, and G. Point. FAST Extended Release. In Proceedings of the 18th International Conference on Computer Aided Verification (CAV'06), volume 4144 of Lecture Notes in Computer Science, pages 63--66, Seattle, Washington, USA, August 2006. Springer.
doi: 10.1007/11817963_9.
BibTex | DOI | Web page | PS | PDF ]
[DL06a]
S. Demri and R. Lazić. LTL with the freeze quantifier and register automata. In Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pages 17--26, Seattle, Washington, USA, August 2006. IEEE Computer Society Press.
doi: 10.1109/LICS.2006.31.
BibTex | DOI | Web page | PDF ]
[DL06b]
S. Demri and D. Lugiez. Presburger Modal Logic is Only PSPACE-complete. In Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR'06), volume 4130 of Lecture Notes in Artificial Intelligence, pages 541--556, Seattle, Washington, USA, August 2006. Springer-Verlag.
doi: 10.1007/11814771_44.
BibTex | DOI | Web page ]
[Dem06b]
S. Demri. LTL over integer periodicity constraints. Theoretical Computer Science, 360(1-3):96--123, August 2006.
doi: 10.1016/j.tcs.2006.02.019.
BibTex | DOI | Web page | PDF ]
[JRV06]
F. Jacquemard, M. Rusinowitch, and L. Vigneron. Tree automata with equality constraints modulo equational theories. In Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR'06), volume 4130 of Lecture Notes in Artificial Intelligence, pages 557--571, Seattle, Washington, USA, August 2006. Springer-Verlag.
doi: 10.1007/11814771_45.
BibTex | DOI | Web page ]
[KS06]
A. Kučera and Ph. Schnoebelen. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. Theoretical Computer Science, 358(2-3):315--333, August 2006.
doi: 10.1016/j.tcs.2006.01.021.
BibTex | DOI | Web page | PS | PDF ]
[LLT06]
P. Lafourcade, D. Lugiez, and R. Treinen. ACUNh: Unification and Disunification Using Automata Theory. In Proceedings of the 20th International Workshop on Unification (UNIF'06), pages 6--20, Seattle, Washington, USA, August 2006.
BibTex | Web page | PS | PDF ]
[BJ06a]
A. Bouhoula and F. Jacquemard. Automating Sufficient Completeness Check for Conditional and Constrained TRS. In Proceedings of the 20th International Workshop on Unification (UNIF'06), Seattle, Washington, USA, August 2006.
BibTex | Web page | PDF ]
[MR06]
N. Markey and J.-F. Raskin. Model Checking Restricted Sets of Timed Paths. Theoretical Computer Science, 358(2-3):273--292, August 2006.
doi: 10.1016/j.tcs.2006.01.019.
BibTex | DOI | Web page | PS | PDF ]
[BJ06b]
A. Bouhoula and F. Jacquemard. Security Protocols Verification with Implicit Induction and Explicit Destructors. In Preliminary Proceedings of the 1st International Workshop on Security and Rewriting Techniques (SecReT'06), pages 37--44, Venice, Italy, July 2006.
BibTex | Web page | PDF ]
[BHR06b]
P. Bouyer, S. Haddad, and P.-A. Reynier. Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP'06) --- Part II, volume 4052 of Lecture Notes in Computer Science, pages 420--431, Venice, Italy, July 2006. Springer.
doi: 10.1007/11787006_36.
BibTex | DOI | Web page | PS | PDF ]
[BS06]
N. Bertrand and Ph. Schnoebelen. A short visit to the STS hierarchy. In Proceedings of the 12th International Workshop on Expressiveness in Concurrency (EXPRESS'05), volume 154 of Electronic Notes in Theoretical Computer Science, pages 59--69, San Francisco, California, USA, July 2006. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2006.05.007.
BibTex | DOI | Web page | PS | PDF ]
[CEFX06a]
R. Chevallier, E. Encrenaz-Tiphène, L. Fribourg, and W. Xu. Timing analysis of an embedded memory: SPSMALL. WSEAS Transactions on Circuits and Systems, 5(7):973--978, July 2006.
BibTex | Web page | PDF ]
[DKR06a]
S. Delaune, S. Kremer, and M. D. Ryan. Coercion-Resistance and Receipt-Freeness in Electronic Voting. In Proceedings of the 19th IEEE Computer Security Foundations Workshop (CSFW'06), pages 28--39, Venice, Italy, July 2006. IEEE Computer Society Press.
doi: 10.1109/CSFW.2006.8.
BibTex | DOI | Web page | PS | PDF ]
[DLLT06]
S. Delaune, P. Lafourcade, D. Lugiez, and R. Treinen. Symbolic Protocol Analysis in Presence of a Homomorphism Operator and phExclusive Or. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP'06) --- Part II, volume 4052 of Lecture Notes in Computer Science, pages 132--143, Venice, Italy, July 2006. Springer.
doi: 10.1007/11787006_12.
BibTex | DOI | Web page | PS | PDF ]
[CK06]
V. Cortier and S. Kremer, editors. Proceedings of the 2nd Workshop on Formal and Computational Cryptography (FCC'06), Venice, Italy, July 2006.
BibTex | Web page ]
[RS06]
A. Rabinovich and Ph. Schnoebelen. BTL_2 and the expressive power of ECTL^+. Information and Computation, 204(7):1023--1044, July 2006.
doi: 10.1016/j.ic.2005.07.006.
BibTex | DOI | Web page | PS | PDF ]
[BBLP06]
G. Behrmann, P. Bouyer, K. G. Larsen, and R. Pelánek. Lower and Upper Bounds in Zone-Based Abstractions of Timed Automata. International Journal on Software Tools for Technology Transfer, 8(3):204--215, June 2006.
doi: 10.1007/s10009-005-0190-0.
BibTex | DOI | Web page | PS | PDF ]
[BC06]
P. Bouyer and F. Chevalier. On the Control of Timed and Hybrid Systems. EATCS Bulletin, 89:79--96, June 2006.
BibTex | Web page | PS | PDF ]
[BBM06]
P. Bouyer, Th. Brihaye, and N. Markey. Improved Undecidability Results on Weighted Timed Automata. Information Processing Letters, 98(5):188--194, June 2006.
doi: 10.1016/j.ipl.2006.01.012.
BibTex | DOI | Web page | PS | PDF ]
[BH06b]
M. Bidoit and R. Hennicker. Proving Behavioral Refinements of COL-Specifications. In Algebra, Meaning and Computation --- Essays dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday, volume 4060 of Lecture Notes in Computer Science, pages 333--354, San Diego, California, USA, June 2006. Springer.
doi: 10.1007/11780274_18.
BibTex | DOI | Web page | PDF ]
[BHR06a]
P. Bouyer, S. Haddad, and P.-A. Reynier. Extended Timed Automata and Time Petri Nets. In Proceedings of the 6th International Conference on Application of Concurrency to System Design (ACSD'06), pages 91--100, Turku, Finland, June 2006. IEEE Computer Society Press.
doi: 10.1109/ACSD.2006.6.
BibTex | DOI | Web page | PS | PDF ]
[BL06]
P. Bouyer and F. Laroussinie. Vérification par automates temporisés. In Systèmes temps-réel 1 : techniques de description et de vérification, pages 121--150. Hermès, June 2006.
BibTex | Web page | PS | PDF ]
[Bol06]
B. Bollig. Formal Models of Communicating Systems --- Languages, Automata, and Monadic Second-Order Logic. Springer, June 2006.
BibTex | Web page ]
[BE06]
C. Braunstein and E. Encrenaz. Formalizing the incremental design and verification process of a pipelined protocol converter. In Proceedings of the 17th International Workshop on Rapid System Prototyping (RSP'06), pages 103--109, Chania, Crete, June 2006. IEEE Computer Society Press.
doi: 10.1109/RSP.2006.19.
BibTex | DOI | Web page | PS | PDF ]
[DKR06b]
S. Delaune, S. Kremer, and M. D. Ryan. Verifying Properties of Electronic Voting Protocols. In Proceedings of the IAVoSS Workshop On Trustworthy Elections (WOTE'06), pages 45--52, Cambridge, UK, June 2006.
BibTex | Web page | PS | PDF ]
[DLS06]
S. Demri, F. Laroussinie, and Ph. Schnoebelen. A Parametric Analysis of the State Explosion Problem in Model Checking. Journal of Computer and System Sciences, 72(4):547--575, June 2006.
doi: 10.1016/j.jcss.2005.11.003.
BibTex | DOI | Web page | PS | PDF ]
[Ber06a]
V. Bernat. Théories de l'intrus pour la vérification des protocoles cryptographiques. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2006.
BibTex | Web page | PS | PDF ]
[Del06c]
S. Delaune. Vérification des protocoles cryptographiques et propriétés algébriques. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2006.
BibTex | Web page | PS | PDF ]
[Bro06]
R. Brochenin. Techniques d'automates pour raisonner sur la mémoire. Rapport de Master, Master Recherche Informatique de Lyon --- Informatique Fondamentale, Lyon, France, June 2006.
BibTex | Web page | PS ]
[OG06]
J. Olivain and J. Goubault-Larrecq. Detecting Subverted Cryptographic Protocols by Entropy Checking. Research Report LSV-06-13, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2006. 19 pages.
BibTex | Web page | PDF ]
[Gas06a]
P. Gastin. Distributed synthesis: synchronous and asynchronous semantics. Invited talk, 34ème École de Printemps en Informatique Théorique, Ile de Ré, France, May 2006.
BibTex ]
[Gas06d]
P. Gastin. Refinements and Abstractions of Signal-Event (Timed) Languages. Invited talk, 22nd Conference on Mathematical Foundations of Programming Semantics (MFPS'06), May 2006.
BibTex ]
[Bou06]
P. Bouyer. Weighted Timed Automata: Model-Checking and Games. In Proceedings of the 22nd Conference on Mathematical Foundations of Programming Semantics (MFPS'06), volume 158 of Electronic Notes in Theoretical Computer Science, pages 3--17, Genova, Italy, May 2006. Elsevier Science Publishers. Invited paper.
doi: 10.1016/j.entcs.2006.04.002.
BibTex | DOI | Web page | PS | PDF ]
[FGRV06]
A. Finkel, G. Geeraerts, J.-F. Raskin, and L. Van Begin. On the ω-Language Expressive Power of Extended Petri Nets. Theoretical Computer Science, 356(3):374--386, May 2006.
doi: 10.1016/j.tcs.2006.02.008.
BibTex | DOI | Web page | PDF ]
[DG06a]
V. Diekert and P. Gastin. From local to global temporal logics over Mazurkiewicz traces. Theoretical Computer Science, 356(1-2):126--135, May 2006.
doi: 10.1016/j.tcs.2006.01.035.
BibTex | DOI | Web page | PDF ]
[BK06]
B. Bollig and D. Kuske. Distributed Muller Automata and Logics. Research Report LSV-06-11, Laboratoire Spécification et Vérification, ENS Cachan, France, May 2006. 23 pages.
BibTex | Web page | PS | PDF ]
[BFLS06]
S. Bardin, A. Finkel, É. Lozes, and A. Sangnier. From Pointer Systems to Counter Systems Using Shape Analysis. In Proceedings of the 5th International Workshop on Automated Verification of Infinite-State Systems (AVIS'06), Vienna, Austria, April 2006.
BibTex | Web page | PS | PDF ]
[BDCD+06]
J. Boender, R. Di Cosmo, B. Durak, X. Leroy, F. Mancinelli, M. Morgado, D. Pinheiro, R. Treinen, P. Trezentos, and J. Vouillon. News from the EDOS project: improving the maintenance of free software distributions. In Proceedings of the International Workshop on Free Software (IWFS'06), pages 199--207, Porto Allegre, Brazil, April 2006.
BibTex | Web page | PDF ]
[BH06a]
M. Bidoit and R. Hennicker. Constructor-Based Observational Logic. Journal of Logic and Algebraic Programming, 67(1-2):3--51, April-May 2006.
doi: 10.1016/j.jlap.2005.09.002.
BibTex | DOI | Web page | PDF ]
[ABW06]
M. Abadi, M. Baudet, and B. Warinschi. Guessing Attacks and the Computational Soundness of Static Equivalence. In Proceedings of the 9th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'06), volume 3921 of Lecture Notes in Computer Science, pages 398--412, Vienna, Austria, March 2006. Springer.
doi: 10.1007/11690634_27.
BibTex | DOI | Web page | PS | PDF ]
[BKSS06]
B. Bollig, C. Kern, M. Schlütter, and V. Stolz. MSCan: A Tool for Analyzing MSC Specifications. In Proceedings of the 12th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'06), volume 3920 of Lecture Notes in Computer Science, pages 455--458, Vienna, Austria, March 2006. Springer.
doi: 10.1007/11691372_32.
BibTex | DOI | Web page | PS | PDF ]
[Gas06e]
P. Gastin. Weigthed logics and weighted automata. Invited talk, Workshop Weighted Automata: Theory and Applications, Leipzig, Germany, March 2006.
BibTex ]
[BMR06]
P. Bouyer, N. Markey, and P.-A. Reynier. Robust Model-Checking of Linear-Time Properties in Timed Automata. In Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN'06), volume 3887 of Lecture Notes in Computer Science, pages 238--249, Valdivia, Chile, March 2006. Springer.
doi: 10.1007/11682462_25.
BibTex | DOI | Web page | PS | PDF ]
[Del06a]
S. Delaune. Easy Intruder Deduction Problems with Homomorphisms. Information Processing Letters, 97(6):213--218, March 2006.
doi: 10.1016/j.ipl.2005.11.008.
BibTex | DOI | Web page | PS | PDF ]
[LMS06]
F. Laroussinie, N. Markey, and Ph. Schnoebelen. Efficient Timed Model Checking for Discrete-Time Systems. Theoretical Computer Science, 353(1-3):249--271, March 2006.
doi: 10.1016/j.tcs.2005.11.020.
BibTex | DOI | Web page | PS | PDF ]
[MS06]
N. Markey and Ph. Schnoebelen. Mu-Calculus Path Checking. Information Processing Letters, 97(6):225--230, March 2006.
doi: 10.1016/j.ipl.2005.11.010.
BibTex | DOI | Web page | PS | PDF ]
[FMP06]
L. Fribourg, S. Messika, and C. Picaronny. Coupling and Self-Stabilization. Distributed Computing, 18(3):221--232, February 2006.
doi: 10.1007/s00446-005-0142-7.
BibTex | DOI | Web page | PS | PDF ]
[Ber06c]
N. Bertrand. SuMo -- Reachability analysis for lossy channels, February 2006. See [BBS06c] for a description. Written in OCaml (3000 lines).
BibTex ]
[CL06]
F. Cassez and F. Laroussinie. Contrôle des applications temps-réel : modèles temporisés et hybrides. Technique et Science Informatiques, 25(3), 2006.
BibTex | Web page ]
[BBS06a]
C. Baier, N. Bertrand, and Ph. Schnoebelen. A note on the attractor-property of infinite-state Markov chains. Information Processing Letters, 97(2):58--63, January 2006.
doi: 10.1016/j.ipl.2005.09.011.
BibTex | DOI | Web page | PS | PDF ]
[CDL06]
V. Cortier, S. Delaune, and P. Lafourcade. A Survey of Algebraic Properties Used in Cryptographic Protocols. Journal of Computer Security, 14(1):1--43, 2006.
BibTex | Web page | PS | PDF ]
[CKS06]
R. Chadha, S. Kremer, and A. Scedrov. Formal Analysis of Multi-Party Contract Signing. Journal of Automated Reasoning, 36(1-2):39--83, January 2006.
doi: 10.1007/s10817-005-9019-5.
BibTex | DOI | Web page | PDF ]
[DJ06]
S. Delaune and F. Jacquemard. Decision Procedures for the Security of Protocols with Probabilistic Encryption against Offline Dictionary Attacks. Journal of Automated Reasoning, 36(1-2):85--124, January 2006.
doi: 10.1007/s10817-005-9017-7.
BibTex | DOI | Web page | PS ]
[Bau06]
M. Baudet. Random Polynomial-Time Attacks and Dolev-Yao Models. Journal of Automata, Languages and Combinatorics, 11(1):7--21, 2006.
BibTex | Web page | PS | PDF ]
[Dem06a]
S. Demri. Linear-Time Temporal Logics with Presburger Constraints: An Overview. Journal of Applied Non-Classical Logics, 16(3-4):311--347, 2006.
BibTex | Web page | PDF ]
[AGH+06]
S. Anantharaman, P. Gastin, G. Hains, J. Mullins, and M. Rusinowitch, editors. Selected papers of the International Workshop on Security Analysis of Systems: Formalisms and Tools (SASYFT'04), volume 11, Orléans, France, 2006.
BibTex ]

This file was generated by bibtex2html 1.98.

About LSV