Publications : 1999
-
[CDJK99]
-
H. Comon, M. Dincbas, J.-P. Jouannaud, and C. Kirchner.
A Methodological View of Constraint Solving.
Constraints, 4(4):337--361, December 1999.
[ BibTex |
Web page |
PS ]
-
[Mey99]
-
R. Meyer.
Contributions à l'étude des logiques temporelles sur les
traces.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, November 1999.
[ BibTex |
Web page |
PS ]
-
[Jur99]
-
Y. Jurski.
Expression de la relation binaire d'accessibilité pour les
automates à compteurs plats et les automates temporisés.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, October 1999.
[ BibTex |
Web page |
PS ]
-
[BHTW99]
-
M. Bidoit, R. Hennicker, F. Tort, and M. Wirsing.
Correct Realization of Interface Constraints with OCL.
In Proceedings of the 2nd International Conference on the
Unified Modeling Language (UML'99), volume 1723 of Lecture Notes in
Computer Science, pages 399--415, Fort Collins, Colorado, USA, October 1999.
Springer.
[ BibTex |
Web page |
PS ]
-
[Wil99]
-
N. Williams-Preston.
New Type Signatures for Legacy Fortran Subroutines.
In Proceedings of the ACM SIGPLAN/SIGSOFT Workshop on
Program Analysis for Software Tools and Engineering (PASTE'99),
pages 76--85, Toulouse, France, September 1999. ACM Press.
[ BibTex |
Web page |
PS ]
-
[BBF99]
-
J. Beauquier, B. Bérard, and L. Fribourg.
A New Rewrite Method for Proving Convergence of Self-Stabilizing
Systems.
In Proceedings of the 13th International Symposium on
Distributed Computing (DISC'99), volume 1693 of Lecture Notes in
Computer Science, pages 240--253, Bratislava, Slovak republic, September
1999. Springer.
[ BibTex |
Web page |
PS ]
-
[Bla99]
-
B. Blanc.
Modélisation et spécification d'architectures
logicielles.
Rapport de DEA, DEA Programmation, Paris, France, September 1999.
[ BibTex |
Web page |
PS ]
-
[Cor99]
-
V. Cortier.
Vérification de systèmes à compteurs.
Rapport de DEA, DEA de Logique, Paris, France, September 1999.
[ BibTex |
Web page |
PS ]
-
[AL99]
-
L. Aceto and F. Laroussinie.
Is your Model Checker on Time?
In Proceedings of the 24th International Symposium on
Mathematical Foundations of Computer Science (MFCS'99), volume 1672
of Lecture Notes in Computer Science, pages 125--136, Szklarska Poreba,
Poland, September 1999. Springer.
[ BibTex |
Web page |
PS ]
-
[Ler99]
-
J. Leroux.
Vérification des systèmes paramétrés.
Rapport de DEA, DEA Algorithmique, Paris, France, September 1999.
[ BibTex ]
-
[BH99]
-
M. Bidoit and R. Hennicker.
Observer Complete Definitions are Behaviourally Coherent.
In Proceedings of the OBJ/CafeOBJ/Maude Workshop at
Formal Methods (FM'99), pages 83--94, Toulouse, France, September 1999.
Theta, Bucharest, Romania.
[ BibTex |
Web page |
PS ]
-
[Tur99]
-
M. Turuani.
Logique temporelle temporisée pour la vérification de
programmes : expressivité et complexité.
Rapport de DEA, DEA Programmation, Paris, France, September 1999.
[ BibTex |
Web page |
PS ]
-
[BF99b]
-
B. Bérard and L. Fribourg.
Reachability Analysis of (Timed) Petri Nets Using Real
Arithmetic.
In Proceedings of the 10th International Conference on
Concurrency Theory (CONCUR'99), volume 1664 of Lecture Notes in
Computer Science, pages 178--193, Eindhoven, The Netherlands, August 1999.
Springer.
[ BibTex |
Web page |
PS ]
-
[CJ99]
-
H. Comon and Y. Jurski.
Timed Automata and the Theory of Real Numbers.
In Proceedings of the 10th International Conference on
Concurrency Theory (CONCUR'99), volume 1664 of Lecture Notes in
Computer Science, pages 242--257, Eindhoven, The Netherlands, August 1999.
Springer.
[ BibTex |
Web page |
PS ]
-
[DF99]
-
C. Dufourd and A. Finkel.
A Polynomial λ-Bisimilar Normalization for Reset
Petri Nets.
Theoretical Computer Science, 222(1-2):187--194, July 1999.
[ BibTex |
Web page |
PS ]
-
[BP99]
-
P. Bouyer and A. Petit.
Decomposition and Composition of Timed Automata.
In Proceedings of the 26th International Colloquium on
Automata, Languages and Programming (ICALP'99), volume 1644 of
Lecture Notes in Computer Science, pages 210--219, Prague, Czech Republic,
July 1999. Springer.
[ BibTex |
Web page |
PS ]
-
[BF99a]
-
B. Bérard and L. Fribourg.
Automated Verification of a Parametric Real-Time Program: The
ABR Conformance Protocol.
In Proceedings of the 11th International Conference on
Computer Aided Verification (CAV'99), volume 1633 of Lecture Notes in
Computer Science, pages 96--107, Trento, Italy, July 1999. Springer.
[ BibTex |
Web page |
PS ]
-
[CGJV99]
-
V. Cortier, H. Ganzinger, F. Jacquemard, and M. Veanes.
Decidable Fragments of Simultaneous Rigid Reachability.
In Proceedings of the 26th International Colloquium on
Automata, Languages and Programming (ICALP'99), volume 1644 of
Lecture Notes in Computer Science, pages 250--260, Prague, Czech Republic,
July 1999. Springer.
[ BibTex |
Web page |
PS ]
-
[DJS99]
-
C. Dufourd, P. Jančar, and Ph. Schnoebelen.
Boundedness of Reset P/T Nets.
In Proceedings of the 26th International Colloquium on
Automata, Languages and Programming (ICALP'99), volume 1644 of
Lecture Notes in Computer Science, pages 301--310, Prague, Czech Republic,
July 1999. Springer.
[ BibTex |
Web page |
PS ]
-
[EFM99]
-
J. Esparza, A. Finkel, and R. Mayr.
On the verification of broadcast protocols.
In Proceedings of the 14th Annual IEEE Symposium on Logic
in Computer Science (LICS'99), pages 352--359, Trento, Italy, July
1999. IEEE Computer Society Press.
[ BibTex |
Web page |
PS ]
-
[MT99]
-
R. Meyer and P. S. Thiagarajan.
LTrL Based Model-Checking for a Restricted Class of Signal
Transition Graphs.
In Proceedings of the 2nd International Workshop on Hardware
Design and Petri Nets (HWPN'99), pages 3--14, Williamsburg, Virginia,
USA, June 1999. Kluwer Academic Publishers.
[ BibTex ]
-
[CP99]
-
H. Comon and V. Padovani.
Report on Specification Validation in Telecommunication
Services.
Contract report, June 1999.
[ BibTex ]
-
[PCLT99]
-
V. Padovani, H. Comon, J. Leneutre, and R. Tingaud.
A Formal Verification of Telephone Supplementary Service
Interactions.
Research Report LSV-99-5, Laboratoire Spécification et
Vérification, ENS Cachan, France, May 1999.
[ BibTex |
Web page |
PS ]
-
[SBB+99]
-
Ph. Schnoebelen, B. Bérard, M. Bidoit,
F. Laroussinie, and A. Petit.
Vérification de logiciels : techniques et outils du
model-checking.
Vuibert, April 1999.
[ BibTex |
Web page ]
-
[Sut99]
-
G. Sutre.
Vérification des automates à file réactifs : un
modèle pour les systémes réactifs écrits en Electre.
In Actes du 2ème Congrès sur la Modélisation des
Systèmes Réactifs (MSR'99), pages 71--78, Cachan, France, March
1999. Hermès.
[ BibTex ]
-
[FMP99]
-
A. Finkel, P. McKenzie, and C. Picaronny.
A Well-Structured Framework for Analysing Petri Net
Extensions.
Research Report LSV-99-2, Laboratoire Spécification et
Vérification, ENS Cachan, France, February 1999.
[ BibTex |
Web page |
PS ]
-
[Sch99]
-
Ph. Schnoebelen.
Decomposable Regular Languages and the Shuffle Operator.
EATCS Bulletin, 67:283--289, February 1999.
[ BibTex |
Web page |
PS |
PDF ]
-
[Pet99b]
-
L. Petrucci.
Promela et Spin : exercices corrigés,
1999.
[ BibTex ]
-
[Pet99c]
-
L. Petrucci.
Un exemple de langage parallèle asynchrone :
Promela.
Polycopié de cours, IEE, Évry, France, 1999.
[ BibTex ]
-
[Pet99a]
-
L. Petrucci.
Promela et Spin : exercices.
Polycopié, IEE, Évry, France, 1999.
[ BibTex ]
-
[HCRT99]
-
H. Hußmann, M. Cerioli, G. Reggio, and F. Tort.
Abstract Data Types and UML Models.
Technical Report DISI-TR-99-15, DISI, Universitá di Genova,
Italy, 1999.
[ BibTex ]
-
[BST99]
-
M. Bidoit, D. Sannella, and A. Tarlecki.
Architectural Specifications in CASL.
In Proceedings of the 7th International Conference on
Algebraic Methodology and Software Technology (AMAST'98), volume
1548 of Lecture Notes in Computer Science, pages 341--357, Amazonia, Brasil,
January 1999. Springer.
[ BibTex |
Web page |
PS |
PDF ]
-
[HB99]
-
R. Hennicker and M. Bidoit.
Observational Logic.
In Proceedings of the 7th International Conference on
Algebraic Methodology and Software Technology (AMAST'98), volume
1548 of Lecture Notes in Computer Science, pages 263--277, Amazonia, Brasil,
January 1999. Springer.
[ BibTex |
Web page |
PS ]
-
[BCH99]
-
M. Bidoit, M. V. Cengarle, and R. Hennicker.
Proof systems for structured specifications and their
refinements.
In Algebraic Foundations of Systems Specification, chapter 11, pages
385--433. Springer, 1999.
[ BibTex |
Web page |
PS ]
-
[SFRC99]
-
G. Sutre, A. Finkel, O. F. Roux, and F. Cassez.
Effective Recognizability and Model Checking of Reactive Fiffo
Automata.
In Proceedings of the 7th International Conference on
Algebraic Methodology and Software Technology (AMAST'98), volume
1548 of Lecture Notes in Computer Science, pages 106--123, Amazonia, Brasil,
January 1999. Springer.
[ BibTex |
Web page |
PS ]
This file was generated by
bibtex2html 1.98.