A | |
---|---|
[dA99] | Luca de Alfaro. Computing minimum and maximum reachability times in probabilistic systems. In CONCUR'99, Lecture Notes in Computer Science 1664, pages 66-81. Springer-Verlag, août 1999. |
[dA03] | Luca de Alfaro. Quantitative Verification and Control via the Mu-Calculus. In CONCUR'03, Lecture Notes in Computer Science 2761, pages 102-126. Springer-Verlag, août 2003. |
[AAB00] | Aurore Annichini,
Eugene Asarin et
Ahmed Bouajjani.
Symbolic Techniques for Parametric Reasoning about
Counter and Clock Systems.
In CAV'00,
Lecture Notes in Computer Science 1855, pages 419-434. Springer-Verlag, juillet 2000.
|
[AAB23] | Shaull Almagor, Daniel Assa et Udi Boker. Synchronized CTL over One-Counter Automata. In FSTTCS'23, Leibniz International Proceedings in Informatics 284, pages 19:1-19:22. Leibniz-Zentrum für Informatik, décembre 2023. |
[AAD+06] | Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer et René Peralta. Computation in Networks of Passively Mobile Finite-State Sensors. Distributed Computing 18(4):235-253. Springer-Verlag, mars 2006. |
[AAE05] | Baruch Awerbuch, Yossi Azar et Amir Epstein. The price of routing unsplittable flow. In STOC'05, pages 57-66. ACM Press, mai 2005. |
[AAE+07] | Dana Angluin, James Aspnes, David Eisenstat et Eric Ruppert. The computational power of population protocols. Distributed Computing 20(4):279-304. Springer-Verlag, mars 2007. |
[AAG+15] | Manindra Agrawal, S. Akshay, Blaise Genest et P. S. Thiagarajan. Approximate Verification of the Symbolic Dynamics of Markov Chains. Journal of the ACM 62(1):183-235. ACM Press, février 2015. |
[AAM06] | Yasmina Abdeddaïm, Eugene Asarin et Oded Maler. Scheduling with timed automata. Theoretical Computer Science 354(2):272-300. Elsevier, mars 2006. |
[AB01] | Carlos Areces et
Patrick Blackburn.
Bringing them all Together.
Journal of Logic and Computation 11(5):657-669. Oxford University Press, octobre 2001.
|
[AB01] | Eugene Asarin et Ahmed Bouajjani. Perturbed Turing machines and hybrid systems. In LICS'01, pages 269-278. IEEE Comp. Soc. Press, juin 2001. |
[AB09] | Sanjeev Arora et Boaz Barak. Computational Complexity: A Modern Approach. Cambridge University Press, 2009. |
[ABB+16] | José Bacelar Almeida, Manuel Barbosa, Gilles Barthe, François Dupressoir et Michael Emmi. Verifying Constant-Time Implementations. In USENIX Security'16, pages 53-70. Usenix Association, août 2016. |
[ABB+03] | Luca Aceto, Patricia Bouyer, Augusto Burgueño et Kim Guldstrand Larsen. The Power of Reachability Testing for Timed Automata. Theoretical Computer Science 300(1-3):411-475. Elsevier, mai 2003. |
[ABD+17] | Ernst Althaus, Björn Beber, Werner Damm, Stefan Disch, Willem Hagemann, Astrid Rakow, Christoph Scholl, Uwe Waldmann et Boris Wirtz. Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement. Science of Computer Programming 148:123-160. Elsevier, novembre 2017. |
[ABE00] | Parosh Aziz Abdulla, Per Bjesse et Niklas Eén. Symbolic Reachability Analysis based on SAT Solvers. In TACAS'00, Lecture Notes in Computer Science 1785, pages 411-425. Springer-Verlag, mars 2000. |
[ABF94] | Amihood Amir,
Gary Benson et
Martin Farach.
Let Sleeping Files Lie: Pattern Matching in
Z-Comporessed Files.
In SODA'94,
pages 705-714.
ACM Press, janvier 1994.
|
[ABG15] | C. Aiswarya, Benedikt Bollig et Paul Gastin. An automata-theoretic approach to the verification of distributed algorithms. In CONCUR'15, Leibniz International Proceedings in Informatics 42, pages 340-353. Leibniz-Zentrum für Informatik, septembre 2015. |
[ABG+08] | S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund et K. Narayan Kumar. Distributed Timed Automata with Independently Evolving Clocks. In CONCUR'08, Lecture Notes in Computer Science 5201, pages 82-97. Springer-Verlag, août 2008. |
[ABK13] | Shaull Almagor,
Udi Boker et
Orna Kupferman.
Formalizing and Reasoning about Quality.
In ICALP'13,
Lecture Notes in Computer Science 7966, pages 15-27. Springer-Verlag, juillet 2013.
|
[ABK14] | Shaull Almagor, Udi Boker et Orna Kupferman. Discounting in LTL. In TACAS'14, Lecture Notes in Computer Science 8413, pages 424-439. Springer-Verlag, avril 2014. |
[ABK16] | Shaull Almagor, Udi Boker et Orna Kupferman. Formally Reasoning about Quality. Journal of the ACM 63(3):24:1-24:56. ACM Press, septembre 2016. |
[ABK+97] | Eugene Asarin,
Marius Bozga,
Alain Kerbrat,
Oded Maler,
Amir Pnueli et
Anne Rasse.
Data-Structures for the Verification of Timed
Automata.
In HART'97,
Lecture Notes in Computer Science 1201, pages 346-360. Springer-Verlag, mars 1997.
|
[ABK+03] | Roy Armoni,
Doron Bustan,
Orna Kupferman et
Moshe Y. Vardi.
Resets vs. Aborts in Linear Temporal Logic.
In TACAS'03,
Lecture Notes in Computer Science 2619, pages 65-80. Springer-Verlag, avril 2003.
|
[ABM99] | Carlos Areces,
Patrick Blackburn et
Maarten Marx.
A Road-Map on Complexity for Hybrid Logics.
In CSL'99,
Lecture Notes in Computer Science 1862, pages 307-321. Springer-Verlag, septembre 1999.
|
[ABM00] | Carlos Areces,
Patrick Blackburn et
Maarten Marx.
The Computational Complexity of Hybrid Temporal
Logics.
Logic Journal of the IGPL 8(5):653-679. Oxford University Press, septembre 2000.
|
[ABM04] | Rajeev Alur, Mikhail Bernadsky et Parthasarathy Madhusudan. Optimal Reachability for Weighted Timed Games. In ICALP'04, Lecture Notes in Computer Science, pages 122-133. Springer-Verlag, 2004. |
[ABO97] | Eric Allender,
Robert Beals et
Mitsunori Ogihara.
The Complexity of Matrix Rank and Feasible Systems
of Linear Equations.
Technical Report 97-40, Rutgers University, New Jersey, USA, septembre 1997.
|
[Abr79] | Karl Abrahamson. Modal Logic of Concurrent Nondeterministic Programs. In SCC'79, Lecture Notes in Computer Science 70, pages 21-33. Springer-Verlag, juillet 1979. |
[AC02] | Jean-Pierre Aubin et
Francine Catté.
Bilateral Fixed-point and Algebraic Properties of
Viability Kernels and Capture Basins of Sets.
Technical Report 02-10, CeReMaDe, Université Paris 9, Paris, France, avril 2002.
|
[ACD93] | Rajeev Alur,
Costas Courcoubetis et
David L. Dill.
Model-Checking in Dense Real-Time.
Information and Computation 104(1):2-34. Academic Press, mai 1993.
|
[ACD+92] | Rajeev Alur,
Costas Courcoubetis,
David L. Dill,
Nicolas Halbwachs et
Howard Wong-Toi.
An Implementation of three algorithms for timing
verification based on automata emptiness.
In RTSS'92,
pages 157-166.
IEEE Comp. Soc. Press, décembre 1992.
|
[ACH94] | Rajeev Alur, Costas Courcoubetis et Thomas A. Henzinger. The Observational Power of Clocks. In CONCUR'94, Lecture Notes in Computer Science 836, pages 162-177. Springer-Verlag, août 1994. |
[ACH97] | Rajeev Alur,
Costas Courcoubetis et
Thomas A. Henzinger.
Computing Accumulated Delays in Real Time Systems.
Formal Methods in System Design 11(2):137-155. Kluwer Academic, août 1997.
|
[ACH+93] | Rajeev Alur,
Costas Courcoubetis,
Thomas A. Henzinger et
Pei-Hsin Ho.
Hybrid Automata: An Algorithmic Approach to the
Specification and Verification of Hybrid Systems.
In HSCC'92,
Lecture Notes in Computer Science 736, pages 209-229. Springer-Verlag, 1993.
|
[ACH+95] | Rajeev Alur,
Costas Courcoubetis,
Nicolas Halbwachs,
Thomas A. Henzinger,
Pei-Hsin Ho,
Xavier Nicollin,
Alfredo Olivero,
Joseph Sifakis et
Sergio Yovine.
The Algorithmic Analysis of Hybrid Systems.
Theoretical Computer Science 138(1):3-34. Elsevier, 1995.
|
[ACJ+96] | Parosh Aziz Abdulla,
Kārlis Čerāns,
Bengt Jonsson et
Yih-Kuen Tsay.
General Decidability Theorems for Infinite-State
Systems.
In LICS'96,
pages 313-321.
IEEE Comp. Soc. Press, juillet 1996.
|
[ACM97] | Eugene Asarin,
Paul Caspi et
Oded Maler.
A Kleene Theorem for Timed Automata.
In LICS'97,
pages 160-171.
IEEE Comp. Soc. Press, juin 1997.
|
[ACS10] | Tesnim Abdellatif, Jacques Combaz et Joseph Sifakis. Model-based implementation of real-time applications. In EMSOFT'10, pages 229-238. ACM Press, octobre 2010. |
[ACZ+20] | Jie An, Mingshuai Chen, Bohua Zhan, Naijun Zhan et Miaomiao Zhang. Learning One-Clock Timed Automata. In TACAS'20 (Part I), Lecture Notes in Computer Science 12078, pages 444-462. Springer-Verlag, avril 2020. |
[AD89] | André Arnold et
Anne Dicky.
An Algebraic Characterization of Transition System
Equivalences.
Information and Computation 82(2):198-229. Academic Press, août 1989.
|
[AD90] | Rajeev Alur et David L. Dill. Automata For Modeling Real-Time Systems. In ICALP'90, Lecture Notes in Computer Science 443, pages 322-335. Springer-Verlag, juillet 1990. |
[AD94] | Rajeev Alur et David L. Dill. A Theory of Timed Automata. Theoretical Computer Science 126(2):183-235. Elsevier, avril 1994. |
[AD09] | Timos Antonopoulos et
Anuj Dawar.
Separating Graph Logic from MSO.
In FoSSaCS'09,
Lecture Notes in Computer Science 5504, pages 63-77. Springer-Verlag, mars 2009.
|
[ADK+04] | Elliot Anshelevich, Anirban Dasgupta, Jon Kleinberg, Éva Tardos, Tom Wexler et Tim Roughgarden. The Price of Stability for Network Design with Fair Cost Allocation. In FOCS'04, pages 295-304. IEEE Comp. Soc. Press, octobre 2004. |
[ADK+08] | Elliot Anshelevich, Anirban Dasgupta, Jon Kleinberg, Éva Tardos, Tom Wexler et Tim Roughgarden. The Price of Stability for Network Design with Fair Cost Allocation. SIAM Journal on Computing 38(4):1602-1623. Society for Industrial and Applied Math., 2008. |
[ADM04] | Parosh Aziz Abdulla, Johann Deneux et Pritha Mahata. Multi-clock timed networks. In LICS'04, pages 345-354. IEEE Comp. Soc. Press, juillet 2004. |
[ADM+09] | Rajeev Alur, Aldric Degorre, Oded Maler et Gera Weiss. On Omega-Languages Defined by Mean-Payoff Conditions. In FoSSaCS'09, Lecture Notes in Computer Science 5504. Springer-Verlag, mars 2009. |
[ADO+05] | Parosh Aziz Abdulla,
Johann Deneux,
Joël Ouaknine et
James Worrell.
Decidability and Complexity Results for Timed
Automata via Channel Machines.
In ICALP'05,
Lecture Notes in Computer Science 3580, pages 1089-1101. Springer-Verlag, juillet 2005.
|
[AEL+01] | Rajeev Alur,
Kousha Etessami,
Salvatore La Torre et
Doron A. Peled.
Parametric Temporal Logic for "Model Measuring".
ACM Transactions on Computational Logic 2(3):388-407. ACM Press, juillet 2001.
|
[AFF+02] | Roy Armoni,
Limor Fix,
Alon Flaisher,
Rob Gerth,
Boris Ginsburg,
Tomer Kanza,
Avner Landver,
Sela Mador-Haim,
Eli Singerman,
Andreas Tiemeyer,
Moshe Y. Vardi et
Yael Zbar.
The ForSpec Temporal Logic: A New Temporal
Property-Specification Language.
In TACAS'02,
Lecture Notes in Computer Science 2280, pages 296-311. Springer-Verlag, avril 2002.
|
[AFF+03] | Roy Armoni, Limor Fix, Alon Flaisher, Orna Grumberg, Nir Piterman, Andreas Tiemeyer et Moshe Y. Vardi. Enhanced Vacuity Detection in Linear Temporal Logic. In CAV'03, Lecture Notes in Computer Science 2725, pages 368-380. Springer-Verlag, juillet 2003. |
[AFH91] | Rajeev Alur,
Tómas Feder et
Thomas A. Henzinger.
The Benefits of Relaxing Punctuality.
In PODC'91,
pages 139-152.
ACM Press, août 1991.
|
[AFH94] | Rajeev Alur,
Limor Fix et
Thomas A. Henzinger.
Event-Clock Automata: A Determinizable Class of
Timed Automata.
In CAV'94,
Lecture Notes in Computer Science 818, pages 1-13. Springer-Verlag, juin 1994.
|
[AFH96] | Rajeev Alur, Tómas Feder et Thomas A. Henzinger. The Benefits of Relaxing Punctuality. Journal of the ACM 43(1):116-146. ACM Press, janvier 1996. |
[AFH99] | Rajeev Alur, Limor Fix et Thomas A. Henzinger. Event-Clock Automata: A Determinizable Class of Timed Automata. Theoretical Computer Science 211(1-2):253-273. Elsevier, janvier 1999. |
[dAF+03] | Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar et Mariëlle Stoelinga. The Element of Surprise in Timed Games. In CONCUR'03, Lecture Notes in Computer Science 2761, pages 142-156. Springer-Verlag, août 2003. |
[dAF+05] | Luca de Alfaro,
Marco Faella,
Thomas A. Henzinger,
Rupak Majumdar et
Mariëlle Stoelinga.
Model checking discounted temporal properties.
Theoretical Computer Science 345(1):139-170. Elsevier, novembre 2005.
|
[AFM+02] | Tobias Amnell,
Elena Fersman,
Leonid Mokrushin,
Paul Pettersson et
Wang Yi.
TIMES – A Tool for Modelling and Implementation of
Embedded Systems.
In TACAS'02,
Lecture Notes in Computer Science 2280, pages 460-464. Springer-Verlag, avril 2002.
|
[AG00] | Carme Àlvarez et Raymond Greenlaw. A Compendium of Problems Complete for Symmetric Logarithmic Space. Computational Complexity 9(2):123-145. Birkhäuser, 2000. |
[AG11] | Krzysztof Apt et Erich Grädel. Lectures in Game Theory for Computer Scientists. Cambridge University Press, 2011. |
[AGG08] | Xavier Allamigeon,
Stéphane Gaubert et
Éric Goubault.
Inferring Min and Max Invariants Using Max-Plus
Polyhedra.
In SAS'08,
Lecture Notes in Computer Science 5079, pages 189-204. Springer-Verlag, juillet 2008.
|
[AGJ07] | Thomas Ågotnes, Valentin Goranko et Wojciech Jamroga. Alternating-time Temporal Logics with Irrevocable Strategies. In TARK'07, pages 15-24. Juin 2007. |
[AGJ08] | Thomas Ågotnes,
Valentin Goranko et
Wojciech Jamroga.
Strategic Commitment and Release in Logics for
Multi-Agent Systems (Extended abstract).
Technical Report 08-01, Clausthal University of Technology, Germany, 2008.
|
[AGK16] | S. Akshay, Paul Gastin et Shankara Narayanan Krishna. Analyzing Timed Systems Using Tree Automata. In CONCUR'16, Leibniz International Proceedings in Informatics 59, pages 27:1-27:14. Leibniz-Zentrum für Informatik, août 2016. |
[AGK17] | Guy Avni, Shibashis Guha et Orna Kupferman. Timed Network Games. In MFCS'17, Leibniz International Proceedings in Informatics 84, pages 37:1-37:16. Leibniz-Zentrum für Informatik, août 2017. |
[AGK18] | Guy Avni, Shibashis Guha et Orna Kupferman. Timed Network Games with Clocks. In MFCS'18, Leibniz International Proceedings in Informatics 117, pages 23:1-23:18. Leibniz-Zentrum für Informatik, août 2018. |
[AGK+17] | S. Akshay, Paul Gastin, Shankara Narayanan Krishna et Ilias Sarkar. Towards an Efficient Tree Automata Based Technique for Timed Systems. In CONCUR'17, Leibniz International Proceedings in Informatics 85, pages 39:1-39:15. Leibniz-Zentrum für Informatik, septembre 2017. |
[AGP+99] | Karine Altisen,
Gregor Gößler,
Amir Pnueli,
Joseph Sifakis,
Stavros Tripakis et
Sergio Yovine.
A Framework for Scheduler Synthesis.
In RTSS'99,
pages 154-163.
IEEE Comp. Soc. Press, décembre 1999.
|
[AGS00] | Karine Altisen,
Gregor Gößler et
Joseph Sifakis.
A Methodology for the Construction of Scheduled
Systems.
In FTRTFT'00,
Lecture Notes in Computer Science 1926, pages 106-120. Springer-Verlag, septembre 2000.
|
[AH89] | Rajeev Alur et
Thomas A. Henzinger.
A Really Temporal Logic.
In FOCS'89,
pages 164-169.
IEEE Comp. Soc. Press, octobre 1989.
|
[AH92] | Rajeev Alur et
Thomas A. Henzinger.
Logics and Models of Real Time: A Survey.
In REX'91,
Lecture Notes in Computer Science 600, pages 74-106. Springer-Verlag, 1992.
|
[AH92] | Rajeev Alur et
Thomas A. Henzinger.
Back to the Future: Towards a Theory of Timed
Regular Languages.
In FOCS'92,
pages 177-186.
IEEE Comp. Soc. Press, octobre 1992.
|
[AH93] | Rajeev Alur et
Thomas A. Henzinger.
Real-time Logics: Complexity and Expressiveness.
Information and Computation 104(1):35-77. Academic Press, mai 1993.
|
[AH94] | Rajeev Alur et Thomas A. Henzinger. A Really Temporal Logic. Journal of the ACM 41(1):181-203. ACM Press, janvier 1994. |
[dAH00] | Luca de Alfaro et Thomas A. Henzinger. Concurrent Omera-Regular Games. In LICS'00, pages 141-154. IEEE Comp. Soc. Press, juin 2000. |
[dAH01] | Luca de Alfaro et
Thomas A. Henzinger.
Interface automata.
In FSE'01,
pages 109-120.
ACM Press, septembre 2001.
|
[AH02] | Henrik Reif Andersen et Henrik Hulgaard. Boolean Expression Diagrams. Information and Computation 179(2):194-212. Academic Press, décembre 2002. |
[AHH96] | Rajeev Alur,
Thomas A. Henzinger et
Pei-Hsin Ho.
Automatic Symbolic Verification of Embedded Systems.
IEEE Transactions on Software Engineering 22(3):181-201. IEEE Comp. Soc. Press, mars 1996.
|
[AHK97] | Rajeev Alur,
Thomas A. Henzinger et
Orna Kupferman.
Alternating-time Temporal Logic.
In FOCS'97,
pages 100-109.
IEEE Comp. Soc. Press, octobre 1997.
|
[AHK98] | Rajeev Alur,
Thomas A. Henzinger et
Orna Kupferman.
Alternating-time Temporal Logic.
In COMPOS'97,
Lecture Notes in Computer Science 1536, pages 23-60. Springer-Verlag, 1998.
|
[dAH+98] | Luca de Alfaro, Thomas A. Henzinger et Orna Kupferman. Concurrent Reachability Games. In FOCS'98, pages 564-575. IEEE Comp. Soc. Press, novembre 1998. |
[AHK02] | Rajeev Alur, Thomas A. Henzinger et Orna Kupferman. Alternating-time Temporal Logic. Journal of the ACM 49(5):672-713. ACM Press, septembre 2002. |
[dAH+07] | Luca de Alfaro, Thomas A. Henzinger et Orna Kupferman. Concurrent Reachability Games. Theoretical Computer Science 386(3):188-217. Elsevier, novembre 2007. |
[AHK16] | Guy Avni, Thomas A. Henzinger et Orna Kupferman. Dynamic Resource Allocation Games. In SAGT'16, Lecture Notes in Computer Science 9928, pages 153-166. Springer-Verlag, septembre 2016. |
[AHK20] | Guy Avni, Thomas A. Henzinger et Orna Kupferman. Dynamic Resource Allocation Games. Theoretical Computer Science 807:42-55. Elsevier, février 2020. |
[AHK+98] | Rajeev Alur,
Thomas A. Henzinger,
Orna Kupferman et
Moshe Y. Vardi.
Alternating Refinement Relations.
In CONCUR'98,
Lecture Notes in Computer Science 1466, pages 163-178. Springer-Verlag, septembre 1998.
|
[dAH+00] | Luca de Alfaro,
Thomas A. Henzinger et
Freddy Y. C. Mang.
The Control of Synchronous Systems.
In CONCUR'00,
Lecture Notes in Computer Science 1877, pages 458-473. Springer-Verlag, août 2000.
|
[dAH+01] | Luca de Alfaro,
Thomas A. Henzinger et
Freddy Y. C. Mang.
The Control of Synchronous Systems, Part II.
In CONCUR'01,
Lecture Notes in Computer Science 2154, pages 566-582. Springer-Verlag, août 2001.
|
[dAH+01] | Luca de Alfaro,
Thomas A. Henzinger et
Rupak Majumdar.
Symbolic Algorithms for Infinite-State Games.
In CONCUR'01,
Lecture Notes in Computer Science 2154, pages 536-550. Springer-Verlag, août 2001.
|
[dAH+01] | Luca de Alfaro,
Thomas A. Henzinger et
Rupak Majumdar.
From Verification to Control: Dynamic Programs for
Omega-Regular Objectives.
In LICS'01,
pages 279-290.
IEEE Comp. Soc. Press, juin 2001.
|
[AHM+98] | Rajeev Alur,
Thomas A. Henzinger,
Freddy Y. C. Mang,
Shaz Qadeer,
Sriram Rajamani et
Serdar Taşiran.
MOCHA: Modularity in Model Checking.
In CAV'98,
Lecture Notes in Computer Science 1427, pages 521-525. Springer-Verlag, juin 1998.
|
[AHR00] | Myla Archer, Constance L. Heitmeyer et Elvinia Riccobene. Using TAME to prove invariants of automata models: Two case studies. In FMSP'00, pages 25-36. ACM Press, août 2000. |
[AHV93] | Rajeev Alur,
Thomas A. Henzinger et
Moshe Y. Vardi.
Parametric Real-Time Reasoning.
In STOC'93,
pages 592-601.
ACM Press, 1993.
|
[AI01] | Micah Adler et
Neil Immerman.
An n! Lower Bound On Formula Size.
In LICS'01,
pages 197-206.
IEEE Comp. Soc. Press, juin 2001.
|
[AI03] | Micah Adler et Neil Immerman. An n! Lower Bound On Formula Size. ACM Transactions on Computational Logic 4(3):296-314. ACM Press, juillet 2003. |
[AIK+95] | Rajeev Alur,
Alon Itai,
Robert P. Kurshan et
Mihalis Yannakakis.
Timing Verification by Successive Approximation.
Information and Computation 118(1):142-157. Academic Press, avril 1995.
|
[AIP+00] | Luca Aceto, Anna Ingólfsdóttir, Mikkel Lykke Pedersen et Jan Poulsen. Characteristic Formulae for Timed Automata. RAIRO – Theoretical Informatics and Applications 34(6):565-584. EDP Sciences, 2000. |
[AJ95] | Carme Àlvarez et
Birgit Jenner.
On adaptive DLOGTIME and POLYLOGTIME reductions.
Theoretical Computer Science 148(2):183-205. Elsevier, septembre 1995.
|
[AJ96] | Parosh Aziz Abdulla et Bengt Jonsson. Verifying Programs with Unreliable Channels. Information and Computation 127(2):91-101. Academic Press, juin 1996. |
[AJ99] | Parosh Aziz Abdulla et
Bengt Jonsson.
On the Existence of Network Invariants for Verifying
Parameterized Systems.
In Correct System Design, Recent Insight and Advances,
Lecture Notes in Computer Science 1710, pages 180-197. Springer-Verlag, 1999.
|
[AJ03] | Parosh Aziz Abdulla et Bengt Jonsson. Model checking of systems with many identical timed processes. Theoretical Computer Science 290(1):241-264. Elsevier, janvier 2003. |
[AJK16] | Simon Außerlechner, Swen Jacobs et Ayrat Khalimov. Tight Cutoffs for Guarded Protocols with Fairness. In VMCAI'16, Lecture Notes in Computer Science 9583, pages 476-494. Springer-Verlag, janvier 2016. |
[AJK+14] | Benjamin Aminof, Swen Jacobs, Ayrat Khalimov et Sasha Rubin. Parametrized Model Checking of Token-Passing Systems. In VMCAI'14, Lecture Notes in Computer Science 8318, pages 262-281. Springer-Verlag, janvier 2014. |
[AJN+04] | Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson et Mayank Saksena. A Survey of Regular Model Checking. In CONCUR'04, Lecture Notes in Computer Science 3170, pages 35-48. Springer-Verlag, août 2004. |
[AK86] | Krzysztof Apt et Dexter C. Kozen. Limits for automatic verification of finite-state concurrent systems. Information Processing Letters 22(6):307-309. Elsevier, mai 1986. |
[AK16] | Shaull Almagor et Orna Kupferman. High-Quality Synthesis Against Stochastic Environments. In CSL'16, Leibniz International Proceedings in Informatics 62, pages 28:1-28:17. Leibniz-Zentrum für Informatik, septembre 2016. |
[AKK15] | Shaull Almagor, Denis Kuperberg et Orna Kupferman. The Sensing Cost of Monitoring and Synthesis. In FSTTCS'15, Leibniz International Proceedings in Informatics 45, pages 380-393. Leibniz-Zentrum für Informatik, décembre 2015. |
[AKM03] | Yasmina Abdeddaïm,
Abdelkarim Kerbaa et
Oded Maler.
Task Graph Scheduling Using Timed Automata.
In IPDPS'03,
pages 237.
IEEE Comp. Soc. Press, avril 2003.
|
[AKP18] | Shaull Almagor, Orna Kupferman et Giuseppe Perelli. Synthesis of Controllable Nash Equilibria in Quantitative Objective Games. In IJCAI'18, pages 35-41. IJCAI organization, juillet 2018. |
[AKR+14] | Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni et Helmut Veith. Parameterized Model Checking of Rendezvous Systems. In CONCUR'14, Lecture Notes in Computer Science 8704, pages 109-124. Springer-Verlag, septembre 2014. |
[AKR+17] | Shaull Almagor, Orna Kupferman, Jan Oliver Ringert et Yaron Velner. Quantitative Assume Guarantee Synthesis. In CAV'17, Lecture Notes in Computer Science 10427, pages 353-374. Springer-Verlag, juillet 2017. |
[AKV98] | Rajeev Alur,
Robert P. Kurshan et
Mahesh Viswanathan.
Membership Question for Timed and Hybrid Automata.
In RTSS'98,
pages 254-263.
IEEE Comp. Soc. Press, décembre 1998.
|
[AKY10] | Parosh Aziz Abdulla, Pavel Krčál et Wang Yi. Sampled Semantics of Timed Automata. Logical Methods in Computer Science 6(3). Septembre 2010. |
[AL92] | Martín Abadi et Leslie Lamport. An old-fashioned recipe for real time. In REX'91, Lecture Notes in Computer Science 600, pages 1-27. Springer-Verlag, 1992. |
[AL02] | Luca Aceto et François Laroussinie. Is your Model Checker on Time?. Journal of Logic and Algebraic Programming 52-53:3-51. Elsevier, juin 2002. |
[AL04] | Rajeev Alur et
Salvatore La Torre.
Deterministic Generators and Games for LTL
Fragments.
ACM Transactions on Computational Logic 5(1):297-322. ACM Press, janvier 2004.
|
[All89] | Eric Allender.
P-Uniform Circuit Complexity.
Journal of the ACM 36(4):912-928. ACM Press, octobre 1989.
|
[All97] | Eric Allender.
Making Computation Count: Arithmetic Circuits in the
Nineties.
SIGACT News 28(4):2-15. ACM Press, décembre 1997.
|
[ALM03] | Rajeev Alur,
Salvatore La Torre et
Parthasarathy Madhusudan.
Playing Games with Boxes and Diamonds.
In CONCUR'03,
Lecture Notes in Computer Science 2761, pages 127-141. Springer-Verlag, août 2003.
|
[ALM05] | Rajeev Alur, Salvatore La Torre et Parthasarathy Madhusudan. Perturbed Timed Automata. In HSCC'05, Lecture Notes in Computer Science 3414, pages 70-85. Springer-Verlag, mars 2005. |
[ALM20] | Étienne André, Didier Lime et Nicolas Markey. Language-preservation problems in parametric timed automata. Logical Methods in Computer Science 16(1). Janvier 2020. |
[ALN+10] | Natasha Alechina,
Brian Logan,
Nguyen Hoang Nga et
Abdur Rakib.
Resource-bounded alternating-time temporal logic.
In AAMAS'10,
pages 481-488.
International Foundation for Autonomous Agents and
Multiagent Systems, mai 2010.
|
[ALP01] | Rajeev Alur, Salvatore La Torre et George J. Pappas. Optimal paths in weighted timed automata. In HSCC'01, Lecture Notes in Computer Science 2034, pages 49-62. Springer-Verlag, mars 2001. |
[ALP04] | Rajeev Alur, Salvatore La Torre et George J. Pappas. Optimal paths in weighted timed automata. Theoretical Computer Science 318(3):297-322. Elsevier, juin 2004. |
[ALR98] | Eric Allender,
Michael C. Loui et
Kenneth W. Regan.
Complexity Classes.
In Mikhail J. Atallah (eds.),
Handbook of Algorithms and Theory of Computation.
CRC Press, novembre 1998.
|
[ALR98] | Eric Allender,
Michael C. Loui et
Kenneth W. Regan.
Reducibility and Completeness.
In Mikhail J. Atallah (eds.),
Handbook of Algorithms and Theory of Computation.
CRC Press, novembre 1998.
|
[ALR98] | Eric Allender,
Michael C. Loui et
Kenneth W. Regan.
Other Complexity Classes and Measures.
In Mikhail J. Atallah (eds.),
Handbook of Algorithms and Theory of Computation.
CRC Press, novembre 1998.
|
[Alu91] | Rajeev Alur. Techniques for Automatic Verification of Real-Time Systems. PhD thesis, Stanford University, 1991. |
[Alu99] | Rajeev Alur. Timed Automata. In CAV'99, Lecture Notes in Computer Science 1633, pages 8-22. Springer-Verlag, juillet 1999. |
[ALV01] | Roberto Amadio,
Denis Lugiez et
Vincent Vanackère.
On the Symbolic Reduction of Processes with
Cryptographic Functions.
Technical Report 4147, INRIA, mars 2001.
|
[ALW89] | Martín Abadi, Leslie Lamport et Pierre Wolper. Realizable and Unrealizable Specifications of Reactive Systems. In ICALP'89, Lecture Notes in Computer Science 372, pages 1-17. Springer-Verlag, juillet 1989. |
[AM99] | Eugene Asarin et Oded Maler. As Soon as Possible: Time Optimal Control for Timed Automata. In HSCC'99, Lecture Notes in Computer Science 1569, pages 19-30. Springer-Verlag, mars 1999. |
[AM01] | Yasmina Abdeddaïm et
Oded Maler.
Job-Shop Scheduling Using Timed Automata.
In CAV'01,
Lecture Notes in Computer Science 2102, pages 478-492. Springer-Verlag, juillet 2001.
|
[AM02] | Yasmina Abdeddaïm et
Oded Maler.
Preemptive Job-Shop Scheduling using Stopwatch
Automata.
In TACAS'02,
Lecture Notes in Computer Science 2280, pages 113-126. Springer-Verlag, avril 2002.
|
[AM04] | Rajeev Alur et
Parthasarathy Madhusudan.
Decision Problems for Timed Automata: A Survey.
In SFM-RT'04,
Lecture Notes in Computer Science 3185, pages 1-24. Springer-Verlag, septembre 2004.
|
[AM15] | Étienne André et Nicolas Markey. Language Preservation Problems in Parametric Timed Automata. In FORMATS'15, Lecture Notes in Computer Science 9268, pages 27-43. Springer-Verlag, septembre 2015. |
[AMM+16] | Benjamin Aminof, Vadim Malvone, Aniello Murano et Sasha Rubin. Graded Strategy Logic: Reasoning about Uniqueness of Nash Equilibria. In AAMAS'16, pages 698-706. International Foundation for Autonomous Agents and Multiagent Systems, mai 2016. |
[AMM+18] | Benjamin Aminof, Vadim Malvone, Aniello Murano et Sasha Rubin. Graded modalities in Strategy Logic. Information and Computation 261(4):634-649. Elsevier, août 2018. |
[AMP95] | Eugene Asarin,
Oded Maler et
Amir Pnueli.
Reachability Analysis of Dynamical Systems Having
Piecewise-Constant Derivatives.
Theoretical Computer Science 138(1):35-65. Elsevier, 1995.
|
[AMP95] | Eugene Asarin,
Oded Maler et
Amir Pnueli.
Symbolic Controller Synthesis for Discrete and Timed
Systems.
In HSCC'94,
Lecture Notes in Computer Science 999, pages 1-20. Springer-Verlag, 1995.
|
[AMP98] | Eugene Asarin, Oded Maler et Amir Pnueli. On Discretization of Delays in Timed Automata and Digital Circuits. In CONCUR'98, Lecture Notes in Computer Science 1466, pages 470-484. Springer-Verlag, septembre 1998. |
[AMP+20] | Gal Amram,
Shahar Maoz,
Or Pistiner et
Jan Oliver Ringert.
Energy μ-Calculus: Symbolic Fixed-Point
Algorithms for ω-Regular Energy Games.
Technical Report 2005.00641, arXiv, mai 2020.
|
[AMP+98] | Eugene Asarin, Oded Maler, Amir Pnueli et Joseph Sifakis. Controller Synthesis for Timed Automata. In SSC'98, pages 469-474. Elsevier, juillet 1998. |
[AMR+05] | Karine Altisen, Nicolas Markey, Pierre-Alain Reynier et Stavros Tripakis. Implémentabilité des automates temporisés. In MSR'05, pages 395-406. Hermès, octobre 2005. |
[AN80] | André Arnold et
Maurice Nivat.
The metric space of infinite trees. Algebraic and
topological properties.
Fundamenta Informaticae 3(4):445-476. IOS Press, 1980.
|
[AN01] | André Arnold et
Damian Niwiński.
Complete lattices and fixed-point theorems.
In Rudiments of μ-calculus,
Studies in Logic and the Foundations of Mathematics 146, pages 1-39. North-Holland, 2001.
|
[And95] | Henrik Reif Andersen. Partial Model-Checking (Extended Abstract). In LICS'95, pages 398-407. IEEE Comp. Soc. Press, juin 1995. |
[And06] | Daniel Andersson.
An improved algorithm for discounted payoff games.
In Proceedings of the 11th ESSLLI Student
Session,
pages 91-98.
Août 2006.
|
[Ang80] | Dana Angluin.
On Counting Problems and the Polynomial Hierarchy.
Theoretical Computer Science 12:161-173. Elsevier, 1980.
|
[Ang87] | Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation 75(2):87-106. Academic Press, novembre 1987. |
[AO96] | Eric Allender et
Mitsunori Ogihara.
Relationships Among PL, #;L, and the
Determinant.
RAIRO – Theoretical Informatics and Applications 30(1):1-21. EDP Sciences, 1996.
|
[AP06] | Horacio Arló-Costa et Eric Pacuit. First-Order Classical Modal Logic. Studia Logica 84(2):171-210. Kluwer Academic, novembre 2006. |
[APT79] | Bengt Aspvall,
Michael F. Plass et
Robert Endre Tarjan.
A Linear-Time Algorithm for Testing the Truth of
Certain Quantified Boolean Formulas.
Information Processing Letters 8(3):121-123. Elsevier, mars 1979. erratum as \citeipl14(4)-APT.
|
[APT82] | Bengt Aspvall,
Michael F. Plass et
Robert Endre Tarjan.
Erratum (A Linear-Time Algorithm for Testing the
Truth of Certain Quantified Boolean Formulas).
Information Processing Letters 14(4):195. Elsevier, juin 1982.
|
[AR14] | Benjamin Aminof et Sasha Rubin. First Cycle Games. In SR'14, Electronic Proceedings in Theoretical Computer Science 146, pages 83-90. Mars 2014. |
[ARZ15] | Benjamin Aminof, Sasha Rubin et Florian Zuleger. On the Expressive Power of Communication Primitives in Parameterised Systems. In LPAR'15, Lecture Notes in Computer Science 9450, pages 313-328. Springer-Verlag, novembre 2015. |
[AS89] | Bowen Alpern et
Fred B. Schneider.
Verifying Temporal Properties without Temporal
Logic.
ACM Transactions on Programming Languages and
Systems 11(1):147-167. ACM Press, janvier 1989.
|
[AS02] | Eugene Asarin et
Gerardo Schneider.
Widening the Boundary between Decidable and
Undecidable Hybrid Systems.
In CONCUR'02,
Lecture Notes in Computer Science 2421, pages 193-208. Springer-Verlag, août 2002.
|
[AS04] | Robert Airapetyan et
Thorsten Schneider.
Protecting Applications with Petri Nets.
The Code Breaker's Journal 1(1).
2004.
|
[Asp02] | James Aspnes. Fast deterministic consensus in a noisy environment. Journal of Algorithms 45(1):16-39. Elsevier, octobre 2002. |
[ASS+00] | Adnan Aziz, Kumud Sanwal, Vigyan Singhal et Robert K. Brayton. Model-checking continous-time Markov chains. ACM Transactions on Computational Logic 1(1):162-170. ACM Press, juillet 2000. |
[ASY01] | Eugene Asarin,
Gerardo Schneider et
Sergio Yovine.
On the Decidability of the Reachability Problem for
Planar Differential Inclusions.
In HSCC'01,
Lecture Notes in Computer Science 2034, pages 89-104. Springer-Verlag, mars 2001.
|
[ASY07] | Eugene Asarin,
Gerardo Schneider et
Sergio Yovine.
Algorithmic analysis of polygonal hybrid systems,
part I: Reachability.
Theoretical Computer Science 379(1-2):231-265. Elsevier, juin 2007.
|
[AT96] | Rajeev Alur et
Gadi Taubenfeld.
Fast Timing-based Algorithms.
Distributed Computing 10:1-10. Springer-Verlag, 1996.
|
[AT02] | Karine Altisen et
Stavros Tripakis.
Tools for Controller Synthesis of Timed Systems.
In RT-TOOLS'02.
Août 2002.
|
[AT05] | Karine Altisen et
Stavros Tripakis.
Implementation of Timed Automata: An Issue of
Semantics or Modeling?.
In FORMATS'05,
Lecture Notes in Computer Science 3829, pages 273-288. Springer-Verlag, septembre 2005.
|
[AT17] | Rajeev Alur et Stavros Tripakis. Automatic Synthesis of Distributed Protocols. SIGACT News 48(1):55-90. ACM Press, mars 2017. |
[Ats02] | Albert Atserias.
Unsatisfiable Random Formulas are Hard to Certify.
In LICS'02,
pages 325-334.
IEEE Comp. Soc. Press, juillet 2002.
|
[AVW03] | André Arnold,
Aymeric Vincent et
Igor Walukiewicz.
Games for Synthesis of Controllers with Partial
Observation.
Theoretical Computer Science 303(1):7-34. Elsevier, juin 2003.
|
[AZZ+21] | Jie An, Bohua Zhan, Naijun Zhan et Miaomiao Zhang. Learning nondeterministic real-time automata. ACM Transactions on Embedded Computing Systems 20(5s):99:1-99:26. ACM Press, octobre 2021. |
Sélectionner
171 correspondances trouvéesListe des auteurs
- 2
- 2
- 1
- 2
- 4
- 1
- 9
- 1
- 3
- 2
- 1
- 1
- 1
- 4
- 1
- 1
- 7
- 8
- 1
- 1
- 1
- 5
- 39
- 1
- 6
- 1
- 1
- 1
- 2
- 2
- 1
- 2
- 4
- 1
- 2
- 1
- 2
- 1
- 3
- 1
- 3
- 4
- 1
- 13
- 3
- 2
- 1
- 1
- 1
- 1
- 4
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 4
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 6
- 1
- 2
- 1
- 12
- 1
- 2
- 1
- 1
- 4
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 2
- 1
- 1
- 4
- 2
- 2
- 4
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 2
- 1
- 2
- 1
- 32
- 3
- 1
- 2
- 1
- 1
- 2
- 2
- 1
- 5
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 2
- 1
- 18
- 2
- 6
- 2
- 1
- 1
- 1
- 1
- 1
- 3
- 1
- 4
- 1
- 1
- 4
- 12
- 2
- 3
- 1
- 3
- 2
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 6
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 1
- 1
- 2
- 2
- 6
- 1
- 1
- 1
- 1
- 1
- 3
- 1
- 1
- 5
- 1
- 1
- 1
- 2
- 1
- 2
- 2
- 1
- 1
- 2
- 5
- 1
- 1
- 5
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 2
- 4
- 1
- 2
- 2
- 2
- 1