Danièle Beauquier

According to our database1, Danièle Beauquier
  • authored at least 51 papers between 1984 and 2013.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2013
Security policies enforcement using finite and pushdown edit automata.
Int. J. Inf. Sec., 2013

2009
A Decidable Probability Logic for Timed Probabilistic Systems.
Fundam. Inform., 2009

Security Policies Enforcement Using Finite Edit Automata.
Electr. Notes Theor. Comput. Sci., 2009

2007
How to Guarantee Secrecy for Cryptographic Protocols
CoRR, 2007

Decidability of Parameterized Probabilistic Information Flow.
Proceedings of the Computer Science, 2007

2006
A Logic of Probability with Decidable Model Checking.
J. Log. Comput., 2006

Periodicity based decidable classes in a first order timed logic.
Ann. Pure Appl. Logic, 2006

Decidable properties for monadic abstract state machines.
Ann. Pure Appl. Logic, 2006

Hiding Information in Multi Level Security Systems.
Proceedings of the Formal Aspects in Security and Trust, Fourth International Workshop, 2006

2005
A Probabilistic Property-Specific Approach to Information Flow.
Proceedings of the Computer Network Security, 2005

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

2004
A Decidable Probability Logic for Timed Probabilistic Systems
CoRR, 2004

Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

2003
A codicity undecidable problem in the plane.
Theor. Comput. Sci., 2003

Biography of A.O. Slissenko.
Theor. Comput. Sci., 2003

On probabilistic timed automata.
Theor. Comput. Sci., 2003

2002
Decidable verification for reducible timed automata specified in a first order logic with time.
Theor. Comput. Sci., 2002

Groups and tilings.
Theor. Comput. Sci., 2002

Monadic Logic of Order over Naturals has no Finite Base.
J. Log. Comput., 2002

Markov Decision Processes and Deterministic Büchi Automata.
Fundam. Inform., 2002

The Probability Nesting Game.
Electr. Notes Theor. Comput. Sci., 2002

A Logic of Probability with Decidable Model-Checking.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001
A first order logic for specification of timed algorithms: basic properties and a decidable class.
Ann. Pure Appl. Logic, 2001

1999
Decidable Classes of the Verification Problem in a Timed Predicate Logic.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
Polytime Model Checking for Timed Probabilistic Computation Tree Logic.
Acta Inf., 1998

Pumping Lemmas for Timed Automata.
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.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1995
Automata on Infinite Trees with Counting Constraints
Inf. Comput., July, 1995

Polyomino Tilings, Cellular Automata and Codicity.
Theor. Comput. Sci., 1995

Tiling Figures of the Plane with Two Bars.
Comput. Geom., 1995

On the Complexity of Finite Memory Policies for Markov Decision Processes.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994
Rabin Tree Automata and Finite Monoids.
Theor. Comput. Sci., 1994

1993
The Effect of the Number of Successful Paths in a BüChi Tree Automaton.
IJAC, 1993

Automata on Infinite Trees with Counting Constraints.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

Rabin Tree Automata and Finite Monoids.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
A Decidability Result about Convex Polyominoes.
Proceedings of the LATIN '92, 1992

1991
Languages and Scanners.
Theor. Comput. Sci., 1991

An Undecidable Problem About Rational Sets and Contour Words of Polyominoes.
Inf. Process. Lett., 1991

On Translating One Polyomino to Tile the Plane.
Discrete & Computational Geometry, 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.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990
Tiling the Plane with One Tile.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Minimal Automaton for a Factorial, Transitive and Rational Language.
Theor. Comput. Sci., 1989

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

1987
Minimal Automaton of a Rational Cover.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
Thin Homogeneous Sets of Factors.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

1985
Codeterministic Automata on Infinite Words.
Inf. Process. Lett., 1985

About Rational Sets of Factors of a Bi-Infinite Word.
Proceedings of the Automata, 1985

Muller automata and bi-infinite words.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
Bilimites de Langages Reconnaissables.
Theor. Comput. Sci., 1984

Ensembles reconnaissables de mots bi -infinis limite et déterminisme.
Proceedings of the Automata on Infinite Words, 1984

Some Results About Finite and Infinite Behaviours of a Pushdown Automaton.
Proceedings of the Automata, 1984


  Loading...