Publications : 2013

[Cha13]

Th. Chatain. Concurrency in Real-Time Distributed Systems, from Unfoldings to Implementability. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, December 2013.
[ BibTex | Web page | PDF ]

[Rod13]

C. Rodríguez. Verification Based on Unfoldings of Petri Nets with Read Arcs. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2013.
[ BibTex | Web page | PDF ]

[Sch13]

S. Schwoon. Efficient verification of sequential and concurrent systems. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, December 2013.
[ BibTex | Web page | PDF ]

[Ant13]

É. Antoine. Distributed data management with a declarative rule-based language: Webdamlog. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2013.
[ BibTex | Web page | PDF ]

[BLBL13]

M. Bambagini, J. Lelli, G. Buttazzo, and G. Lipari. On the Energy-Aware Partitioning of Real-Time Tasks on Homogeneous Multi-Processor Systems. In Proceedings of the 4th International Conference on Energy-Aware Computing Systems and Applications (ICEAC'14),, pages 69--74, Istanbul, Turkey, December 2013. IEEE Circuits and Systems Society.
doi: 10.1109/ICEAC.2013.6737640.
[ BibTex | DOI | Web page | PDF ]

[HHMS13]

S. Haar, S. Haddad, T. Melliti, and S. Schwoon. Optimal Constructions for Active Diagnosis. In Proceedings of the 33rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), volume 24 of Leibniz International Proceedings in Informatics, pages 527--539, Guwahati, India, December 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2013.527.
[ BibTex | DOI | Web page | PDF ]

[EJS13]

J. Esparza, L. Jezequel, and S. Schwoon. Computation of summaries using net unfoldings. In Proceedings of the 33rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), volume 24 of Leibniz International Proceedings in Informatics, pages 225--236, Guwahati, India, December 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2013.225.
[ BibTex | DOI | Web page | PDF ]

[CDKR13]

C. Chevalier, S. Delaune, S. Kremer, and M. D. Ryan. Composition of Password-based Protocols. Formal Methods in System Design, 43(3):369--413, December 2013.
doi: 10.1007/s10703-013-0184-6.
[ BibTex | DOI | Web page | PDF ]

[BS13c]

D. Berwanger and O. Serre. Théorie des jeux en informatique. Technique et Science Informatiques, 32(9-10), December 2013.
[ BibTex | Web page | PDF ]

[BC13a]

S. Balaguer and Th. Chatain. Avoiding Shared Clocks in Networks of Timed Automata. Logical Methods in Computer Science, 9(4:13), November 2013.
doi: 10.2168/LMCS-9(4:13)2013.
[ BibTex | DOI | Web page | PDF ]

[CD13b]

R. Chrétien and S. Delaune. La protection des informations sensibles. Pour La Science, 433:70--77, November 2013.
[ BibTex | Web page ]

[PHL13]

H. Ponce de León, S. Haar, and D. Longuet. Unfolding-based Test Selection for Concurrent Conformance. In Proceedings of the 25th IFIP International Conference on Testing Software and Systems (ICTSS'13), Lecture Notes in Computer Science, pages 98--113, Istanbul, Turkey, November 2013. Springer.
doi: 10.1007/978-3-642-41707-8_7.
[ BibTex | DOI | Web page | PDF ]

[KS13c]

W. Kazana and L. Segoufin. Enumeration of monadic second-order queries on trees. ACM Transactions on Computational Logic, 14(4), November 2013.
doi: 10.1145/2528928.
[ BibTex | DOI | Web page | PDF ]

[CFM13]

M. Cadilhac, A. Finkel, and P. McKenzie. Unambiguous Contrained Automata. International Journal of Foundations of Computer Science, 24(7):1099--1116, November 2013.
doi: 10.1142/S0129054113400339.
[ BibTex | DOI | Web page | PDF ]

[BS13a]

N. Bertrand and Ph. Schnoebelen. Computable fixpoints in well-structured symbolic model checking. Formal Methods in System Design, 43(2):233--267, October 2013.
doi: 10.1007/s10703-012-0168-y.
[ BibTex | DOI | Web page | PDF ]

[MLS⁺13]

N. Markey, K. G. Larsen, A. Skou, D. Lux, J. Rozenkilde, K. L. Pedersen, and S. M. Sørensen. Description of case studies. Cassting deliverable D4.1 (FP7-ICT-601148), October 2013. 19 pages.
[ BibTex ]

[Mon13]

B. Monmege. Spécification et vérification de propriétés quantitatives : expressions, logiques, et automates. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2013.
[ BibTex | Web page | PDF ]

[PLML13]

A. Parri, J. Lelli, M. Marinoni, and G. Lipari. Design and Implementation of the Multiprocessor Bandwidth Inheritance Protocol on Linux. In Proceedings of the 15th Real-Time Linux Workshop (RTLWS'13), pages 41--54, Lugano-Manno, Switzerland, October 2013. Open Source Automation Development Lab (OSADL).
[ BibTex | Web page | PDF ]

[SSL⁺13]

Y. Sun, R. Soulat, G. Lipari, É. André, and L. Fribourg. Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems. In Preproceedings of the 2nd International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS'13), pages 179--194, Queenstown, New Zealand, October 2013.
[ BibTex | Web page | PDF ]

[PBB13]

H. Ponce de León, G. Bonigo, and L. Brandán Briones. Distributed Analysis of Diagnosability in Concurrent Systems. In Proceedings of the 24th International Workshop on Principles of Diagnosis (DX'13), Jerusalem, Israel, October 2013.
[ BibTex | Web page | PDF ]

[ABD⁺13]

É. André, B. Barbot, C. Démoulins, L. M. Hillah, F. Hulin-Hubard, F. Kordon, A. Linard, and L. Petrucci. A Modular Approach for Reusing Formalisms in Verification Tools of Concurrent Systems. In Proceedings of the 15th International Conference on Formal Engineering Methods (ICFEM'13), Lecture Notes in Computer Science, pages 199--214, Queenstown, New Zealand, October-November 2013. Springer.
doi: 10.1007/978-3-642-41202-8_14.
[ BibTex | DOI | Web page | PDF ]

[BDG⁺13]

Th. Brihaye, L. Doyen, G. Geeraerts, J. Ouaknine, J.-F. Raskin, and J. Worrell. Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points. In Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), volume 8172 of Lecture Notes in Computer Science, pages 55--70, Hanoi, Vietnam, October 2013. Springer.
doi: 10.1007/978-3-319-02444-8_6.
[ BibTex | DOI | Web page | PDF ]

[CDRR13]

K. Chatterjee, L. Doyen, M. Randour, and J.-F. Raskin. Looking at Mean-Payoff and Total-Payoff through Windows. In Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), volume 8172 of Lecture Notes in Computer Science, pages 118--132, Hanoi, Vietnam, October 2013. Springer.
doi: 10.1007/978-3-319-02444-8_10.
[ BibTex | DOI | Web page | PDF ]

[RS13a]

C. Rodríguez and S. Schwoon. Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs. In Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), volume 8172 of Lecture Notes in Computer Science, pages 492--495, Hanoi, Vietnam, October 2013. Springer.
doi: 10.1007/978-3-319-02444-8_42.
[ BibTex | DOI | Web page | PDF ]

[AFS13a]

É. André, L. Fribourg, and R. Soulat. Merge and Conquer: State Merging in Parametric Timed Automata. In Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), volume 8172 of Lecture Notes in Computer Science, pages 381--396, Hanoi, Vietnam, October 2013. Springer.
doi: 10.1007/978-3-319-02444-8_27.
[ BibTex | DOI | Web page | PDF ]

[CDH13]

K. Chatterjee, L. Doyen, and Th. A. Henzinger. A survey of partial-observation stochastic parity games. Formal Methods in System Design, 43(2):268--284, October 2013.
doi: 10.1007/s10703-012-0164-2.
[ BibTex | DOI | Web page | PDF ]

[GO13]

J. Goubault-Larrecq and J. Olivain. On the Efficiency of Mathematics in Intrusion Detection: The NetEntropy Case. In Revised Selected Papers of the 6th International Symposium on Foundations and Practice of Security (FPS'13), volume 8352 of Lecture Notes in Computer Science, pages 3--16, La Rochelle, France, October 2013. Springer.
doi: 10.1007/978-3-319-05302-8_1.
[ BibTex | DOI | Web page | PDF ]

[AV13b]

S. Abiteboul and V. Vianu. Models for Data-Centric Workflows. In In Search of Elegance in the Theory and Practice of Computation -- Essays Dedicated to Peter Buneman, volume 8000 of Lecture Notes in Computer Science, pages 1--12. Springer, September 2013.
doi: 10.1007/978-3-642-41660-6_1.
[ BibTex | DOI ]

[tCS13]

B. ten Cate and L. Segoufin. Unary negation. Logical Methods in Computer Science, 9(3:25), September 2013.
doi: 10.2168/LMCS-9(3:25)2013.
[ BibTex | DOI | Web page | PDF ]

[BCMV13]

R. Bonnet, R. Chadha, P. Madhusudan, and M. Viswanathan. Reachability under contextual locking. Logical Methods in Computer Science, 9(3:21), September 2013.
doi: 10.2168/LMCS-9(3:21)2013.
[ BibTex | DOI | Web page | PDF ]

[BL13b]

G. Buttazzo and G. Lipari. Ptask: An Educational C Library for Programming Real-Time Systems on Linux. In Proceedings of the 18th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'13), Cagliari, Italy, September 2013. IEEE Industrial Electronics Society.
doi: 10.1109/ETFA.2013.6648001.
[ BibTex | DOI | Web page | PDF ]

[Bro13]

R. Brochenin. Separation Logic: Expressiveness, Complexity, Temporal Extension. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2013.
[ BibTex | Web page | PDF ]

[Kaz13]

W. Kazana. Query Evaluation with Constant Delay. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2013.
[ BibTex | Web page | PDF ]

[Hir13a]

L. Hirschi. Réduction d'entrelacements pour l'équivalence de traces. Research Report LSV-13-13, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2013. 22 pages.
[ BibTex | Web page | PDF ]

[BMS13b]

P. Bouyer, N. Markey, and O. Sankur. Robustness in timed automata. In Proceedings of the 7th Workshop on Reachability Problems in Computational Models (RP'13), volume 8169 of Lecture Notes in Computer Science, pages 1--18, Uppsala, Sweden, September 2013. Springer.
doi: 10.1007/978-3-642-41036-9_1.
[ BibTex | DOI | Web page | PDF ]

[Rei13]

J. Reichert. On The Complexity of Counter Reachability Games. In Proceedings of the 7th Workshop on Reachability Problems in Computational Models (RP'13), volume 8169 of Lecture Notes in Computer Science, pages 196--208, Uppsala, Sweden, September 2013. Springer.
doi: 10.1007/978-3-642-41036-9_18.
[ BibTex | DOI | Web page | PDF ]

[BHJL13]

B. Bérard, S. Haddad, A. Jovanovic, and D. Lime. Parametric Interrupt Timed Automata. In Proceedings of the 7th Workshop on Reachability Problems in Computational Models (RP'13), volume 8169 of Lecture Notes in Computer Science, pages 59--69, Uppsala, Sweden, September 2013. Springer.
doi: 10.1007/978-3-642-41036-9_7.
[ BibTex | DOI | Web page | PDF ]

[FS13c]

L. Fribourg and R. Soulat. Stability Controllers for Sampled Switched Systems. In Proceedings of the 7th Workshop on Reachability Problems in Computational Models (RP'13), volume 8169 of Lecture Notes in Computer Science, pages 135--145, Uppsala, Sweden, September 2013. Springer.
doi: 10.1007/978-3-642-41036-9_13.
[ BibTex | DOI | Web page | PDF ]

[SHL⁺13]

R. Soulat, G. Hérault, D. Labrousse, B. Revol, G. Feld, S. Lefebvre, and L. Fribourg. Use of a full wave correct-by-design command to control a multilevel modular converter. In Proceedings of the 15th European Conference on Power Electronics and Applications (EPE'13), Lille, France, September 2013. IEEE Power Electronics Society.
doi: 10.1109/EPE.2013.6634448.
[ BibTex | DOI | Web page | PDF ]

[KKS13]

S. Kremer, R. Künnemann, and G. Steel. Universally Composable Key-Management. In Proceedings of the 18th European Symposium on Research in Computer Security (ESORICS'13), volume 8134 of Lecture Notes in Computer Science, pages 327--344, Egham, U.K., September 2013. Springer.
doi: 10.1007/978-3-642-40203-6_19.
[ BibTex | DOI | Web page | PDF ]

[AtCK13]

S. Abiteboul, B. ten Cate, and Y. Katsis. On the equivalence of distributed systems with queries and communication. Journal of Computer and System Sciences, 79(6):739--762, September 2013.
doi: 10.1016/j.jcss.2013.01.001.
[ BibTex | DOI | Web page | PDF ]

[BDD13]

C. Barrett, S. Demri, and M. Deters. Witness runs for counter machines. In Proceedings of the 9th International Symposium on Frontiers of Combining Systems (FroCoS'13), volume 8152 of Lecture Notes in Artificial Intelligence, pages 120--150, Nancy, France, September 2013. Springer.
doi: 10.1007/978-3-642-40885-4_9.
[ BibTex | DOI | Web page | PDF ]

[Sta13]

D. Stan. Équilibres mixtes dans les jeux concurrents. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2013. 29 pages.
[ BibTex | Web page | PDF ]

[BF13]

V. Braberman and L. Fribourg, editors. Proceedings of the 11th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'13), volume 8053 of Lecture Notes in Computer Science, Buenos Aires, Argentina, August 2013. Springer.
[ BibTex | Web page ]

[BL13a]

S. Benedetto and G. Lipari. ADOK: A Minimal Object Oriented Real-Time Operating System in C++. In Proceedings of the 3rd Embedded Operating Systems Workshop (EWiLi'13), Toulouse, France, August 2013.
[ BibTex | Web page | PDF ]

[Gou13a]

J. Goubault-Larrecq. A Constructive Proof of the Topological Kruskal Theorem. In Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), volume 8087 of Lecture Notes in Computer Science, pages 22--41, Klosterneuburg, Austria, August 2013. Springer.
doi: 10.1007/978-3-642-40313-2_3.
[ BibTex | DOI | Web page | PDF ]

[LM13]

F. Laroussinie and N. Markey. Satisfiability of ATL with strategy contexts. In Proceedings of the 4th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'13), volume 119 of Electronic Proceedings in Theoretical Computer Science, pages 208--223, Borca di Cadore, Italy, August 2013.
doi: 10.4204/EPTCS.119.18.
[ BibTex | DOI | Web page | PDF ]

[SS13]

S. Schmitz and Ph. Schnoebelen. The Power of Well-Structured Systems. In Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), volume 8052 of Lecture Notes in Computer Science, pages 5--24, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40184-8_2.
[ BibTex | DOI | Web page | PDF ]

[ABHH13]

S. Akshay, N. Bertrand, S. Haddad, and L. Hélouët. The steady-state control problem for Markov decision processes. In Proceedings of the 10th International Conference on Quantitative Evaluation of Systems (QEST'13), pages 290--304, Buenos Aires, Argentina, August 2013. IEEE Computer Society Press.
doi: 10.1007/978-3-642-40196-1_26.
[ BibTex | DOI | Web page | PDF ]

[CJ13]

Th. Chatain and C. Jard. Back in Time Petri Nets. In Proceedings of the 11th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'13), volume 8053 of Lecture Notes in Computer Science, pages 91--105, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40229-6_7.
[ BibTex | DOI | Web page | PDF ]

[BMS13a]

P. Bouyer, N. Markey, and O. Sankur. Robust Weighted Timed Automata and Games. In Proceedings of the 11th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'13), volume 8053 of Lecture Notes in Computer Science, pages 31--46, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40229-6_3.
[ BibTex | DOI | Web page | PDF ]

[HSS13]

C. Haase, S. Schmitz, and Ph. Schnoebelen. The Power of Priority Channel Systems. In Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), volume 8052 of Lecture Notes in Computer Science, pages 319--333, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40184-8_23.
[ BibTex | DOI | Web page | PDF ]

[SBMR13]

O. Sankur, P. Bouyer, N. Markey, and P.-A. Reynier. Robust Controller Synthesis in Timed Automata. In Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), volume 8052 of Lecture Notes in Computer Science, pages 546--560, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40184-8_38.
[ BibTex | DOI | Web page | PDF ]

[FGH13]

A. Finkel, S. Göller, and C. Haase. Reachability in Register Machines with Polynomial Updates. In Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), volume 8087 of Lecture Notes in Computer Science, pages 409--420, Klosterneuburg, Austria, August 2013. Springer.
doi: 10.1007/978-3-642-40313-2_37.
[ BibTex | DOI | Web page | PS | PDF ]

[Dem13]

S. Demri. On selective unboundedness of VASS. Journal of Computer and System Sciences, 79(5):689--713, August 2013.
doi: 10.1016/j.jcss.2013.01.014.
[ BibTex | DOI | Web page | PDF ]

[Hir13b]

L. Hirschi. Reduction of interleavings for trace equivalence checking of security protocols. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, August 2013.
[ BibTex ]

[Fan13]

E. Fang. Permissive multi-strategies in timed games. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, August 2013.
[ BibTex ]

[GLS13a]

A. Gheerbrant, L. Libkin, and C. Sirangelo. Reasoning About Pattern-Based XML Queries. In Proceedings of the 7th International Conference on Web Reasoning and Rule Systems (WRRS'13), volume 7994 of Lecture Notes in Computer Science, pages 4--18, Mannheim, Germany, July 2013. Springer.
doi: 10.1007/978-3-642-39666-3_2.
[ BibTex | DOI | Web page | PDF ]

[FS13a]

L. Fribourg and R. Soulat. Control of Switching Systems by Invariance Analysis: Application to Power Electronics. Wiley-ISTE, July 2013. 144 pages.
[ BibTex | Web page ]

[RS13b]

C. Rodríguez and S. Schwoon. An Improved Construction of Petri Net Unfoldings. In Proceedings of the 1st French-Singaporean Workshop on Formal Methods and Applications (FSFMA'13), volume 31 of Open Access Series in Informatics, pages 47--52, Singapore, July 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.FSFMA.2013.47.
[ BibTex | DOI | Web page | PDF ]

[HMY13]

S. Haddad, L. Mokdad, and S. Youcef. Bounding models families for performance evaluation in composite Web services. Journal of Computational Science, 4(4):232--241, July 2013.
doi: 10.1016/j.jocs.2011.11.003.
[ BibTex | DOI | Web page | PDF ]

[DDS13]

S. Demri, A. K. Dhar, and A. Sangnier. On the Complexity of Verifying Regular Properties on Flat Counter Systems. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP'13) -- Part II, volume 7966 of Lecture Notes in Computer Science, pages 162--173, Riga, Latvia, July 2013. Springer.
doi: 10.1007/978-3-642-39212-2_17.
[ BibTex | DOI | Web page | PDF ]

[Fri13]

L. Fribourg. Control of Switching Systems by Invariance Analysis (Invited Talk). In Proceedings of the 1st French-Singaporean Workshop on Formal Methods and Applications (FSFMA'13), volume 31 of Open Access Series in Informatics, page 1, Singapore, July 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.FSFMA.2013.1.
[ BibTex | DOI | Web page | PDF ]

[FKS13]

L. Fribourg, U. Kühne, and R. Soulat. Constructing Attractors of Nonlinear Dynamical Systems by State Space Decomposition. In Proceedings of the 1st French-Singaporean Workshop on Formal Methods and Applications (FSFMA'13), volume 31 of Open Access Series in Informatics, pages 53--60, Singapore, July 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.FSFMA.2013.53.
[ BibTex | DOI | Web page | PDF ]

[AHH⁺13]

É. André, L. M. Hillah, F. Hulin-Hubard, F. Kordon, Y. Lembachar, A. Linard, and L. Petrucci. CosyVerif: An Open Source Extensible Verification Environment. In Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'13), pages 33--36, Singapore, July 2013. IEEE Computer Society Press.
doi: 10.1109/ICECCS.2013.15.
[ BibTex | DOI | Web page | PDF ]

[HRS13]

S. Haar, C. Rodríguez, and S. Schwoon. Reveal Your Faults: It's Only Fair! In Proceedings of the 13th International Conference on Application of Concurrency to System Design (ACSD'13), pages 120--129, Barcelona, Spain, July 2013. IEEE Computer Society Press.
doi: 10.1109/ACSD.2013.15.
[ BibTex | DOI | Web page | PDF ]

[HKS13]

S. Haar, C. Kern, and S. Schwoon. Computing the Reveals Relation in Occurrence Nets. Theoretical Computer Science, 493:66--79, July 2013.
doi: 10.1016/j.tcs.2013.04.028.
[ BibTex | DOI | Web page | PDF ]

[McK13]

P. McKenzie. Can chimps go it alone? In Proceedings of the 15th Workshop on Descriptional Complexity of Formal Systems (DCFS'13), volume 8031 of Lecture Notes in Computer Science, page 17, London, Ontario, Canada, July 2013. Springer-Verlag.
doi: 10.1007/978-3-642-39310-5_3.
[ BibTex | DOI | Web page | PDF ]

[CCD13b]

R. Chrétien, V. Cortier, and S. Delaune. From security protocols to pushdown automata. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP'13) -- Part II, volume 7966 of Lecture Notes in Computer Science, pages 137--149, Riga, Latvia, July 2013. Springer.
doi: 10.1007/978-3-642-39212-2_15.
[ BibTex | DOI | Web page | PDF ]

[CCP13]

V. Cheval, V. Cortier, and A. Plet. Lengths may break privacy ---or how to check for equivalences with length. In Proceedings of the 25th International Conference on Computer Aided Verification (CAV'13), volume 8044 of Lecture Notes in Computer Science, pages 708--723, Saint Petersburg, Russia, July 2013. Springer.
doi: 10.1007/978-3-642-39799-8_50.
[ BibTex | DOI | Web page | PDF ]

[HIOP13]

C. Haase, S. Ishtiaq, J. Ouaknine, and M. Parkinson. SeLoger: A Tool for Graph-Based Reasoning in Separation Logic. In Proceedings of the 25th International Conference on Computer Aided Verification (CAV'13), volume 8044 of Lecture Notes in Computer Science, pages 790--795, Saint Petersburg, Russia, July 2013. Springer.
doi: 10.1007/978-3-642-39799-8_55.
[ BibTex | DOI | Web page | PDF ]

[San13b]

O. Sankur. Shrinktech: A Tool for the Robustness Analysis of Timed Automata. In Proceedings of the 25th International Conference on Computer Aided Verification (CAV'13), volume 8044 of Lecture Notes in Computer Science, pages 1006--1012, Saint Petersburg, Russia, July 2013. Springer.
doi: 10.1007/978-3-642-39799-8_72.
[ BibTex | DOI | Web page | PDF ]

[Bre13]

R. Brenguier. PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games. In Proceedings of the 25th International Conference on Computer Aided Verification (CAV'13), volume 8044 of Lecture Notes in Computer Science, pages 890--895, Saint Petersburg, Russia, July 2013. Springer.
doi: 10.1007/978-3-642-39799-8_63.
[ BibTex | DOI | Web page | PDF ]

[Gou13b]

J. Goubault-Larrecq. A few pearls in the theory of quasi-metric spaces. Invited talk (semi-plenary speaker), Summer Topology Conference, North Bay, Ontario, CA, July 2013.
[ BibTex ]

[Gou13e]

J. Goubault-Larrecq. A short proof of the Schröder-Simpson theorem. Invited talk, Workshop on Asymmetric Topology, Summer Topology Conference, North Bay, Ontario, CA, July 2013.
[ BibTex ]

[ABG13]

S. Akshay, B. Bollig, and P. Gastin. Event-clock Message Passing Automata: A Logical Characterization and an Emptiness-Checking Algorithm. Formal Methods in System Design, 42(3):262--300, June 2013.
doi: 10.1007/s10703-012-0179-8.
[ BibTex | DOI | Web page | PDF ]

[GS13]

P. Gastin and N. Sznajder. Fair Synthesis for Asynchronous Distributed Systems. ACM Transactions on Computational Logic, 14(2:9), June 2013.
doi: 10.1145/2480759.2480761.
[ BibTex | DOI | Web page | PDF ]

[AAM⁺13]

S. Abiteboul, É. Antoine, G. Miklau, J. Stoyanovich, and J. Testard. Rule-based application development using Webdamlog. In Proceedings of the ACM SIGMOD Internaitonal Conference on Management of Data (SIGMOD'13), pages 965--968, New York, New York, USA, June 2013. ACM Press.
doi: 10.1145/2463676.2465251.
[ BibTex | DOI | Web page | PDF ]

[BD13]

K. Bansal and S. Demri. Model-checking bounded multi-pushdown systems. In Proceedings of the 8th International Computer Science Symposium in Russia (CSR'13), volume 7913 of Lecture Notes in Computer Science, pages 405--417, Ekaterinburg, Russia, June 2013. Springer.
doi: 10.1007/978-3-642-38536-0_35.
[ BibTex | DOI | Web page | PDF ]

[VM13a]

S. Valette and N. Markey. Cassting website. Cassting deliverable D6.1 (FP7-ICT-601148), June 2013. 10 pages.
[ BibTex | Web page | PDF ]

[CH13]

Th. Chatain and S. Haar. A Canonical Contraction for Safe Petri Nets. In Proceedings of the 7th International Workshop on Petri Nets and Software Engineering (PNSE'13), volume 969 of CEUR Workshop Proceedings, pages 25--39, Milano, Italy, June 2013. RWTH Aachen, Germany.
[ BibTex | Web page | PDF ]

[GHPR13]

G. Geeraerts, A. Heußner, M. Praveen, and J.-F. Raskin. ω-Petri nets. In Proceedings of the 34th International Conference on Applications and Theory of Petri Nets (PETRI NETS'13), volume 7927 of Lecture Notes in Computer Science, pages 49--69, Milano, Italy, June 2013. Springer.
doi: 10.1007/978-3-642-38697-8_4.
[ BibTex | DOI | Web page | PDF ]

[BST13]

M. Bojańczyk, L. Segoufin, and S. Toruńczyk. Verification of Database-driven Systems via Amalgamation. In Proceedings of the 32nd Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'13), pages 63--74, New York, New York, USA, June 2013. ACM Press.
doi: 10.1145/2463664.2465228.
[ BibTex | DOI | Web page | PDF ]

[GLS13b]

A. Gheerbrant, L. Libkin, and C. Sirangelo. When is Naïve Evaluation Possible? In Proceedings of the 32nd Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'13), pages 75--86, New York, New York, USA, June 2013. ACM Press.
doi: 10.1145/2463664.2463674.
[ BibTex | DOI | Web page | PDF ]

[AV13a]

S. Abiteboul and V. Vianu. Collaborative Data-Driven Workflows: Think Global, Act Local. In Proceedings of the 32nd Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'13), pages 91--102, New York, New York, USA, June 2013. ACM Press.
doi: 10.1145/2463664.2463672.
[ BibTex | DOI | Web page | PDF ]

[KS13b]

W. Kazana and L. Segoufin. Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion. In Proceedings of the 32nd Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'13), pages 297--308, New York, New York, USA, June 2013. ACM Press.
doi: 10.1145/2463664.2463667.
[ BibTex | DOI | Web page | PDF ]

[CCD13a]

V. Cheval, V. Cortier, and S. Delaune. Deciding equivalence-based properties using constraint solving. Theoretical Computer Science, 492:1--39, June 2013.
doi: 10.1016/j.tcs.2013.04.016.
[ BibTex | DOI | Web page | PDF ]

[CCS13]

H. Comon-Lundh, V. Cortier, and G. Scerri. Tractable inference systems: an extension with a deducibility predicate. In Proceedings of the 24th International Conference on Automated Deduction (CADE'13), volume 7898 of Lecture Notes in Artificial Intelligence, pages 91--108, Lake Placid, New York, USA, June 2013. Springer.
doi: 10.1007/978-3-642-38574-2_6.
[ BibTex | DOI | Web page | PDF ]

[BKM13]

B. Bollig, D. Kuske, and R. Mennicke. The Complexity of Model Checking Multi-Stack Systems. In Proceedings of the 28th Annual IEEE Symposium on Logic in Computer Science (LICS'13), pages 163--170, New-Orleans, Louisiana, USA, June 2013. IEEE Computer Society Press.
doi: 10.1109/LICS.2013.22.
[ BibTex | DOI | Web page | PDF ]

[DFP13]

S. Demri, D. Figueira, and M. Praveen. Reasoning about Data Repetitions with Counter Systems. In Proceedings of the 28th Annual IEEE Symposium on Logic in Computer Science (LICS'13), pages 33--42, New-Orleans, Louisiana, USA, June 2013. IEEE Computer Society Press.
doi: 10.1109/LICS.2013.8.
[ BibTex | DOI | Web page | PDF ]

[BS13d]

A. Boral and S. Schmitz. Model Checking Parse Trees. In Proceedings of the 28th Annual IEEE Symposium on Logic in Computer Science (LICS'13), pages 153--162, New-Orleans, Louisiana, USA, June 2013. IEEE Computer Society Press.
doi: 10.1109/LICS.2013.21.
[ BibTex | DOI | Web page | PDF ]

[BHLM13]

B. Bollig, P. Habermehl, M. Leucker, and B. Monmege. A Fresh Approach to Learning Register Automata. In Proceedings of the 17th International Conference on Developments in Language Theory (DLT'13), volume 7907 of Lecture Notes in Computer Science, pages 118--130, Marne-la-Vallée, France, June 2013. Springer.
doi: 10.1007/978-3-642-38771-5_12.
[ BibTex | DOI | Web page | PDF ]

[RSK13]

C. Rodríguez, S. Schwoon, and V. Khomenko. Contextual Merged Processes. In Proceedings of the 34th International Conference on Applications and Theory of Petri Nets (PETRI NETS'13), volume 7927 of Lecture Notes in Computer Science, pages 29--48, Milano, Italy, June 2013. Springer.
doi: 10.1007/978-3-642-38697-8_3.
[ BibTex | DOI | Web page | PDF ]

[FH13]

E. Fraca and S. Haddad. Complexity Analysis of Continuous Petri Nets. In Proceedings of the 34th International Conference on Applications and Theory of Petri Nets (PETRI NETS'13), volume 7927 of Lecture Notes in Computer Science, pages 170--189, Milano, Italy, June 2013. Springer.
doi: 10.1007/978-3-642-38697-8_10.
[ BibTex | DOI | Web page | PDF ]

[HHM13]

S. Haddad, R. Hennicker, and M. H. Møller. Channel Properties of Asynchronously Composed Petri Nets. In Proceedings of the 34th International Conference on Applications and Theory of Petri Nets (PETRI NETS'13), volume 7927 of Lecture Notes in Computer Science, pages 369--388, Milano, Italy, June 2013. Springer.
doi: 10.1007/978-3-642-38697-8_20.
[ BibTex | DOI | Web page | PDF ]

[AR13]

A. Arul and J. Reichert. The Complexity of Robot Games on the Integer Line. In Proceedings of the 11th International Workshop on Quantitative Aspects of Programming Languages (QAPl'13), volume 117 of Electronic Proceedings in Theoretical Computer Science, pages 132--148, Rome, Italy, June 2013.
doi: 10.4204/EPTCS.117.9.
[ BibTex | DOI | Web page | PDF ]

[BS13b]

N. Bertrand and Ph. Schnoebelen. Solving stochastic Büchi games on infinite arenas with a finite attractor. In Proceedings of the 11th International Workshop on Quantitative Aspects of Programming Languages (QAPl'13), volume 117 of Electronic Proceedings in Theoretical Computer Science, pages 116--131, Rome, Italy, June 2013.
doi: 10.4204/EPTCS.117.8.
[ BibTex | DOI | Web page | PDF ]

[Gou13d]

J. Goubault-Larrecq. OrchIDS, ou : de l'importance de la sémantique. Séminaire DGA Innosciences. DGA, Bagneux, June 2013.
[ BibTex ]

[BCH13a]

S. Balaguer, Th. Chatain, and S. Haar. Building Occurrence Nets from Reveals Relations. Fundamenta Informaticae, 123(3):245--272, May 2013.
doi: 10.3233/FI-2013-809.
[ BibTex | DOI | Web page | PDF ]

[FS13b]

L. Fribourg and R. Soulat. Limit Cycles of Controlled Switched Systems: Existence, Stability, Sensitivity. In Proceedings of the 3rd International Workshop on New Computational Methods for Inverse Problems (NCMIP'13), volume 464 of Journal of Physics: Conference Series, Cachan, France, May 2013. IOS Press.
doi: 10.1088/1742-6596/464/1/012007.
[ BibTex | DOI | Web page | PDF ]

[San13a]

O. Sankur. Robustness in Timed Automata: Analysis, Synthesis, Implementation. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, May 2013.
[ BibTex | Web page | PDF ]

[ABB⁺13]

E. G. Amparore, B. Barbot, M. Beccuti, S. Donatelli, and G. Franceschinis. Simulation-based Verification of Hybrid Automata Stochastic Logic Formulas for Stochastic Symmetric Nets. In Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation (PADS'13), pages 253--264, Montreal, Canada, May 2013. ACM Press.
doi: 10.1145/2486092.2486124.
[ BibTex | DOI | Web page | PDF ]

[AFS13b]

É. André, L. Fribourg, and J. Sproston. An Extension of the Inverse Method to Probabilistic Timed Automata. Formal Methods in System Design, 42(2):119--145, April 2013.
doi: 10.1007/s10703-012-0169-x.
[ BibTex | DOI | Web page | PDF ]

[VM13b]

S. Valette and N. Markey. Minutes of the Kick-Off Meeting. Cassting deliverable D6.1 (FP7-ICT-601148), April 2013. 9 pages.
[ BibTex | Web page | PDF ]

[BCG⁺13]

L. Barguñó, C. Creus, G. Godoy, F. Jacquemard, and C. Vacher. Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories. Logical Methods in Computer Science, 9(2), April 2013.
doi: 10.2168/LMCS-9(2:1)2013.
[ BibTex | DOI | Web page | PDF ]

[BCH⁺13c]

B. Bollig, A. Cyriac, L. Hélouët, A. Kara, and Th. Schwentick. Dynamic Communicating Automata and Branching High-Level MSCs. In Proceedings of the 7th International Conference on Language and Automata Theory and Applications (LATA'13), volume 7810 of Lecture Notes in Computer Science, pages 177--189, Bilbao, Spain, April 2013. Springer.
doi: 10.1109/REVET.2012.6195253.
[ BibTex | DOI | Web page | PDF ]

[CB13]

V. Cheval and B. Blanchet. Proving More Observational Equivalences with ProVerif. In Proceedings of the 2nd International Conference on Principles of Security and Trust (POST'13), volume 7796 of Lecture Notes in Computer Science, pages 226--246, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-36830-1_12.
[ BibTex | DOI | Web page | PDF ]

[CD13a]

R. Chrétien and S. Delaune. Formal analysis of privacy for routing protocols in mobile ad hoc networks. In Proceedings of the 2nd International Conference on Principles of Security and Trust (POST'13), volume 7796 of Lecture Notes in Computer Science, pages 1--20, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-36830-1_1.
[ BibTex | DOI | Web page | PDF ]

[BFHR13]

R. Bonnet, A. Finkel, S. Haddad, and F. Rosa-Velardo. Ordinal Theory for Expressiveness of Well-Structured Transition Systems. Information and Computation, 224:1--22, March 2013.
doi: 10.1016/j.ic.2012.11.003.
[ BibTex | DOI | Web page | PDF ]

[Gou13c]

J. Goubault-Larrecq. Non-Hausdorff Topology and Domain Theory---Selected Topics in Point-Set Topology, volume 22 of New Mathematical Monographs. Cambridge University Press, March 2013.
[ BibTex | Web page ]

[BC13b]

R. Bonnet and R. Chadha. Bounded Context-Switching and Reentrant Locking. In Proceedings of the 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'13), volume 7794 of Lecture Notes in Computer Science, pages 65--80, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-37075-5_5.
[ BibTex | DOI ]

[LGBB13]

G. Lipari, L. George, E. Bini, and M. Bertogna. On the Average Complexity of the Processor Demand Analysis for Earliest Deadline Scheduling. In Real-Time Sytems: the past, the present, and the future -- Proceedings of a conference organized in celebration of Professor Alan Burns' sixtieth birthday, pages 75--86, York, UK, March 2013. CreateSpace Independent Publishing Platform.
[ BibTex | Web page | PDF ]

[LB13]

G. Lipari and G. Buttazzo. Resource reservation for Mixed Criticality Systems. In Real-Time Sytems: the past, the present, and the future -- Proceedings of a conference organized in celebration of Professor Alan Burns' sixtieth birthday, pages 60--74, York, UK, March 2013. CreateSpace Independent Publishing Platform.
[ BibTex | Web page | PDF ]

[DKN⁺13]

M. Duflot, M. Kwiatkowska, G. Norman, D. Parker, S. Peyronnet, C. Picaronny, and J. Sproston. Practical Applications of Probabilistic Model Checking to Communication Protocols. In Formal Methods for Industrial Critical Systems: A Survey of Applications, chapter 7, pages 133--150. John Wiley & Sons, Ltd. and IEEE Computer Society Press, March 2013.
doi: 10.1002/9781118459898.ch7.
[ BibTex | DOI | Web page | PDF ]

[ABMW13]

S. Abiteboul, P. Bourhis, A. Muscholl, and Z. Wu. Recursive queries on trees and data trees. In Proceedings of the 16th International Conference on Database Theory (ICDT'13), pages 93--104, Genoa, Italy, March 2013. ACM Press.
doi: 10.1145/2448496.2448509.
[ BibTex | DOI | Web page | PDF ]

[BGM13]

B. Bollig, P. Gastin, and B. Monmege. Weighted Specifications over Nested Words. In Proceedings of the 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'13), volume 7794 of Lecture Notes in Computer Science, pages 385--400, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-37075-5_25.
[ BibTex | DOI | Web page | PDF ]

[BNS13]

E. Bertsch, M.-J. Nederhof, and S. Schmitz. On LR Parsing with Selective Delays. In Proceedings of the 22nd International Conference on Compiler Construction (CC'13), volume 7791 of Lecture Notes in Computer Science, pages 244--263, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-37051-9_13.
[ BibTex | DOI | Web page | PDF ]

[KS13a]

P. Karandikar and S. Schmitz. The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. In Proceedings of the 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'13), volume 7794 of Lecture Notes in Computer Science, pages 273--288, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-37075-5_18.
[ BibTex | DOI | Web page | PDF ]

[Fin13]

A. Finkel. REACHARD -- Compte-rendu intermédiaire. Deliverable D2 Reachard (ANR-11-BS02-001), March 2013. 9 pages.
[ BibTex ]

[BCH⁺13b]

B. Bérard, F. Cassez, S. Haddad, D. Lime, and O. H. Roux. The Expressive Power of Time Petri Nets. Theoretical Computer Science, 474:1--20, February 2013.
doi: 10.1016/j.tcs.2012.12.005.
[ BibTex | DOI | Web page | PDF ]

[BCD13]

M. Baudet, V. Cortier, and S. Delaune. YAPA: A generic tool for computing intruder knowledge. ACM Transactions on Computational Logic, 14(1:4), February 2013.
doi: 10.1145/2422085.2422089.
[ BibTex | DOI | Web page | PDF ]

[FK13]

L. Fribourg and U. Kühne. Parametric Verification and Test Coverage for Hybrid Automata using the Inverse Method. International Journal of Foundations of Computer Science, 24(2):233--249, February 2013.
doi: 10.1142/S0129054113400091.
[ BibTex | DOI | Web page | PDF ]

[HM13]

S. Haar and T. Masopust. Languages, Decidability, and Complexity. In Control of Discrete-Event Systems -- Automata and Petri Net Perspectives, volume 433 of Lecture Notes in Control and Information Sciences, pages 23--43. Springer, 2013.
doi: 10.1007/978-1-4471-4276-8_2.
[ BibTex | DOI | Web page | PDF ]

[HF13]

S. Haar and É. Fabre. Diagnosis with Petri Net Unfoldings. In Control of Discrete-Event Systems -- Automata and Petri Net Perspectives, volume 433 of Lecture Notes in Control and Information Sciences, pages 301--318. Springer, 2013.
doi: 10.1007/978-1-4471-4276-8_15.
[ BibTex | DOI | Web page | PDF ]

[BBL⁺13]

B. Bérard, P. Bouyer, K. G. Larsen, N. Markey, J. Mullins, O. Sankur, M. Sassolas, and C. Thrane. Measuring the robustness. Deliverable ImpRo 3.1, (ANR-10-BLAN-0317), January 2013. 59 pages.
[ BibTex | Web page | PDF ]

[BFH⁺13]

P. Bouyer, S. Faucou, S. Haar, A. Jovanivić, D. Lime, N. Markey, O. H. Roux, and O. Sankur. Control tasks for Timed System; Robustness issues. Deliverable ImpRo 5.1, (ANR-10-BLAN-0317), January 2013. 34 pages.
[ BibTex | Web page | PDF ]

[AS13]

É. André and R. Soulat. The Inverse Method. Wiley-ISTE, January 2013. 176 pages.
[ BibTex | Web page ]

[HMN13]

S. Haddad, J. Mairesse, and H.-T. Nguyen. Synthesis and Analysis of Product-form Petri Nets. Fundamenta Informaticae, 122(1-2):147--172, 2013.
doi: 10.3233/FI-2013-786.
[ BibTex | DOI | Web page | PDF ]

[GJ13]

J. Goubault-Larrecq and J.-P. Jouannaud. The Blossom of Finite Semantic Trees. In Programming Logics -- Essays in Memory of Harald Ganzinger, volume 7797 of Lecture Notes in Computer Science, pages 90--122. Springer, January 2013.
[ BibTex | Web page | PDF ]

[Bon13]

R. Bonnet. Theory of Well-Structured Transition Systems and Extended Vector-Addition Systems. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2013.
[ BibTex | Web page | PDF ]

[DR13]

L. Doyen and A. Rabinovich. Robot games. Research Report LSV-13-02, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2013. 2 pages.
[ BibTex | Web page | PDF ]

This file was generated by bibtex2html 1.98.