C | |
---|---|
[tC06] | Balder ten Cate.
Expressivity of Second Order Propositional Modal
Logic.
Journal of Philosophical Logic 35(2):209-223. Springer-Verlag, septembre 2006.
|
[Cac03] | Thierry Cachat. Games on Pushdown Graphs and Extensions. Thèse de doctorat, RWTH Aachen, Germany, Décembre 2003. |
[Cac06] | Thierry Cachat.
Tree Automata Make Ordinal Theory Easy.
In FSTTCS'06,
Lecture Notes in Computer Science 4337, pages 285-296. Springer-Verlag, décembre 2006.
|
[CdA+06] | Krishnendu Chatterjee, Luca de Alfaro et Thomas A. Henzinger. The Complexity of Quantitative Concurrent Parity Games. In SODA'06, pages 678-687. Society for Industrial and Applied Math., janvier 2006. |
[CdA+06] | Krishnendu Chatterjee, Luca de Alfaro et Thomas A. Henzinger. Strategy Improvement for Concurrent Reachability Games. In QEST'06, pages 291-300. IEEE Comp. Soc. Press, septembre 2006. |
[CdA+03] | Arindam Chakrabarti, Luca de Alfaro, Thomas A. Henzinger et Mariëlle Stoelinga. Resource Interfaces. In EMSOFT'03, Lecture Notes in Computer Science 2855, pages 117-133. Springer-Verlag, octobre 2003. |
[Cai03] | Benoît Caillaud.
Project-Team S4.
Activity Report, IRISA, Rennes, France, 2003.
|
[CAM+04] | Scott Cotton,
Eugene Asarin,
Oded Maler et
Peter Niebert.
Some Progress in Satisfiability Checking for
Difference Logic.
In FORMATS-FTRTFT'04,
Lecture Notes in Computer Science 3253, pages 263-276. Springer-Verlag, septembre 2004.
|
[Cas87] | Ilaria Castellani.
Bisimulations and abstraction homomorphisms.
Journal of Computer and System Sciences 34(2-3):210-235. Academic Press, avril 1987.
|
[Cas09] | Franck Cassez. A note on fault diagnosis algorithms. In CDC'09, pages 6941-6946. IEEE Comp. Soc. Press, décembre 2009. |
[CB13] | Franck Cassez et Jean-Luc Béchennec. Timing Analysis of Binary Programs with UPPAAL. In ACSD'13, pages 41-50. IEEE Comp. Soc. Press, juillet 2013. |
[CBC13] | Christophe Chareton, Julien Brunel et David Chemouil. Towards an Updatable Strategy Logic. In SR'13, Electronic Proceedings in Theoretical Computer Science 112, pages 91-98. Mars 2013. |
[CBK+13] | Maximilien Colange, Souheib Baarir, Fabrice Kordon et Yann Thierry-Mieg. Towards Distributed Software Model-Checking using Decision Diagrams. In CAV'13, Lecture Notes in Computer Science 8044, pages 830-845. Springer-Verlag, juillet 2013. |
[CC77] | Patrick Cousot et Radhia Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In POPL'77, pages 238-252. ACM Press, janvier 1977. |
[CC79] | Patrick Cousot et
Radhia Cousot.
Constructive Versions of Tarski's Fixed Point
Theorems.
Pacific Journal of Mathematics 82(1):43-57. 1979.
|
[CC94] | Sérgio Vale Aguiar Campos et
Edmund M. Clarke.
Real-Time Symbolic Model Checking for Discrete Time
Models.
Technical Report CMU-CS-94-146, Computer Science Deparment, Carnegie Mellon
University, Pittsburgh, Pennsylvania, USA, mai 1994.
|
[CC95] | Sérgio Vale Aguiar Campos et
Edmund M. Clarke.
Real-time symbolic model checking for discrete time
models.
In Teodor Rus et
Charles Rattray (eds.),
Real-time symbolic model checking for discrete time
models,
AMAST Series in Computing 2, pages 129-145. World Scientific, janvier 1995.
|
[CC99] | Sérgio Vale Aguiar Campos et Edmund M. Clarke. Analysis and verification of real-time systems using quantitative symbolic algorithms. International Journal on Software Tools for Technology Transfer 2(3):260-269. Springer-Verlag, novembre 1999. |
[CC00] | Hubert Comon et
Véronique Cortier.
Flatness is not Weakness.
In CSL'00,
Lecture Notes in Computer Science 1862, pages 262-276. Springer-Verlag, août 2000.
|
[CC01] | Sérgio Vale Aguiar Campos et
Edmund M. Clarke.
The Verus Language: Representing Time Efficiently
with BDDs.
Theoretical Computer Science 253(1):95-118. Elsevier, février 2001.
|
[CC02] | Cristian S. Calude et
Elena Calude.
The Bridge Crossing Problem.
EATCS Bulletin 77:180-190. EATCS, juin 2002.
|
[CCG+02] | Alessandro Cimatti,
Edmund M. Clarke,
Enrico Giunchiglia,
Fausto Giunchiglia,
Marco Pistore,
Marco Roveri,
Roberto Sebastiani et
Armando Tacchella.
NuSMV2: An OpenSource Tool for Symbolic Model
Checking.
In CAV'02,
Lecture Notes in Computer Science 2404, pages 359-364. Springer-Verlag, juillet 2002.
|
[CCG+99] | Alessandro Cimatti,
Edmund M. Clarke,
Fausto Giunchiglia et
Marco Roveri.
NuSMV: A New Symbolic Model Verifier.
In CAV'99,
Lecture Notes in Computer Science 1633, pages 495-499. Springer-Verlag, juillet 1999.
|
[CCG+00] | Alessandro Cimatti,
Edmund M. Clarke,
Fausto Giunchiglia et
Marco Roveri.
NuSMV: A New Symbolic Model Checker.
International Journal on Software Tools for
Technology Transfer 2(4):410-425. Springer-Verlag, mars 2000.
|
[CCJ06] | Franck Cassez, Thomas Chatain et Claude Jard. Symbolic Unfoldings for Networks of Timed Automata. In ATVA'06, Lecture Notes in Computer Science 4218, pages 307-321. Springer-Verlag, octobre 2006. |
[CCM+95] | Sérgio Vale Aguiar Campos,
Edmund M. Clarke,
Wilfredo R. Marrero et
Marius Minea.
Verifying the performance of the PCI local bus using
symbolic techniques.
In ICCD'95,
pages 72-78.
IEEE Comp. Soc. Press, octobre 1995.
|
[CCM+94] | Sérgio Vale Aguiar Campos,
Edmund M. Clarke,
Wilfredo R. Marrero,
Marius Minea et
Hiromi Hiraishi.
Computing Quantitative Characteristics of
Finite-State Real-Time Systems.
Technical Report CMU-CS-94-147, Computer Science Deparment, Carnegie Mellon
University, Pittsburgh, Pennsylvania, USA, mai 1994.
|
[CCM+20] | Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos et Marco Scarsini. When is selfish routing bad? The price of anarchy in light and heavy traffic. Operations Research 68(2):411-434. Informs, avril 2020. |
[CD88] | Edmund M. Clarke et
I. A. Draghicescu.
Expressibility Results for Linear-Time and
Branching-Time Logics.
In REX'88,
Lecture Notes in Computer Science 354, pages 428-437. Springer-Verlag, mai 1988.
|
[CD10] | Krishnendu Chatterjee et Laurent Doyen. Energy Parity Games. In ICALP'10, Lecture Notes in Computer Science 6199, pages 599-610. Springer-Verlag, juillet 2010. |
[CD12] | Krishnendu Chatterjee et Laurent Doyen. Energy Parity Games. Theoretical Computer Science 458:49-60. Elsevier, novembre 2012. |
[CD16] | Krishnendu Chatterjee et Laurent Doyen. Computation Tree Logic for Synchronization Properties. In ICALP'16, Leibniz International Proceedings in Informatics 55, pages 98:1-98:14. Leibniz-Zentrum für Informatik, juillet 2016. |
[CDC04] | Krishnendu Chatterjee, Pallab Dasgupta et P. P. Chakrabarti. The power of first-order quantification over states in branching and linear time temporal logics. Information Processing Letters 91(5):201-210. Elsevier, septembre 2004. |
[CDF+05] | Franck Cassez, Alexandre David, Emmanuel Fleury, Kim Guldstrand Larsen et Didier Lime. Efficient On-the-fly Algorithms for the Analysis of Timed Games. In CONCUR'05, Lecture Notes in Computer Science 3653, pages 66-80. Springer-Verlag, août 2005. |
[CDF+14] | Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot et Jean-François Raskin. Doomsday Equilibria for Omega-Regular Games. In VMCAI'14, Lecture Notes in Computer Science 8318, pages 78-97. Springer-Verlag, janvier 2014. |
[CDF+14] | Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot et Jean-François Raskin. Doomsday Equilibria for Omega-Regular Games. In VMCAI'14, Lecture Notes in Computer Science 8318, pages 78-97. Springer-Verlag, janvier 2014. |
[CDH08] | Krishnendu Chatterjee, Laurent Doyen et Thomas A. Henzinger. Quantitative Languages. In CSL'08, Lecture Notes in Computer Science 5213, pages 385-400. Springer-Verlag, septembre 2008. |
[CDH10] | Krishnendu Chatterjee, Laurent Doyen et Thomas A. Henzinger. Quantitative Languages. ACM Transactions on Computational Logic 11(4). ACM Press, juillet 2010. |
[CDH17] | Krishnendu Chatterjee, Laurent Doyen et Thomas A. Henzinger. The Cost of Exactness in Quantitative Reachability. In Models, Algorithms, Logics and Tools: Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday, Lecture Notes in Computer Science 10460, pages 367-381. Springer-Verlag, août 2017. |
[CDH+06] | Krishnendu Chatterjee,
Laurent Doyen,
Thomas A. Henzinger et
Jean-François Raskin.
Algorithms for Omega-Regular Games with Imperfect
Information.
In CSL'06,
Lecture Notes in Computer Science 4207, pages 287-302. Springer-Verlag, septembre 2006.
|
[CDH+10] | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger et Jean-François Raskin. Generalized Mean-payoff and Energy Games. In FSTTCS'10, Leibniz International Proceedings in Informatics 8, pages 505-516. Leibniz-Zentrum für Informatik, décembre 2010. |
[CDL+07] | Franck Cassez, Alexandre David, Kim Guldstrand Larsen, Didier Lime et Jean-François Raskin. Timed Control with Observation Based and Stuttering Invariant Strategies. In ATVA'07, Lecture Notes in Computer Science 4762, pages 192-206. Springer-Verlag, octobre 2007. |
[CDM12] | Franck Cassez, Jérémy Dubreil et Hervé Marchand. Synthesis of opaque systems with static and dynamic masks. Formal Methods in System Design 40(1):88-115. Springer-Verlag, février 2012. |
[CDR+13] | Krishnendu Chatterjee,
Laurent Doyen,
Mickael Randour et
Jean-François Raskin.
Looking at Mean-Payoff and Total-Payoff through
Windows.
In ATVA'13,
Lecture Notes in Computer Science 8172, pages 118-132. Springer-Verlag, octobre 2013.
|
[CDR+15] | Krishnendu Chatterjee, Laurent Doyen, Mickael Randour et Jean-François Raskin. Looking at Mean-Payoff and Total-Payoff through Windows. Information and Computation 242:25-52. Elsevier, juin 2015. |
[CDS23] | Roberto Cominetti, Valerio Dose et Marco Scarsini. The price of anarchy in routing games as a function of the demand. Mathematical Programming. 2023. À paraître. |
[CDV02] | Diego Calvanese,
Giuseppe De Giacomo et
Moshe Y. Vardi.
Reasoning about Actions and Planning in LTL Action
Theories.
In KR'02,
pages 593-602.
Morgan Kaufmann Publishers, avril 2002.
|
[CE80] | Edmund M. Clarke et
E. Allen Emerson.
Characterizing properties of parallel programs as
fixpoints.
In ICALP'80,
Lecture Notes in Computer Science 85, pages 169-181. Springer-Verlag, juillet 1980.
|
[CE82] | Edmund M. Clarke et E. Allen Emerson. Design and Synthesis of Synchronization Skeletons using Branching-Time Temporal Logic. In LOP'81, Lecture Notes in Computer Science 131, pages 52-71. Springer-Verlag, 1982. |
[CE11] | Bruno Courcelle et Joost Engelfriet. Graph Structure and Monadic Second-Order Logic, a Language Theoretic Approach. Cambridge University Press, 2011. |
[CEJ+98] | Edmund M. Clarke, E. Allen Emerson, Somesh Jha et A. Prasad Sistla. Symmetry Reductions in Model Checking. In CAV'98, Lecture Notes in Computer Science 1427, pages 147-158. Springer-Verlag, juin 1998. |
[Cer64] | Ján Černý. Poznámka k homogénnym experimentom s konečnými automatmi. Matematicko-fyzikálny časopis 14(3):208-216. 1964. |
[Cer93] | Kārlis Čerāns. Decidability of Bisimulation Equivalences for Parallel Timer Processes. In CAV'92, Lecture Notes in Computer Science 663, pages 302-315. Springer-Verlag, 1993. |
[CER93] | Bruno Courcelle, Joost Engelfriet et Grzegorz Rozenberg. Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences 46(2). Academic Press, avril 1993. |
[Cer14] | Petr Čermák. A Model Checker for Strategy Logic. Master's thesis, Dept. of Computing, Imperial College London, UK, Juin 2014. |
[CES83] | Edmund M. Clarke,
E. Allen Emerson et
A. Prasad Sistla.
Automatic Verification of Finite-State Concurrent
Systems using Temporal Logic Specifications: A
Practical Approach.
In POPL'83,
pages 117-126.
ACM Press, janvier 1983.
|
[CES86] | Edmund M. Clarke, E. Allen Emerson et A. Prasad Sistla. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems 8(2):244-263. ACM Press, avril 1986. |
[CES09] | Edmund M. Clarke, E. Allen Emerson et Joseph Sifakis. Model checking: algorithmic verification and debugging. Communications of the ACM 52(11):74-84. ACM Press, novembre 2009. |
[CFG+16] | Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini et Jean-François Raskin. The Complexity of Rational Synthesis. In ICALP'16, Leibniz International Proceedings in Informatics 55, pages 121:1-121:15. Leibniz-Zentrum für Informatik, juillet 2016. |
[CFH+03] | Edmund M. Clarke, Ansgar Fehnker, Zhi Han, Bruce H. Krogh, Joël Ouaknine, Olaf Stursberg et Michael Theobald. Abstraction and Countrexample-Guided Refinement in Model Checking of Hybrid Systems. International Journal of Foundations of Computer Science 14(4):583-604. Août 2003. |
[CFK+12] | Taolue Chen, Vojtěch Forejt, Marta Kwiatkowska, David Parker et Aistis Simaitis. Automatic Verification of Competitive Stochastic Systems. In TACAS'12, Lecture Notes in Computer Science 7214, pages 315-330. Springer-Verlag, mars 2012. |
[CFK+12] | Taolue Chen, Vojtěch Forejt, Marta Kwiatkowska, Aistis Simaitis, Ashutosh Trivedi et Michael Ummels. Playing Stochastic Games Precisely. In CONCUR'12, Lecture Notes in Computer Science 7454, pages 348-363. Springer-Verlag, septembre 2012. |
[CFP+96] | Gérard Cécé,
Alain Finkel et
S. Purushothaman Iyer.
Unreliable Channels are Easier to Verify Than
Perfect Channels.
Information and Computation 124(1):20-31. Academic Press, janvier 1996.
|
[CG87] | Edmund M. Clarke et
Orna Grumberg.
Research on Automatic Verification of Finite-State
Concurrent Systems.
Annual Review of Computer Science 2:269-290. Annual Reviews Inc., 1987.
|
[CG96] | Boris V. Cherkassky et
Andrew V. Goldberg.
Negative-Cycle Detection Algorithm.
In ESA'96,
Lecture Notes in Computer Science 1136, pages 349-363. Springer-Verlag, septembre 1996.
|
[CG14] | Namit Chaturvedi et
Marcus Gelderie.
Weak ω-Regular Trace Languages.
Research Report 1402.3199, arXiv, février 2014.
|
[CGH97] | Edmund M. Clarke,
Orna Grumberg et
Kiyoharu Hamaguchi.
Another Look at LTL Model Checking.
Formal Methods in System Design 10(1):47-71. Kluwer Academic, février 1997.
|
[CGJ+00] | Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu et Helmut Veith. Counterexample-Guided Abstraction Refinement. In CAV'00, Lecture Notes in Computer Science 1855, pages 154-169. Springer-Verlag, juillet 2000. |
[CGJ+01] | Edmund M. Clarke,
Orna Grumberg,
Somesh Jha,
Yuan Lu et
Helmut Veith.
Progress on the State Explosion Problem in Model
Checking.
In Reinhard Wilhelm (eds.),
Informatics – 10 Years Back. 10 Years Ahead,
Lecture Notes in Computer Science 2000, pages 176-194. Springer-Verlag, 2001.
|
[CGJ+03] | Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu et Helmut Veith. Counterexample-Guided Abstraction Refinement for Symbolic Model Checking. Journal of the ACM 50(5):752-794. ACM Press, septembre 2003. |
[CGL93] | Kārlis Čerāns,
Jens Christian Godskesen et
Kim Guldstrand Larsen.
Timed Modal Specification - Theory and Tools.
In CAV'93,
Lecture Notes in Computer Science 697, pages 253-267. Springer-Verlag, juin 1993.
|
[CGL94] | Edmund M. Clarke,
Orna Grumberg et
David E. Long.
Model Checking.
ACM Transactions on Programming Languages and
Systems 16(5):1-45. ACM Press, septembre 1994.
|
[CGM+95] | Edmund M. Clarke,
Orna Grumberg,
Kenneth L. McMillan et
Xudong Zhao.
Efficient Generation of Counterexamples and
Witnesses in Symbolic Model Checking.
In DAC'95,
pages 427-432.
ACM Press, juin 1995.
|
[CGP00] | Edmund M. Clarke,
Orna Grumberg et
Doron A. Peled.
Model checking.
MIT Press, 2000.
|
[CGP+02] | Alessandro Cimatti,
Enrico Giunchiglia,
Marco Pistore,
Marco Roveri,
Roberto Sebastiani et
Armando Tacchella.
Integrating BDD-based and SAT-based Symbolic
Model Checking.
In FroCoS'02,
Lecture Notes in Computer Science 2309, pages 49-56. Springer-Verlag, avril 2002.
|
[CGS98] | Marco Cadoli,
Andrea Giovanardi et
Marco Schaerf.
An Algorithm to Evaluate Quantified Boolean
Formulae.
In AAAI-IAAI'98,
pages 262-267.
MIT Press, juillet 1998.
|
[CH14] | Arnaud Carayol et Matthew Hague. Regular Strategies In Pushdown Reachability Games. In RP'14, Lecture Notes in Computer Science 8762, pages 58-71. Springer-Verlag, septembre 2014. |
[Cha00] | William Chan.
Temporal-Logic Queries.
In CAV'00,
Lecture Notes in Computer Science 1855, pages 450-463. Springer-Verlag, juillet 2000.
|
[Cha07] | Krishnendu Chatterjee. Stochastic ω-regular games. PhD thesis, University of Califormia at Berkeley, USA, 2007. |
[Cha09] | Patryk Chamuczyński.
Algorithms and data structures for parametric
analysis of real time systems.
Thèse de doctorat,
University of Göttingen, Germany,
2009.
|
[Cha14] | Namit Chaturvedi. Toward a structure theory of regular infinitary trace languages. In ICALP'14, Lecture Notes in Computer Science 8573, pages 134-145. Springer-Verlag, juillet 2014. |
[Cha14] | Namit Chaturvedi. Languages of Infinite Traces and Deterministic Asynchronous Automata. Research Report AIB-2014-004, RWTH Aachen, Germany, février 2014. |
[CHJ04] | Krishnendu Chatterjee,
Thomas A. Henzinger et
Marcin Jurdziński.
Games with Secure Equilibria.
In LICS'04,
pages 160-169.
IEEE Comp. Soc. Press, juillet 2004.
|
[CHJ05] | Krishnendu Chatterjee, Thomas A. Henzinger et Marcin Jurdziński. Mean-payoff Parity Games. In LICS'05, pages 178-187. IEEE Comp. Soc. Press, juillet 2005. |
[CHJ06] | Krishnendu Chatterjee,
Thomas A. Henzinger et
Marcin Jurdziński.
Games with Secure Equilibria.
Theoretical Computer Science 365(1-2):67-82. Elsevier, novembre 2006.
|
[Cho03] | Hana Chockler.
Coverage Metrics for Model Checking.
PhD thesis,
Hebrew University, Jerusalem, Israel,
Septembre 2003.
|
[CHO+13] | Krishnendu Chatterjee,
Thomas A. Henzinger,
Jan Otop et
Andreas Pavlogiannis.
Distributed synthesis for LTL fragments.
In FMCAD'13,
pages 18-25.
IEEE Comp. Soc. Press, octobre 2013.
|
[CHP07] | Krishnendu Chatterjee,
Thomas A. Henzinger et
Nir Piterman.
Generalized Parity Games.
In FoSSaCS'07,
Lecture Notes in Computer Science 4423, pages 153-167. Springer-Verlag, mars 2007.
|
[CHP07] | Krishnendu Chatterjee, Thomas A. Henzinger et Nir Piterman. Strategy Logic. In CONCUR'07, Lecture Notes in Computer Science 4703, pages 59-73. Springer-Verlag, septembre 2007. |
[CHP08] | Krishnendu Chatterjee, Thomas A. Henzinger et Nir Piterman. Algorithms for Büchi games. Research Report 0805.2620, arXiv, mai 2008. |
[CHP10] | Krishnendu Chatterjee, Thomas A. Henzinger et Nir Piterman. Strategy Logic. Information and Computation 208(6):677-693. Elsevier, juin 2010. |
[CHP11] | Krishnendu Chatterjee, Thomas A. Henzinger et Vinayak S. Prabhu. Timed Parity Games: Complexity and Robustness. Logical Methods in Computer Science 7(4). Décembre 2011. |
[CHR02] | Franck Cassez, Thomas A. Henzinger et Jean-François Raskin. A Comparison of Control Problems for Timed and Hybrid Systems. In HSCC'02, Lecture Notes in Computer Science 2289, pages 134-148. Springer-Verlag, mars 2002. |
[CHR12] | Pavol Černý, Thomas A. Henzinger et Arjun Radhakrishna. Simulation distances. Theoretical Computer Science 413(1):21-35. Elsevier, janvier 2012. |
[CHR13] | Pavol Černý, Thomas A. Henzinger et Arjun Radhakrishna. Quantitative abstraction refinement. In POPL'13, pages 115-128. ACM Press, janvier 2013. |
[CHS11] | Arnaud Carayol, Axel Haddad et Olivier Serre. Qualitative Tree Languages. In LICS'11, pages 13-22. IEEE Comp. Soc. Press, juin 2011. |
[Chu60] | Alonzo Church.
Applications of recursive arithmetic to the problem
of circuit synthesis.
In Summaries of the Summer Institute of
Symbolic Logic – Volume 1,
pages 3-50.
Institute for Defense Analyses, 1960.
|
[Chu63] | Alonzo Church. Logic, arithmetic, and automata. In ICM'62, pages 23-35. 1963. |
[CHV+18] | Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith et Roderick Bloem. Handbook of Model Checking. Springer-Verlag, avril 2018. |
[CJ97] | Hubert Comon et
Florent Jacquemard.
Ground Reducibility is EXPTIME-Complete.
In LICS'97,
pages 26-34.
IEEE Comp. Soc. Press, juin 1997.
|
[CJ98] | Hubert Comon et Yan Jurski. Multiple counters automata, safety analysis, and Presburger arithmetic. In CAV'98, Lecture Notes in Computer Science 1427, pages 268-279. Springer-Verlag, juin 1998. |
[CJ99] | Hubert Comon et Yan Jurski. Timed Automata and the Theory of Real Numbers. Research Report LSV-99-6, Lab. Spécification & Vérification, ENS Cachan, France, juillet 1999. |
[CJ99] | Hubert Comon et Yan Jurski. Timed Automata and the Theory of Real Numbers. In CONCUR'99, Lecture Notes in Computer Science 1664, pages 242-257. Springer-Verlag, août 1999. |
[CdJ+19] | José R. Correa, Jasper de Jong, Bart de Keizer et Marc Uetz. The inefficiency of Nash and subgame-perfect equilibria for network routing. Mathematics of Operations Research 44(4):1286-1303. Informs, novembre 2019. |
[CJL+09] | Franck Cassez, Jan J. Jensen, Kim Guldstrand Larsen, Jean-François Raskin et Pierre-Alain Reynier. Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study. In HSCC'09, Lecture Notes in Computer Science 5469, pages 90-104. Springer-Verlag, avril 2009. |
[CJL+02] | Edmund M. Clarke,
Somesh Jha,
Yuan Lu et
Helmut Veith.
Tree-Like Counterexamples in Model Checking.
In LICS'02,
pages 19-29.
IEEE Comp. Soc. Press, juillet 2002.
|
[CJM+20] | Emily Clement, Thierry Jéron, Nicolas Markey et David Mentré. Computing maximally-permissive strategies in acyclic timed automata. In FORMATS'20, Lecture Notes in Computer Science 12288, pages 111-126. Springer-Verlag, septembre 2020. |
[CK05] | George Christodoulou et Elias Koutsoupias. The price of anarchy of finite congestion games. In STOC'05, pages 67-73. ACM Press, mai 2005. |
[CKL98] | Richard Castanet, Ousmane Koné et Patrice Laurençot. On-the-fly Test Generation for Real Time Protocols. In ICCCN'98, pages 378-387. IEEE Comp. Soc. Press, octobre 1998. |
[CKS81] | Ashok K. Chandra,
Dexter C. Kozen et
Larry J. Stockmeyer.
Alternation.
Journal of the ACM 28(1):114-133. ACM Press, janvier 1981.
|
[CKV01] | Hana Chockler,
Orna Kupferman et
Moshe Y. Vardi.
Coverage Metrics for Temporal Logic Model Checking.
In TACAS'01,
Lecture Notes in Computer Science 2031, pages 528-542. Springer-Verlag, avril 2001.
|
[CL00] | Franck Cassez et Kim Guldstrand Larsen. The Impressive Power of Stopwatches. In CONCUR'00, Lecture Notes in Computer Science 1877, pages 138-152. Springer-Verlag, août 2000. |
[CL02] | Rance Cleaveland et
Gerald Lüttgen.
A Logical Process Calculi.
In EXPRESS'02,
Electronic Notes in Theoretical Computer Science 68(2), pages 33-50. Elsevier, août 2002.
|
[CL03] | Thomas Colcombet et
Christof Löding.
On the Expressiveness of Deterministic transducers
over Infinite Trees.
In STACS'04,
Lecture Notes in Computer Science 2996, pages 428-439. Springer-Verlag, mars 2003.
|
[CL03] | Maxime Crochemore et
Thierry Lecrocq.
Pattern Matching and Text Compression Algorithms.
In Allen B. Tucker (eds.),
Computer Science and Engineering Handbook.
CRC Press, 2003.
|
[CL07] | Taolue Chen et Jian Lu. Probabilistic Alternating-time Temporal Logic and Model Checking Algorithm. In FSKD'07, pages 35-39. IEEE Comp. Soc. Press, août 2007. |
[CLM15] | Petr Čermák, Alessio Lomuscio et Aniello Murano. Verifying and Synthesising Multi-Agent Systems against One-Goal Strategy Logic Specifications. In AAAI'15, pages 2038-2044. AAAI Press, janvier 2015. |
[CLM+14] | Petr Čermák, Alessio Lomuscio, Fabio Mogavero et Aniello Murano. MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications. In CAV'14, Lecture Notes in Computer Science 8559, pages 525-532. Springer-Verlag, juillet 2014. |
[CLM+15] | Krishnendu Chatterjee, Stéphane Lafortune, Nicolas Markey et Wolfgang Thomas (eds.) Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061). Dagstuhl Reports 5(2):1-25. Leibniz-Zentrum für Informatik, juin 2015. |
[Clo94] | Peter Clote.
Computation Models and Function Algebras.
In LCC'94,
Lecture Notes in Computer Science 960, pages 98-130. Springer-Verlag, octobre 1994.
|
[CLP+11] | Laura Carnevali,
Giuseppe Lipari,
Alessandro Pinzuti et
Enrico Vicario.
A Formal Approach to Design and Verification of
Two-Level Hierarchical Scheduling Systems.
In ADA-EUROPE'11,
Lecture Notes in Computer Science 6652, pages 118-131. Springer-Verlag, 2011.
|
[CLS01] | Gianfranco Ciardo,
Gerald Lüttgen et
Radu Siminiceanu.
Saturation: An Efficient Iteration Strategy for
Symbolic State-Space Generation.
In TACAS'01,
Lecture Notes in Computer Science 2031, pages 328-342. Springer-Verlag, avril 2001.
|
[CM93] | Bruno Courcelle et Mohamed Mosbah. Monadic second-order evaluations on tree-decomposable graphs. Theoretical Computer Science 109(1-2):49-82. Elsevier, 1993. |
[CM97] | Stephen A. Cook et
David G. Mitchell.
Finding Hard Instances of the Satisfiability
Problem: A Survey.
In Ding-zhu Du,
Jun Gu et
Panos M. Pardalos (eds.),
Satisfiability Problem: Theory and Applications,
DIMACS Series in Discrete Mathematics and
Theoretical Computer Science 35, pages 1-17. American Mathematical Society, octobre 1997.
|
[CM02] | Marco Carbone et
Sergio Maffeis.
On the Expressive Power of Polyadic Synchronisation
in π-calculus.
In EXPRESS'02,
Electronic Notes in Theoretical Computer Science 68(2), pages 15-32. Elsevier, août 2002.
|
[CM03] | Olivier Carton et
Max Michel.
Unambiguous Büchi Automata.
Theoretical Computer Science 297(1-3):37-81. Elsevier, mars 2003.
|
[CM06] | Scott Cotton et
Oded Maler.
Fast and Flexible Difference Constraint Propagation
for DPLL(T).
In SAT'06,
Lecture Notes in Computer Science 4121, pages 170-183. Springer-Verlag, août 2006.
|
[CM08] | Franck Cassez et
Nicolas Markey.
Contrôle des systèmes temporisés.
In Olivier H. Roux et
Claude Jard (eds.),
Approches formelles des systèmes embarqués
communicants.
Hermès, octobre 2008.
|
[CM09] | Franck Cassez et
Nicolas Markey.
Control of Timed Systems.
In Claude Jard et
Olivier H. Roux (eds.),
Communicating Embedded Systems – Software and
Design.
Wiley-ISTE, octobre 2009.
|
[CMH08] | Krishnendu Chatterjee,
Rupak Majumdar et
Thomas A. Henzinger.
Controller Synthesis with Budget Constraints.
In HSCC'08,
Lecture Notes in Computer Science 4981.
Springer-Verlag, avril 2008.
|
[CMJ04] | Krishnendu Chatterjee,
Rupak Majumdar et
Marcin Jurdziński.
On Nash equilibria in stochastic games.
In CSL'04,
Lecture Notes in Computer Science 3210.
Springer-Verlag, septembre 2004.
|
[CMP04] | Ching-Tsun Chou, Phanindra K. Mannava et Seungjoon Park. A Simple Method for Parameterized Verification of Cache Coherence Protocols. In FMCAD'04, Lecture Notes in Computer Science 3312, pages 382-398. Springer-Verlag, novembre 2004. |
[CMR01] | Paul Caspi, Christine Mazuet et Natacha Reynaud-Paligot. About the design of distributed control systems: The quasi-synchronous approach. In SAFECOMP'01, Lecture Notes in Computer Science 2187, pages 215-226. Springer-Verlag, septembre 2001. |
[CMR01] | Bruno Courcelle,
Johann A. Makowsky et
Udi Rotics.
On the fixed parameter complexity of graph
enumeration problems definable in monadic
second-order logic.
Discrete Applied Mathematics 108(1-2):23-52. Elsevier, février 2001.
|
[COG98] | Rachel Cardell-Oliver et Tim Glover. A Practical and Complete Algorithm for Testing Real-Time Systems. In FTRTFT'98, Lecture Notes in Computer Science 1486, pages 251-261. Springer-Verlag, septembre 1998. |
[Col12] | Thomas Colcombet. Forms of determinism for automata. In STACS'12, Leibniz International Proceedings in Informatics 14, pages 1-23. Leibniz-Zentrum für Informatik, février 2012. |
[Coo71] | Stephen A. Cook.
The complexity of Theorem Proving Procedures.
In STOC'71,
pages 151-158.
ACM Press, 1971.
|
[Coo85] | Stephen A. Cook.
A Taxonomy of Problems with Fast Parallel
Algorithms.
Information and Control 64(1-3):2-22. Academic Press, 1985.
|
[Coo04] | Stephen A. Cook.
Theories for Complexity Classes and their
Propositional Translations.
In Jan Krajíček (eds.),
Complexity of computations and proofs,
Quaderni di Matematica 13, pages 175-227. Dipartimento di Matematica, Seconda Universitá
degli Studi di Napoli, Italy, 2004.
|
[Cou90] | Bruno Courcelle.
The Monadic Second-Order Logic of Graphs.
I: Recognizable Sets of Finite Graphs.
Information and Computation 85(1):12-75. Academic Press, mars 1990.
|
[Cou97] | Bruno Courcelle.
The expression of graph properties and graph
transformations in monadic second-order logic.
In Grzegorz Rozenberg (eds.),
Handbook of Graph Grammars.
World Scientific, 1997.
|
[Cou04] | Jean-Michel Couvreur.
A BDD-like Implementation of an Automaton Package.
In CIAA'04,
Lecture Notes in Computer Science 3317, pages 310-311. Springer-Verlag, juillet 2004.
|
[Cou04] | Jean-Michel Couvreur.
Contribution à l'algorithmique de la
vérification.
Mémoire d'habilitation,
Lab. Spécification & Vérification, ENS Cachan,
France,
Juillet 2004.
|
[Cov72] | Thomas M. Cover. Broadcast Channels. IEEE Transactions on Information Theory 18(1):2-14. IEEE Inf. Theory Soc., janvier 1972. |
[Cov98] | Thomas M. Cover. Comments on Broadcast Channels. IEEE Transactions on Information Theory 44(6):2524-2530. IEEE Inf. Theory Soc., octobre 1998. |
[CP97] | Yi-Liang Chen et Gregory Provan. Modeling and Diagnosis of Timed Discrete Event Systems – A Factory Automation Example. In ACC'97, pages 31-36. IEEE Comp. Soc. Press, juin 1997. |
[CPJ08] | Hubert Comon, Nicolas Perrin et Florent Jacquemard. Visibly Tree Automata with Memory and Constraints. Logical Methods in Computer Science 4(2). Mai 2008. |
[CPP93] | Joëlle Cohen,
Dominique Perrin et
Jean-Éric Pin.
On the Expressive Power of Temporal Logic.
Journal of Computer and System Sciences 46(3):271-294. Academic Press, juin 1993.
|
[CPR+02] | Alessandro Cimatti,
Marco Pistore,
Marco Roveri et
Roberto Sebastiani.
Improving the Encoding of LTL Model Checking into
SAT.
In VMCAI'02,
Lecture Notes in Computer Science 2294, pages 196-207. Springer-Verlag, janvier 2002.
|
[CR07] | Olivier Carton et
Chloé Rispal.
Complementation of rational sets on scattered linear
orderings of finite rank.
Theoretical Computer Science 382(2):109-119. Elsevier, août 2007.
|
[Cro86] | Maxime Crochemore.
Transducers and Repetitions.
Theoretical Computer Science 45(1):63-86. Elsevier, 1986.
|
[CRR12] | Krishnendu Chatterjee,
Mickael Randour et
Jean-François Raskin.
Strategy Synthesis for Multi-dimensional
Quantitative Objectives.
Research Report 1201.5073, arXiv, janvier 2012.
|
[CRR14] | Krishnendu Chatterjee, Mickael Randour et Jean-François Raskin. Strategy Synthesis for Multi-dimensional Quantitative Objectives. Acta Informatica 51(3-4):129-163. Springer-Verlag, juin 2014. |
[CRS01] | Franck Cassez,
Mark D. Ryan et
Pierre-Yves Schobbens.
Proving Feature Non-Interaction with
Alternating-Time Temporal Logic.
In Proceedings of the FIREworks Workshop on
Language Constructs for Describing Features,
pages 85-104.
Springer-Verlag, janvier 2001.
|
[CRV+04] | Shih-Fen Cheng, Daniel M. Reeves, Yevgeniy Vorobeychik et Michael P. Wellman. Notes on Equilibria in Symmetric Games. In GTDT'04, pages 71-78. Juin 2004. |
[CS92] | Rance Cleaveland et Bernhard Steffen. A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus. Formal Methods in System Design 2(2):121-147. Kluwer Academic, 1992. |
[CS01] | Edmund M. Clarke et Bernd-Holger Schlingloff. Model Checking. In John Alan Robinson et Andrei Voronkov (eds.), Handbook of Automated Reasoning. Elsevier and MIT Press, 2001. |
[CS03] | Maxime Crochemore et Valery T. Stefanov. Waiting time and complexity for matching patterns with automata. Information Processing Letters 87(3):119-125. Elsevier, août 2003. |
[CT06] | Thomas M. Cover et Joy A. Thomas. Elements of Information Theory. John Wiley & Sons, 2006. |
[CTL97] | Christian Collberg,
Clark Thomborson et
Douglas Low.
A Taxonomy of Obfuscating Transformations.
Technical Report 148, Department of Computer Science, University of
Auckland, New Zealand, juillet 1997.
|
[CTM+99] | Sérgio Vale Aguiar Campos,
Márcio Teixeira,
Marius Minea,
Andreas Kuehlmann et
Edmund M. Clarke.
Model Checking Semi-Continuous Time Models Using
BDDs.
In SMC'99,
Electronic Notes in Theoretical Computer Science 23(2).
Elsevier, juillet 1999.
|
[CTT+04] | Edmund M. Clarke, Muralidhar Talupur, Tayssir Touili et Helmut Veith. Verification by network decomposition. In CONCUR'04, Lecture Notes in Computer Science 3170, pages 276-291. Springer-Verlag, août 2004. |
[CTV06] | Edmund M. Clarke, Muralidhar Talupur et Helmut Veith. Environment Abstraction for Parameterized Verification. In VMCAI'06, Lecture Notes in Computer Science 3855, pages 126-141. Springer-Verlag, janvier 2006. |
[CV12] | Krishnendu Chatterjee et Yaron Velner. Mean-Payoff Pushdown Games. In LICS'12, pages 195-204. IEEE Comp. Soc. Press, juin 2012. |
[CVW+91] | Costas Courcoubetis,
Moshe Y. Vardi,
Pierre Wolper et
Mihalis Yannakakis.
Memory-Efficient Algorithms for the Verification of
Temporal Properties.
In CAV'90,
Lecture Notes in Computer Science 531, pages 233-242. Springer-Verlag, 1991.
|
[CY92] | Costas Courcoubetis et Mihalis Yannakakis. Minimum and Maximum Delay Problems in Real-Time Systems. Formal Methods in System Design 1(4):385-415. Kluwer Academic, décembre 1992. |
[CY95] | Costas Courcoubetis et Mihalis Yannakakis. The Complexity of Probabilistic Verification. Journal of the ACM 42(4):857-907. ACM Press, juillet 1995. |
Sélectionner
167 correspondances trouvéesListe des auteurs
- 2
- 3
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 7
- 2
- 1
- 1
- 1
- 2
- 1
- 12
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 31
- 3
- 1
- 3
- 1
- 1
- 1
- 2
- 1
- 1
- 2
- 1
- 5
- 31
- 2
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 2
- 6
- 1
- 4
- 1
- 1
- 2
- 6
- 3
- 2
- 2
- 2
- 3
- 3
- 1
- 2
- 3
- 1
- 1
- 1
- 1
- 12
- 1
- 1
- 6
- 2
- 1
- 3
- 1
- 1
- 2
- 1
- 1
- 1
- 2
- 3
- 1
- 1
- 1
- 8
- 1
- 1
- 1
- 1
- 22
- 1
- 1
- 2
- 1
- 1
- 5
- 4
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 2
- 1
- 5
- 1
- 1
- 2
- 1
- 2
- 1
- 1
- 1
- 4
- 1
- 2
- 1
- 2
- 1
- 1
- 4
- 2
- 1
- 1
- 1
- 1
- 1
- 3
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 4
- 1
- 1
- 1
- 2
- 4
- 12
- 1
- 1
- 1
- 1
- 1
- 5
- 1
- 1
- 2
- 1
- 1
- 1
- 3
- 1
- 1
- 2
- 1
- 3
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 7
- 1
- 1
- 1
- 1
- 1
- 3
- 1