Anca Muscholl
Anca Muscholl
LaBRI, Univ. of Bordeaux
Verified email at labri.fr - Homepage
TitleCited byYear
Two-variable logic on data trees and XML reasoning
M Bojańczyk, A Muscholl, T Schwentick, L Segoufin
Journal of the ACM (JACM) 56 (3), 13, 2009
2282009
Two-variable logic on words with data
M Bojanczyk, A Muscholl, T Schwentick, L Segoufin, C David
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 7-16, 2006
2172006
Deciding properties for message sequence charts
A Muscholl, D Peled, Z Su
International Conference on Foundations of Software Science and Computation …, 1998
1561998
Two-variable logic on data words
M Bojańczyk, C David, A Muscholl, T Schwentick, L Segoufin
ACM Transactions on Computational Logic (TOCL) 12 (4), 27, 2011
1482011
Message sequence graphs and decision problems on Mazurkiewicz traces
A Muscholl, D Peled
International Symposium on Mathematical Foundations of Computer Science, 81-91, 1999
1421999
Counting in trees for free
H Seidl, T Schwentick, A Muscholl, P Habermehl
International Colloquium on Automata, Languages, and Programming, 1136-1149, 2004
1062004
Compositional message sequence charts
EL Gunter, A Muscholl, DA Peled
International Conference on Tools and Algorithms for the Construction and …, 2001
942001
Numerical document queries
H Seidl, T Schwentick, A Muscholl
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on …, 2003
922003
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
B Genest, D Kuske, A Muscholl
Information and Computation 204 (6), 920-956, 2006
892006
Logical definability on infinite traces
W Ebinger, A Muscholl
Theoretical Computer Science 154 (1), 67-84, 1996
721996
A lower bound on web services composition
A Muscholl, I Walukiewicz
International Conference on Foundations of Software Science and …, 2007
632007
Reachability analysis of communicating pushdown systems
A Heußner, J Leroux, A Muscholl, G Sutre
International Conference on Foundations of Software Science and …, 2010
592010
Infinite-state high-level MSCs: Model-checking and realizability
B Genest, A Muscholl, H Seidl, M Zeitoun
Journal of Computer and System Sciences 72 (4), 617-647, 2006
542006
Synthesis of distributed algorithms using asynchronous automata
A Ştefănescu, J Esparza, A Muscholl
International Conference on Concurrency Theory, 27-41, 2003
532003
Infinite-state high-level MSCs: Model-checking and realizability
B Genest, A Muscholl, H Seidl, M Zeitoun
International Colloquium on Automata, Languages, and Programming, 657-668, 2002
502002
Computing ϵ-Free NFA from Regular Expressions in O(n log2(n)) Time
C Hagenah, A Muscholl
RAIRO-Theoretical Informatics and Applications 34 (4), 257-277, 2000
482000
Bounded MSC communication
M Lohrey, A Muscholl
Information and Computation 189 (2), 160-181, 2004
452004
Logical definability on infinite traces
W Ebinger, A Muscholl
International Colloquium on Automata, Languages, and Programming, 335-346, 1993
441993
Characterizations of classes of graphs recognizable by local computations
E Godard, Y Métivier, A Muscholl
Theory of Computing Systems 37 (2), 249-293, 2004
382004
Message sequence charts
B Genest, A Muscholl, D Peled
Advanced Course on Petri Nets, 537-558, 2003
372003
The system can't perform the operation now. Try again later.
Articles 1–20