Danièle Beauquier

51 papers A* 4A 1B 8Misc 1Journal 27Unranked 10

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