Anca Muscholl

According to our database1, Anca Muscholl
  • authored at least 113 papers between 1993 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Static Analysis of Deterministic Negotiations.
CoRR, 2017

Soundness in negotiations.
CoRR, 2017

One-way definability of two-way word transducers.
CoRR, 2017

Untwisting two-way transducers in elementary time.
CoRR, 2017

Reachability for Dynamic Parametric Processes.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

On the Decomposition of Finite-Valued Streaming String Transducers.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Static analysis of deterministic negotiations.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Untwisting two-way transducers in elementary time.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

A Tour of Recent Results on Word Transducers.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
Controlling loosely cooperating processes.
Theor. Comput. Sci., 2016

Preface of STACS 2013 Special Issue.
Theory Comput. Syst., 2016

Walking on Data Words.
Theory Comput. Syst., 2016

ICALP 2017 - Call for Papers.
Bulletin of the EATCS, 2016

Reachability for dynamic parametric processes.
CoRR, 2016

On parametrized verification of asynchronous, shared-memory pushdown systems.
CoRR, 2016

Minimizing Resources of Sweeping and Streaming String Transducers.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Automated Synthesis: Going Distributed.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

Soundness in Negotiations.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
Automated Synthesis of Distributed Controllers.
CoRR, 2015

A Note on Monitors and Büchi automata.
CoRR, 2015

A Note on Monitors and Büchi Automata.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Automated Synthesis of Distributed Controllers.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

One-way Definability of Sweeping Transducer.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

On Distributed Monitoring and Synthesis.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
Distributed synthesis for acyclic architectures.
CoRR, 2014

Distributed Synthesis for Acyclic Architectures.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013
A quadratic construction for Zielonka automata with acyclic communication structure.
Theor. Comput. Sci., 2013

Call for Nominations For EATCS - Fellows 2014.
Bulletin of the EATCS, 2013

Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Recursive queries on trees and data trees.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Asynchronous Games over Tree Architectures.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Walking on Data Words.
Proceedings of the Computer Science - Theory and Applications, 2013

2012
Reachability Analysis of Communicating Pushdown Systems
Logical Methods in Computer Science, 2012

On distributed monitoring of asynchronous systems
CoRR, 2012

On Injective Embeddings of Tree Patterns
CoRR, 2012

Asynchronous Games over Tree Architectures
CoRR, 2012

On Distributed Monitoring of Asynchronous Systems.
Proceedings of the Logic, Language, Information and Computation, 2012

2011
Trace Theory.
Proceedings of the Encyclopedia of Parallel Computing, 2011

Two-variable logic on data words.
ACM Trans. Comput. Log., 2011

2010
Verifying Recursive Active Documents with Positive Data Tree Rewriting
CoRR, 2010

Analysis of Communicating Automata.
Proceedings of the Language and Automata Theory and Applications, 2010

Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Verifying Recursive Active Documents with Positive Data Tree Rewriting.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Reachability Analysis of Communicating Pushdown Systems.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

Taming Distributed Asynchronous Systems.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
Two-variable logic on data trees and XML reasoning.
J. ACM, 2009

2008
Pattern Matching and Membership for Hierarchical Message Sequence Charts.
Theory Comput. Syst., 2008

A Lower Bound on Web Services Composition.
Logical Methods in Computer Science, 2008

A lower bound on web services composition
CoRR, 2008

08171 Summary - Beyond the Finite: New Challenges in Verification and Semistructured Data.
Proceedings of the Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04., 2008

08171 Abstracts Collection - Beyond the Finite: New Challenges in Verification and Semistructured Data.
Proceedings of the Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04., 2008

Counting in trees.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

Tree Pattern Rewriting Systems.
Proceedings of the Automated Technology for Verification and Analysis, 2008

2007
Permutation rewriting and algorithmic verification.
Inf. Comput., 2007

On Communicating Automata with Bounded Channels.
Fundam. Inform., 2007

A Lower Bound on Web Services Composition.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

2006
Active Context-Free Games.
Theory Comput. Syst., 2006

Infinite-state high-level MSCs: Model-checking and realizability.
J. Comput. Syst. Sci., 2006

Complementing deterministic tree-walking automata.
Inf. Process. Lett., 2006

Solvability of Equations in Graph Groups Is Decidable.
IJAC, 2006

A Kleene theorem and model checking algorithms for existentially bounded communicating automata.
Inf. Comput., 2006

Two-variable logic on data trees and XML reasoning.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Two-Variable Logic on Words with Data.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Constructing Exponential-Size Deterministic Zielonka Automata.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
An NP-complete fragment of LTL.
Int. J. Found. Comput. Sci., 2005

Snapshot Verification.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

Message Sequence Charts: A Survey.
Proceedings of the Fifth International Conference on Application of Concurrency to System Design (ACSD 2005), 2005

2004
Characterizations of Classes of Graphs Recognizable by Local Computations.
Theory Comput. Syst., 2004

Bounded MSC communication.
Inf. Comput., 2004

Active Context-Free Games.
Proceedings of the STACS 2004, 2004

Counting in Trees for Free.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Specifying and Verifying Partial Order Properties Using Template MSCs.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

An NP-Complete Fragment of LTL.
Proceedings of the Developments in Language Theory, 2004

A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms.
Proceedings of the Developments in Language Theory, 2004

2003
Compositional message sequence charts.
STTT, 2003

Numerical document queries.
Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

Deciding Properties of Message Sequence Charts.
Proceedings of the Scenarios: Models, 2003

Synthesis of Distributed Algorithms Using Asynchronous Automata.
Proceedings of the CONCUR 2003, 2003

High-Level Message Sequence Charts and Projections.
Proceedings of the CONCUR 2003, 2003

Message Sequence Charts.
Proceedings of the Lectures on Concurrency and Petri Nets, 2003

2002
Preface.
Electr. Notes Theor. Comput. Sci., 2002

Pattern Matching and Membership for Hierarchical Message Sequence Charts.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Infinite-State High-Level MSCs: Model-Checking and Realizability.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Bounded MSC Communication.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001
Compositional Message Sequence Charts.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2001

Permutation Rewriting and Algorithmic Verification.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

From Finite State Communication Protocols to High-Level Message Sequence Charts.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Solvability of Equations in Free Partially Commutative Groups Is Decidable.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Computing epsilon-free NFA from regular expressions in O(n log2(n)) time.
ITA, 2000

Analyzing Message Sequence Charts.
Proceedings of the SAM 2000, 2000

1999
Solving Word Equations modulo Partial Commutations.
Theor. Comput. Sci., 1999

Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Matching Specifications for Message Sequence Charts.
Proceedings of the Foundations of Software Science and Computation Structure, 1999

Decision and complexity issues on concurrent systems.
Universität Stuttgart, 1999

1998
The Power of Local Computations in Graphs with Initial Knowledge.
Proceedings of the Theory and Application of Graph Transformations, 1998

Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Deciding Properties for Message Sequence Charts.
Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997
The Code Problem for Traces - Improving the Boundaries.
Theor. Comput. Sci., 1997

About the local detection of termination of local computations in graphs.
Proceedings of the SIROCCO'97, 1997

Solving Trace Equations Using Lexicographical Normal Forms.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
On the Complementation of Asynchronous Cellular Büchi Automata.
Theor. Comput. Sci., 1996

Logical Definability on Infinite Traces.
Theor. Comput. Sci., 1996

A Note on the Commutative Closure of Star-Free Languages.
Inf. Process. Lett., 1996

A Note on Métivier's Construction of Asynchronous Automata for Triangulated Graphs.
Fundam. Inform., 1996

Code Problems on Traces.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995
On Codings of Traces.
STACS, 1995

1994
Deterministic Asynchronous Automata for Infinite Traces.
Acta Inf., 1994

On the Complementation of Büchi Asynchronous Cellular Automata.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Über die Erkennbarkeit unendlicher Spuren.
PhD thesis, 1994

1993
Deterministic Asynchronous Automata for Infinite Traces.
Proceedings of the STACS 93, 1993

Logical Definability on Infinite Traces.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993


  Loading...