2016  

[BGM16]  Patricia Bouyer, Patrick Gardy, and Nicolas Markey. On the semantics of Strategy Logic. Information Processing Letters 116(2):7579. Elsevier, February 2016. 
[BCM16]  Patricia Bouyer, Maximilien Colange, and Nicolas Markey. Symbolic Optimal Reachability in Weighted Timed Automata. In CAV'16, Lecture Notes in Computer Science 9779, pages 513530. SpringerVerlag, July 2016. 
[BMR+16]  Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, and Daniel Stan. Reachability in Networks of Register Protocols under Stochastic Schedulers. In ICALP'16, Leibniz International Proceedings in Informatics 55, pages 106:1106:14. LeibnizZentrum für Informatik, July 2016. 
[BMS16]  Patricia Bouyer, Nicolas Markey, and Daniel Stan. Stochastic Equilibria under Imprecise Deviations in TerminalReward Concurrent Games. In GandALF'16, Electronic Proceedings in Theoretical Computer Science 226, pages 6175. September 2016. 
[DLM16]  Amélie David, François Laroussinie, and Nicolas Markey. On the expressiveness of QCTL. In CONCUR'16, Leibniz International Proceedings in Informatics 59, pages 28:128:15. LeibnizZentrum für Informatik, August 2016. 
[FKM16]  Laurent Fribourg, Ulrich Kühne, and Nicolas Markey. Gamebased Synthesis of Distributed Controllers for Sampled Switched Systems. In SynCoP'15, OpenAccess Series in Informatics 44, pages 4761. LeibnizZentrum für Informatik, April 2016. 
[LFM+16]  Adrien Le Coënt, Laurent Fribourg, Nicolas Markey, Florian De Vuyst, and Ludovic Chamoin. Distributed Synthesis of StateDependent Switching Control. In RP'16, Lecture Notes in Computer Science 9899, pages 119133. SpringerVerlag, September 2016. 
[BDJ+16]  Thomas Brihaye, Benoît Delahaye, Loïg Jezequel, Nicolas Markey, and Jiří Srba (eds.) Proceedings of the Cassting Workshop on Games for the Synthesis of Complex Systems (Cassting'16) and of the 3rd International Workshop on Synthesis of Complex Parameters (SynCoP'16). Electronic Proceedings in Theoretical Computer Science 220. July 2016. 
[FM16]  Martin Fränzle and Nicolas Markey (eds.) Proceedings of the 14th International Conferences on Formal Modelling and Analysis of Timed Systems (FORMATS'16). Lecture Notes in Computer Science 9884. SpringerVerlag, August 2016. 
[ABB+16]  José Bacelar Almeida, Manuel Barbosa, Gilles Barthe, François Dupressoir, and Michael Emmi. Verifying ConstantTime Implementations. In USENIX Security'16, pages 5370. Usenix Association, August 2016. 
[ABK16]  Shaull Almagor, Udi Boker, and Orna Kupferman. Formally Reasoning about Quality. Journal of the ACM 63(3):24:124:56. ACM Press, September 2016. 
[AGK16]  S. Akshay, Paul Gastin, and Shankara Narayanan Krishna. Analyzing Timed Systems Using Tree Automata. In CONCUR'16, Leibniz International Proceedings in Informatics 59, pages 27:127:14. LeibnizZentrum für Informatik, August 2016. 
[AHK16]  Guy Avni, Thomas A. Henzinger, and Orna Kupferman. Dynamic Resource Allocation Games. In SAGT'16, Lecture Notes in Computer Science 9928, pages 153166. SpringerVerlag, September 2016. 
[AJK16]  Simon Außerlechner, Swen Jacobs, and Ayrat Khalimov. Tight Cutoffs for Guarded Protocols with Fairness. In VMCAI'16, Lecture Notes in Computer Science 9583, pages 476494. SpringerVerlag, January 2016. 
[AK16]  Shaull Almagor and Orna Kupferman. HighQuality Synthesis Against Stochastic Environments. In CSL'16, Leibniz International Proceedings in Informatics 62, pages 28:128:17. LeibnizZentrum für Informatik, September 2016. 
[AMM+16]  Benjamin Aminof, Vadim Malvone, Aniello Murano, and Sasha Rubin. Graded Strategy Logic: Reasoning about Uniqueness of Nash Equilibria. In AAMAS'16, pages 698706. International Foundation for Autonomous Agents and Multiagent Systems, May 2016. 
[BO16]  Randal E. Bryant and David R. O'Hallaron. Computer Systems – A programmer's perspective. Pearson, 2016. 
[BPR+16]  Romain Brenguier, Guillermo A. Pérez, JeanFrançois Raskin, and Mathieu Sassolas. Admissibility in Quantitative Graph Games. In FSTTCS'16, Leibniz International Proceedings in Informatics, pages 42:142:14. LeibnizZentrum für Informatik, December 2016. 
[Bre16]  Romain Brenguier. Optimal Assumptions for Synthesis. In CONCUR'16, Leibniz International Proceedings in Informatics 59, pages 8:18:15. LeibnizZentrum für Informatik, August 2016. 
[CD16]  Krishnendu Chatterjee and Laurent Doyen. Computation Tree Logic for Synchronization Properties. In ICALP'16, Leibniz International Proceedings in Informatics 55, pages 98:198:14. LeibnizZentrum für Informatik, July 2016. 
[CFG+16]  Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini, and JeanFrançois Raskin. The Complexity of Rational Synthesis. In ICALP'16, Leibniz International Proceedings in Informatics 55, pages 121:1121:15. LeibnizZentrum für Informatik, July 2016. 
[DLF+16]  Alexandre DuretLutz, Alexandre Lewkowicz, Amaury Fauchille, Thibault Michaud, Étienne Renault, and Laurent Xu. Spot 2.0 – A Framework for LTL and ωAutomata Manipulation. In ATVA'16, Lecture Notes in Computer Science 9938, pages 122129. SpringerVerlag, October 2016. 
[EGL+16]  Javier Esparza, Pierre Ganty, Jérôme Leroux, and Rupak Majumdar. Model checking Population Protocols. In FSTTCS'16, Leibniz International Proceedings in Informatics, pages 27:127:14. LeibnizZentrum für Informatik, December 2016. 
[FJM+16]  Yliès Falcone, Thierry Jéron, Hervé Marchand, and Srinivas Pinisetty. Runtime enforcement of regular timed properties by suppressing and delaying events. Science of Computer Programming 123:241. Elsevier, July 2016. 
[HK16]  Loïc Hélouët and Karim Kecir. Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics. In PETRI NETS'16, Lecture Notes in Computer Science 9698, pages 155175. SpringerVerlag, June 2016. 
[HST+16]  Frédéric Herbreteau, B. Srivathsan, ThanhTung Tran, and Igor Walukiewicz. Why liveness for timed automata is hard, and what we can do about it. In FSTTCS'16, Leibniz International Proceedings in Informatics, pages 48:148:14. LeibnizZentrum für Informatik, December 2016. 
[HSW16]  Frédéric Herbreteau, B. Srivathsan, and Igor Walukiewicz. Efficient emptiness check for timed Büchi automata. Information and Computation 251:6790. Elsevier, December 2016. 
[JKP16]  Wojciech Jamroga,
Beata Konikowska, and
Wojciech Penczek.
MultiValued Verification of Strategic Ability.
In AAMAS'16,
pages 11801189.
International Foundation for Autonomous Agents and
Multiagent Systems, May 2016.

[KMP16]  Shankara Narayanan Krishna, Khushraj Madnani, and Paritosh K. Pandya. Metric Temporal Logic with Counting. In FoSSaCS'16, Lecture Notes in Computer Science 9634, pages 335352. SpringerVerlag, April 2016. 
[KPV16]  Orna Kupferman, Giuseppe Perelli, and Moshe Y. Vardi. Synthesis with rational environments. Annals of Mathematics and Artificial Intelligence 78(1):320. Kluwer Academic, September 2016. 
[LR16]  Anthony W. Lin and Philipp Rümmer. Liveness of Randomised Parameterised Systems under Arbitrary Schedulers. In CAV'16, Lecture Notes in Computer Science 9779, pages 112133. SpringerVerlag, July 2016. 
[PPT+16]  Srinivas Pinisetty, Viorel Preoteasa, Stavros Tripakis, Thierry Jéron, Yliès Falcone, and Hervé Marchand. Predictive Runtime Enforcement. In SAC'16, pages 16281633. ACM Press, April 2016. 
[PS16]  Nicolas Perrin and Philipp SchlehuberCaissier. Fast diffeomorphic matching to learn globally asymptotically stable nonlinear dynamical systems. Systems & Control Letters 96:5159. Elsevier, October 2016. 
[Rei16]  Julien Reichert. On The Complexity of Counter Reachability Games. Fundamenta Informaticae 143(34):415436. IOS Press, 2016. 
[Sch16]  Sylvain Schmitz. Complexity Hierarchies Beyond Elementary. ACM Transactions on Computation Theory 8(1):3:13:36. ACM Press, February 2016. 
[Van16]  Marie Van den Bogaard. Motifs de flot d'information dans les jeux à information imparfaite. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, December 2016. 
Search
Displayed 36 resultsList of authors
 1
 2
 1
 1
 1
 1
 1
 1
 1
 4
 2
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 2
 1
 1
 1
 2
 1
 1
 1
 1
 1
 1
 2
 2
 1
 1
 1
 1
 1
 1
 1
 2
 4
 1
 1
 1
 1
 1
 1
 1
 1
 2
 9
 1
 1
 1
 1
 1
 1
 1
 1
 2
 1
 1
 1
 2
 1
 1
 1
 1
 1
 1
 1
 1
 2
 2
 1
 1
 1
 1
 2
 1