Danièle Beauquier

Publication Activity (10 Years)

Years Active: 1984-2013
Publications (10 Years): 0

Top Topics

Xml Access Control

Regular Expressions

Security Policies

Finite Automata

Top Venues

Int. J. Inf. Sec.

Publications

Danièle Beauquier, Joëlle Cohen, Ruggero Lanotte
Security policies enforcement using finite and pushdown edit automata. Int. J. Inf. Sec. 12 (4) (2013)
Danièle Beauquier, Joëlle Cohen, Ruggero Lanotte
Security Policies Enforcement Using Finite Edit Automata. Electron. Notes Theor. Comput. Sci. 229 (3) (2009)
Ruggero Lanotte, Danièle Beauquier
A Decidable Probability Logic for Timed Probabilistic Systems. Fundam. Informaticae 96 (1-2) (2009)
Danièle Beauquier, Frédéric Gauche
How to Guarantee Secrecy for Cryptographic Protocols CoRR (2007)
Danièle Beauquier, Marie Duflot, Yury Lifshits
Decidability of Parameterized Probabilistic Information Flow. CSR (2007)
Danièle Beauquier, Anatol Slissenko
Periodicity based decidable classes in a first order timed logic. Ann. Pure Appl. Log. 139 (1-3) (2006)
Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko
A Logic of Probability with Decidable Model Checking. J. Log. Comput. 16 (4) (2006)
Danièle Beauquier
Decidable properties for monadic abstract state machines. Ann. Pure Appl. Log. 141 (3) (2006)
Danièle Beauquier, Ruggero Lanotte
Hiding Information in Multi Level Security Systems. Formal Aspects in Security and Trust (2006)
Danièle Beauquier, Marie Duflot, Marius Minea
A Probabilistic Property-Specific Approach to Information Flow. MMM-ACNS (2005)
Danièle Beauquier, Egon Börger, Anatol Slissenko
Introduction. Abstract State Machines (2005)
Ruggero Lanotte, Danièle Beauquier
A Decidable Probability Logic for Timed Probabilistic Systems CoRR (2004)
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. TACAS (2004)
Danièle Beauquier, Dimitri Grigoriev, Yuri V. Matiyasevich
Biography of A.O. Slissenko. Theor. Comput. Sci. 303 (1) (2003)
Danièle Beauquier
On probabilistic timed automata. Theor. Comput. Sci. 292 (1) (2003)
Danièle Beauquier, Maurice Nivat
A codicity undecidable problem in the plane. Theor. Comput. Sci. 303 (2-3) (2003)
Danièle Beauquier, Jean-Claude Fournier
Groups and tilings. Theor. Comput. Sci. 281 (1-2) (2002)
Danièle Beauquier, Alexander Moshe Rabinovich
Monadic Logic of Order over Naturals has no Finite Base. J. Log. Comput. 12 (2) (2002)
Danièle Beauquier, Anatol Slissenko
Decidable verification for reducible timed automata specified in a first order logic with time. Theor. Comput. Sci. 275 (1-2) (2002)
Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko
A Logic of Probability with Decidable Model-Checking. CSL (2002)
Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko
The Probability Nesting Game. EXPRESS (2002)
Danièle Beauquier
Markov Decision Processes and Deterministic Büchi Automata. Fundam. Informaticae 50 (1) (2002)
Danièle Beauquier, Anatol Slissenko
A first order logic for specification of timed algorithms: basic properties and a decidable class. Ann. Pure Appl. Log. 113 (1-3) (2001)
Danièle Beauquier, Anatol Slissenko
Decidable Classes of the Verification Problem in a Timed Predicate Logic. FCT (1999)
Danièle Beauquier, Anatol Slissenko
Polytime Model Checking for Timed Probabilistic Computation Tree Logic. Acta Informatica 35 (8) (1998)
Danièle Beauquier
Pumping Lemmas for Timed Automata. FoSSaCS (1998)
Danièle Beauquier, Anatol Slissenko
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages. TAPSOFT (1997)
Danièle Beauquier, Damian Niwinski
Automata on Infinite Trees with Counting Constraints Inf. Comput. 120 (1) (1995)
Danièle Beauquier, Maurice Nivat, Eric Rémila, Mike Robson
Tiling Figures of the Plane with Two Bars. Comput. Geom. 5 (1995)
Danièle Beauquier, Dima Burago, Anatol Slissenko
On the Complexity of Finite Memory Policies for Markov Decision Processes. MFCS (1995)
Philippe Aigrain, Danièle Beauquier
Polyomino Tilings, Cellular Automata and Codicity. Theor. Comput. Sci. 147 (1&2) (1995)
Danièle Beauquier, Andreas Podelski
Rabin Tree Automata and Finite Monoids. Theor. Comput. Sci. 134 (1) (1994)
Danièle Beauquier, Damian Niwinski
Automata on Infinite Trees with Counting Constraints. TAPSOFT (1993)
Danièle Beauquier, Andreas Podelski
Rabin Tree Automata and Finite Monoids. MFCS (1993)
Danièle Beauquier, Maurice Nivat, Damian Niwinski
The Effect of the Number of Successful Paths in a BüChi Tree Automaton. Int. J. Algebra Comput. 3 (2) (1993)
Danièle Beauquier, Michel Latteux, Karine Slowinski
A Decidability Result about Convex Polyominoes. LATIN (1992)
Danièle Beauquier, Jean-Eric Pin
Languages and Scanners. Theor. Comput. Sci. 84 (1) (1991)
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. FCT (1991)
Danièle Beauquier
An Undecidable Problem About Rational Sets and Contour Words of Polyominoes. Inf. Process. Lett. 37 (5) (1991)
Danièle Beauquier, Maurice Nivat
On Translating One Polyomino to Tile the Plane. Discret. Comput. Geom. 6 (1991)
Danièle Beauquier, Maurice Nivat
Tiling the Plane with One Tile. SCG (1990)
Danièle Beauquier, Jean-Eric Pin
Factors of Words. ICALP (1989)
Danièle Beauquier
Minimal Automaton for a Factorial, Transitive and Rational Language. Theor. Comput. Sci. 67 (1) (1989)
Danièle Beauquier
Minimal Automaton of a Rational Cover. ICALP (1987)
Danièle Beauquier
Thin Homogeneous Sets of Factors. FSTTCS (1986)
Danièle Beauquier, Dominique Perrin
Codeterministic Automata on Infinite Words. Inf. Process. Lett. 20 (2) (1985)
Danièle Beauquier, Maurice Nivat
About Rational Sets of Factors of a Bi-Infinite Word. ICALP (1985)
Danièle Beauquier
Muller automata and bi-infinite words. FCT (1985)
Danièle Beauquier
Ensembles reconnaissables de mots bi -infinis limite et déterminisme. Automata on Infinite Words (1984)
Danièle Beauquier
Some Results About Finite and Infinite Behaviours of a Pushdown Automaton. ICALP (1984)
Danièle Beauquier
Bilimites de Langages Reconnaissables. Theor. Comput. Sci. 33 (1984)