Some Results About Finite and Infinite Behaviours of a Pushdown Automaton. - Danièle Beauquier (ICALP, 1984)

Ensembles reconnaissables de mots bi -infinis limite et déterminisme. - Danièle Beauquier (Automata on Infinite Words, 1984)

Bilimites de Langages Reconnaissables. - Danièle Beauquier (Theor. Comput. Sci., 1984)

Muller automata and bi-infinite words. - Danièle Beauquier (FCT, 1985)

About Rational Sets of Factors of a Bi-Infinite Word. - Danièle Beauquier; Maurice Nivat (ICALP, 1985)

Codeterministic Automata on Infinite Words. - Danièle Beauquier; Dominique Perrin (Inf. Process. Lett., 1985)

Thin Homogeneous Sets of Factors. - Danièle Beauquier (FSTTCS, 1986)

Minimal Automaton of a Rational Cover. - Danièle Beauquier (ICALP, 1987)

Factors of Words. - Danièle Beauquier; Jean-Eric Pin (ICALP, 1989)

Minimal Automaton for a Factorial, Transitive and Rational Language. - Danièle Beauquier (Theor. Comput. Sci., 1989)

Tiling the Plane with One Tile. - Danièle Beauquier; Maurice Nivat (SCG, 1990)

About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Büchi Conditions. - Danièle Beauquier; Maurice Nivat; Damian Niwinski (FCT, 1991)

On Translating One Polyomino to Tile the Plane. - Danièle Beauquier; Maurice Nivat (Discret. Comput. Geom., 1991)

An Undecidable Problem About Rational Sets and Contour Words of Polyominoes. - Danièle Beauquier (Inf. Process. Lett., 1991)

Languages and Scanners. - Danièle Beauquier; Jean-Eric Pin (Theor. Comput. Sci., 1991)

A Decidability Result about Convex Polyominoes. - Danièle Beauquier; Michel Latteux; Karine Slowinski (LATIN, 1992)

The Effect of the Number of Successful Paths in a BüChi Tree Automaton. - Danièle Beauquier; Maurice Nivat; Damian Niwinski (Int. J. Algebra Comput., 1993)

Rabin Tree Automata and Finite Monoids. - Danièle Beauquier; Andreas Podelski (Theor. Comput. Sci., 1994)

On the Complexity of Finite Memory Policies for Markov Decision Processes. - Danièle Beauquier; Dima Burago; Anatol Slissenko (MFCS, 1995)

Tiling Figures of the Plane with Two Bars. - Danièle Beauquier; Maurice Nivat; Eric Rémila; Mike Robson (Comput. Geom., 1995)

Polyomino Tilings, Cellular Automata and Codicity. - Philippe Aigrain; Danièle Beauquier (Theor. Comput. Sci., 1995)

Automata on Infinite Trees with Counting Constraints - Danièle Beauquier; Damian Niwinski (Inf. Comput., 1995)

The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages. - Danièle Beauquier; Anatol Slissenko (TAPSOFT, 1997)

Pumping Lemmas for Timed Automata. - Danièle Beauquier (FoSSaCS, 1998)

Polytime Model Checking for Timed Probabilistic Computation Tree Logic. - Danièle Beauquier; Anatol Slissenko (Acta Informatica, 1998)

Decidable Classes of the Verification Problem in a Timed Predicate Logic. - Danièle Beauquier; Anatol Slissenko (FCT, 1999)

A first order logic for specification of timed algorithms: basic properties and a decidable class. - Danièle Beauquier; Anatol Slissenko (Ann. Pure Appl. Log., 2001)

The Probability Nesting Game. - Danièle Beauquier; Yoram Hirshfeld; Alexander Moshe Rabinovich; Anatol Slissenko (EXPRESS, 2002)

Markov Decision Processes and Deterministic Büchi Automata. - Danièle Beauquier (Fundam. Informaticae, 2002)

Monadic Logic of Order over Naturals has no Finite Base. - Danièle Beauquier; Alexander Moshe Rabinovich (J. Log. Comput., 2002)

Groups and tilings. - Danièle Beauquier; Jean-Claude Fournier (Theor. Comput. Sci., 2002)

Decidable verification for reducible timed automata specified in a first order logic with time. - Danièle Beauquier; Anatol Slissenko (Theor. Comput. Sci., 2002)

On probabilistic timed automata. - Danièle Beauquier (Theor. Comput. Sci., 2003)

Biography of A.O. Slissenko. - Danièle Beauquier; Dimitri Grigoriev; Yuri V. Matiyasevich (Theor. Comput. Sci., 2003)

A codicity undecidable problem in the plane. - Danièle Beauquier; Maurice Nivat (Theor. Comput. Sci., 2003)

Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic. - Danièle Beauquier; Tristan Crolard; Evguenia Prokofieva (TACAS, 2004)

Introduction. - Danièle Beauquier; Egon Börger; Anatol Slissenko (Abstract State Machines, 2005)

A Probabilistic Property-Specific Approach to Information Flow. - Danièle Beauquier; Marie Duflot; Marius Minea (MMM-ACNS, 2005)

Hiding Information in Multi Level Security Systems. - Danièle Beauquier; Ruggero Lanotte (Formal Aspects in Security and Trust, 2006)

Decidable properties for monadic abstract state machines. - Danièle Beauquier (Ann. Pure Appl. Log., 2006)

Periodicity based decidable classes in a first order timed logic. - Danièle Beauquier; Anatol Slissenko (Ann. Pure Appl. Log., 2006)

A Logic of Probability with Decidable Model Checking. - Danièle Beauquier; Alexander Moshe Rabinovich; Anatol Slissenko (J. Log. Comput., 2006)

Decidability of Parameterized Probabilistic Information Flow. - Danièle Beauquier; Marie Duflot; Yury Lifshits (CSR, 2007)

How to Guarantee Secrecy for Cryptographic Protocols - Danièle Beauquier; Frédéric Gauche (CoRR, 2007)

Security Policies Enforcement Using Finite Edit Automata. - Danièle Beauquier; Joëlle Cohen; Ruggero Lanotte (ICE@ICALP, 2008)

A Decidable Probability Logic for Timed Probabilistic Systems. - Ruggero Lanotte; Danièle Beauquier (Fundam. Informaticae, 2009)

Security policies enforcement using finite and pushdown edit automata. - Danièle Beauquier; Joëlle Cohen; Ruggero Lanotte (Int. J. Inf. Sec., 2013)