Publications : 2001
-
[CC01]
-
H. Comon and V. Cortier.
Tree Automata with One Memory, Set Constraints and Cryptographic
Protocols.
Research Report LSV-01-13, Laboratoire Spécification et
Vérification, ENS Cachan, France, December 2001.
98 pages.
[ BibTex |
Web page |
PS ]
-
[PKD+01]
-
L. Petrucci, L. M. Kristensen, P. Dauchy, M. Aziz, and
J. Billington.
Modelling and analysis of airborne mission systems.
Progress Report 1, DSTO/UniSA contract, December 2001.
54 pages.
[ BibTex ]
-
[Can01]
-
G. Canet.
Vérification des programmes écrits dans les langages de
programmation IL et ST définis par la norme IEC 61131-3.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, December 2001.
[ BibTex |
Web page |
PS ]
-
[Nar01]
-
G. A. Narboni.
Un cas remarquable de systèmes linéaires: les
systèmes monotones. Résolution et application à la
vérification formelle de programmes.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, December 2001.
[ BibTex |
Web page |
PS ]
-
[BBP01]
-
B. Bérard, P. Bouyer, and A. Petit.
Modélisation du protocole PGM et de certaines de ses
propriétés en UPPAAL.
Contract Report 4.4, projet RNRT Calife, November 2001.
18 pages.
[ BibTex ]
-
[JL01]
-
F. Jacquemard and D. Le Métayer.
Langage de spécification de protocoles cryptographiques de
EVA: syntaxe concrète.
Technical Report 1, projet RNTL EVA, November 2001.
25 pages.
[ BibTex |
Web page |
PDF ]
-
[BFJL01]
-
D. Bolignano, F. Fiorenza, F. Jacquemard, and D. Le
Métayer.
EVA test base.
Technical Report 4, projet RNTL EVA, November 2001.
55 pages.
[ BibTex |
Web page |
PS |
PDF ]
-
[Gou01b]
-
J. Goubault-Larrecq.
Les syntaxes et la sémantique du langage de
spécification EVA.
Contract Report 3, projet RNTL EVA, November 2001.
32 pages.
[ BibTex |
Web page |
PS |
PDF ]
-
[Gou01a]
-
J. Goubault-Larrecq.
Higher-Order Automata, Pushdown Systems, and Set Constraints.
Research Report LSV-01-9, Laboratoire Spécification et
Vérification, ENS Cachan, France, November 2001.
15 pages.
[ BibTex |
Web page |
PS ]
-
[DFP01]
-
M. Duflot, L. Fribourg, and C. Picaronny.
Randomized Finite-State Distributed Algorithms as Markov
Chains.
In Proceedings of the 15th International Symposium on
Distributed Computing (DISC'01), volume 2180 of Lecture Notes in
Computer Science, pages 240--254, Lisbon, Portugal, October 2001. Springer.
[ BibTex |
Web page |
PS ]
-
[Sch01a]
-
Ph. Schnoebelen.
Bisimulation and Other Undecidable Equivalences for Lossy
Channel Systems.
In Proceedings of the 4th International Workshop on
Theoretical Aspects of Computer Software (TACS'01), volume 2215 of
Lecture Notes in Computer Science, pages 385--399, Sendai, Japan, October
2001. Springer.
[ BibTex |
Web page |
PS |
PDF ]
-
[CGN01]
-
H. Comon, G. Godoy, and R. Nieuwenhuis.
The Confluence of Ground Term Rewrite Systems is Decidable in
Polynomial Time.
In Proceedings of the 42nd Symposium on Foundations of
Computer Science (FOCS'01), pages 298--307, Las Vegas, Nevada, USA,
October 2001. IEEE Computer Society Press.
[ BibTex |
Web page |
PS ]
-
[Sch01b]
-
Ph. Schnoebelen.
Spécification et vérification des systèmes
concurrents.
Mémoire d'habilitation, Université Paris 7, Paris, France,
October 2001.
[ BibTex |
Web page |
PS ]
-
[ADdR01]
-
N. Alechina, S. Demri, and M. de Rijke.
Path Constraints from a Modal Logic Point of View (Extended
Abstract).
In Proceedings of the 8th International Workshop on Knowledge
Representation meets Databases (KRDB'01), volume 45 of CEUR Workshop
Proceedings, Rome, Italy, September 2001. RWTH Aachen, Germany.
[ BibTex |
Web page |
PS ]
-
[Fri01]
-
L. Fribourg, editor.
Proceedings of the 15th International Workshop on
Computer Science Logic (CSL'01), volume 2142 of Lecture Notes in
Computer Science, Paris, France, September 2001. Springer.
[ BibTex |
Web page ]
-
[BP01]
-
G. Berthelot and L. Petrucci.
Specification and Validation of a Concurrent System: An
Educational Project.
International Journal on Software Tools for Technology Transfer,
3(4):372--381, September 2001.
doi:
10.1007/s100090100064.
[ BibTex |
DOI |
Web page |
PS ]
-
[Gou01d]
-
J. Goubault-Larrecq.
Well-Founded Recursive Relations.
In Proceedings of the 15th International Workshop on Computer
Science Logic (CSL'01), volume 2142 of Lecture Notes in Computer
Science, pages 484--497, Paris, France, September 2001. Springer.
[ BibTex |
Web page |
PS ]
-
[RG01a]
-
X. Rival and J. Goubault-Larrecq.
Experiments with Finite Tree Automata in Coq.
In Proceedings of the 14th International Conference on
Theorem Proving in Higher Order Logics (TPHOLs'01), volume 2152
of Lecture Notes in Computer Science, pages 362--377, Edinburgh, Scotland,
UK, September 2001. Springer.
[ BibTex |
Web page |
PS ]
-
[Cor01]
-
P. Corbineau.
Autour de la clôture de congruence avec Coq.
Master's thesis, DEA Programmation, Paris, France, September 2001.
[ BibTex |
Web page |
PS ]
-
[Hor01]
-
S. Hornus.
Requêtes en logique temporelle.
Master's thesis, DEA Algorithmique, Paris, France, September 2001.
[ BibTex |
Web page |
PS ]
-
[Pic01]
-
É. Pichon.
Preuves observationnelles.
Master's thesis, DEA Programmation, Paris, France, September 2001.
[ BibTex ]
-
[BPT01]
-
P. Bouyer, A. Petit, and D. Thérien.
An Algebraic Characterization of Data and Timed Languages.
In Proceedings of the 12th International Conference on
Concurrency Theory (CONCUR'01), volume 2154 of Lecture Notes in
Computer Science, pages 248--261, Aalborg, Denmark, August 2001. Springer.
[ BibTex |
Web page |
PS ]
-
[DFN01]
-
M. Duflot, L. Fribourg, and U. Nilsson.
Unavoidable Configurations of Parameterized Rings of Processes.
In Proceedings of the 12th International Conference on
Concurrency Theory (CONCUR'01), volume 2154 of Lecture Notes in
Computer Science, pages 472--486, Aalborg, Denmark, August 2001. Springer.
[ BibTex |
Web page |
PS ]
-
[Pet01]
-
A. Petit.
About Extensions of Timed Automata.
Invited talk, 8th International Workshop on Expressiveness in
Concurrency (EXPRESS'01), Aalborg, Denmark, August 2001.
[ BibTex ]
-
[BCF01]
-
G. Berry, H. Comon, and A. Finkel, editors.
Proceedings of the 13th International Conference on
Computer Aided Verification (CAV'01), volume 2102 of Lecture Notes
in Computer Science, Paris, France, July 2001. Springer.
[ BibTex |
Web page ]
-
[Gou01c]
-
J. Goubault-Larrecq.
Une proposition de langage de description de protocoles
cryptographiques.
Contract Report 2, projet RNTL EVA, July 2001.
12 pages.
[ BibTex ]
-
[CCM01]
-
H. Comon, V. Cortier, and J. Mitchell.
Tree Automata with One Memory, Set Constraints and Ping-Pong
Protocols.
In Proceedings of the 28th International Colloquium on
Automata, Languages and Programming (ICALP'01), volume 2076 of
Lecture Notes in Computer Science, pages 682--693, Heraklion, Crete, Grece,
July 2001. Springer.
[ BibTex |
Web page |
PS ]
-
[BT01]
-
B. Blanc and F. Tort.
Co-développement de spécifications algébriques.
In Actes du 4ème Atelier sur les Approches Formelles dans
l'Assistance au Développement de Logiciels (AFADL'01), pages
141--156, Nancy, France, June 2001.
[ BibTex |
Web page |
PS ]
-
[RG01b]
-
M. Roger and J. Goubault-Larrecq.
Log Auditing through Model Checking.
In Proceedings of the 14th IEEE Computer Security
Foundations Workshop (CSFW'01), pages 220--236, Cape Breton, Nova
Scotia, Canada, June 2001. IEEE Computer Society Press.
[ BibTex |
Web page |
PS ]
-
[CMR01]
-
V. Cortier, J. K. Millen, and H. Rueß.
Proving Secrecy is Easy Enough.
In Proceedings of the 14th IEEE Computer Security
Foundations Workshop (CSFW'01), pages 97--110, Cape Breton, Nova
Scotia, Canada, June 2001. IEEE Computer Society Press.
[ BibTex |
Web page |
PS ]
-
[CCR01]
-
G. Canet, S. Couffin, and O. Rossi.
Validation dans le cadre de l'utilisation des SFC, LD
et ST.
Final report, tâches 4, 5 et 6, projet VULCAIN, May 2001.
393 pages.
[ BibTex ]
-
[BB01]
-
M. Bidoit and A. Boisseau.
Algebraic Abstractions.
In Recent Trends in Algebraic Development Techniques ---
Selected Papers of the 15th International Workshop on Algebraic
Development Techniques (WADT'01), volume 2267 of Lecture Notes in
Computer Science, pages 21--47, Genova, Italy, April 2001. Springer.
[ BibTex |
Web page |
PS ]
-
[BM01]
-
M. Bidoit and P. D. Mosses.
A Gentle Introduction to CASL v1.0.1.
Invited tutorial, CoFI Workshop at the 4th European Joint Conferences
on Theory and Practice of Software (ETAPS 2001), Genova, Italy, April 2001.
[ BibTex |
Web page ]
-
[BHK01]
-
M. Bidoit, R. Hennicker, and A. Kurz.
On the Duality between Observability and Reachability.
In Proceedings of the 4th International Conference on
Foundations of Software Science and Computation Structures
(FoSSaCS'01), volume 2030 of Lecture Notes in Computer Science, pages
72--87, Genova, Italy, April 2001. Springer.
[ BibTex |
Web page |
PS ]
-
[FS01]
-
A. Finkel and Ph. Schnoebelen.
Well-Structured Transition Systems Everywhere!
Theoretical Computer Science, 256(1-2):63--92, April 2001.
doi:
10.1016/S0304-3975(00)00102-X.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[LMS01]
-
F. Laroussinie, N. Markey, and Ph. Schnoebelen.
Model checking CTL^+ and FCTL is hard.
In Proceedings of the 4th International Conference on
Foundations of Software Science and Computation Structures
(FoSSaCS'01), volume 2030 of Lecture Notes in Computer Science, pages
318--331, Genova, Italy, April 2001. Springer.
[ BibTex |
Web page |
PS |
PDF ]
-
[BBFM01]
-
J. Beauquier, B. Bérard, L. Fribourg, and F. Magniette.
Proving Convergence of Self-Stabilizing Systems Using
First-Order Rewriting and Regular Languages.
Distributed Computing, 14(2):83--95, 2001.
doi:
10.1007/PL00008931.
[ BibTex |
DOI |
Web page |
PS ]
-
[CMT01]
-
H. Comon, C. Marché, and R. Treinen, editors.
Revised Lectures of the International Summer School on
Constraints in Computational Logics (CCL'99), volume 2002 of Lecture
Notes in Computer Science, Gif-sur-Yvette, France, 2001. Springer.
[ BibTex |
Web page ]
-
[CK01]
-
H. Comon and C. Kirchner.
Constraint Solving on Terms.
In Revised Lectures of the International Summer School on
Constraints in Computational Logics (CCL'99), volume 2002 of Lecture
Notes in Computer Science, pages 47--103, Gif-sur-Yvette, France, 2001.
Springer.
[ BibTex ]
-
[Com01]
-
H. Comon.
Inductionless Induction.
In Handbook of Automated Reasoning, volume 1, chapter 14, pages
913--962. Elsevier Science Publishers, 2001.
[ BibTex |
Web page |
PS ]
-
[BBF+01]
-
B. Bérard, M. Bidoit, A. Finkel, F. Laroussinie,
A. Petit, L. Petrucci, and Ph. Schnoebelen.
Systems and Software Verification. Model-Checking Techniques
and Tools.
Springer, 2001.
[ BibTex |
Web page ]
-
[BBD+01]
-
É. Badouel, S. Boucheron, A. Dicky, A. Petit, M. Santha,
P. Weil, and M. Zeitoun.
Problèmes d'informatique fondamentale, volume 13 of Scopos.
Springer, 2001.
[ BibTex |
Web page ]
This file was generated by
bibtex2html 1.98.