1995 | |
---|---|
[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.
|
[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.
|
[AJ95] | Carme Àlvarez et
Birgit Jenner.
On adaptive DLOGTIME and POLYLOGTIME reductions.
Theoretical Computer Science 148(2):183-205. Elsevier, septembre 1995.
|
[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.
|
[And95] | Henrik Reif Andersen. Partial Model-Checking (Extended Abstract). In LICS'95, pages 398-407. IEEE Comp. Soc. Press, juin 1995. |
[BL95] | Ahmed Bouajjani et
Yassine Lakhnech.
Temporal Logic + Timed Automata: Expressiveness and
Decidability.
In CONCUR'95,
Lecture Notes in Computer Science 962, pages 531-545. Springer-Verlag, août 1995.
|
[BM95] | Michael S. Branicky et
Sanjoy K. Mitter.
Algorithms for Optimal Hybrid Control.
In CDC'95,
pages 2661-2666.
IEEE Comp. Soc. Press, décembre 1995.
|
[BS95] | Patrick Blackburn et
Jerry Seligman.
Hybrid Languages.
Journal of Logic, Language and Information 4(3):251-272. Kluwer Academic, 1995.
|
[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.
|
[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.
|
[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.
|
[CY95] | Costas Courcoubetis et Mihalis Yannakakis. The Complexity of Probabilistic Verification. Journal of the ACM 42(4):857-907. ACM Press, juillet 1995. |
[DR95] | Volker Diekert et
Grzegorz Rozenberg.
The Book of Traces.
World Scientific, 1995.
|
[DY95] | Conrado Daws et
Sergio Yovine.
Two examples of verification of multirate timed
automata with Kronos.
In RTSS'95,
pages 66-75.
IEEE Comp. Soc. Press, décembre 1995.
|
[EF95] | Heinz-Dieter Ebbinghaus et
Jörg Flum.
Finite Model Theory.
Springer-Verlag, 1995.
|
[FGK95] | Jürgen Frößl,
Joachim Gerlach et
Thomas Kropf.
Symbolic Model Checking for Real-Time Circuits and
Specifications.
In TAU'95.
ACM Press, novembre 1995.
|
[FHM+95] | Ronald Fagin,
Joseph Y. Halpern,
Yoram Moses et
Moshe Y. Vardi.
Knowledge-Based Programs.
In PODC'95,
pages 153-163.
ACM Press, août 1995.
|
[FT95] | Martin Farach et
Mikkel Thorup.
String Matching in Lempel-Ziv Compressed
Strings.
In STOC'95,
pages 703-712.
ACM Press, mai 1995.
|
[GHR95] | Raymond Greenlaw, H. James Hoover et Walter L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, 1995. |
[GLS95] | Jens Christian Godskesen,
Kim Guldstrand Larsen et
Arne Skou.
Automatic verification of real-tim systems using
epsilon.
In PSTV'94,
IFIP Conference Proceedings 1, pages 323-330. Chapman & Hall, 1995.
|
[Got95] | Georg Gottlob.
NP Trees and Carnap's Modal Logic.
Journal of the ACM 42(2):421-457. ACM Press, mars 1995.
|
[HHW95] | Thomas A. Henzinger, Pei-Hsin Ho et Howard Wong-Toi. A User Guide to HyTech. In TACAS'95, Lecture Notes in Computer Science 1019, pages 41-71. Springer-Verlag, mai 1995. |
[HKP+95] | Thomas A. Henzinger,
Peter W. Kopke,
Anuj Puri et
Pravin Varaiya.
What is decidable about Hybrid Automata?.
In STOC'95,
pages 373-382.
ACM Press, mai 1995.
|
[HKW95] | Thomas A. Henzinger,
Peter W. Kopke et
Howard Wong-Toi.
The expressive power of clocks.
In ICALP'95,
Lecture Notes in Computer Science 944, pages 417-428. Springer-Verlag, juillet 1995.
|
[JW95] | David Janin et
Igor Walukiewicz.
Automata for the Modal μ-Calculus and
Related Results.
In MFCS'95,
Lecture Notes in Computer Science 969, pages 552-562. Springer-Verlag, août 1995.
|
[KP95] | Yonit Kesten et
Amir Pnueli.
A Complete Proof Systems for QPTL.
In LICS'95,
pages 2-12.
IEEE Comp. Soc. Press, juin 1995.
|
[KP95] | Orna Kupferman et Amir Pnueli. Once and For All. In LICS'95, pages 25-35. IEEE Comp. Soc. Press, juin 1995. |
[Kup95] | Orna Kupferman. Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions. In CAV'95, Lecture Notes in Computer Science 939, pages 325-338. Springer-Verlag, juillet 1995. |
[Kup95] | Orna Kupferman.
Model Checking for Branching-Time Temporal Logics.
PhD thesis,
Israel Institute of Technology, Haifa, Israel,
1995.
|
[Lar95] | François Laroussinie.
About the Expressive Power of CTL Combinators.
Information Processing Letters 54(6):343-345. Elsevier, juin 1995.
|
[LLW95] | François Laroussinie, Kim Guldstrand Larsen et Carsten Weise. From Timed Automata to Logic – and Back. In MFCS'95, Lecture Notes in Computer Science 969, pages 529-539. Springer-Verlag, août 1995. |
[LS95] | François Laroussinie et
Philippe Schnoebelen.
A Hierarchy of Temporal Logics with Past.
Theoretical Computer Science 148(2):303-324. Elsevier, septembre 1995.
|
[MPS95] | Oded Maler,
Amir Pnueli et
Joseph Sifakis.
On the Synthesis of Discrete Controllers for Timed
Systems (An Extended Abstract).
In STACS'95,
Lecture Notes in Computer Science 900, pages 229-242. Springer-Verlag, mars 1995.
|
[MR95] | Rajeev Motwani et Prabhakar Raghavan. Randomized algorithms. Cambridge University Press, 1995. |
[MS95] | David E. Muller et Paul E. Schupp. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra. Theoretical Computer Science 141(1-2):69-107. Elsevier, avril 1995. |
[NTS95] | Noam Nisan et
Amnon Ta-Shma.
Symmetric LOGSPACE is Closed Under Complement.
In STOC'95,
pages 140-146.
ACM Press, mai 1995.
|
[PP95] | Dominique Perrin et
Jean-Éric Pin.
Semigroups and Automata on Infinite Words.
In John B. Fountain et
Victoria Gould (eds.),
NATO Advanced Study Institute: Semigroups, Formal
Languages and Groups.
Kluwer Academic, 1995.
|
[RN95] | Stuart J. Russell et Peter Norvig. Artificial Intelligence – A modern approach. Prentice Hall, 1995. |
[RR95] | Olivier F. Roux et
Vlad Rusu.
Deciding time-bounded properties for ELECTRE
reactive programs with stopwatch automata.
In HSCC'94,
Lecture Notes in Computer Science 999, pages 405-416. Springer-Verlag, 1995.
|
[SSL+95] | Meera Sampath, Raja Sengupta, Stéphane Lafortune, Kasim Sinnamohideen et Demosthenis Teneketzis. Diagnosability of discrete-event systems. IEEE Transactions on Automatic Control 40(9):1555-1575. IEEE Comp. Soc. Press, septembre 1995. |
[Sti95] | Colin Stirling.
Local Model Checking Games (Extended Abstract).
In CONCUR'95,
Lecture Notes in Computer Science 962, pages 1-11. Springer-Verlag, août 1995.
|
[Tho95] | Wolfgang Thomas. On the Synthesis of Strategies in Infinite Games. In STACS'95, Lecture Notes in Computer Science 900, pages 1-13. Springer-Verlag, mars 1995. |
[Var95] | Moshe Y. Vardi.
Alternating Automata and Program Verification.
In Jan van Leeuwen (eds.),
Computer Science Today: Recent Trends and
Developments,
Lecture Notes in Computer Science 1000, pages 471-485. Springer-Verlag, 1995.
|
[YPD95] | Wang Yi,
Paul Pettersson et
Mats Daniels.
Automatic verification of real-time communicating
systems by constraint-solving.
In FORTE'94,
IFIP Conference Proceedings 6, pages 243-258. Chapman & Hall, 1995.
|
Sélectionner
45 correspondances trouvéesListe des auteurs
- 1
- 2
- 1
- 2
- 1
- 1
- 1
- 2
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 2
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 3
- 1
- 1
- 1
- 3
- 2
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 5
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 2
- 2
- 1
- 2
- 1