Anca Muscholl (born 1967)[1] is a Romanian-German mathematical logician and theoretical computer scientist known for her work on formal verification, model checking, and two-variable logic. She is a researcher at the Laboratoire bordelais de recherche en informatique [fr] (LaBRI), a professor at the University of Bordeaux, and a former junior member of the Institut Universitaire de France.[2]

Education and career

edit

Muscholl was born in Bucharest,[3] came to Germany as a teenage refugee in 1984,[4] and won first place in two German national mathematics competitions (the Bundeswettbewerb Mathematik [de]) in 1985 and 1986.[2][4] She earned a master's degree at the Technical University of Munich,[2] and completed her Ph.D. at the University of Stuttgart in 1994. Her dissertation, Über die Erkennbarkeit unendlicher Spuren, was supervised by Volker Diekert [de] and published by Teubner Verlag in 1996.[3] She also earned a habilitation at the University of Stuttgart in 1999.[2]

After becoming a professor at Paris Diderot University in 1999, she moved to the University of Bordeaux in 2006.[2]

Recognition

edit

Muscholl was a junior member of the Institut Universitaire de France from 2007 to 2012.[2] She won the CNRS Silver Medal in 2010.[2][4]

References

edit
  1. ^ Birth year from German National Library catalog entry, retrieved 2021-03-29
  2. ^ a b c d e f g "Anca Muscholl, Hans Fischer Senior Fellow", Alumni fellows, TU Munich Institute for Advanced Study, retrieved 2021-03-29
  3. ^ a b Muscholl, Anca (1996), Über die Erkennbarkeit unendlicher Spuren, Teubner, ISBN 9783322953711 – via Google Books
  4. ^ a b c "Anca Muscholl, enseignante-chercheuse en informatique" (PDF), Médailles d'argent du CNRS (in French), CNRS, retrieved 2021-03-29
edit

📚 Artikel Terkait di Wikipedia

Percent sign

Petites leçons de typographie (PDF). Rennes: Institut de recherche en informatique et systèmes aléatoires. p. 34. Retrieved 8 June 2022. "El % se escribe

Pointwise mutual information

statistiques lexicales et filtres linguistiques. Thèse de Doctorat en Informatique Fondamentale. Université Paris 7. 1994. p.139 Tim Van de Cruys. 2011

Virtual method table

Atlanta, United States. pp.125-141. inria-00565627. Centre de Recherche en Informatique de Nancy Campus Scientifique, Bâtiment LORIA. p. 16. Ellis & Stroustrup

Big O notation

upper bounds" (PDF). RAIRO – Theoretical Informatics and Applications – Informatique Théorique et Applications. 23 (2): 180. ISSN 0988-3754. Archived (PDF)

Pick operating system

PICK et UNIX : la nouvelle norme informatique; Bruno Beninca; Aulnay-sous-Bois, Seine-Saint-Denis; Relais Informatique International, 1990. OCLC 23242884

Mellin transform

Asymptotics. Research Report 2956. 93 pages. Institut National de Recherche en Informatique et en Automatique (INRIA), 1996. A. Liam Fitzpatrick, Jared Kaplan, Joao

Esoteric programming language

Camille (2009). "Langages ésotériques". Poétique des codes sur le réseau informatique. Archives contemporaines. ISBN 978-2-914610-70-4. Cox, Geoff (2013).

Plactic monoid

Schützenberger, Marcel-Paul (1997), "Pour le monoïde plaxique", Mathématiques, Informatique et Sciences Humaines (140): 5–10, doi:10.4000/msh.2764, ISSN 0995-2314