Publications : 2009
-
[CDMP09]
-
F. Chevalier, D. D'Souza, R. M. Matteplackel, and
P. Prabhakar.
Automata and logics over finitely varying functions.
Annals of Pure and Applied Logics, 161(3):324--336, December 2009.
doi:
10.1016/j.apal.2009.07.007.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Mer09]
-
A. Mercier.
Contributions à l'analyse automatique des protocoles
cryptographiques en présence de propriétés algébriques :
protocoles de groupe, équivalence statique.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, December 2009.
[ BibTex |
Web page |
PDF ]
-
[Bur09a]
-
S. Bursuc.
Contraintes de déductibilité dans une algèbre
quotient: réduction de modèles et applications à la
sécurité.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, December 2009.
[ BibTex |
Web page |
PDF ]
-
[Gou09a]
-
J. Goubault-Larrecq.
Logic Wins!.
In Proceedings of the 13th Asian Computing Science
Conference (ASIAN'09), volume 5913 of Lecture Notes in Computer Science,
pages 1--16, Seoul, Korea, December 2009. Springer.
doi:
10.1007/978-3-642-10622-4_1.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DJLL09]
-
S. Demri, M. Jurdziński, O. Lachish, and R. Lazić.
The covering and boundedness problems for branching vector
addition systems.
In Proceedings of the 29th Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS'09),
volume 4 of Leibniz International Proceedings in Informatics, pages 181--192,
Kanpur, India, December 2009. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.FSTTCS.2009.2317.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DKP09]
-
S. Delaune, S. Kremer, and O. Pereira.
Simulation based security in the applied pi calculus.
In Proceedings of the 29th Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS'09),
volume 4 of Leibniz International Proceedings in Informatics, pages 169--180,
Kanpur, India, December 2009. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.FSTTCS.2009.2316.
[ BibTex |
DOI |
Web page |
PDF ]
-
[VLC09]
-
J. Villard, É. Lozes, and C. Calcagno.
Proving Copyless Message Passing.
In Proceedings of the 7th Asian Symposium on Programming
Languages and Systems (APLAS'09), volume 5904 of Lecture Notes in
Computer Science, pages 194--209, Seoul, Korea, December 2009. Springer.
doi:
10.1007/978-3-642-10672-9_15.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BBC09]
-
P. Bouyer, Th. Brihaye, and F. Chevalier.
Weighted O-Minimal Hybrid Systems.
Annals of Pure and Applied Logics, 161(3):268--288, December 2009.
doi:
10.1016/j.apal.2009.07.014.
[ BibTex |
DOI |
Web page |
PDF ]
-
[KMT09a]
-
S. Kremer, A. Mercier, and R. Treinen.
Reducing Equational Theories for the Decision of Static
Equivalence.
In Proceedings of the 13th Asian Computing Science
Conference (ASIAN'09), volume 5913 of Lecture Notes in Computer Science,
pages 94--108, Seoul, Korea, December 2009. Springer.
doi:
10.1007/978-3-642-10622-4_8.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BDC09]
-
S. Bursuc, S. Delaune, and H. Comon-Lundh.
Deducibility constraints.
In Proceedings of the 13th Asian Computing Science
Conference (ASIAN'09), volume 5913 of Lecture Notes in Computer Science,
pages 24--38, Seoul, Korea, December 2009. Springer.
doi:
10.1007/978-3-642-10622-4_3.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BDL09]
-
R. Brochenin, S. Demri, and É. Lozes.
Reasoning about sequences of memory states.
Annals of Pure and Applied Logics, 161(3):305--323, December 2009.
doi:
10.1016/j.apal.2009.07.004.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DG09a]
-
S. Demri and R. Gascon.
The Effects of Bounding Syntactic Resources on Presburger
LTL.
Journal of Logic and Computation, 19(6):1541--1575, December 2009.
doi:
10.1093/logcom/exp037.
[ BibTex |
DOI |
Web page |
PDF ]
-
[ASV09b]
-
S. Abiteboul, L. Segoufin, and V. Vianu.
Static Analysis of Active XML Systems.
ACM Transactions on Database Systems, 34(4), December 2009.
doi:
10.1145/1620585.1620590.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Haa09]
-
S. Haar.
Qualitative Diagnosability of Labeled Petri Nets Revisited.
In Proceedings of the Joint 48th IEEE Conference on Decision
and Control (CDC'09) and 28th Chinese Control Conference
(CCC'09), pages 1248--1253, Shanghai, China, December 2009. IEEE Control
System Society.
doi:
10.1109/CDC.2009.5400917.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Bou09a]
-
F. Bouchy.
Logiques et modèles pour la vérification de systèmes
infinis.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, November 2009.
[ BibTex |
Web page |
PDF ]
-
[Szn09]
-
N. Sznajder.
Synthèse de systèmes distribués ouverts.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, November 2009.
[ BibTex |
Web page |
PDF ]
-
[SRKK09]
-
B. Smyth, M. D. Ryan, S. Kremer, and M. Kourjieh.
Election verifiability in electronic voting protocols
(Preliminary version).
In Proceedings of the 4th Benelux Workshop on Information and
System Security (WISSEC'09), Louvain-la-Neuve, Belgium, November 2009.
[ BibTex |
Web page |
PDF ]
-
[BFS09a]
-
F. Bouchy, A. Finkel, and P. San Pietro.
Dense-choice Counter Machines Revisited.
In Proceedings of the 11th International Workshops on
Verification of Infinite State Systems (INFINITY'09), volume 10 of
Electronic Proceedings in Theoretical Computer Science, pages 3--22, Bologna,
Italy, November 2009.
doi:
10.4204/EPTCS.10.1.
[ BibTex |
DOI |
Web page |
PDF ]
-
[AF09a]
-
É. André and L. Fribourg.
An Inverse Method for Policy-Iteration Based Algorithms.
In Proceedings of the 11th International Workshops on
Verification of Infinite State Systems (INFINITY'09), volume 10 of
Electronic Proceedings in Theoretical Computer Science, pages 44--61,
Bologna, Italy, November 2009.
doi:
10.4204/EPTCS.10.4.
[ BibTex |
DOI |
Web page |
PDF ]
-
[HMY09]
-
S. Haddad, L. Mokdad, and S. Youcef.
Bornes du temps de réponse des services Web composites.
In Actes du 7ème Colloque sur la Modélisation des
Systèmes Réactifs (MSR'09), volume 43 of Journal Européen
des Systèmes Automatisés, pages 969--983, Nantes, France, November
2009. Hermès.
[ BibTex |
Web page |
PDF ]
-
[ACD+09a]
-
É. André, Th. Chatain, O. De Smet,
L. Fribourg, and S. Ruel.
Synthèse de contraintes temporisées pour une
architecture d'automatisation en réseau.
In Actes du 7ème Colloque sur la Modélisation des
Systèmes Réactifs (MSR'09), volume 43 of Journal Européen
des Systèmes Automatisés, pages 1049--1064, Nantes, France, November
2009. Hermès.
[ BibTex |
Web page |
PDF ]
-
[Ste09b]
-
G. Steel.
Towards a Formal Analysis of the SeVeCoM API.
In Proceedings of the 7th Conference on Embedded Security in
Cars (ESCAR'09), Düsseldorf, Germany, November 2009.
[ BibTex |
Web page |
PDF ]
-
[LCE+09]
-
LIAFA, CRIL, EDF, LSV, and Verimag.
Projet RNTL Averiles -- Fourniture F2.2 : Algorithmes de
vérification -- Rapport final, November 2009.
25 pages.
[ BibTex |
Web page |
PDF ]
-
[FLS09a]
-
A. Finkel, É. Lozes, and A. Sangnier.
Towards Model Checking Pointer Systems.
In Revised Selected Papers of the International Conference
on Infinity in Logic & Computation (ILC'07), volume 5489 of
Lecture Notes in Artificial Intelligence, pages 56--82, Cape Town, South
Africa, October 2009. Springer-Verlag.
doi:
10.1007/978-3-642-03092-5_6.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[AKSS09]
-
S. Abiteboul, B. Kimelfeld, Y. Sagiv, and P. Senellart.
On the expressiveness of probabilistic XML models.
The VLDB Journal, 18(5):1041--1064, October 2009.
doi:
10.1007/s00778-009-0146-1.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CM09]
-
F. Cassez and N. Markey.
Control of Timed Systems.
In Communicating Embedded Systems -- Software and Design, chapter 3,
pages 83--120. Wiley-ISTE, October 2009.
[ BibTex |
Web page ]
-
[DH09]
-
S. Donatelli and S. Haddad.
Quantitative Verification of Markov Chains.
In Communicating Embedded Systems -- Software and Design, chapter 5,
pages 139--163. Wiley-ISTE, October 2009.
[ BibTex |
Web page ]
-
[Cha09]
-
N. Chamseddine.
Analyse quantitative parametrée d'automates temporisés
probabilistes.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, October 2009.
[ BibTex |
Web page |
PDF ]
-
[CCD09]
-
V. Cheval, H. Comon-Lundh, and S. Delaune.
A decision procedure for proving observational equivalence.
In Preliminary Proceedings of the 7th International Workshop
on Security Issues in Coordination Models, Languages and Systems
(SecCo'09), Bologna, Italy, October 2009.
[ BibTex |
Web page |
PDF ]
-
[Dim09]
-
J. Dimino.
Les systèmes à canaux non-fiables vus comme des
transducteurs.
Rapport de stage de M1, Master Parisien de Recherche en
Informatique, Paris, France, October 2009.
[ BibTex |
Web page |
PDF ]
-
[FLS09b]
-
R. Focardi, F. L. Luccio, and G. Steel.
Blunting Differential Attacks on PIN Processing APIs.
In Proceedings of the 14th Nordic Workshop on Secure IT
Systems (NordSec'09), volume 5838 of Lecture Notes in Computer Science,
pages 88--103, Oslo, Norway, October 2009. Springer.
doi:
10.1007/978-3-642-04766-4_7.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BCHK09]
-
Y. Boichut, R. Courbis, P.-C. Héam, and
O. Kouchnarenko.
Handling Non-left Linear Rules when Completing Tree Automata.
International Journal of Foundations of Computer Science,
20(5):837--849, October 2009.
doi:
10.1142/S0129054109006917.
[ BibTex |
DOI |
Web page |
PDF ]
-
[ACEF09]
-
É. André, Th. Chatain, E. Encrenaz, and
L. Fribourg.
An Inverse Method for Parametric Timed Automata.
International Journal of Foundations of Computer Science,
20(5):819--836, October 2009.
doi:
10.1142/S0129054109006905.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DHL09]
-
F. Dadeau, P.-C. Héam, and J. Levrey.
On the Use of Uniform Random Generation of Automata for
Testing.
In Proceedings of the 5th Workshop on Model-Based Testing
(MBT'09), volume 253 of Electronic Notes in Theoretical Computer Science,
pages 37--51, York, UK, October 2009. Elsevier Science Publishers.
doi:
10.1016/j.entcs.2009.09.050.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BS09a]
-
M. Benedikt and L. Segoufin.
Regular tree languages definable in FO and in
FO_mod.
ACM Transactions on Computational Logic, 11(1), October 2009.
doi:
10.1145/1614431.1614435.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DBB+09]
-
A. David, G. Behrmann, P. Bulychev, J. Byg,
Th. Chatain, K. G. Larsen, P. Pettersson, J. I. Rasmussen, J. Srba, W. Yi,
K. Y. Joergensen, D. Lime, M. Magnin, O. H. Roux, and L.-M. Traonouez.
Tools for Model-Checking Timed Systems.
In Communicating Embedded Systems -- Software and Design, chapter 6,
pages 165--225. Wiley-ISTE, October 2009.
[ BibTex |
Web page ]
-
[ASV09a]
-
S. Abiteboul, L. Segoufin, and V. Vianu.
Modeling and Verifying Active XML Artifacts.
IEEE Data Engineering Bulletin, 32(3):10--15, September 2009.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Che09]
-
V. Cheval.
Algorithme de décision de l'équivalence symbolique de
systèmes de contraintes.
Rapport de Master, Master Parisien de Recherche en
Informatique, Paris, France, September 2009.
[ BibTex |
Web page |
PDF ]
-
[Bre09]
-
R. Brenguier.
Calcul des équilibres de Nash dans les jeux temporisés.
Rapport de Master, Master Parisien de Recherche en
Informatique, Paris, France, September 2009.
[ BibTex |
Web page |
PS |
PDF ]
-
[BCH+09]
-
C. Boutrous-Saab, D. Coulibaly, S. Haddad, T. Melliti,
P. Moreaux, and S. Rampacek.
An Integrated Framework for Web Services Orchestration.
International Journal of Web Services Research, 6(4):1--29, September
2009.
[ BibTex |
Web page |
PDF ]
-
[AFS09]
-
É. André, L. Fribourg, and J. Sproston.
An Extension of the Inverse Method to Probabilistic Timed
Automata.
In Proceedings of the 9th International Workshop on Automated
Verification of Critical Systems (AVoCS'09), volume 23 of Electronic
Communications of the EASST, Swansea, UK, September 2009. European
Association of Software Science and Technology.
[ BibTex |
Web page |
PDF ]
-
[CDL09]
-
Th. Chatain, A. David, and K. G. Larsen.
Playing Games with Timed Games.
In Proceedings of the 3rd IFAC Conference on Analysis and
Design of Hybrid Systems (ADHS'09), Zaragoza, Spain, September 2009.
[ BibTex |
Web page |
PDF ]
-
[BHK09]
-
Y. Boichut, P.-C. Héam, and O. Kouchnarenko.
How to Tackle Integer Weighted Automata Positivity.
In Proceedings of the 3rd Workshop on Reachability Problems
in Computational Models (RP'09), volume 5797 of Lecture Notes in
Computer Science, pages 79--92, Palaiseau, France, September 2009. Springer.
doi:
10.1007/978-3-642-04420-5_9.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BCDL09]
-
P. Bulychev, Th. Chatain, A. David, and K. G.
Larsen.
Checking simulation relation between timed game automata.
In Proceedings of the 7th International Conference on Formal
Modelling and Analysis of Timed Systems (FORMATS'09), volume 5813
of Lecture Notes in Computer Science, pages 73--87, Budapest, Hungary,
September 2009. Springer.
doi:
10.1007/978-3-642-04368-0_8.
[ BibTex |
DOI |
Web page |
PDF ]
-
[HP09]
-
S. Haddad and N. Pekergin.
Using Stochastic Comparison for Efficient Model Checking of
Uncertain Markov Chains.
In Proceedings of the 6th International Conference on
Quantitative Evaluation of Systems (QEST'09), pages 177--186,
Budapest, Hungary, September 2009. IEEE Computer Society Press.
doi:
10.1109/QEST.2009.42.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CFLS09]
-
M. Centenaro, R. Focardi, F. L. Luccio, and G. Steel.
Type-based Analysis of PIN Processing APIs.
In Proceedings of the 14th European Symposium on Research in
Computer Security (ESORICS'09), volume 5789 of Lecture Notes in
Computer Science, pages 53--68, Saint Malo, France, September 2009. Springer.
doi:
10.1007/978-3-642-04444-1_4.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CS09]
-
V. Cortier and G. Steel.
A generic security API for symmetric key management on
cryptographic devices.
In Proceedings of the 14th European Symposium on Research in
Computer Security (ESORICS'09), volume 5789 of Lecture Notes in
Computer Science, pages 605--620, Saint Malo, France, September 2009.
Springer.
doi:
10.1007/978-3-642-04444-1_37.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CAM09]
-
B. Cautis, S. Abiteboul, and T. Milo.
Reasoning about XML update constraints.
Journal of Computer and System Sciences, 75(6):336--358, September
2009.
doi:
10.1016/j.jcss.2009.02.001.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BHR09a]
-
A. Bouillard, S. Haar, and S. Rosario.
Critical paths in the Partial Order Unfolding of a Stochastic
Petri Net.
In Proceedings of the 7th International Conference on Formal
Modelling and Analysis of Timed Systems (FORMATS'09), volume 5813
of Lecture Notes in Computer Science, pages 43--57, Budapest, Hungary,
September 2009. Springer.
doi:
10.1007/978-3-642-04368-0_6.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BDMR09]
-
P. Bouyer, M. Duflot, N. Markey, and G. Renault.
Measuring Permissivity in Finite Games.
In Proceedings of the 20th International Conference on
Concurrency Theory (CONCUR'09), volume 5710 of Lecture Notes in
Computer Science, pages 196--210, Bologna, Italy, September 2009. Springer.
doi:
10.1007/978-3-642-04081-8_14.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CC09]
-
S. Ciobâcă and V. Cortier.
Algorithmes pour l'équivalence statique.
Deliverable AVOTE 2.1 (ANR-07-SESU-002), September 2009.
17 pages.
[ BibTex |
Web page |
PDF ]
-
[BK09]
-
M. Boreale and S. Kremer, editors.
Proceedings of the 7th International Workshop on
Security Issues in Concurrency (SecCo'09), volume 7 of Electronic
Proceedings in Theoretical Computer Science, Bologna, Italy, August 2009.
doi:
10.4204/EPTCS.7.
[ BibTex |
DOI |
Web page ]
-
[FS09a]
-
D. Figueira and L. Segoufin.
Future-looking logics on data words and trees.
In Proceedings of the 34th International Symposium on
Mathematical Foundations of Computer Science (MFCS'09), volume 5734
of Lecture Notes in Computer Science, pages 331--343, Novy Smokovec,
Slovakia, August 2009. Springer.
doi:
10.1007/978-3-642-03816-7_29.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[KAS09]
-
G. Keighren, D. Aspinall, and G. Steel.
Towards a Type System for Security APIs.
In Revised Selected Papers of the Joint Workshop on
Automated Reasoning for Security Protocol Analysis and Issues in
the Theory of Security (ARSPA-WITS'09), volume 5511 of Lecture Notes in
Computer Science, pages 173--192, York, UK, August 2009. Springer.
doi:
10.1007/978-3-642-03459-6_12.
[ BibTex |
DOI |
Web page |
PDF ]
-
[FS09b]
-
S. Fröschle and G. Steel.
Analysing PKCS#11 Key Management APIs with Unbounded Fresh
Data.
In Revised Selected Papers of the Joint Workshop on
Automated Reasoning for Security Protocol Analysis and Issues in
the Theory of Security (ARSPA-WITS'09), volume 5511 of Lecture Notes in
Computer Science, pages 92--106, York, UK, August 2009. Springer.
doi:
10.1007/978-3-642-03459-6_7.
[ BibTex |
DOI |
Web page |
PDF ]
-
[LA09]
-
D. Longuet and M. Aiguier.
Integration Testing from Structured First-Order Specifications
via Deduction Modulo.
In Proceedings of the 6th International Colloquium on
Theoretical Aspects of Computing (ICTAC'09), volume 5684 of Lecture
Notes in Computer Science, pages 261--276, Kuala Lumpur, Malaysia, August
2009. Springer.
doi:
10.1007/978-3-642-03466-4_17.
[ BibTex |
DOI |
Web page |
PDF ]
-
[And09b]
-
É. André.
IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds
of Timed Automata.
In Proceedings of the 6th International Colloquium on
Theoretical Aspects of Computing (ICTAC'09), volume 5684 of Lecture
Notes in Computer Science, pages 336--342, Kuala Lumpur, Malaysia, August
2009. Springer.
doi:
10.1007/978-3-642-03466-4_22.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CDK09c]
-
S. Ciobâcă, S. Delaune, and S. Kremer.
Computing knowledge in security protocols under convergent
equational theories.
In Proceedings of the 22nd International Conference on
Automated Deduction (CADE'09), volume 5663 of Lecture Notes in Computer
Science, pages 355--370, Montreal, Canada, August 2009. Springer.
doi:
10.1007/978-3-642-02959-2_27.
[ BibTex |
DOI |
Web page |
PDF ]
-
[KP09]
-
S. Kremer and P. Panangaden, editors.
Proceedings of the 6th International Workshop on
Security Issues in Concurrency (SecCo'08), volume 242 of
Electronic Notes in Theoretical Computer Science, Toronto, Canada, August
2009. Elsevier Science Publishers.
doi:
10.1016/j.entcs.2009.07.077.
[ BibTex |
DOI |
Web page ]
-
[EF09]
-
E. Encrenaz and A. Finkel.
Automatic verification of counter systems with ranking
functions.
In Joint Proceedings of the 8th, 9th and 10th International
Workshops on Verification of Infinite State Systems
(INFINITY'06,'07,'08), volume 239 of Electronic Notes in Theoretical
Computer Science, pages 85--103. Elsevier Science Publishers, July 2009.
doi:
10.1016/j.entcs.2009.05.032.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[DKR09]
-
S. Delaune, S. Kremer, and M. D. Ryan.
Verifying Privacy-type Properties of Electronic Voting
Protocols.
Journal of Computer Security, 17(4):435--487, July 2009.
doi:
10.3233/JCS-2009-0340.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BFS09b]
-
F. Bouchy, A. Finkel, and A. Sangnier.
Reachability in Timed Counter Systems.
In Joint Proceedings of the 8th, 9th and 10th International
Workshops on Verification of Infinite State Systems
(INFINITY'06,'07,'08), volume 239 of Electronic Notes in Theoretical
Computer Science, pages 167--178. Elsevier Science Publishers, July 2009.
doi:
10.1016/j.entcs.2009.05.038.
[ BibTex |
DOI |
Web page |
PDF ]
-
[HV09a]
-
P. Habermehl and T. Vojnar, editors.
Joint Proceedings of the 8th, 9th and 10th International
Workshops on Verification of Infinite State Systems
(INFINITY'06,'07,'08), volume 239 of Electronic Notes in Theoretical
Computer Science. Elsevier Science Publishers, July 2009.
doi:
10.1016/j.entcs.2009.05.026.
[ BibTex |
DOI ]
-
[And09a]
-
É. André.
Everything You Always Wanted to Know About IMITATOR (But Were
Afraid to Ask).
Research Report LSV-09-20, Laboratoire Spécification et
Vérification, ENS Cachan, France, July 2009.
11 pages.
[ BibTex |
Web page |
PDF ]
-
[AF09b]
-
C. Areces and D. Figueira.
Which Semantics for Neighbourhood Semantics?
In Proceedings of the 21st International Joint Conference on
Artificial Intelligence (IJCAI'09), pages 671--676, Pasadena,
California, USA, July 2009. AAAI Press.
[ BibTex |
Web page |
PS |
PDF ]
-
[BHS09]
-
B. Bérard, S. Haddad, and M. Sassolas.
Verification on Interrupt Timed Automata.
Research Report LSV-09-16, Laboratoire Spécification et
Vérification, ENS Cachan, France, July 2009.
16 pages.
[ BibTex |
Web page |
PDF ]
-
[HN09]
-
P.-C. Héam and C. Nicaud.
Seed: an Easy-to-Use Random Generator of Recursive Data
Structures for Testing.
Research Report LSV-09-15, Laboratoire Spécification et
Vérification, ENS Cachan, France, July 2009.
16 pages.
[ BibTex |
Web page |
PDF ]
-
[CDK09b]
-
S. Ciobâcă, S. Delaune, and S. Kremer.
Computing knowledge in security protocols under convergent
equational theories.
In Preliminary Proceedings of the 4th International Workshop
on Security and Rewriting Techniques (SecReT'09), pages 47--58, Port
Jefferson, New York, USA, July 2009.
[ BibTex |
Web page |
PDF ]
-
[ACD09b]
-
M. Arnaud, V. Cortier, and S. Delaune.
Modeling and Verifying Ad Hoc Routing Protocol.
In Preliminary Proceedings of the 4th International Workshop
on Security and Rewriting Techniques (SecReT'09), pages 33--46, Port
Jefferson, New York, USA, July 2009.
[ BibTex |
Web page |
PS |
PDF ]
-
[KMT09b]
-
S. Kremer, A. Mercier, and R. Treinen.
Reducing Equational Theories for the Decision of Static
Equivalence (Preliminary Version).
In Preliminary Proceedings of the 4th International Workshop
on Security and Rewriting Techniques (SecReT'09), Port Jefferson,
New York, USA, July 2009.
[ BibTex |
Web page |
PS |
PDF ]
-
[AFGM09]
-
C. Areces, D. Figueira, D. Gorín, and S. Mera.
Tableaux and Model Checking for Memory Logics.
In Proceedings of the 18th International Workshop on Theorem
Proving with Analytic Tableaux and Related Methods (TABLEAUX'09),
volume 5607 of Lecture Notes in Artificial Intelligence, pages 47--61, Oslo,
Norway, July 2009. Springer.
doi:
10.1007/978-3-642-02716-1_5.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[CHK09]
-
R. Courbis, P.-C. Héam, and O. Kouchnarenko.
TAGED Approximations for Veriying Temporal Patterns.
In Proceedings of the 14th International Conference on
Implementation and Application of Automata (CIAA'09), volume 5642 of
Lecture Notes in Computer Science, pages 135--144, Sydney, Australia, July
2009. Springer-Verlag.
doi:
10.1007/978-3-642-02979-0_17.
[ BibTex |
DOI |
Web page |
PDF ]
-
[HNS09]
-
P.-C. Héam, C. Nicaud, and S. Schmitz.
Random Generation of Deterministic Tree (Walking) Automata.
In Proceedings of the 14th International Conference on
Implementation and Application of Automata (CIAA'09), volume 5642 of
Lecture Notes in Computer Science, pages 115--124, Sydney, Australia, July
2009. Springer-Verlag.
doi:
10.1007/978-3-642-02979-0_15.
[ BibTex |
DOI |
Web page |
PDF ]
-
[PS09]
-
Th. Place and L. Segoufin.
A decidable characterization of Locally Testable Tree
Languages.
In Proceedings of the 36th International Colloquium on
Automata, Languages and Programming (ICALP'09), volume 5556 of
Lecture Notes in Computer Science, pages 285--296, Rhodes, Greece, July 2009.
Springer.
doi:
10.1007/978-3-642-02930-1_24.
[ BibTex |
DOI |
Web page |
PDF ]
-
[FG09b]
-
A. Finkel and J. Goubault-Larrecq.
Forward Analysis for WSTS, Part II: Complete WSTS.
In Proceedings of the 36th International Colloquium on
Automata, Languages and Programming (ICALP'09), volume 5556 of
Lecture Notes in Computer Science, pages 188--199, Rhodes, Greece, July 2009.
Springer.
doi:
10.1007/978-3-642-02930-1_16.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BBBB09]
-
C. Baier, N. Bertrand, P. Bouyer, and Th. Brihaye.
When are Timed Automata Determinizable?
In Proceedings of the 36th International Colloquium on
Automata, Languages and Programming (ICALP'09), volume 5556 of
Lecture Notes in Computer Science, pages 43--54, Rhodes, Greece, July 2009.
Springer.
doi:
10.1007/978-3-642-02930-1_4.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BF09]
-
P. Bouyer and V. Forejt.
Reachability in Stochastic Timed Games.
In Proceedings of the 36th International Colloquium on
Automata, Languages and Programming (ICALP'09), volume 5556 of
Lecture Notes in Computer Science, pages 103--114, Rhodes, Greece, July 2009.
Springer.
doi:
10.1007/978-3-642-02930-1_9.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CD09a]
-
V. Cortier and S. Delaune.
A method for proving observational equivalence.
In Proceedings of the 22nd IEEE Computer Security
Foundations Symposium (CSF'09), pages 266--276, Port Jefferson, New
York, USA, July 2009. IEEE Computer Society Press.
doi:
10.1109/CSF.2009.9.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BHKL09]
-
B. Bollig, P. Habermehl, C. Kern, and M. Leucker.
Angluin-Style Learning of NFA.
In Proceedings of the 21st International Joint Conference on
Artificial Intelligence (IJCAI'09), pages 1004--1009, Pasadena,
California, USA, July 2009. AAAI Press.
[ BibTex |
Web page |
PDF ]
-
[Ste09a]
-
G. Steel.
Computational Soundness for APIs.
In Proceedings of the 5th Workshop on Formal and
Computational Cryptography (FCC'09), Port Jefferson, New York, USA,
July 2009.
[ BibTex |
Web page |
PDF ]
-
[LS09]
-
L. Libkin and C. Sirangelo.
Open and closed world assumptions in data exchange.
In Proceedings of the 22nd International Workshop Description
Logic (DL'09), volume 477 of CEUR Workshop Proceedings, pages 1--6,
Oxford, UK, July 2009. RWTH Aachen, Germany.
[ BibTex |
Web page |
PDF ]
-
[BYBJ09]
-
N. Ben Youssef, A. Bouhoula, and F. Jacquemard.
Automatic Verification of Conformance of Firewall Configurations
to Security Policies.
In Proceedings of the 14th IEEE Symposium on Computers and
Communications (ISCC'09), pages 526 -- 531, Sousse, Tunisia, July 2009.
IEEE Computer Society Press.
doi:
10.1109/ISCC.2009.5202309.
[ BibTex |
DOI |
Web page |
PDF ]
-
[LVN09]
-
F. Laroussinie, F. Vaandrager, and M. Neuhäußer.
Extended timed automata for scheduling.
Deliverable QUASIMODO 3.5 (ICT-FP7-STREP-214755), July 2009.
[ BibTex ]
-
[MBD+09]
-
N. Markey, J. Berendsen, A. David, T. Han, H. Hermanns, K. G.
Larsen, and M. Neuhäußer.
Symbolic data structures and analysis of models with multiple
quantitative aspects.
Deliverable QUASIMODO 2.2 (ICT-FP7-STREP-214755), July 2009.
[ BibTex ]
-
[ABGM09]
-
S. Abiteboul, P. Bourhis, A. Galland, and B. Marinoiu.
The AXML Artifact Model.
In Proceedings of the 16th International Symposium on
Temporal Representation and Reasoning (TIME'09), pages 11--17,
Brixen-Bressanone, Italy, July 2009. IEEE Computer Society Press.
[ BibTex |
Web page |
PDF ]
-
[AP09]
-
S. Abiteboul and N. Polyzotis.
Searching Shared Content in Communities with the Data Ring.
IEEE Data Engineering Bulletin, 32(2):44--51, June 2009.
[ BibTex |
DOI |
Web page |
PDF ]
-
[AEF09]
-
É. André, E. Encrenaz, and L. Fribourg.
Synthesizing Parametric Constraints on Various Case Studies
Using IMITATOR.
Research Report LSV-09-13, Laboratoire Spécification et
Vérification, ENS Cachan, France, June 2009.
18 pages.
[ BibTex |
Web page |
PDF ]
-
[ABC09]
-
M. Abadi, B. Blanchet, and H. Comon-Lundh.
Models and Proofs of Protocol Security: A Progress Report.
In Proceedings of the 21st International Conference on
Computer Aided Verification (CAV'09), volume 5643 of Lecture Notes in
Computer Science, pages 35--49, Grenoble, France, June-July 2009. Springer.
doi:
10.1007/978-3-642-02658-4_5.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BRBH09]
-
A. Bouillard, S. Rosario, A. Benveniste, and S. Haar.
Monotonicity in Service Orchestrations.
In Proceedings of the 30th International Conference on
Applications and Theory of Petri Nets (PETRI NETS'09), volume 5606
of Lecture Notes in Computer Science, pages 263--282, Paris, France, June
2009. Springer.
doi:
10.1007/978-3-642-02424-5_16.
[ BibTex |
DOI |
Web page |
PDF ]
-
[HKP+09]
-
S. Haddad, F. Kordon, L. Petrucci, J.-F. Pradat-Peyre, and
N. Trèves.
Efficient State-Based Analysis by Introducing Bags in Petri
Nets Color Domains.
In Proceedings of the 28th American Control Conference
(ACC'09), pages 5018--5025, Saint Louis, Missouri, USA, June 2009.
doi:
10.1109/ACC.2009.5160020.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BG09]
-
B. Bollig and P. Gastin.
Weighted versus Probabilistic Logics.
In Proceedings of the 13th International Conference on
Developments in Language Theory (DLT'09), volume 5583 of Lecture
Notes in Computer Science, pages 18--38, Stuttgart, Germany, June-July 2009.
Springer.
doi:
10.1007/978-3-642-02737-6_2.
[ BibTex |
DOI |
Web page |
PDF ]
-
[AGM09]
-
S. Abiteboul, G. Gottlob, and M. Manna.
Distributed XML Design.
In Proceedings of the 28th Annual ACM
SIGACT-SIGMOD-SIGART Symposium on Principles of Database
Systems (PODS'09), pages 247--258, Providence, Rhode Island, USA,
June-July 2009. ACM Press.
doi:
10.1145/1559795.1559833.
[ BibTex |
DOI |
Web page |
PDF ]
-
[ABM09b]
-
S. Abiteboul, P. Bourhis, and B. Marinoiu.
Satisfiability and relevance for queries over active documents.
In Proceedings of the 28th Annual ACM
SIGACT-SIGMOD-SIGART Symposium on Principles of Database
Systems (PODS'09), pages 87--96, Providence, Rhode Island, USA, June-July
2009. ACM Press.
doi:
10.1145/1559795.1559810.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BLPS09]
-
P. Barceló, L. Libkin, A. Poggi, and C. Sirangelo.
XML with Incomplete Information: Models, Properties, and Query
Answering.
In Proceedings of the 28th Annual ACM
SIGACT-SIGMOD-SIGART Symposium on Principles of Database
Systems (PODS'09), pages 237--246, Providence, Rhode Island, USA,
June-July 2009. ACM Press.
doi:
10.1145/1559795.1559832.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Fig09]
-
D. Figueira.
Satisfiability of Downward XPath with Data Equality Tests.
In Proceedings of the 28th Annual ACM
SIGACT-SIGMOD-SIGART Symposium on Principles of Database
Systems (PODS'09), pages 197--206, Providence, Rhode Island, USA,
June-July 2009. ACM Press.
doi:
10.1145/1559795.1559827.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[CDK09a]
-
R. Chadha, S. Delaune, and S. Kremer.
Epistemic Logic for the Applied Pi Calculus.
In Proceedings of IFIP International Conference on Formal
Techniques for Distributed Systems (FMOODS/FORTE'09), volume 5522 of
Lecture Notes in Computer Science, pages 182--197, Lisbon, Portugal, June
2009. Springer.
doi:
10.1007/978-3-642-02138-1_12.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BC09a]
-
S. Bursuc and H. Comon-Lundh.
Protocol security and algebraic properties: decision results for
a bounded number of sessions.
In Proceedings of the 20th International Conference on
Rewriting Techniques and Applications (RTA'09), volume 5595 of
Lecture Notes in Computer Science, pages 133--147, Brasília, Brazil,
June-July 2009. Springer.
doi:
10.1007/978-3-642-02348-4_10.
[ BibTex |
DOI |
Web page |
PDF ]
-
[GJ09]
-
G. Godoy and F. Jacquemard.
Unique Normalization for Shallow TRS.
In Proceedings of the 20th International Conference on
Rewriting Techniques and Applications (RTA'09), volume 5595 of
Lecture Notes in Computer Science, pages 63--77, Brasília, Brazil,
June-July 2009. Springer.
doi:
10.1007/978-3-642-02348-4_5.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BCD09a]
-
M. Baudet, V. Cortier, and S. Delaune.
YAPA: A generic tool for computing intruder knowledge.
In Proceedings of the 20th International Conference on
Rewriting Techniques and Applications (RTA'09), volume 5595 of
Lecture Notes in Computer Science, pages 148--163, Brasília, Brazil,
June-July 2009. Springer.
doi:
10.1007/978-3-642-02348-4_11.
[ BibTex |
DOI |
Web page |
PDF ]
-
[GSZ09]
-
P. Gastin, N. Sznajder, and M. Zeitoun.
Distributed synthesis for well-connected architectures.
Formal Methods in System Design, 34(3):215--237, June 2009.
doi:
10.1007/s10703-008-0064-7.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BFCH09]
-
M. Beccuti, G. Franceschinis, D. Codetta-Raiteri, and
S. Haddad.
Parametric NdRFT for the derivation of optimal repair
strategies.
In Proceedings of the 39th Annual IEEEashIFIP
International Conference on Dependable Systems and Networks
(DSN'09), pages 399--408, Estoril, Portugal, June-July 2009. IEEE
Computer Society Press.
doi:
10.1109/DSN.2009.5270312.
[ BibTex |
DOI |
Web page |
PDF ]
-
[AC09]
-
R. Affeldt and H. Comon-Lundh.
Verification of Security Protocols with a Bounded Number of
Sessions Based on Resolution for Rigid Variables.
In Formal to Practical Security, volume 5458 of Lecture Notes
in Computer Science, pages 1--20. Springer, May 2009.
doi:
10.1007/978-3-642-02002-5_1.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Gou09b]
-
J. Goubault-Larrecq.
On a Generalization of a Result by Valk and Jantzen.
Research Report LSV-09-09, Laboratoire Spécification et
Vérification, ENS Cachan, France, May 2009.
18 pages.
[ BibTex |
Web page |
PDF ]
-
[BMSS09]
-
M. Bojańczyk, A. Muscholl, Th. Schwentick, and
L. Segoufin.
Two-variable logic on data trees and applications to XML
reasoning.
Journal of the ACM, 56(3), May 2009.
doi:
10.1145/1516512.1516515.
[ BibTex |
DOI |
Web page |
PDF ]
-
[GGJ09]
-
A. Gascón, G. Godoy, and F. Jacquemard.
Closure of Tree Automata Languages under Innermost Rewriting.
In Proceedings of the 8th International Workshop on Reduction
Strategies in Rewriting and Programming (WRS'08), volume 237 of
Electronic Notes in Theoretical Computer Science, pages 23--38, Castle of
Hagenberg, Austria, April 2009. Elsevier Science Publishers.
doi:
10.1016/j.entcs.2009.03.033.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Bur09b]
-
E. Bursztein.
Extending Anticipation Games with Location, Penalty and
Timeline.
In Revised Selected Papers of the 5th International
Workshop on Formal Aspects in Security and Trust (FAST'08),
volume 5491 of Lecture Notes in Computer Science, pages 272--286, Malaga,
Spain, April 2009. Springer.
doi:
10.1007/978-3-642-01465-9_18.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DL09]
-
S. Demri and R. Lazić.
LTL with the freeze quantifier and register automata.
ACM Transactions on Computational Logic, 10(3), April 2009.
doi:
10.1145/1507244.1507246.
[ BibTex |
DOI |
Web page |
PDF ]
-
[EFSH09]
-
A. El Fallah Seghrouchni and S. Haddad.
Interopérabilité des systèmes multi-agents à
l'aide des services web.
In Technologies des systèmes multi-agents et applications
industrielles, chapter 3, pages 77--99. Hermès, April 2009.
[ BibTex |
Web page ]
-
[JKV09]
-
F. Jacquemard, F. Klay, and C. Vacher.
Rigid Tree Automata.
In Proceedings of the 3rd International Conference on
Language and Automata Theory and Applications (LATA'09), volume
5457 of Lecture Notes in Computer Science, pages 446--457, Tarragona, Spain,
April 2009. Springer.
doi:
10.1007/978-3-642-00982-2_38.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BCK09]
-
M. Baudet, V. Cortier, and S. Kremer.
Computationally Sound Implementations of Equational Theories
against Passive Adversaries.
Information and Computation, 207(4):496--520, April 2009.
doi:
10.1016/j.ic.2008.12.005.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Bou09c]
-
P. Bouyer.
Model-Checking Timed Temporal Logics.
In Proceedings of the 4th Workshop on Methods for Modalities
(M4M-5), volume 231 of Electronic Notes in Theoretical Computer Science,
pages 323--341, Cachan, France, March 2009. Elsevier Science Publishers.
doi:
10.1016/j.entcs.2009.02.044.
[ BibTex |
DOI |
Web page |
PDF ]
-
[AD09]
-
C. Areces and S. Demri, editors.
Proceedings of the 5th International Workshop on Methods
for Modalities (M4M-5), volume 231 of Electronic Notes in Theoretical
Computer Science, Cachan, France, March 2009. Elsevier Science Publishers.
doi:
10.1016/j.entcs.2009.02.025.
[ BibTex |
DOI |
Web page ]
-
[ABM09a]
-
S. Abiteboul, P. Bourhis, and B. Marinoiu.
Efficient maintenance techniques for views over active
documents.
In Advances in Database Technology --- Proceedings of the
12th International Conference on Extending Database Technology
(EDBT'09), ACM International Conference Proceeding Series, pages
1076--1087, Saint Petersburg, Russia, March 2009. Springer.
doi:
10.1145/1516360.1516483.
[ BibTex |
DOI |
Web page |
PDF ]
-
[AGMP09]
-
S. Abiteboul, O. Greenshpan, T. Milo, and N. Polyzotis.
MatchUp: Autocompletion for Mashups.
In Proceedings of the 25th International Conference on Data
Engineering (ICDE'09), pages 1479--1482, Shanghai, China, March-April
2009. IEEE Computer Society Press.
doi:
10.1109/ICDE.2009.47.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CGM+09]
-
Th. Chatain, P. Gastin, A. Muscholl, N. Sznajder,
I. Walukiewicz, and M. Zeitoun.
Distributed control for restricted specifications.
Deliverable DOTS 2.2 (ANR-06-SETI-003), March 2009.
[ BibTex ]
-
[BLLM09]
-
P. Bouyer, F. Laroussinie, D. Lime, and N. Markey.
Synthesis of timed controllers.
Deliverable DOTS 1.2a (ANR-06-SETI-003), March 2009.
[ BibTex ]
-
[DHS09]
-
S. Donatelli, S. Haddad, and J. Sproston.
Model Checking Timed and Stochastic Properties with
CSLTA.
IEEE Transactions on Software Engineering, 35(2):224--240,
March-April 2009.
doi:
10.1109/TSE.2008.108.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BCD+09b]
-
D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and
Th. A. Henzinger.
Alpaga: A Tool for Solving Parity Games with Imperfect
Information.
In Proceedings of the 15th International Conference on Tools
and Algorithms for Construction and Analysis of Systems (TACAS'09),
volume 5505 of Lecture Notes in Computer Science, pages 58--61, York, UK,
March 2009. Springer.
doi:
10.1007/978-3-642-00768-2_7.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BBL09]
-
K. Bansal, R. Brochenin, and É. Lozes.
Beyond Shapes: Lists with Ordered Data.
In Proceedings of the 12th International Conference on
Foundations of Software Science and Computation Structures
(FoSSaCS'09), volume 5504 of Lecture Notes in Computer Science, pages
425--439, York, UK, March 2009. Springer.
doi:
10.1007/978-3-642-00596-1_30.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BH09]
-
B. Bérard and S. Haddad.
Interrupt Timed Automata.
In Proceedings of the 12th International Conference on
Foundations of Software Science and Computation Structures
(FoSSaCS'09), volume 5504 of Lecture Notes in Computer Science, pages
197--211, York, UK, March 2009. Springer.
doi:
10.1007/978-3-642-00596-1_15.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BGH09]
-
B. Bollig, M.-L. Grindei, and P. Habermehl.
Realizability of Concurrent Recursive Programs.
In Proceedings of the 12th International Conference on
Foundations of Software Science and Computation Structures
(FoSSaCS'09), volume 5504 of Lecture Notes in Computer Science, pages
410--424, York, UK, March 2009. Springer.
doi:
10.1007/978-3-642-00596-1_29.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BS09b]
-
M. Benedikt and L. Segoufin.
Towards a Characterization of Order-Invariant Queries over Tame
Structures.
Journal of Symbolic Logic, 74(1):168--186, March 2009.
doi:
10.2178/jsl/1231082307.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CEFX09]
-
R. Chevallier, E. Encrenaz-Tiphène, L. Fribourg, and
W. Xu.
Timed Verification of the Generic Architecture of a Memory
Circuit Using Parametric Timed Automata.
Formal Methods in System Design, 34(1):59--81, February 2009.
doi:
10.1007/s10703-008-0061-x.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[CD09b]
-
V. Cortier and S. Delaune.
Safely Composing Security Protocols.
Formal Methods in System Design, 34(1):1--36, February 2009.
doi:
10.1007/s10703-008-0059-4.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BC09b]
-
S. Bursuc and H. Comon-Lundh.
Protocols, insecurity decision and combination of equational
theories.
Research Report LSV-09-02, Laboratoire Spécification et
Vérification, ENS Cachan, France, February 2009.
43 pages.
[ BibTex |
Web page |
PDF ]
-
[FG09a]
-
A. Finkel and J. Goubault-Larrecq.
Forward Analysis for WSTS, Part I: Completions.
In Proceedings of the 26th Annual Symposium on Theoretical
Aspects of Computer Science (STACS'09), volume 3 of Leibniz
International Proceedings in Informatics, pages 433--444, Freiburg, Germany,
February 2009. Leibniz-Zentrum für Informatik.
[ BibTex |
Web page |
PDF ]
-
[DG09c]
-
M. Droste and P. Gastin.
Weighted automata and weighted logics.
In Handbook of Weighted Automata, EATCS Monographs in Theoretical
Computer Science, chapter 5, pages 175--211. Springer, 2009.
[ BibTex |
Web page |
PDF ]
-
[DG09b]
-
V. Diekert and P. Gastin.
Local safety and local liveness for distributed systems.
In Perspectives in Concurrency Theory, IARCS-Universities, pages
86--106. Universities Press, January 2009.
[ BibTex |
Web page |
PDF ]
-
[HI09]
-
S. Haddad and J.-M. Ilié.
Symmetry and Temporal Logic.
In Petri Nets: Fundamental Models, Verification and Applications,
pages 435--460. Wiley-ISTE, 2009.
[ BibTex |
Web page ]
-
[HV09c]
-
S. Haddad and F. Vernadat.
Verification of Specific Properties.
In Petri Nets: Fundamental Models, Verification and Applications,
pages 349--414. Wiley-ISTE, 2009.
[ BibTex |
Web page ]
-
[HM09c]
-
S. Haddad and P. Moreaux.
Tensor Methods and Stochastic Petri Nets.
In Petri Nets: Fundamental Models, Verification and Applications,
pages 321--346. Wiley-ISTE, 2009.
[ BibTex |
Web page ]
-
[HM09b]
-
S. Haddad and P. Moreaux.
Stochastic Well-formed Petri Nets.
In Petri Nets: Fundamental Models, Verification and Applications,
pages 303--320. Wiley-ISTE, 2009.
[ BibTex |
Web page ]
-
[HM09a]
-
S. Haddad and P. Moreaux.
Stochastic Petri Nets.
In Petri Nets: Fundamental Models, Verification and Applications,
pages 269--302. Wiley-ISTE, 2009.
[ BibTex |
Web page ]
-
[Had09]
-
S. Haddad.
Decidability and Complexity of Petri Net Problems.
In Petri Nets: Fundamental Models, Verification and Applications,
pages 87--122. Wiley-ISTE, 2009.
[ BibTex |
Web page ]
-
[HV09b]
-
S. Haddad and F. Vernadat.
Analysis Methods for Petri Nets.
In Petri Nets: Fundamental Models, Verification and Applications,
pages 41--86. Wiley-ISTE, 2009.
[ BibTex |
Web page ]
-
[BHR09b]
-
P. Bouyer, S. Haddad, and P.-A. Reynier.
Undecidability Results for Timed Automata with Silent
Transitions.
Fundamenta Informaticae, 92(1-2):1--25, 2009.
[ BibTex |
Web page |
PS |
PDF ]
-
[BKL+09]
-
P. Bouyer, J.-P. Katoen, R. Langerak, F. Laroussinie,
N. Markey, and J.-F. Raskin.
Transfer of correctness from models to implementation.
Deliverable QUASIMODO 3.1 (ICT-FP7-STREP-214755), January 2009.
[ BibTex ]
-
[Bou09b]
-
P. Bouyer.
From Qualitative to Quantitative Analysis of Timed Systems.
Mémoire d'habilitation, Université Paris 7, Paris, France,
January 2009.
[ BibTex |
Web page |
PDF ]
-
[GMNK09]
-
P. Gastin, M. Mukund, and K. Narayan Kumar.
Reachability and boundedness in time-constrained MSC graphs.
In Perspectives in Concurrency Theory, IARCS-Universities, pages
157--183. Universities Press, January 2009.
[ BibTex |
Web page |
PDF ]
-
[BP09]
-
P. Bouyer and A. Petit.
On extensions of timed automata.
In Perspectives in Concurrency Theory, IARCS-Universities, pages
35--63. Universities Press, January 2009.
[ BibTex ]
-
[CGS09]
-
Th. Chatain, P. Gastin, and N. Sznajder.
Natural Specifications Yield Decidability for Distributed
Synthesis of Asynchronous Systems.
In Proceedings of the 35th International Conference on Current
Trends in Theory and Practice of Computer Science (SOFSEM'09), volume 5404
of Lecture Notes in Computer Science, pages 141--152, Špindlerův
Mlýn, Czech Republic, January 2009. Springer.
doi:
10.1007/978-3-540-95891-8_16.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BDLM09]
-
Th. Brihaye, A. Da Costa, F. Laroussinie, and
N. Markey.
ATL with Strategy Contexts and Bounded Memory.
In Proceedings of the Symposium on Logical Foundations of
Computer Science (LFCS'09), volume 5407 of Lecture Notes in Computer
Science, pages 92--106, Deerfield Beach, Florida, USA, January 2009.
Springer.
doi:
10.1007/978-3-540-92687-0_7.
[ BibTex |
DOI |
Web page |
PDF ]
This file was generated by
bibtex2html 1.98.