Danièle Beauquier

According to our database, Danièle Beauquier authored at least 47 papers between 1984 and 2013.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2013

Security policies enforcement using finite and pushdown edit automata.

Danièle Beauquier, Joëlle Cohen, Ruggero Lanotte

Int. J. Inf. Sec., 2013

2009

A Decidable Probability Logic for Timed Probabilistic Systems.

Ruggero Lanotte, Danièle Beauquier

Fundam. Informaticae, 2009

2008

Security Policies Enforcement Using Finite Edit Automata.

Danièle Beauquier, Joëlle Cohen, Ruggero Lanotte

Proceedings of the First Interaction and Concurrency Experiences Workshop, 2008

2007

How to Guarantee Secrecy for Cryptographic Protocols

Danièle Beauquier, Frédéric Gauche

CoRR, 2007

Decidability of Parameterized Probabilistic Information Flow.

Danièle Beauquier, Marie Duflot, Yury Lifshits

Proceedings of the Computer Science, 2007

2006

A Logic of Probability with Decidable Model Checking.

Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko

J. Log. Comput., 2006

Periodicity based decidable classes in a first order timed logic.

Danièle Beauquier, Anatol Slissenko

Ann. Pure Appl. Log., 2006

Decidable properties for monadic abstract state machines.

Danièle Beauquier

Ann. Pure Appl. Log., 2006

Hiding Information in Multi Level Security Systems.

Danièle Beauquier, Ruggero Lanotte

Proceedings of the Formal Aspects in Security and Trust, Fourth International Workshop, 2006

2005

A Probabilistic Property-Specific Approach to Information Flow.

Danièle Beauquier, Marie Duflot, Marius Minea

Proceedings of the Computer Network Security, 2005

Introduction.

Danièle Beauquier, Egon Börger, Anatol Slissenko

Proceedings of the 12th International Workshop on Abstract State Machines, 2005

2004

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

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

2003

A codicity undecidable problem in the plane.

Danièle Beauquier, Maurice Nivat

Theor. Comput. Sci., 2003

Biography of A.O. Slissenko.

Danièle Beauquier, Dimitri Grigoriev, Yuri V. Matiyasevich

Theor. Comput. Sci., 2003

On probabilistic timed automata.

Danièle Beauquier

Theor. Comput. Sci., 2003

2002

Decidable verification for reducible timed automata specified in a first order logic with time.

Danièle Beauquier, Anatol Slissenko

Theor. Comput. Sci., 2002

Groups and tilings.

Danièle Beauquier, Jean-Claude Fournier

Theor. Comput. Sci., 2002

Monadic Logic of Order over Naturals has no Finite Base.

Danièle Beauquier, Alexander Moshe Rabinovich

J. Log. Comput., 2002

Markov Decision Processes and Deterministic Büchi Automata.

Danièle Beauquier

Fundam. Informaticae, 2002

The Probability Nesting Game.

Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko

Proceedings of the 9th International Workshop on Expressiveness in Concurrency, 2002

2001

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

1999

Decidable Classes of the Verification Problem in a Timed Predicate Logic.

Danièle Beauquier, Anatol Slissenko

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998

Polytime Model Checking for Timed Probabilistic Computation Tree Logic.

Danièle Beauquier, Anatol Slissenko

Acta Informatica, 1998

Pumping Lemmas for Timed Automata.

Danièle Beauquier

Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997

The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages.

Danièle Beauquier, Anatol Slissenko

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1995

Automata on Infinite Trees with Counting Constraints

Danièle Beauquier, Damian Niwinski

Inf. Comput., July, 1995

Polyomino Tilings, Cellular Automata and Codicity.

Philippe Aigrain, Danièle Beauquier

Theor. Comput. Sci., 1995

Tiling Figures of the Plane with Two Bars.

Danièle Beauquier, Maurice Nivat, Eric Rémila, Mike Robson

Comput. Geom., 1995

On the Complexity of Finite Memory Policies for Markov Decision Processes.

Danièle Beauquier, Dima Burago, Anatol Slissenko

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994

Rabin Tree Automata and Finite Monoids.

Danièle Beauquier, Andreas Podelski

Theor. Comput. Sci., 1994

1993

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

1992

A Decidability Result about Convex Polyominoes.

Danièle Beauquier, Michel Latteux, Karine Slowinski

Proceedings of the LATIN '92, 1992

1991

Languages and Scanners.

Danièle Beauquier, Jean-Eric Pin

Theor. Comput. Sci., 1991

An Undecidable Problem About Rational Sets and Contour Words of Polyominoes.

Danièle Beauquier

Inf. Process. Lett., 1991

On Translating One Polyomino to Tile the Plane.

Danièle Beauquier, Maurice Nivat

Discret. Comput. Geom., 1991

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

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

Tiling the Plane with One Tile.

Danièle Beauquier, Maurice Nivat

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Minimal Automaton for a Factorial, Transitive and Rational Language.

Danièle Beauquier

Theor. Comput. Sci., 1989

Factors of Words.

Danièle Beauquier, Jean-Eric Pin

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1987

Minimal Automaton of a Rational Cover.

Danièle Beauquier

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

Thin Homogeneous Sets of Factors.

Danièle Beauquier

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

1985

Codeterministic Automata on Infinite Words.

Danièle Beauquier, Dominique Perrin

Inf. Process. Lett., 1985

About Rational Sets of Factors of a Bi-Infinite Word.

Danièle Beauquier, Maurice Nivat

Proceedings of the Automata, 1985

Muller automata and bi-infinite words.

Danièle Beauquier

Proceedings of the Fundamentals of Computation Theory, 1985

1984

Bilimites de Langages Reconnaissables.

Danièle Beauquier

Theor. Comput. Sci., 1984

Ensembles reconnaissables de mots bi -infinis limite et déterminisme.

Danièle Beauquier

Proceedings of the Automata on Infinite Words, 1984

Some Results About Finite and Infinite Behaviours of a Pushdown Automaton.

Danièle Beauquier

Proceedings of the Automata, 1984