dblp.uni-trier.dewww.uni-trier.de

Danièle Beauquier Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2007
47EEDanièle Beauquier, Marie Duflot, Yury Lifshits: Decidability of Parameterized Probabilistic Information Flow. CSR 2007: 82-91
46EEDanièle Beauquier, Frédéric Gauche: How to Guarantee Secrecy for Cryptographic Protocols CoRR abs/cs/0703140: (2007)
2006
45EEDanièle Beauquier, Ruggero Lanotte: Hiding Information in Multi Level Security Systems. Formal Aspects in Security and Trust 2006: 250-269
44EEDanièle Beauquier, Anatol Slissenko: Periodicity based decidable classes in a first order timed logic. Ann. Pure Appl. Logic 139(1-3): 43-73 (2006)
43EEDanièle Beauquier: Decidable properties for monadic abstract state machines. Ann. Pure Appl. Logic 141(3): 308-319 (2006)
42EEDanièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko: A Logic of Probability with Decidable Model Checking. J. Log. Comput. 16(4): 461-487 (2006)
2005
41EEDanièle Beauquier, Egon Börger, Anatol Slissenko: Introduction. Abstract State Machines 2005: 5-10
40EEDanièle Beauquier, Marie Duflot, Marius Minea: A Probabilistic Property-Specific Approach to Information Flow. MMM-ACNS 2005: 206-220
2004
39EEDaniè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: 372-387
38EERuggero Lanotte, Danièle Beauquier: A Decidable Probability Logic for Timed Probabilistic Systems CoRR cs.LO/0411100: (2004)
2003
37EEDanièle Beauquier, Dimitri Grigoriev, Yuri Matiyasevich: Biography of A.O. Slissenko. Theor. Comput. Sci. 1(303): 3-5 (2003)
36EEDanièle Beauquier, Maurice Nivat: A codicity undecidable problem in the plane. Theor. Comput. Sci. 2-3(303): 417-430 (2003)
35 Danièle Beauquier: On probabilistic timed automata. Theor. Comput. Sci. 292(1): 65-84 (2003)
2002
34EEDanièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko: A Logic of Probability with Decidable Model-Checking. CSL 2002: 306-321
33EEDanièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko: The Probability Nesting Game. Electr. Notes Theor. Comput. Sci. 68(2): (2002)
32 Danièle Beauquier: Markov Decision Processes and Deterministic Büchi Automata. Fundam. Inform. 50(1): 1-13 (2002)
31EEDanièle Beauquier, Alexander Moshe Rabinovich: Monadic Logic of Order over Naturals has no Finite Base. J. Log. Comput. 12(2): 243-253 (2002)
30EEDanièle Beauquier, Anatol Slissenko: Decidable verification for reducible timed automata specified in a first order logic with time. Theor. Comput. Sci. 275(1-2): 347-388 (2002)
29EEDanièle Beauquier, Jean-Claude Fournier: Groups and tilings. Theor. Comput. Sci. 281(1-2): 81-97 (2002)
2001
28 Danièle Beauquier, Anatol Slissenko: A first order logic for specification of timed algorithms: basic properties and a decidable class. Ann. Pure Appl. Logic 113(1-3): 13-52 (2001)
1999
27EEDanièle Beauquier, Anatol Slissenko: Decidable Classes of the Verification Problem in a Timed Predicate Logic. FCT 1999: 100-111
1998
26EEDanièle Beauquier: Pumping Lemmas for Timed Automata. FoSSaCS 1998: 81-94
25EEDanièle Beauquier, Anatol Slissenko: Polytime Model Checking for Timed Probabilistic Computation Tree Logic. Acta Inf. 35(8): 645-664 (1998)
1997
24EEDanièle Beauquier, Anatol Slissenko: The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages. TAPSOFT 1997: 201-212
1995
23EEDanièle Beauquier, Dima Burago, Anatol Slissenko: On the Complexity of Finite Memory Policies for Markov Decision Processes. MFCS 1995: 191-200
22 Danièle Beauquier, Maurice Nivat, Eric Rémila, Mike Robson: Tiling Figures of the Plane with Two Bars. Comput. Geom. 5: 1-25 (1995)
21 Danièle Beauquier, Damian Niwinski: Automata on Infinite Trees with Counting Constraints Inf. Comput. 120(1): 117-125 (1995)
20EEPhilippe Aigrain, Danièle Beauquier: Polyomino Tilings, Cellular Automata and Codicity. Theor. Comput. Sci. 147(1&2): 165-180 (1995)
1994
19 Danièle Beauquier, Andreas Podelski: Rabin Tree Automata and Finite Monoids. Theor. Comput. Sci. 134(1): 13-25 (1994)
1993
18EEDanièle Beauquier, Andreas Podelski: Rabin Tree Automata and Finite Monoids. MFCS 1993: 262-271
17EEDanièle Beauquier, Damian Niwinski: Automata on Infinite Trees with Counting Constraints. TAPSOFT 1993: 266-281
1992
16 Danièle Beauquier, Michel Latteux, Karine Slowinski: A Decidability Result about Convex Polyominoes. LATIN 1992: 32-45
1991
15 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: 136-145
14 Danièle Beauquier, Maurice Nivat: On Translating One Polyomino to Tile the Plane. Discrete & Computational Geometry 6: 575-592 (1991)
13 Danièle Beauquier: An Undecidable Problem About Rational Sets and Contour Words of Polyominoes. Inf. Process. Lett. 37(5): 257-263 (1991)
12 Danièle Beauquier, Jean-Eric Pin: Languages and Scanners. Theor. Comput. Sci. 84(1): 3-21 (1991)
1990
11EEDanièle Beauquier, Maurice Nivat: Tiling the Plane with One Tile. Symposium on Computational Geometry 1990: 128-138
1989
10EEDanièle Beauquier, Jean-Eric Pin: Factors of Words. ICALP 1989: 63-79
9 Danièle Beauquier: Minimal Automaton for a Factorial, Transitive and Rational Language. Theor. Comput. Sci. 67(1): 65-73 (1989)
1987
8EEDanièle Beauquier: Minimal Automaton of a Rational Cover. ICALP 1987: 174-189
1986
7EEDanièle Beauquier: Thin Homogeneous Sets of Factors. FSTTCS 1986: 239-251
1985
6 Danièle Beauquier: Muller automata and bi-infinite words. FCT 1985: 36-43
5EEDanièle Beauquier, Maurice Nivat: About Rational Sets of Factors of a Bi-Infinite Word. ICALP 1985: 33-42
4 Danièle Beauquier, Dominique Perrin: Codeterministic Automata on Infinite Words. Inf. Process. Lett. 20(2): 95-98 (1985)
1984
3EEDanièle Beauquier: Ensembles reconnaissables de mots bi -infinis limite et déterminisme. Automata on Infinite Words 1984: 28-46
2EEDanièle Beauquier: Some Results About Finite and Infinite Behaviours of a Pushdown Automaton. ICALP 1984: 187-195
1 Danièle Beauquier: Bilimites de Langages Reconnaissables. Theor. Comput. Sci. 33: 335-342 (1984)

Coauthor Index

1Philippe Aigrain [20]
2Egon Börger [41]
3Dima Burago [23]
4Tristan Crolard [39]
5Marie Duflot [40] [47]
6Jean-Claude Fournier [29]
7Frédéric Gauche [46]
8Dimitri Grigoriev [37]
9Yoram Hirshfeld [33]
10Ruggero Lanotte [38] [45]
11Michel Latteux [16]
12Yury Lifshits [47]
13Yuri Matiyasevich [37]
14Marius Minea [40]
15Maurice Nivat [5] [11] [14] [15] [22] [36]
16Damian Niwinski [15] [17] [21]
17Dominique Perrin [4]
18Jean-Eric Pin [10] [12]
19Andreas Podelski [18] [19]
20Evguenia Prokofieva [39]
21Alexander Moshe Rabinovich (Alexander Rabinovich) [31] [33] [34] [42]
22Eric Rémila [22]
23Mike Robson [22]
24Anatol Slissenko [23] [24] [25] [27] [28] [30] [33] [34] [41] [42] [44]
25Karine Slowinski [16]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)