Publications : 2012

[Haa12]

S. Haar. What topology tells us about diagnosability in partial order semantics. Discrete Event Dynamic Systems: Theory and Applications, 22(4):383--402, December 2012.
doi: 10.1007/s10626-011-0121-z.
[ BibTex | DOI | Web page | PDF ]

[CU12]

R. Chadha and M. Ummels. The complexity of quantitative information flow in recursive programs. In Proceedings of the 32nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'12), volume 18 of Leibniz International Proceedings in Informatics, pages 534--545, Hyderabad, India, December 2012. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2012.534.
[ BibTex | DOI | Web page | PDF ]

[Ben12b]

H. Benzina. Enforcing Virtualized Systems Security. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012.
[ BibTex | Web page | PDF ]

[Bal12]

S. Balaguer. La concurrence dans les systèmes distribués temps-réel. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012.
[ BibTex | Web page | PDF ]

[FFL⁺12b]

G. Feld, L. Fribourg, D. Labrousse, B. Revol, and R. Soulat. Correct-by-Design Control of 5-level and 7-level Power Converters. Research Report LSV-12-25, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012. 8 pages.
[ BibTex | Web page | PDF ]

[FS12]

L. Fribourg and R. Soulat. Controlled Recurrent Subspaces for Sampled Switched Linear Systems. Research Report LSV-12-24, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012. 11 pages.
[ BibTex | Web page | PDF ]

[Ves12]

S. Vester. Symmetric Nash equilibria. Research Report LSV-12-23, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012. 51 pages.
[ BibTex | Web page | PDF ]

[Che12]

V. Cheval. Automatic verification of cryptographic protocols: privacy-type properties. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012.
[ BibTex | Web page | PDF ]

[CFM12b]

M. Cadilhac, A. Finkel, and P. McKenzie. Bounded Parikh automata. International Journal of Foundations of Computer Science, 23(8):1691--1710, December 2012.
doi: 10.1142/S0129054112400709.
[ BibTex | DOI | Web page | PDF ]

[BGKR12]

D. Berwanger, E. Grädel, L. Kaiser, and R. Rabinovich. Entanglement and the complexity of directed graphs. Theoretical Computer Science, 463:2--25, December 2012.
doi: 10.1016/j.tcs.2012.07.010.
[ BibTex | DOI | Web page | PDF ]

[BFP12]

R. Bonnet, A. Finkel, and M. Praveen. Extending the Rackoff technique to affine nets. In Proceedings of the 32nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'12), volume 18 of Leibniz International Proceedings in Informatics, Hyderabad, India, December 2012. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2012.301.
[ BibTex | DOI | Web page | PDF ]

[BS12]

D. Berwanger and O. Serre. Parity games on undirected graphs. Information Processing Letters, 112(23):928--932, December 2012.
doi: 10.1016/j.ipl.2012.08.021.
[ BibTex | DOI | Web page | PDF ]

[GS12]

P. Gastin and N. Sznajder. Decidability of well-connectedness for distributed synthesis. Information Processing Letters, 112(24):963--968, December 2012.
doi: 10.1016/j.ipl.2012.08.018.
[ BibTex | DOI | Web page | PDF ]

[BDF12]

A. Bušić, H. Djafri, and J.-M. Fourneau. Bounded state space truncation and censored Markov chains. In Proceedings of the 51st IEEE Conference on Decision and Control (CDC'12), pages 5828--5833, Maui, Hawaii, USA, December 2012. IEEE Control System Society.
doi: 10.1109/CDC.2012.6426156.
[ BibTex | DOI | Web page | PDF ]

[AvMSS12]

M. Anderson, D. van Melkebeek, N. Schweikardt, and L. Segoufin. Locality from Circuit Lower Bounds. SIAM Journal on Computing, 41(6):1481--1523, November 2012.
doi: 10.1137/110856873.
[ BibTex | DOI | Web page | PDF ]

[Bre12]

R. Brenguier. Équilibres de Nash dans les Jeux Concurrents -- Application aux Jeux Temporisés. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2012.
[ BibTex | Web page | PDF ]

[BHP12b]

B. Barbot, S. Haddad, and C. Picaronny. Importance Sampling for Model Checking of Continuous Time Markov Chains. In Proceedings of the 4th International Conference on Advances in System Simulation (SIMUL'12), pages 30--35, Lisbon, Portugal, November 2012. XPS.
[ BibTex | Web page | PDF ]

[CD12c]

K. Chatterjee and L. Doyen. Energy parity games. Theoretical Computer Science, 458:49--60, November 2012.
doi: 10.1016/j.tcs.2012.07.038.
[ BibTex | DOI | Web page | PDF ]

[FLC12]

D. Faggioli, G. Lipari, and T. Cucinotta. Analysis and Implementation of the Multiprocessor Bandwidth Inheritance Protocol. Real-Time Systems, 48(6):789--825, November 2012.
doi: 10.1007/s11241-012-9162-0.
[ BibTex | DOI | Web page | PDF ]

[DDG12]

S. Demri, D. D'Souza, and R. Gascon. Temporal Logics of Repeating Values. Journal of Logic and Computation, 22(5):1059--1096, October 2012.
doi: 10.1093/logcom/exr013.
[ BibTex | DOI | Web page | PDF ]

[CFM12a]

M. Cadilhac, A. Finkel, and P. McKenzie. Affine Parikh automata. RAIRO Informatique Théorique et Applications, 46(4):511--545, October 2012.
doi: 10.1051/ita/2012013.
[ BibTex | DOI | Web page | PDF ]

[DDMM12]

Ph. Darondeau, S. Demri, R. Meyer, and Ch. Morvan. Petri Net Reachability Graphs: Decidability Status of FO Properties. Logical Methods in Computer Science, 8(4:9), October 2012.
doi: 10.2168/LMCS-8(4:9)2012.
[ BibTex | DOI | Web page | PDF ]

[AG12]

A. Adjé and J. Goubault-Larrecq. Concrete Semantics of Programs with Non-Deterministic and Random Inputs. Research Report cs.LO/1210.2605, Computing Research Repository, October 2012. 19 pages.
[ BibTex | Web page | PDF ]

[BGMZ12]

B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. A Probabilistic Kleene Theorem. In Proceedings of the 10th International Symposium on Automated Technology for Verification and Analysis (ATVA'12), volume 7561 of Lecture Notes in Computer Science, pages 400--415, Thiruvananthapuram, India, October 2012. Springer.
doi: 10.1007/978-3-642-33386-6_31.
[ BibTex | DOI | Web page | PDF ]

[SVMdM12]

D. V. Simões De Sousa, H. Viana, N. Markey, and J. A. F. de Macêdo. Querying Trajectories through Model Checking based on Timed Automata. In Proceedings of the 27th Brazilian Symposium on Databases (SBBD'12), São Paulo, Brazil, October 2012. Sociedade Brasileira de Computação.
[ BibTex | Web page | PDF ]

[AGL12]

A. Adjé and J. Goubault-Larrecq. Concrete semantics of programs with non-deterministic and random inputs. Fourniture du projet ANR CPP (Confidence, Proofs, and Probabilities), WP 2, version 1, October 2012.
[ BibTex | Web page ]

[FG12a]

A. Finkel and J. Goubault-Larrecq. Forward Analysis for WSTS, Part II: Complete WSTS. Logical Methods in Computer Science, 8(3:28), September 2012.
doi: 10.2168/LMCS-8(3:28)2012.
[ BibTex | DOI | Web page | PDF ]

[Abi12b]

S. Abiteboul. Sharing Distributed Knowledge on the Web (Invited Talk). In Proceedings of the 21st Annual EACSL Conference on Computer Science Logic (CSL'12), volume 16 of Leibniz International Proceedings in Informatics, pages 6--8, Fontainebleau, France, September 2012. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2012.6.
[ BibTex | DOI | Web page | PDF ]

[BSS12]

M. Bojańczyk, L. Segoufin, and H. Straubing. Piecewise testable tree languages. Logical Methods in Computer Science, 8(3:26), September 2012.
doi: 10.2168/LMCS-8(3:26)2012.
[ BibTex | DOI | Web page | PDF ]

[Chr12]

R. Chrétien. Trace equivalence of protocols for an unbounded number of sessions. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2012. 30 pages.
[ BibTex | Web page | PDF ]

[KS12b]

R. Künnemann and G. Steel. YubiSecure? Formal Security Analysis Results for the Yubikey and YubiHSM. In Revised Selected Papers of the 8th Workshop on Security and Trust Management (STM'12), volume 7783 of Lecture Notes in Computer Science, pages 257--272, Pisa, Italy, September 2012. Springer.
doi: 10.1007/978-3-642-38004-4_17.
[ BibTex | DOI | Web page | PDF ]

[FLP12]

A. Finkel, J. Leroux, and I. Potapov, editors. Proceedings of the 6th International Wokshop on Reachability Problems (RP'12), volume 7550 of Lecture Notes in Computer Science, Bordeaux, France, September 2012. Springer.
doi: 10.1007/978-3-642-33512-9.
[ BibTex | DOI | Web page ]

[SLBC12]

R. M. Santos, G. Lipari, E. Bini, and T. Cucinotta. On-line schedulability tests for adaptive reservations in fixed priority scheduling. Real-Time Systems, 48(5):601--634, September 2012.
doi: 10.1007/s11241-012-9156-y.
[ BibTex | DOI | Web page | PDF ]

[JKS12]

P. Jančar, P. Karandikar, and Ph. Schnoebelen. Unidirectional channel systems can be tested. In Proceedings of the 7th IFIP International Conference on Theoretical Computer Science (IFIP TCS'12), volume 7604 of Lecture Notes in Computer Science, pages 149--163, Amsterdam, The Netherlands, September 2012. Springer.
doi: 10.1007/978-3-642-33475-7_11.
[ BibTex | DOI | Web page | PDF ]

[RS12]

C. Rodríguez and S. Schwoon. Verification of Petri Nets with Read Arcs. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 471--485, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_33.
[ BibTex | DOI | Web page | PDF ]

[CGNK12]

A. Cyriac, P. Gastin, and K. Narayan Kumar. MSO Decidability of Multi-Pushdown Systems via Split-Width. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 547--561, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_38.
[ BibTex | DOI | Web page | PDF ]

[BGS12]

R. Brenguier, S. Göller, and O. Sankur. A Comparison of Succinctly Represented Finite-State Systems. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 147--161, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_12.
[ BibTex | DOI | Web page | PDF ]

[BHSS12]

B. Bérard, S. Haddad, M. Sassolas, and N. Sznajder. Concurrent Games on VASS with Inhibition. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 39--52, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_5.
[ BibTex | DOI | Web page | PDF ]

[BC12a]

S. Balaguer and Th. Chatain. Avoiding Shared Clocks in Networks of Timed Automata. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 100--114, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_9.
[ BibTex | DOI | Web page | PDF ]

[DLM12]

A. Da Costa, F. Laroussinie, and N. Markey. Quantified CTL: expressiveness and model checking. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 177--192, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_14.
[ BibTex | DOI | Web page | PDF ]

[FLMS12]

L. Fribourg, D. Lesens, P. Moro, and R. Soulat. Robustness Analysis for Scheduling Problems using the Inverse Method. In Proceedings of the 19th International Symposium on Temporal Representation and Reasoning (TIME'12), pages 73--80, Leicester, UK, September 2012. IEEE Computer Society Press.
doi: 10.1109/TIME.2012.10.
[ BibTex | DOI | Web page | PDF ]

[BBJM12]

P. Bouyer, Th. Brihaye, M. Jurdziński, and Q. Menet. Almost-Sure Model-Checking of Reactive Timed Automata. In Proceedings of the 9th International Conference on Quantitative Evaluation of Systems (QEST'12), pages 138--147, London, UK, September 2012. IEEE Computer Society Press.
doi: 10.1109/QEST.2012.10.
[ BibTex | DOI | Web page | PDF ]

[BLM12]

P. Bouyer, K. G. Larsen, and N. Markey. Lower-Bound Constrained Runs in Weighted Timed Automata. In Proceedings of the 9th International Conference on Quantitative Evaluation of Systems (QEST'12), pages 128--137, London, UK, September 2012. IEEE Computer Society Press.
doi: 10.1109/QEST.2012.28.
[ BibTex | DOI | Web page | PDF ]

[CFM12c]

M. Cadilhac, A. Finkel, and P. McKenzie. Unambiguous Constrained Automata. In Proceedings of the 16th International Conference on Developments in Language Theory (DLT'12), volume 7410 of Lecture Notes in Computer Science, pages 239--250, Taipei, Taiwan, August 2012. Springer.
doi: 10.1007/978-3-642-31653-1_22.
[ BibTex | DOI | Web page | PDF ]

[BKL12]

D. Berwanger, L. Kaiser, and S. Leßenich. Solving Counter Parity Games. In Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS'12), volume 7464 of Lecture Notes in Computer Science, pages 160--171, Bratislava, Slovakia, August 2012. Springer.
doi: 10.1007/978-3-642-32589-2_17.
[ BibTex | DOI | Web page | PDF ]

[BBC⁺12]

P. Baldan, A. Bruni, A. Corradini, B. König, C. Rodríguez, and S. Schwoon. Efficient unfolding of contextual Petri nets. Theoretical Computer Science, 449(1):2--22, August 2012.
doi: 10.1016/j.tcs.2012.04.046.
[ BibTex | DOI | Web page | PDF ]

[BFK⁺12]

R. Bardou, R. Focardi, Y. Kawamoto, L. Simionato, G. Steel, and J.-K. Tsay. Efficient Padding Oracle Attacks on Cryptographic Hardware. In Proceedings of the 32nd Annual International Cryptology Conference (CRYPTO'12), volume 7417 of Lecture Notes in Computer Science, pages 608--625, Santa Barbara, California, USA, August 2012. Springer.
doi: 10.1007/978-3-642-32009-5_36.
[ BibTex | DOI | Web page | PDF ]

[CD12b]

F. Carreiro and S. Demri. Beyond Regularity for Presburger Modal Logics. In Selected Papers from the 9th Workshop on Advances in Modal Logics (AiML'12), pages 161--182, Copenhagen, Denmark, August 2012. College Publications.
[ BibTex | Web page | PDF ]

[AFKS12]

É. André, L. Fribourg, U. Kühne, and R. Soulat. IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems. In Proceedings of the 18th International Symposium on Formal Methods (FM'12), volume 7436 of Lecture Notes in Computer Science, pages 33--36, Paris, France, August 2012. Springer.
doi: 10.1007/978-3-642-32759-9_6.
[ BibTex | DOI | Web page | PDF ]

[AMH12]

A. Agarwal, A. Madalinski, and S. Haar. Effective Verification of Weak Diagnosability. In Proceedings of the 8th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes (SAFEPROCESS'12), Mexico City, Mexico, August 2012. IFAC.
doi: 10.3182/20120829-3-MX-2028.00083.
[ BibTex | DOI | Web page | PDF ]

[DG12]

S. Demri and P. Gastin. Specification and Verification using Temporal Logics. In Modern applications of automata theory, volume 2 of IISc Research Monographs, chapter 15, pages 457--494. World Scientific, July 2012.
[ BibTex | Web page | PDF ]

[BDH⁺12]

D. Berwanger, A. Dawar, P. Hunter, S. Kreutzer, and J. Obdrzálek. The DAG-width of directed graphs. Journal of Combinatorial Theory, Series B, 102(4):900--923, July 2012.
doi: 10.1016/j.jctb.2012.04.004.
[ BibTex | DOI | Web page | PDF ]

[FFL⁺12c]

G. Feld, L. Fribourg, D. Labrousse, B. Revol, and R. Soulat. Numerical simulation and physical experimentation of a 5-level and 7-level power converter under a control designed by a formal method. Research Report LSV-12-16, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2012. 18 pages.
[ BibTex | Web page | PDF ]

[Loz12]

É. Lozes. Separation Logic: Expressiveness and Copyless Message-Passing. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, July 2012.
[ BibTex | Web page | PDF ]

[GM12]

P. Gastin and B. Monmege. Adding Pebbles to Weighted Automata. In Proceedings of the 17th International Conference on Implementation and Application of Automata (CIAA'12), volume 7381 of Lecture Notes in Computer Science, pages 28--51, Porto, Portugal, July 2012. Springer-Verlag.
doi: 10.1007/978-3-642-31606-7_4.
[ BibTex | DOI | Web page | PDF ]

[BMO⁺12]

P. Bouyer, N. Markey, J. Ouaknine, Ph. Schnoebelen, and J. Worrell. On Termination and Invariance for Faulty Channel Systems. Formal Aspects of Computing, 24(4-6):595--607, July 2012.
doi: 10.1007/s00165-012-0234-7.
[ BibTex | DOI | Web page | PDF ]

[BDL12a]

B. Bollig, N. Decker, and M. Leucker. Frequency Linear-time Temporal Logic. In Proceedings of the 6th International Symposium on Theoretical Aspects of Software Engineering (TASE'12), pages 85--92, Beijing, China, July 2012. IEEE Computer Society Press.
doi: 10.1109/TASE.2012.43.
[ BibTex | DOI | Web page | PDF ]

[BMS12]

P. Bouyer, N. Markey, and O. Sankur. Robust Reachability in Timed Automata: A Game-based Approach. In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP'12) -- Part II, volume 7392 of Lecture Notes in Computer Science, pages 128--140, Warwick, UK, July 2012. Springer.
doi: 10.1007/978-3-642-31585-5_15.
[ BibTex | DOI | Web page | PDF ]

[Ben12a]

H. Benzina. A Network Policy Model for Virtualized Systems. In Proceedings of the 17th IEEE Symposium on Computers and Communications (ISCC'12), pages 680--683, Nevsehir, Turkey, July 2012. IEEE Computer Society Press.
doi: 10.1109/ISCC.2012.6249376.
[ BibTex | DOI | Web page | PDF ]

[KS12a]

P. Karandikar and Ph. Schnoebelen. Cutting Through Regular Post Embedding Problems. In Proceedings of the 7th International Computer Science Symposium in Russia (CSR'12), volume 7353 of Lecture Notes in Computer Science, pages 229--240, Nizhni Novgorod, Russia, July 2012. Springer.
doi: 10.1007/978-3-642-30642-6_22.
[ BibTex | DOI | Web page | PDF ]

[Abi12c]

S. Abiteboul. Viewing the Web as a Distributed Knowledge Base. In Proceedings of the 2012 International Workshop Description Logic (DL'09), volume 846 of CEUR Workshop Proceedings, Rome, Italy, June 2012. RWTH Aachen, Germany.
[ BibTex | Web page | PDF ]

[CD12d]

K. Chatterjee and L. Doyen. Partial-Observation Stochastic Games: How to Win when Belief Fails. In Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science (LICS'12), pages 175--184, Dubrovnik, Croatia, June 2012. IEEE Computer Society Press.
doi: 10.1109/LICS.2012.28.
[ BibTex | DOI | Web page | PDF ]

[HP12]

S. Haddad and L. Pomello, editors. Proceedings of the 33rd International Conference on Applications and Theory of Petri Nets (ICATPN'12), volume 7347 of Lecture Notes in Computer Science, Hamburg, Germany, June 2012. Springer.
doi: 10.1007/978-3-642-31131-4.
[ BibTex | DOI | Web page ]

[FG12b]

A. Finkel and J. Goubault-Larrecq. The Theory of WSTS: The Case of Complete WSTS. In Proceedings of the 33rd International Conference on Applications and Theory of Petri Nets (PETRI NETS'12), volume 7347 of Lecture Notes in Computer Science, pages 3--31, Hamburg, Germany, June 2012. Springer.
doi: 10.1007/978-3-642-31131-4_2.
[ BibTex | DOI | Web page | PDF ]

[FFL⁺12a]

G. Feld, L. Fribourg, D. Labrousse, S. Lefebvre, B. Revol, and R. Soulat. Control of Multilevel Power Converters using Formal Methods. Research Report LSV-12-14, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2012. 14 pages.
[ BibTex | Web page | PDF ]

[Dja12]

H. Djafri. Approches numériques et statistiques pour le model checking des processus stochastiques. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2012.
[ BibTex | Web page | PDF ]

[HSS12]

S. Haddad, S. Schmitz, and Ph. Schnoebelen. The Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets. In Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science (LICS'12), pages 355--364, Dubrovnik, Croatia, June 2012. IEEE Computer Society Press.
doi: 10.1109/LICS.2012.46.
[ BibTex | DOI | Web page | PDF ]

[DDS12b]

S. Demri, A. K. Dhar, and A. Sangnier. Taming Past LTL and Flat Counter Systems. In Proceedings of the 6th International Joint Conference on Automated Reasoning (IJCAR'12), volume 7364 of Lecture Notes in Artificial Intelligence, pages 179--193, Manchester, UK, June 2012. Springer-Verlag.
doi: 10.1007/978-3-642-31365-3_16.
[ BibTex | DOI | Web page | PDF ]

[ACD12]

M. Arapinis, V. Cheval, and S. Delaune. Verifying privacy-type properties in a modular way. In Proceedings of the 25th IEEE Computer Security Foundations Symposium (CSF'12), pages 95--109, Cambridge Massachusetts, USA, June 2012. IEEE Computer Society Press.
doi: 10.1109/CSF.2012.16.
[ BibTex | DOI | Web page | PDF ]

[DKP12]

S. Delaune, S. Kremer, and D. Pasailă. Security protocols, constraint systems, and group theories. In Proceedings of the 6th International Joint Conference on Automated Reasoning (IJCAR'12), volume 7364 of Lecture Notes in Artificial Intelligence, pages 164--178, Manchester, UK, June 2012. Springer-Verlag.
doi: 10.1007/978-3-642-31365-3_15.
[ BibTex | DOI | Web page | PDF ]

[BCH12a]

S. Balaguer, Th. Chatain, and S. Haar. A Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata. Formal Methods in System Design, 40(3):330--355, June 2012.
doi: 10.1007/s10703-012-0146-4.
[ BibTex | DOI | Web page | PDF ]

[BK12]

B. Bollig and D. Kuske. An optimal construction of Hanf sentences. Journal of Applied Logic, 10(2):179--186, June 2012.
doi: 10.1016/j.jal.2012.01.002.
[ BibTex | DOI | Web page | PDF ]

[ABD12]

S. Abiteboul, M. Bienvenu, and D. Deutch. Deduction in the Presence of Distribution and Contradictions. In Proceedings of the 15th International Workshop on the Web and Databases (WebDB'12), pages 31--36, Scottsdale, Arizona, USA, May 2012.
[ BibTex | Web page | PDF ]

[AAMS12]

S. Abiteboul, Y. Amsterdamer, T. Milo, and P. Senellart. Auto-completion learning for XML. In Proceedings of the ACM SIGMOD Internaitonal Conference on Management of Data (SIGMOD'12), pages 669--672, Scottsdale, Arizona, USA, May 2012. ACM Press.
doi: 10.1145/2213836.2213928.
[ BibTex | DOI | Web page | PDF ]

[ABV12a]

S. Abiteboul, P. Bourhis, and V. Vianu. Comparing workflow specification languages: A matter of views. ACM Transactions on Database Systems, 37(2:10), May 2012.
doi: 10.1145/2188349.2188352.
[ BibTex | DOI | Web page | PDF ]

[PHL12]

H. Ponce de León, S. Haar, and D. Longuet. Conformance Relations for Labeled Event Structures. In Proceedings of the 6th International Conference on Tests and Proofs (TAP'12), volume 7305 of Lecture Notes in Computer Science, pages 83--98, Prague, Czech Republic, May-June 2012. Springer.
doi: 10.1007/978-3-642-30473-6_8.
[ BibTex | DOI | Web page | PDF ]

[IL12]

M. Izabachène and B. Libert. Divisible E-Cash in the Standard Model. In Proceedings of the 5th International Conference on Pairing-Based Cryptography (PAIRING'12), volume 7708 of Lecture Notes in Computer Science, pages 314--332, Cologne, Germany, May 2012. Springer.
doi: 10.1007/978-3-642-36334-4_20.
[ BibTex | DOI | Web page | PDF ]

[Ben12c]

H. Benzina. Towards Designing Secure Virtualized Systems. In Proceedings of the 2nd International Conference on Digital Information and Communication Technology and its Application (DICTAP'12), pages 250--255, Bangkok, Thailand, May 2012. IEEE Computer Society Press.
doi: 10.1109/DICTAP.2012.6215385.
[ BibTex | DOI | Web page | PDF ]

[CD12e]

H. Comon-Lundh and S. Delaune. Formal Security Proofs. In Software Safety and Security, volume 33 of NATO Science for Peace and Security Series -- D: Information and Communication Security, pages 26--63. IOS Press, May 2012.
[ BibTex | Web page | PDF ]

[CD12f]

V. Cortier and S. Delaune. Decidability and combination results for two notions of knowledge in security protocols. Journal of Automated Reasoning, 48(4):441--487, April 2012.
doi: 10.1007/s10817-010-9208-8.
[ BibTex | DOI | Web page | PDF ]

[ASV12]

S. Abiteboul, P. Senellart, and V. Vianu. The ERC webdam on foundations of web data management. In Proceedings of the 21st World Wide Web Conference (WWW'12) -- Companion Volume, pages 211--214, Lyon, France, April 2012. ACM Press.
[ BibTex | Web page | PDF ]

[AAS12]

S. Abiteboul, É. Antoine, and J. Stoyanovich. Viewing the Web as a Distributed Knowledge Base. In Proceedings of the 28th International Conference on Data Engineering (ICDE'12), pages 1--4, Washington, D.C., USA, April 2012. IEEE Computer Society Press.
doi: 10.1109/ICDE.2012.150.
[ BibTex | DOI | Web page | PDF ]

[AFS12]

É. André, L. Fribourg, and R. Soulat. Enhancing the Inverse Method with State Merging. In Proceedings of the 4th NASA Formal Methods Symposium (NFM'12), volume 7226 of Lecture Notes in Computer Science, pages 100--105, Norfolk, Virginia, USA, April 2012. Springer.
doi: 10.1007/978-3-642-28891-3_10.
[ BibTex | DOI | Web page | PDF ]

[GMM12]

P. Ganty, R. Majumdar, and B. Monmege. Bounded underapproximations. Formal Methods in System Design, 40(2):206--231, April 2012.
doi: 10.1007/s10703-011-0136-y.
[ BibTex | DOI | Web page | PDF ]

[CHKS12]

H. Comon-Lundh, M. Hagiya, Y. Kawamoto, and H. Sakurada. Computational Soundness of Indistinguishability Properties without Computable Parsing. In Proceedings of the 8th International Conference on Information Security Practice and Experience (ISPEC'12), volume 7232 of Lecture Notes in Computer Science, pages 63--79, Hangzhou, China, April 2012. Springer.
doi: 10.1007/978-3-642-29101-2_5.
[ BibTex | DOI | Web page | PDF ]

[BGGP12]

O. Bouissou, É. Goubault, J. Goubault-Larrecq, and S. Putot. A Generalization of P-boxes to Affine Arithmetic, and Applications to Static Analysis of Programs. Computing, 94(2-4):189--201, March 2012.
doi: 10.1007/s00607-011-0182-8.
[ BibTex | DOI | Web page | PDF ]

[BC12b]

G. Bana and H. Comon-Lundh. Towards Unconditional Soundness: Computationally Complete Symbolic Attacker. In Proceedings of the 1st International Conference on Principles of Security and Trust (POST'12), volume 7215 of Lecture Notes in Computer Science, pages 189--208, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28641-4_11.
[ BibTex | DOI | Web page | PDF ]

[CCS12]

H. Comon-Lundh, V. Cortier, and G. Scerri. Security proof with dishonest keys. In Proceedings of the 1st International Conference on Principles of Security and Trust (POST'12), volume 7215 of Lecture Notes in Computer Science, pages 149--168, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28641-4_9.
[ BibTex | DOI | Web page | PDF ]

[CDD12]

V. Cortier, J. Degrieck, and S. Delaune. Analysing routing protocols: four nodes topologies are sufficient. In Proceedings of the 1st International Conference on Principles of Security and Trust (POST'12), volume 7215 of Lecture Notes in Computer Science, pages 30--50, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28641-4_3.
[ BibTex | DOI | Web page | PDF ]

[BHP12a]

B. Barbot, S. Haddad, and C. Picaronny. Coupling and Importance Sampling for Statistical Model Checking. In Proceedings of the 18th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'12), volume 7214 of Lecture Notes in Computer Science, pages 331--346, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28756-5_23.
[ BibTex | DOI | Web page | PDF ]

[CMV12]

R. Chadha, P. Madhusudan, and M. Viswanathan. Reachability under Contextual Locking. In Proceedings of the 18th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'12), volume 7214 of Lecture Notes in Computer Science, pages 437--450, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28756-5_30.
[ BibTex | DOI | Web page | PDF ]

[BCGNK12]

B. Bollig, A. Cyriac, P. Gastin, and K. Narayan Kumar. Model Checking Languages of Data Words. In Proceedings of the 15th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'12), volume 7213 of Lecture Notes in Computer Science, pages 391--405, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28729-9_26.
[ BibTex | DOI | Web page | PDF ]

[BBMU12]

P. Bouyer, R. Brenguier, N. Markey, and M. Ummels. Concurrent games with ordered objectives. In Proceedings of the 15th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'12), volume 7213 of Lecture Notes in Computer Science, pages 301--315, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28729-9_20.
[ BibTex | DOI | Web page | PDF ]

[BJ12]

A. Bouhoula and F. Jacquemard. Sufficient completeness verification for conditional and constrained TRS. Journal of Applied Logic, 10(1):127--143, March 2012.
doi: 10.1016/j.jal.2011.09.001.
[ BibTex | DOI | Web page | PDF ]

[ABV12b]

S. Abiteboul, P. Bourhis, and V. Vianu. Highly expressive query languages for unordered data trees. In Proceedings of the 15th International Conference on Database Theory (ICDT'12), pages 46--60, Berlin, Germany, March 2012. ACM Press.
doi: 10.1145/2274576.2274583.
[ BibTex | DOI | Web page | PDF ]

[AAD⁺12]

S. Abiteboul, Y. Amsterdamer, D. Deutch, T. Milo, and P. Senellart. Finding optimal probabilistic generators for XML collections. In Proceedings of the 15th International Conference on Database Theory (ICDT'12), pages 127--139, Berlin, Germany, March 2012. ACM Press.
doi: 10.1145/2274576.2274591.
[ BibTex | DOI | Web page | PDF ]

[IHL⁺12]

R. Iosif, P. Habermehl, S. Labbe, É. Lozes, and B. Yakobowski. Concurrent Programs with Simple Data Structures ash Sequential Programs with Composite Data Structures. Deliverable VERIDYC D 2 (ANR-09-SEGI-016), March 2012.
[ BibTex | Web page | PDF ]

[LL12]

M. Lange and É. Lozes. Model-Checking the Higher-Dimensional Modal μ-Calculus. In Proceedings of the 8th Workshop on Fixed Points in Computer Science (FICS'12), volume 77 of Electronic Proceedings in Theoretical Computer Science, pages 39--46, Tallinn, Estonia, March 2012.
doi: 10.4204/EPTCS.77.6.
[ BibTex | DOI | Web page | PDF ]

[BCH12b]

S. Balaguer, Th. Chatain, and S. Haar. Concurrent semantics for timed distributed systems. Deliverable ImpRo D 4.1 (ANR-2010-BLAN-0317), March 2012.
[ BibTex | Web page | PDF ]

[Doy12]

L. Doyen. Games and Automata: From Boolean to Quantitative Verification. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, March 2012.
[ BibTex | Web page | PDF ]

[Sou12]

R. Soulat. Scheduling with IMITATOR: Some Case Studies. Research Report LSV-12-05, Laboratoire Spécification et Vérification, ENS Cachan, France, March 2012. 13 pages.
[ BibTex | Web page | PDF ]

[CCK12]

R. Chadha, S. Ciobâcă, and S. Kremer. Automated verification of equivalence properties of cryptographic protocols. In Programming Languages and Systems --- Proceedings of the 22nd European Symposium on Programming (ESOP'12), volume 7211 of Lecture Notes in Computer Science, pages 108--127, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28869-2_6.
[ BibTex | DOI | Web page | PDF ]

[BLL⁺12]

G. Belkacem, D. Labrousse, S. Lefebvre, P.-Y. Joubert, U. Kühne, L. Fribourg, R. Soulat, É. Florentin, and Ch. Rey. Distributed and Coupled Electrothermal Model of Power Semiconductor Devices. In Proceedings of the 1st International Conference on Renewable Energies and VEhicular Technology (REVET'12), pages 84--89, Hammamet, Tunisia, March 2012. IEEE Power & Energy Society.
doi: 10.1109/REVET.2012.6195253.
[ BibTex | DOI | Web page | PDF ]

[KMT12]

S. Kremer, A. Mercier, and R. Treinen. Reducing Equational Theories for the Decision of Static Equivalence. Journal of Automated Reasoning, 2(48):197--217, February 2012.
doi: 10.1007/s10817-010-9203-0.
[ BibTex | DOI | Web page | PDF ]

[CDK12]

S. Ciobâcă, S. Delaune, and S. Kremer. Computing knowledge in security protocols under convergent equational theories. Journal of Automated Reasoning, 48(2):219--262, February 2012.
doi: 10.1007/s10817-010-9197-7.
[ BibTex | DOI | Web page | PDF ]

[DJLL12]

S. Demri, M. Jurdziński, O. Lachish, and R. Lazić. The covering and boundedness problems for branching vector addition systems. Journal of Computer and System Sciences, 79(1):23--38, February 2012.
doi: 10.1016/j.jcss.2012.04.002.
[ BibTex | DOI | Web page | PDF ]

[BHP12c]

B. Barbot, S. Haddad, and C. Picaronny. Importance Sampling for Model Checking of Time-Bounded Until. Research Report LSV-12-04, Laboratoire Spécification et Vérification, ENS Cachan, France, February 2012. 14 pages.
[ BibTex | Web page | PDF ]

[BHS12]

B. Bérard, S. Haddad, and M. Sassolas. Interrupt Timed Automata: Verification and Expressiveness. Formal Methods in System Design, 40(1):41--87, February 2012.
doi: 10.1007/s10703-011-0140-2.
[ BibTex | DOI | Web page | PDF ]

[BDL12b]

R. Brochenin, S. Demri, and É. Lozes. On the Almighty Wand. Information and Computation, 211:106--137, February 2012.
doi: 10.1016/j.ic.2011.12.003.
[ BibTex | DOI | Web page | PDF ]

[Gou12]

J. Goubault-Larrecq. QRB-Domains and the Probabilistic Powerdomain. Logical Methods in Computer Science, 8(1:14), 2012.
doi: 10.2168/LMCS-8(1:14)2012.
[ BibTex | DOI | Web page | PDF ]

[CD12a]

P. Cabalar and S. Demri. Automata-Based Computation of Temporal Equilibrium Models. In Proceedings of the 21st International Workshop on Logic Program Synthesis and Transformation (LOPSTR'11), volume 7225 of Lecture Notes in Computer Science, pages 57--72, Odense, Denmark, 2012. Springer.
doi: 10.1007/978-3-642-32211-2_5.
[ BibTex | DOI | Web page | PDF ]

[DDS12a]

M. Dahl, S. Delaune, and G. Steel. Formal Analysis of Privacy for Anonymous Location Based Services. In Revised Selected Papaers of the Workshop on Theory of Security and Applications (TOSCA'11), volume 6993 of Lecture Notes in Computer Science, pages 98--112, Saarbrücken, Germany, January 2012. Springer.
doi: 10.1007/978-3-642-27375-9_6.
[ BibTex | DOI | Web page | PDF ]

[JLTV12]

F. Jacquemard, É. Lozes, R. Treinen, and J. Villard. Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus. In Revised Selected Papaers of the Workshop on Theory of Security and Applications (TOSCA'11), volume 6993 of Lecture Notes in Computer Science, pages 166--185, Saarbrücken, Germany, January 2012. Springer.
doi: 10.1007/978-3-642-27375-9_10.
[ BibTex | DOI | Web page | PDF ]

[Abi12a]

S. Abiteboul. Sciences des données: De la logique du premier ordre à la Toile. Leçons inaugurales du Collège de France. Fayard, 2012.
[ BibTex ]

[LV12]

É. Lozes and J. Villard. Reliable Contracts for Unreliable Half-Duplex Communications. In Revised Selected Papers of the 8th International Workshop on Web Services and Formal Methods (WS-FM'11), volume 7176 of Lecture Notes in Computer Science, pages 2--16, Clermont-Ferrand, France, 2012. Springer.
doi: 10.1007/978-3-642-29834-9_2.
[ BibTex | DOI | Web page | PDF ]

[ABB⁺12]

S. Akshay, B. Bérard, P. Bouyer, S. Haar, S. Haddad, C. Jard, D. Lime, N. Markey, P.-A. Reynier, O. Sankur, and Y. Thierry-Mieg. Overview of Robustness in Timed Systems. Deliverable ImpRo D 2.1 (ANR-2010-BLAN-0317), January 2012.
[ BibTex | Web page | PDF ]

[AGG12]

A. Adjé, S. Gaubert, and É. Goubault. Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis. Logical Methods in Computer Science, 8(1:1), January 2012.
doi: 10.2168/LMCS-8(1:01)2012.
[ BibTex | DOI | Web page | PDF ]

[Fig12]

D. Figueira. Alternating register automata on finite words and trees. Logical Methods in Computer Science, 8(1:22), 2012.
doi: 10.2168/LMCS-8(1:22)2012.
[ BibTex | DOI | Web page | PDF ]

[BFLZ12]

R. Bonnet, A. Finkel, J. Leroux, and M. Zeitoun. Model Checking Vector Addition Systems with one zero-test. Logical Methods in Computer Science, 8(2:11), 2012.
doi: 10.2168/LMCS-8(2:11)2012.
[ BibTex | DOI | Web page | PDF ]

[EHH12]

D. El Hog-Benzina, S. Haddad, and R. Hennicker. Refinement and Asynchronous Composition of Modal Petri Nets. In Transactions on Petri Nets and Other Models of Concurrency V, volume 6900 of Lecture Notes in Computer Science, pages 96--120. Springer, 2012.
doi: 10.1007/978-3-642-29072-5_4.
[ BibTex | DOI | Web page | PDF ]

This file was generated by bibtex2html 1.98.