Margus Veanes

According to our database1, Margus Veanes authored at least 92 papers between 1996 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Symbolic Regex Matcher.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

2018
Theoretical Aspects of Symbolic Automata.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

Simulation Algorithms for Symbolic Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2018

2017
Monadic Decomposition.
J. ACM, 2017

Prepose: Privacy, Security, and Reliability for Gesture-Based Programming.
IEEE Security & Privacy, 2017

Forward Bisimulations for Nondeterministic Symbolic Finite Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Monadic second-order logic on finite sequences.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Fusing effectful comprehensions.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

Translating C# to Branching Symbolic Transducers.
Proceedings of the IWIL@LPAR 2017 Workshop and LPAR-21 Short Presentations, 2017

Symbolic Automata Theory with Applications (Invited Talk).
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

Minimization of Symbolic Transducers.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

The Power of Symbolic Automata and Transducers.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
Prepose: Privacy, Security, and Reliability for Gesture-Based Programming.
Proceedings of the IEEE Symposium on Security and Privacy, 2016

Minimization of Symbolic Tree Automata.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015
Fast: A Transducer-Based Language for Tree Manipulation.
ACM Trans. Program. Lang. Syst., 2015

Symbolic tree automata.
Inf. Process. Lett., 2015

Extended symbolic finite automata and transducers.
Formal Methods in System Design, 2015

Data-Parallel String-Manipulating Programs.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Program Boosting: Program Synthesis via Crowd-Sourcing.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Symbolic WS1S.
Proceedings of the 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, 2015

Equivalence of Finite-Valued Symbolic Finite Transducers.
Proceedings of the Perspectives of System Informatics, 2015

2014
Minimization of symbolic automata.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Fast: a transducer-based language for tree manipulation.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2014

Skolemization Modulo Theories.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Symbolic String Transformations with Regular Lookahead and Rollback.
Proceedings of the Perspectives of System Informatics, 2014

Monadic Decomposition.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013
Symbolic Methods in Testing (Dagstuhl Seminar 13021).
Dagstuhl Reports, 2013

Applications of Symbolic Finite Automata.
Proceedings of the Implementation and Application of Automata, 2013

Static Analysis of String Encoders and Decoders.
Proceedings of the Verification, 2013

Effectively Monadic Predicates.
Proceedings of the LPAR 2013, 2013

Operating System Support for Augmented Reality Applications.
Proceedings of the 14th Workshop on Hot Topics in Operating Systems, 2013

Equivalence of Extended Symbolic Finite Transducers.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012
Alternating simulation and IOCO.
STTT, 2012

Symbolic Automata: The Toolkit.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Beyond First-Order Satisfaction: Fixed Points, Interpolants, Automata and Polynomials.
Proceedings of the Model Checking Software - 19th International Workshop, 2012

Symbolic finite state transducers: algorithms and applications.
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

SMT-LIB Sequences and Regular Expressions.
Proceedings of the 10th International Workshop on Satisfiability Modulo Theories, 2012

2011
Foundations of Finite Symbolic Tree Transducers.
Bulletin of the EATCS, 2011

An Evaluation of Automata Algorithms for String Analysis.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2011

Fast and Precise Sanitizer Analysis with BEK.
Proceedings of the 20th USENIX Security Symposium, 2011

Symbolic Tree Transducers.
Proceedings of the Perspectives of Systems Informatics, 2011

2010
Composing model programs for analysis.
J. Log. Algebr. Program., 2010

Alternating Simulation and IOCO.
Proceedings of the Testing Software and Systems, 2010

Qex: Symbolic SQL Query Explorer.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Symbolic Automata Constraint Solving.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Rex: Symbolic Regular Expression Explorer.
Proceedings of the Third International Conference on Software Testing, 2010

2009
Symbolic Bounded Model Checking of Abstract State Machines.
Int. J. Software and Informatics, 2009

Model-Based Testing of Web Applications Using NModel.
Proceedings of the Testing of Software and Communication Systems, 2009

Input-Output Model Programs.
Proceedings of the Theoretical Aspects of Computing, 2009

Symbolic Query Exploration.
Proceedings of the Formal Methods and Software Engineering, 2009

Symbolic Bounded Conformance Checking of Model Programs.
Proceedings of the Perspectives of Systems Informatics, 2009

2008
On Bounded Reachability of Programs with Set Comprehensions.
Proceedings of the Logic for Programming, 2008

Model-Based Testing of Object-Oriented Reactive Systems with Spec Explorer.
Proceedings of the Formal Methods and Testing, 2008

Protocol Modeling with Model Program Composition.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2008

An SMT Approach to Bounded Reachability Analysis of Model Programs.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2008

Using Satisfiability Modulo Theories to Analyze Abstract State Machines (Abstract).
Proceedings of the Abstract State Machines, B and Z, First International Conference, 2008

2007
Can abstract state machines be useful in language theory?
Theor. Comput. Sci., 2007

Adapting Futures: Scalability for Real-World Computing.
Proceedings of the 28th IEEE Real-Time Systems Symposium (RTSS 2007), 2007

State Isomorphism in Model Programs with Abstract Data Structures.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2007

Composition of Model Programs.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2007

2006
Online Testing with Reinforcement Learning.
Proceedings of the Formal Approaches to Software Testing and Runtime Verification, 2006

2005
Online testing with model programs.
Proceedings of the 10th European Software Engineering Conference held jointly with 13th ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2005

Action Machines - Towards a Framework for Model Composition, Exploration and Conformance Testing Based on Symbolic Computation.
Proceedings of the Fifth International Conference on Quality Software (QSIC 2005), 2005

Multiplexing of Partially Ordered Events.
Proceedings of the Testing of Communicating Systems, 2005

Testing Concurrent Object-Oriented Systems with Spec Explorer.
Proceedings of the FM 2005: Formal Methods, 2005

Play to Test.
Proceedings of the Formal Approaches to Software Testing, 5th International Workshop, 2005

State Exploration with Multiple State Groupings.
Proceedings of the 12th International Workshop on Abstract State Machines, 2005

2004
Abstract Communication Model for Distributed Systems.
IEEE Trans. Software Eng., 2004

Instrumenting scenarios in a model-driven development environment.
Information & Software Technology, 2004

Optimal strategies for testing nondeterministic systems.
Proceedings of the ACM/SIGSOFT International Symposium on Software Testing and Analysis, 2004

2003
Validating Use-Cases with the AsmL Test Tool.
Proceedings of the 3rd International Conference on Quality Software (QSIC 2003), 2003

Towards a Tool Environment for Model-Based Testing with AsmL.
Proceedings of the Formal Approaches to Software Testing, 2003

Test Case Generation from AsmL Specifications.
Proceedings of the Abstract State Machines, 2003

2002
Generating finite state machines from abstract state machines.
Proceedings of the International Symposium on Software Testing and Analysis, 2002

Universal Plug and Play Machine Models.
Proceedings of the Design and Analysis of Distributed Embedded Systems, IFIP 17<sup>th</sup> World Computer Congress, 2002

High-Level Executable Specification of the Universal Plug and Play Architecture.
Proceedings of the 35th Hawaii International Conference on System Sciences (HICSS-35 2002), 2002

Modeling Software: From Theory to Practice.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

2000
Decidability and complexity of simultaneous rigid E-unification with one variable and related results.
Theor. Comput. Sci., 2000

Farmer's Theorem revisited.
Inf. Process. Lett., 2000

Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification.
Int. J. Found. Comput. Sci., 2000

On the Undecidability of Second-Order Unification.
Inf. Comput., 2000

Using Abstract State Machines at Microsoft: A Case Study.
Proceedings of the Abstract State Machines, 2000

1999
Logic with Equality: Partisan Corroboration and Shifted Pairing.
Inf. Comput., 1999

The Two-Variable Guarded Fragment with Transitive Relations.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Decidable Fragments of Simultaneous Rigid Reachability.
Proceedings of the Automata, 1999

1998
The Decidability of Simultaneous Rigid E-Unification with One Variable.
Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

The Relation Between Second-Order Unification and Simultaneous Rigid E-Unification.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

Rigid Reachability.
Proceedings of the Advances in Computing Science, 1998

1997
The Undecidability of Simultaneous Rigid E-Unification with Two Variables.
Proceedings of the Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, 1997

1996
Natural Cycletrees: Flexible Interconnection Graphs.
J. Parallel Distrib. Comput., 1996

Construction of Natural Cycletrees.
Inf. Process. Lett., 1996

On the Number of Edges in Cycletrees.
Inf. Process. Lett., 1996


  Loading...