The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Danièle Beauquier: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Danièle Beauquier, Maurice Nivat
    Tiling the Plane with One Tile. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:128-138 [Conf]
  2. Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko
    A Logic of Probability with Decidable Model-Checking. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:306-321 [Conf]
  3. Danièle Beauquier
    Muller automata and bi-infinite words. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:36-43 [Conf]
  4. Danièle Beauquier, Anatol Slissenko
    Decidable Classes of the Verification Problem in a Timed Predicate Logic. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:100-111 [Conf]
  5. Danièle Beauquier, Maurice Nivat, Damian Niwinski
    About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Büchi Conditions. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:136-145 [Conf]
  6. Danièle Beauquier
    Pumping Lemmas for Timed Automata. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 1998, pp:81-94 [Conf]
  7. Danièle Beauquier
    Thin Homogeneous Sets of Factors. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:239-251 [Conf]
  8. Danièle Beauquier
    Minimal Automaton of a Rational Cover. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:174-189 [Conf]
  9. Danièle Beauquier, Maurice Nivat
    About Rational Sets of Factors of a Bi-Infinite Word. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:33-42 [Conf]
  10. Danièle Beauquier, Jean-Eric Pin
    Factors of Words. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:63-79 [Conf]
  11. Danièle Beauquier
    Some Results About Finite and Infinite Behaviours of a Pushdown Automaton. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:187-195 [Conf]
  12. Danièle Beauquier, Michel Latteux, Karine Slowinski
    A Decidability Result about Convex Polyominoes. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:32-45 [Conf]
  13. Danièle Beauquier
    Ensembles reconnaissables de mots bi -infinis limite et déterminisme. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:28-46 [Conf]
  14. Danièle Beauquier, Dima Burago, Anatol Slissenko
    On the Complexity of Finite Memory Policies for Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:191-200 [Conf]
  15. Danièle Beauquier, Andreas Podelski
    Rabin Tree Automata and Finite Monoids. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:262-271 [Conf]
  16. Danièle Beauquier, Marie Duflot, Marius Minea
    A Probabilistic Property-Specific Approach to Information Flow. [Citation Graph (0, 0)][DBLP]
    MMM-ACNS, 2005, pp:206-220 [Conf]
  17. Danièle Beauquier, Tristan Crolard, Evguenia Prokofieva
    Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic. [Citation Graph (0, 0)][DBLP]
    TACAS, 2004, pp:372-387 [Conf]
  18. Danièle Beauquier, Anatol Slissenko
    The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:201-212 [Conf]
  19. Danièle Beauquier, Damian Niwinski
    Automata on Infinite Trees with Counting Constraints. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:266-281 [Conf]
  20. Danièle Beauquier, Anatol Slissenko
    Polytime Model Checking for Timed Probabilistic Computation Tree Logic. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:8, pp:645-664 [Journal]
  21. Danièle Beauquier, Anatol Slissenko
    A first order logic for specification of timed algorithms: basic properties and a decidable class. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:13-52 [Journal]
  22. Danièle Beauquier
    Decidable properties for monadic abstract state machines. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:308-319 [Journal]
  23. Danièle Beauquier, Anatol Slissenko
    Periodicity based decidable classes in a first order timed logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:139, n:1-3, pp:43-73 [Journal]
  24. Danièle Beauquier, Maurice Nivat, Eric Rémila, Mike Robson
    Tiling Figures of the Plane with Two Bars. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:1-25 [Journal]
  25. Ruggero Lanotte, Danièle Beauquier
    A Decidable Probability Logic for Timed Probabilistic Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  26. Danièle Beauquier, Maurice Nivat
    On Translating One Polyomino to Tile the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:575-592 [Journal]
  27. Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko
    The Probability Nesting Game. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:68, n:2, pp:- [Journal]
  28. Danièle Beauquier
    Markov Decision Processes and Deterministic Büchi Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:50, n:1, pp:1-13 [Journal]
  29. Danièle Beauquier, Damian Niwinski
    Automata on Infinite Trees with Counting Constraints [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:1, pp:117-125 [Journal]
  30. Danièle Beauquier
    An Undecidable Problem About Rational Sets and Contour Words of Polyominoes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:5, pp:257-263 [Journal]
  31. Danièle Beauquier, Dominique Perrin
    Codeterministic Automata on Infinite Words. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:2, pp:95-98 [Journal]
  32. Danièle Beauquier, Alexander Moshe Rabinovich
    Monadic Logic of Order over Naturals has no Finite Base. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2002, v:12, n:2, pp:243-253 [Journal]
  33. Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko
    A Logic of Probability with Decidable Model Checking. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2006, v:16, n:4, pp:461-487 [Journal]
  34. Philippe Aigrain, Danièle Beauquier
    Polyomino Tilings, Cellular Automata and Codicity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:165-180 [Journal]
  35. Danièle Beauquier
    On probabilistic timed automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:65-84 [Journal]
  36. Danièle Beauquier
    Minimal Automaton for a Factorial, Transitive and Rational Language. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:1, pp:65-73 [Journal]
  37. Danièle Beauquier, Jean-Claude Fournier
    Groups and tilings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:81-97 [Journal]
  38. Danièle Beauquier, Dimitri Grigoriev, Yuri Matiyasevich
    Biography of A.O. Slissenko. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:303, pp:3-5 [Journal]
  39. Danièle Beauquier, Maurice Nivat
    A codicity undecidable problem in the plane. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:2, n:303, pp:417-430 [Journal]
  40. Danièle Beauquier, Jean-Eric Pin
    Languages and Scanners. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:84, n:1, pp:3-21 [Journal]
  41. Danièle Beauquier, Andreas Podelski
    Rabin Tree Automata and Finite Monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:1, pp:13-25 [Journal]
  42. Danièle Beauquier, Anatol Slissenko
    Decidable verification for reducible timed automata specified in a first order logic with time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:347-388 [Journal]
  43. Danièle Beauquier
    Bilimites de Langages Reconnaissables. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:335-342 [Journal]
  44. Danièle Beauquier, Egon Börger, Anatol Slissenko
    Introduction. [Citation Graph (0, 0)][DBLP]
    Abstract State Machines, 2005, pp:5-10 [Conf]
  45. Danièle Beauquier, Marie Duflot, Yury Lifshits
    Decidability of Parameterized Probabilistic Information Flow. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:82-91 [Conf]
  46. Danièle Beauquier, Ruggero Lanotte
    Hiding Information in Multi Level Security Systems. [Citation Graph (0, 0)][DBLP]
    Formal Aspects in Security and Trust, 2006, pp:250-269 [Conf]
  47. Danièle Beauquier, Frédéric Gauche
    How to Guarantee Secrecy for Cryptographic Protocols [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  48. Security Policies Enforcement Using Finite Edit Automata. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.308secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002