default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDanièle Beauquier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j25]Danièle Beauquier, Joëlle Cohen, Ruggero Lanotte
:
Security policies enforcement using finite and pushdown edit automata. Int. J. Inf. Sec. 12(4): 319-336 (2013)
2000 – 2009
- 2009
- [j24]Ruggero Lanotte, Danièle Beauquier:
A Decidable Probability Logic for Timed Probabilistic Systems. Fundam. Informaticae 96(1-2): 127-151 (2009) - 2008
- [c24]Danièle Beauquier, Joëlle Cohen, Ruggero Lanotte:
Security Policies Enforcement Using Finite Edit Automata. ICE@ICALP 2008: 19-35 - 2007
- [c23]Danièle Beauquier, Marie Duflot, Yury Lifshits:
Decidability of Parameterized Probabilistic Information Flow. CSR 2007: 82-91 - [i2]Danièle Beauquier, Frédéric Gauche:
How to Guarantee Secrecy for Cryptographic Protocols. CoRR abs/cs/0703140 (2007) - 2006
- [j23]Danièle Beauquier, Anatol Slissenko:
Periodicity based decidable classes in a first order timed logic. Ann. Pure Appl. Log. 139(1-3): 43-73 (2006) - [j22]Danièle Beauquier:
Decidable properties for monadic abstract state machines. Ann. Pure Appl. Log. 141(3): 308-319 (2006) - [j21]Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko:
A Logic of Probability with Decidable Model Checking. J. Log. Comput. 16(4): 461-487 (2006) - [c22]Danièle Beauquier, Ruggero Lanotte:
Hiding Information in Multi Level Security Systems. Formal Aspects in Security and Trust 2006: 250-269 - 2005
- [c21]Danièle Beauquier, Egon Börger, Anatol Slissenko:
Introduction. Abstract State Machines 2005: 5-10 - [c20]Danièle Beauquier, Marie Duflot, Marius Minea:
A Probabilistic Property-Specific Approach to Information Flow. MMM-ACNS 2005: 206-220 - 2004
- [c19]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: 372-387 - [i1]Ruggero Lanotte, Danièle Beauquier:
A Decidable Probability Logic for Timed Probabilistic Systems. CoRR cs.LO/0411100 (2004) - 2003
- [j20]Danièle Beauquier:
On probabilistic timed automata. Theor. Comput. Sci. 292(1): 65-84 (2003) - [j19]Danièle Beauquier, Dimitri Grigoriev, Yuri V. Matiyasevich:
Biography of A.O. Slissenko. Theor. Comput. Sci. 303(1): 3-5 (2003) - [j18]Danièle Beauquier, Maurice Nivat:
A codicity undecidable problem in the plane. Theor. Comput. Sci. 303(2-3): 417-430 (2003) - 2002
- [j17]Danièle Beauquier:
Markov Decision Processes and Deterministic Büchi Automata. Fundam. Informaticae 50(1): 1-13 (2002) - [j16]Danièle Beauquier, Alexander Moshe Rabinovich:
Monadic Logic of Order over Naturals has no Finite Base. J. Log. Comput. 12(2): 243-253 (2002) - [j15]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): 347-388 (2002) - [j14]Danièle Beauquier, Jean-Claude Fournier:
Groups and tilings. Theor. Comput. Sci. 281(1-2): 81-97 (2002) - [c18]Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko:
A Logic of Probability with Decidable Model-Checking. CSL 2002: 306-321 - [c17]Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko:
The Probability Nesting Game. EXPRESS 2002: 4-14 - 2001
- [j13]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): 13-52 (2001)
1990 – 1999
- 1999
- [c16]Danièle Beauquier, Anatol Slissenko:
Decidable Classes of the Verification Problem in a Timed Predicate Logic. FCT 1999: 100-111 - 1998
- [j12]Danièle Beauquier, Anatol Slissenko:
Polytime Model Checking for Timed Probabilistic Computation Tree Logic. Acta Informatica 35(8): 645-664 (1998) - [c15]Danièle Beauquier:
Pumping Lemmas for Timed Automata. FoSSaCS 1998: 81-94 - 1997
- [c14]Daniè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
- [j11]Danièle Beauquier, Maurice Nivat, Eric Rémila, Mike Robson:
Tiling Figures of the Plane with Two Bars. Comput. Geom. 5: 1-25 (1995) - [j10]Danièle Beauquier, Damian Niwinski:
Automata on Infinite Trees with Counting Constraints. Inf. Comput. 120(1): 117-125 (1995) - [j9]Philippe Aigrain, Danièle Beauquier:
Polyomino Tilings, Cellular Automata and Codicity. Theor. Comput. Sci. 147(1&2): 165-180 (1995) - [c13]Danièle Beauquier, Dima Burago, Anatol Slissenko:
On the Complexity of Finite Memory Policies for Markov Decision Processes. MFCS 1995: 191-200 - 1994
- [j8]Danièle Beauquier, Andreas Podelski:
Rabin Tree Automata and Finite Monoids. Theor. Comput. Sci. 134(1): 13-25 (1994) - 1993
- [j7]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): 237-250 (1993) - [c12]Danièle Beauquier, Andreas Podelski:
Rabin Tree Automata and Finite Monoids. MFCS 1993: 262-271 - [c11]Danièle Beauquier, Damian Niwinski:
Automata on Infinite Trees with Counting Constraints. TAPSOFT 1993: 266-281 - 1992
- [c10]Danièle Beauquier, Michel Latteux, Karine Slowinski:
A Decidability Result about Convex Polyominoes. LATIN 1992: 32-45 - 1991
- [j6]Danièle Beauquier, Maurice Nivat:
On Translating One Polyomino to Tile the Plane. Discret. Comput. Geom. 6: 575-592 (1991) - [j5]Danièle Beauquier:
An Undecidable Problem About Rational Sets and Contour Words of Polyominoes. Inf. Process. Lett. 37(5): 257-263 (1991) - [j4]Danièle Beauquier, Jean-Eric Pin:
Languages and Scanners. Theor. Comput. Sci. 84(1): 3-21 (1991) - [c9]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 - 1990
- [c8]Danièle Beauquier, Maurice Nivat:
Tiling the Plane with One Tile. SCG 1990: 128-138
1980 – 1989
- 1989
- [j3]Danièle Beauquier:
Minimal Automaton for a Factorial, Transitive and Rational Language. Theor. Comput. Sci. 67(1): 65-73 (1989) - [c7]Danièle Beauquier, Jean-Eric Pin:
Factors of Words. ICALP 1989: 63-79 - 1987
- [c6]Danièle Beauquier:
Minimal Automaton of a Rational Cover. ICALP 1987: 174-189 - 1986
- [c5]Danièle Beauquier:
Thin Homogeneous Sets of Factors. FSTTCS 1986: 239-251 - 1985
- [j2]Danièle Beauquier, Dominique Perrin:
Codeterministic Automata on Infinite Words. Inf. Process. Lett. 20(2): 95-98 (1985) - [c4]Danièle Beauquier:
Muller automata and bi-infinite words. FCT 1985: 36-43 - [c3]Danièle Beauquier, Maurice Nivat:
About Rational Sets of Factors of a Bi-Infinite Word. ICALP 1985: 33-42 - 1984
- [j1]Danièle Beauquier:
Bilimites de Langages Reconnaissables. Theor. Comput. Sci. 33: 335-342 (1984) - [c2]Danièle Beauquier:
Some Results About Finite and Infinite Behaviours of a Pushdown Automaton. ICALP 1984: 187-195 - [c1]Danièle Beauquier:
Ensembles reconnaissables de mots bi -infinis limite et déterminisme. Automata on Infinite Words 1984: 28-46
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
