Publications : 1997
-
[DF97]
-
C. Dufourd and A. Finkel.
Polynomial-Time Many-One Reductions for Petri Nets.
In Proceedings of the 17th Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS'97),
volume 1346 of Lecture Notes in Computer Science, pages 312--326, Kharagpur,
India, December 1997. Springer.
[ BibTex |
Web page |
PS |
PDF ]
-
[Wil97]
-
N. Williams-Preston.
An Experiment in Reverse Engineering Using Algebraic
Specifications.
Research Report LSV-97-10, Laboratoire Spécification et
Vérification, ENS Cachan, France, November 1997.
[ BibTex |
Web page |
PS |
PDF ]
-
[BB97]
-
B. Bérard and M. Bidoit.
Contribution du LSV à l'opération 2 << Étude de
cas SRIC >>.
Contract report, Action FORMA, October 1997.
29 pages.
[ BibTex ]
-
[CFG97b]
-
Ch. Collet, A. Finkel, and R. Gherbi.
Gaze Capture System in Man-Machine Interaction.
In Proceedings of the IEEE International Conference on
Intelligent Engineering Systems (INES'97), pages 557--581, Budapest,
Hungary, September 1997. IEEE Press.
[ BibTex |
Web page |
PS |
PDF ]
-
[KS97a]
-
O. Kouchnarenko and Ph. Schnoebelen.
A Formal Framework for the Analysis of Recursive-Parallel
Programs.
In Proceedings of the 4th International Conference on
Parallel Computing Technologies (PaCT'97), volume 1277 of Lecture
Notes in Computer Science, pages 45--59, Yaroslavl, Russia, September 1997.
Springer.
doi:
10.1007/3-540-63371-5_6.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[LS97]
-
F. Laroussinie and Ph. Schnoebelen.
Specification in CTL+Past, Verification in CTL.
In Proceedings of the 4th International Workshop on
Expressiveness in Concurrency (EXPRESS'97), volume 7 of Electronic
Notes in Theoretical Computer Science, pages 161--184, Santa Margherita
Ligure, Italy, September 1997. Elsevier Science Publishers.
doi:
10.1016/S1571-0661(05)80472-4.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[Sut97]
-
G. Sutre.
Vérification de propriétés sur les automates à
file réactifs produits par compilation de programmes Electre.
Rapport de DEA, DEA Algorithmique, Paris, France, September 1997.
[ BibTex |
Web page |
PS |
PDF ]
-
[BP97b]
-
B. Bérard and C. Picaronny.
Accepting Zeno Words without Making Time Stand Still.
In Proceedings of the 22nd International Symposium on
Mathematical Foundations of Computer Science (MFCS'97), volume 1295
of Lecture Notes in Computer Science, pages 149--158, Bratislava, Slovakia,
August 1997. Springer.
[ BibTex |
Web page |
PS |
PDF ]
-
[MP97]
-
R. Meyer and A. Petit.
Decomposition of TrPTL Formulas.
In Proceedings of the 22nd International Symposium on
Mathematical Foundations of Computer Science (MFCS'97), volume 1295
of Lecture Notes in Computer Science, pages 418--427, Bratislava, Slovakia,
August 1997. Springer.
[ BibTex |
Web page |
PS |
PDF ]
-
[FWW97]
-
A. Finkel, B. Willems, and P. Wolper.
A Direct Symbolic Approach to Model Checking Pushdown Systems
(Extended Abstract).
In Proceedings of the 2nd International Workshop on
Verification of Infinite State Systems (INFINITY'97), volume 9 of
Electronic Notes in Theoretical Computer Science, pages 27--39, Bologna,
Italy, July 1997. Elsevier Science Publishers.
[ BibTex |
Web page |
PS |
PDF ]
-
[BF97]
-
Z. Bouziane and A. Finkel.
Cyclic Petri Net Reachability Sets are Semi-Linear Effectively
Constructible.
In Proceedings of the 2nd International Workshop on
Verification of Infinite State Systems (INFINITY'97), volume 9 of
Electronic Notes in Theoretical Computer Science, pages 15--24, Bologna,
Italy, July 1997. Elsevier Science Publishers.
[ BibTex |
Web page |
PS |
PDF ]
-
[CJ97]
-
H. Comon and F. Jacquemard.
Ground Reducibility is EXPTIME-Complete.
In Proceedings of the 12th Annual IEEE Symposium on Logic
in Computer Science (LICS'97), pages 26--34, Warsaw, Poland, July 1997.
IEEE Computer Society Press.
[ BibTex |
Web page |
PS |
PDF ]
-
[Com97a]
-
H. Comon.
Applications of Tree Automata in Rewriting and Lambda-Calculus.
Invited lecture, 12th Annual IEEE Symposium on Logic in
Computer Science (LICS'97), Warsaw, Poland, July 1997.
[ BibTex ]
-
[FO97b]
-
L. Fribourg and H. Olsén.
Proving Safety Properties of Infinite State Systems by
Compilation into Presburger Arithmetic.
In Proceedings of the 8th International Conference on
Concurrency Theory (CONCUR'97), volume 1243 of Lecture Notes in
Computer Science, pages 213--227, Warsaw, Poland, July 1997. Springer.
[ BibTex |
Web page |
PS |
PDF ]
-
[FO97c]
-
L. Fribourg and H. Olsén.
Reachability Sets of Parametrized Rings As Regular Languages.
In Proceedings of the 2nd International Workshop on
Verification of Infinite State Systems (INFINITY'97), volume 9 of
Electronic Notes in Theoretical Computer Science, page 40, Bologna, Italy,
July 1997. Elsevier Science Publishers.
[ BibTex |
Web page |
PS |
PDF ]
-
[CF97]
-
G. Cécé and A. Finkel.
Programs with Quasi-Stable Channels are Effectively
Recognizable.
In Proceedings of the 9th International Conference on
Computer Aided Verification (CAV'97), volume 1254 of Lecture Notes in
Computer Science, pages 304--315, Haifa, Israel, June 1997. Springer.
[ BibTex |
Web page |
PS |
PDF ]
-
[BP97a]
-
F. Belala and L. Petrucci.
Sémantique des ECATNets en termes de CPNets :
application à un exemple de production.
In Actes de la 1ère Conférence Francophone de
Modélisation et de Simulation (MOSIM'97), Rouen, France, June 1997.
Hermès.
[ BibTex ]
-
[MBBP97]
-
M. Maouche, M. Bettaz, G. Berthelot, and L. Petrucci.
Du vrai parallélisme dans les réseaux algébriques et
de son application dans les systèmes de production.
In Actes de la 1ère Conférence Francophone de
Modélisation et de Simulation (MOSIM'97), pages 417--424, Rouen,
France, June 1997. Hermès.
[ BibTex ]
-
[Com97b]
-
H. Comon, editor.
Proceedings of the 8th International Conference on
Rewriting Techniques and Applications (RTA'97), volume 1232 of
Lecture Notes in Computer Science. Springer, June 1997.
[ BibTex |
Web page ]
-
[Com97c]
-
H. Comon.
Une approche logique des contrôles logiques.
Rapport de contrat EDF/DER/MOS--LSV, June 1997.
[ BibTex ]
-
[BPR97]
-
M. Bidoit, Ch. Pellen, and J. Ryckbosch.
Plan de Défense --- Formalisation du cahier des charges du
Point Central à l'aide de spécifications algébriques.
In Application des techniques formelles au logiciel, ARAGO 20,
chapter 7, pages 123--132. Observatoire Français des Techniques
Avancées, June 1997.
[ BibTex ]
-
[CFG97a]
-
Ch. Collet, A. Finkel, and R. Gherbi.
CapRe : un système de capture du regard dans un contexte
d'interaction homme-machine.
In Actes des 6èmes Journées Internationales
Interfaces, pages 36--39, Montpellier, France, May 1997.
[ BibTex |
Web page |
PS |
PDF ]
-
[Duf97]
-
C. Dufourd.
Une extension d'un résultat d'indécidabilité pour
les automates temporisés.
In Actes des 9èmes Rencontres Francophones du
Parallélisme (RENPAR'97), pages 219--222, Lausanne, Switzerland, May
1997.
[ BibTex |
Web page |
PS |
PDF ]
-
[Céc97]
-
G. Cécé.
Les programmes utilisant des canaux quasi-stables sont
effectivement reconnaissables.
In Actes des 9èmes Rencontres Francophones du
Parallélisme (RENPAR'97), pages 215--218, Lausanne, Switzerland, May
1997.
[ BibTex ]
-
[CT97]
-
H. Comon and R. Treinen.
The First-Order Theory of Lexicographic Path Orderings is
Undecidable.
Theoretical Computer Science, 176(1-2):67--87, April 1997.
[ BibTex |
Web page |
PS |
PDF ]
-
[KLL+97]
-
K. J. Kristoffersen, F. Laroussinie, K. G. Larsen,
P. Pettersson, and W. Yi.
A Compositional Proof of a Real-Time Mutual Exclusion Protocol.
In Proceedings of the 7th International Joint Conference
CAAP/FASE on Theory and Practice of Software Development
(TAPSOFT'97), volume 1214 of Lecture Notes in Computer Science, pages
565--579, Lille, France, April 1997. Springer.
doi:
10.1007/BFb0030626.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BD97]
-
M. Bidoit and M. Dauchet, editors.
Proceedings of the 7th International Joint Conference
CAAP/FASE on Theory and Practice of Software Development
(TAPSOFT'97), volume 1214 of Lecture Notes in Computer Science. Lille,
France, Springer, April 1997.
[ BibTex |
Web page ]
-
[Fin97]
-
A. Finkel.
Algorithms and Semi-Algorithms for Infinite State Systems.
In Proceedings of the Grenoble-Alpes d'Huez European
School of Computer Science, Methods and Tools for the
Verification of Infinite State Systems, pages 189--190, Grenoble,
France, March 1997.
Invited tutorial.
[ BibTex ]
-
[FM97]
-
A. Finkel and P. McKenzie.
Verifying Identical Communicating Processes is Undecidable.
Theoretical Computer Science, 174(1-2):217--230, March 1997.
[ BibTex |
Web page |
PS |
PDF ]
-
[DGP97]
-
V. Diekert, P. Gastin, and A. Petit.
Removing ε-Transitions in Timed Automata.
In Proceedings of the 14th Annual Symposium on Theoretical
Aspects of Computer Science (STACS'97), volume 1200 of Lecture Notes
in Computer Science, pages 583--594, Lübeck, Germany, February 1997.
Springer.
[ BibTex |
Web page |
PS |
PDF ]
-
[HWB97]
-
R. Hennicker, M. Wirsing, and M. Bidoit.
Proof Systems for Structured Specifications with Observability
Operators.
Theoretical Computer Science, 173(2):393--443, February 1997.
[ BibTex ]
-
[CFG97c]
-
Ch. Collet, A. Finkel, and R. Gherbi.
Prise en compte dynamique des attitudes perceptive de l'usager.
Rapport de synthèse (version IV de l'Action Inter-PRC 10.2
GDR-PRC ISIS & CHM : << Interaction Système-Environnement pour
l'Interprétation des Signaux et des Images >>, 1997.
[ BibTex ]
-
[CCP97]
-
B. Charron-Bost, R. Cori, and A. Petit.
Introduction à l'algorithmique en mémoire partagée.
RAIRO Informatique Théorique et Applications, 31(2):97--148,
1997.
[ BibTex |
Web page |
PS |
PDF ]
-
[BCK+97]
-
J.-C. Bajard, H. Comon, C. Kenyon, D. Krob, M. Morvan, J.-M.
Muller, A. Petit, and Y. Robert.
Exercices d'algorithmique (oraux d'ENS).
Vuibert, January 1997.
[ BibTex ]
-
[KS97b]
-
O. Kouchnarenko and Ph. Schnoebelen.
A Model for Recursive-Parallel Programs.
In Proceedings of the 1st International Workshop on
Verification of Infinite State Systems (INFINITY'96), volume 5 of
Electronic Notes in Theoretical Computer Science, page 30, Pisa, Italy, 1997.
Elsevier Science Publishers.
doi:
10.1016/S1571-0661(05)82512-5.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[FO97a]
-
L. Fribourg and H. Olsén.
A Decompositional Approach for Computing Least Fixed-Points of
Datalog Programs with Z-Counters.
Constraints, 2(3-4):305--335, 1997.
[ BibTex |
Web page |
PS |
PDF ]
This file was generated by
bibtex2html 1.98.