PUBLICATIONS

The Collection of Computer Science Bibliographies

Revues internationales avec comité de lecture

• Beauquier, D. Bi-limites de langages reconnaissables Theoretical Computer Science, 33, pp. 335-342 (1985)
• Beauquier, D. and Perrin, D. Co-deterministic automata on infinite words Information Processing Letters, 20, pp. 95-98 (1985)
• Beauquier, D. Minimal automaton for a factorial, transitive, rational language Theoretical Computer Science, 67, pp. 65-73 (1985)
• Beauquier, D. and Nivat, M. Tiling the plane with one tile Topology and Computer Science Oxford Science Publications pp. 291-334 (1991)
• Beauquier, D. An undecidable problem about rational sets and contour words of polyominoes Information Processing Letters, 37, pp. 257-263, (1991)
• Beauquier , D. and Nivat M. On translating one polyomino to tile the plane.Discrete and Computational Geometry, 6:575--592, (1991).
• Beauquier, D. and Pin, J.E. Languages and scanners Theoretical Computer Science, 84, pp. 3-21 (1991)
• Beauquier, D. and Nivat, M. and Niwinski, D. The effect of the number of successful paths in a Buchi tree automaton International Journal of Algebra and Computation, 3, pp. 237-250, (1993)
• Beauquier, D. and Podelski, A. Rabin tree automata and finite monoids Theoretical Computer Science, 134, pp. 13-25 (1994)
• Beauquier, D. and Niwinski, D. Automata on infinite trees with path counting constraints Information and Computation, 20, pp. 117-125, (1994)
• Beauquier, D. and Nivat, M. and Remila, E. and Robson, M. Tiling figures of the plane with two bars Computational Geometry: Theory and Applications, 5, pp. 1-25, (1995) LI Beauquier, D. and Slissenko, A. Polytime Model Checking for Timed Probabilistic Systems Acta Informatica, 35, pp. 645-664 (1998)
• Beauquier, D. and Aigrain, Ph. Polyomino tilings, cellular automata and codicity.Theoretical Computer Science, 147:165--180, (1995).
• Beauquier, D. and Slissenko, A. Polytime model checking for timed probabilistic systems. Acta Informatica, 35:201--212, (1998).
• Beauquier, D. and Muller, D. and. Schupp. P. E. The bar problem-a simple tiling problem which is NP-complete on the euclidean tessellation by squares but which is polynomial time on the hyperbolic tessellations by 4g-gons. Groups, Languages and Geometry}, 250:29--36, (1999).
• Beauquier, D. and Slissenko, A. A first order logic for specification of timed algorithms:basic properties and a decidable class. Annals of Pure and Applied Logic., 113(1?3):13?52, (2002
• Beauquier, D. Markov decision processes and deterministic Büchi automata Fundamenta Informaticae,  49:1-13, (2002).
• Beauquier, D. and Fournier, J.C. Groups and Tilings, Theoretical Computer Science , 281(1?2):81?97, (2002)
• Beauquier, D.  Markov Decision Processes and Deterministic Buchi Automata   Fundamenta Informaticae Vol 49 pp1-13 (2002)
• Beauquier, D. Hirshfeld, Y. , Rabinovich, A. and Slissenko, A. The probability nesting game, Electronic Notes in Theoretical Computer Science, 68(2),  2002
• Beauquier, D. and Slissenko, A. A Decidable verification for reducible timed automata specified in a first order logic with time, Theoretical Computer Science , 275: 347-388(2002)
• Beauquier, D. and Rabinovich, A. , Monadic Logic of Order over Naturals has no Finite Base, Journal of Logic and Computation, 12: No 2,: 243-253(2002)
• Beauquier, D. Probabilistic timed automata. Theoretical Computer Science, 292(1): 65-84, (2003)
• Beauquier, D. On probabilistic timed automata. Theoretical Computer Science, 292 :65–84, 2003.
• Beauquier, D. and Nivat, M. A codicity undecidable problem in the plane. Theoretical Computer Science, 303(2-3) :417–430, 2003.
• Beauquier, D. and Nivat, M. A codicity undecidable problem in the plane, Theoretical Computer Science 303(2-3): 417-430, (2003)
• Beauquier, D. and Slissenko, A. Periodicity based decidable classes in a first order ti- med logic. Annals of Pure and Applied Logic, 139(1–3) :43–73, 2006. Available at http ://dx.doi.org/10.1016/j.apal.2005.03.003.
• Beauquier, D. Rabinovich, A. and Slissenko, A. A logic of probability with decidable model- checking. Journal of Logic and Computation, 16(4) :461–487, July 2006.

Publications dans des actes de colloques internationaux

• Beauquier, D. Ensembles reconnaissables de mots bi-infinis. Limite et déterminisme LNCS,192, pp. 28-46 (1984) Year="1984", Pages="28-46"
• Beauquier, D. Some results about finite and infinite behaviours of a pushdown automaton Proceedings of the 11th International Colloquium on Automata, Languages and Programming (ICALP'84) LNCS, 172, pp. 187-195 (1984)
• Beauquier, D. and Nivat, M. About rational sets of factors of a bi-infinite word ICALP'85 LNCS,194, pp. 33-42 (1985)
• Beauquier, D. and Nivat, M. Muller automata and bi-infinite words LNCS, 199, pp. 36-43 (1985)
• Beauquier, D. Thin homogeneous sets of factors LNCS, 241, pp.239-251 (1986)
• Beauquier, D. Minimal automaton of a rational cover (ICALP'87) LNCS, 267, pp. 174-189 (1987)
• Beauquier, D. Factors of words (ICALP'89) LNCS, 372, pp. 63-79 (1989)
• Beauquier, D. and Nivat, M. Tiling the plane with one tile Proceedings of the sixth annual Symposium on Computational Geometry ACM Press pp. 128-138 (1990)
• Beauquier, D. and Nivat, M. and Niwinski, D. About the effect of the number of successful paths in an infinite tree on the recognizability by a finite automaton with Buchi conditions Proceedings of the 8th International Conference Fundamentals of Computation Theory, (FCT 91) LNCS, 529, pp. 136-146 (1991)
• Beauquier, D. and Latteux, M. and Slowinski, K. A decidable result about convex polyominoes LNCS 583, pp. 32-45 (1992)
• Beauquier, D. and Podelski, A. Rabin tree automata and finite monoids Proceedings of MFCS'94, LNCS, (1994)
• Beauquier, D. D. Burago, D. and Slissenko, A. On the complexity of Finite Memory Policies for Markov Decision Proceedings of MFCS'95, LNCS, 969, pp.191-200, (1995)
• Beauquier, D. and Slissenko, A. The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and their Model-Checking in High-Level Languages Proceedings of TAPSOFT'97, LNCS 1214, pp. 201-212 (1997)
• Beauquier, D. Pumping Lemmas for timed automata Proceedings of FoSSaCS'98, LNCS, 1378, pp. 81-94 (1998)
• Beauquier, D. and Cohen, J. From timed automata to timed abstract state machines. In Proc. of the 2nd International Conf. on Computer Science and Information Technologies (CSIT'99)}, pages 18--23, 1999.
• Beauquier D. and Slissenko A. Decidable classes of the verification problem in a timed predicate logic. In Proc. of the 12th Intern. Symp. on Fundamentals of Computation Theory (FCT'99)}, number 1684 in Lecture Notes in Computer Science, pages 100--111, (1999)
• Beauquier, D. and Slissenko, A. Verification  of Timed Algorithms: Gurevich Abstract State Machines versus First Order Timed Logic,  Proc. of ASM2000 International Workshop, March 20?24, 2000, Switzerland, Monte Verita, Ticino, Y.Gurevich, P.Kutter, M.Odersky, L.Thiele, Eds. ETH, Zürich, 2000:22?39
• Beauquier, D. and Kossovski, N., and Smirnova, E..An algorithm for solvability testing of elementary linear inequalities systems. Proceedings of International Conference On Applications Of Computer Algebra. IMACS ACA 2000}, pages 59--61, (2000).
• Beauquier,D. and Crolard, T. and Durand, A. and Slissenko, A. Impossibility of "essential" real-time garbage collection in the general case. In Proc. of the 3nd International Conf. on Computer Science and Information Technologies, September 17?22, 2001, Yerevan, Armenia, pages 113—117. National Academy of Sciences of Armenia, 2001
• Beauquier, D. and Prokofieva, E. A predicate logic framework for mechanical verification of real-time systems: A case study,  Intern. Conf. on Applications of Computer Algebra (ACA’02), Volos, Grèce, Juin 2002
• Beauquier, D. and Rabinovich, A. and Slissenko, A.   A logic of probability with decidable model-checking, Proc. of Intern. Conf. on  Computer Science Logic  (CSL’02), Edinburgh, Septembre 2002, Lect. Notes. Comput. Sci., 2002
• Beauquier, D. and Crolard, T. and Prokofieva, E. Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic,Proc. of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS2004), Barcelona, Spain, March 29 -- April 2, 2004.Lecture Notes in Computer Science, 2988:372--387 (2004)
• Beauquier, D. Secrecy for cryptographic protocols is easy,  Proceedings of SYNASC'04 - CAVIS (2004)
• Beauquier, D. Duflot, M. and Minea, M. A probabilistic property-specific approach to information flow. In Third International Workshop "Mathematical Methods, Models and Architectures for Computer Networks Security, volume 3685, pages 206–220, Timisoara (Roumanie), September 2005.
• Beauquier, D. and Lanotte, R. Hiding information in multi level systems. In Fourth International Workshop on Formal Aspects in Security and Trust (FAST2006), Lecture Notes in Computer Science, vol. 4691, pages 450–469, Springer Verlag, 2007.
• Beauquier, D. and Gauche, F. How to guarantee secrecy for cryptographic protocols. In Sixth International Conference on Computer Science and Information Technologies (CSIT 2007), pages 95–104, September 2007.
• Beauquier, D. and Duflot, M. and Lifshits, Y. Decidability of parameterized probabilistic information flow. In Second International Symposium on Computer Science in Russia, CSR 2007, volume 4649, pages 82–91, Ekaterinburg (Russie), September 2007
• Beauquier, D. and Cohen, J. and Lanotte, R. Security policies enforcement using finite edit automata. To appear, July 2008

Rapports internes

• Beauquier, D. and Nivat, M. Codicity and simplicity in the plane TR 88.65 (LITP) (1988)
• Beauquier, D. and Nivat, M. Tiling pictures of the plane with two bars, a horizontal and a vertical one TR 91.67 (LITP) (1991)
• Beauquier, D. and Burago, D. and Slissenko, A. On the complexity of Markov strategies in planning of motion with uncertain deviations TR Paris 12 94-03 (1994)
• Beauquier, D. and Slissenko, A. On Semantics of Algorithms with Continuous Time TR 97-15 LAcd CL
• Beauquier, D. Probabilistic omega-rational events. Technical report, Université Paris-12, Laboratoire d'Algorithmique Complexité et Logique, 2000. 9 p., submitted to IPL.
• Beauquier, D. and Slissenko, A. A first order logic for specification of timed algorithms:basic properties and a decidable class. Technical Report TR-00-23.ps.gz, Université Paris-12, Laboratoire d'Algorithmique, Complexité et Logique,37 p., (2000).
• Beauquier, D. and Rabinovich, A. Monadic logic of order over naturals has no finite base.Technical Report TR-00-24.ps.gz, Université Paris-12, Laboratoire d'Algorithmique, Complexité et Logique,( 2000).
• Beauquier, D. and Crolard, T., and Slissenko, A. A predicate logic framework for mechanical verification of real-time Gurevich abstrac t state machines: A case study with PVS.Technical Report TR-00-25.ps.gz, Université Paris-12, Laboratoire d'Algorithmique, Complexité et Logique,( 2000). 15 p.+xx, to submit.
• Beauquier, D. and Fournier J. C..Groups and Tilings.Technical Report TR-2001-03.ps.gz, Université Paris-12, Laboratoire d'Algorithmique, Complexité et Logique,( 2001). 15 p.+xx, submitted.
• Beauquier, D. Rabinovich, A. and Slissenko A..A logic of probability with decidable model-checking .Technical Report TR-2001-05.ps.gz, Université Paris-12, Laboratoire d'Algorithmique, Complexité et Logique,( 2001). 13 p.+xx, .
• D. Beauquier, T. Crolard, and E. Prokofieva. Automatic Parametric Verification of Root Contention Protocol based on Abstract State Machines and First Order Timed Logic. Technical Report 2003-08.pdf, University of Paris 12, LACL, 2003.
• D. Beauquier and A. Slissenko. Periodicity Based Decidable Classes in a First Order Timed Logic. Technical Report 2004-04;pdf, University of Paris 12, LACL, 2004.

Thèses

• Automates à piles et mots infinis Thèse de 3^ème cycle (1984)
• Beauquier, D. Automates de mots bi-infinis Thèse d'Etat (1986)

retour à l'annuaire