# Anthony Widjaja Lin

According to our database

Collaborative distances:

^{1}, Anthony Widjaja Lin authored at least 56 papers between 2003 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepages:

#### On csauthors.net:

## Bibliography

2019

Decision procedures for path feasibility of string-manipulating programs with complex operations.

PACMPL, 2019

Monadic Decomposability of Regular Relations.

CoRR, 2019

2018

Decidable models of integer-manipulating programs with recursive parallelism.

Theor. Comput. Sci., 2018

String constraints with concatenation and transducers solved efficiently.

PACMPL, 2018

What is decidable about string constraints with the ReplaceAll function.

PACMPL, 2018

CSS Minification via Constraint Solving (Technical Report).

CoRR, 2018

Decision Procedures for Path Feasibility of String-Manipulating Programs with Complex Operations.

CoRR, 2018

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility.

CoRR, 2018

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility.

Proceedings of the Automated Technology for Verification and Analysis, 2018

Complexity Analysis of Tree Share Structure.

Proceedings of the Programming Languages and Systems - 16th Asian Symposium, 2018

2017

What Is Decidable about String Constraints with the ReplaceAll Function.

CoRR, 2017

Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report).

CoRR, 2017

Learning to Prove Safety over Parameterised Concurrent Systems (Full Version).

CoRR, 2017

Fair Termination for Parameterized Probabilistic Concurrent Systems.

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Learning to prove safety over parameterised concurrent systems.

Proceedings of the 2017 Formal Methods in Computer Aided Design, 2017

2016

Liveness of Randomised Parameterised Systems under Arbitrary Schedulers (Technical Report).

CoRR, 2016

Decidable models of integer-manipulating programs with recursive parallelism (technical report).

CoRR, 2016

A linear-time algorithm for the orbit problem over cyclic groups.

Acta Inf., 2016

Regular Symmetry Patterns.

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

Decidable Models of Integer-Manipulating Programs with Recursive Parallelism.

Proceedings of the Reachability Problems - 10th International Workshop, 2016

String solving with word equations and transducers: towards a logic for analysing mutation XSS.

Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

Decidability and Complexity of Tree Share Formulas.

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Liveness of Randomised Parameterised Systems under Arbitrary Schedulers.

Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015

Regular Symmetry Patterns (Technical Report).

CoRR, 2015

String Solving with Word Equations and Transducers: Towards a Logic for Analysing Mutation XSS (Full Version).

CoRR, 2015

Expressive Path Queries on Graph with Data.

Logical Methods in Computer Science, 2015

Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach.

Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, 2015

2014

Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems.

ACM Trans. Comput. Log., 2014

A linear time algorithm for the orbit problem over cyclic groups.

CoRR, 2014

Detecting Redundant CSS Rules in HTML5 Applications: A Tree-Rewriting Approach.

CoRR, 2014

Analysis of Probabilistic Basic Parallel Processes.

CoRR, 2014

Analysis of Probabilistic Basic Parallel Processes.

Proceedings of the Foundations of Software Science and Computation Structures, 2014

A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups.

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013

Expressive Path Queries on Graphs with Data.

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

2012

Expressive Languages for Path Queries over Graph-Structured Data.

ACM Trans. Database Syst., 2012

Concurrency Makes Simple Theories Hard.

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Weakly-Synchronized Ground Tree Rewriting - (with Applications to Verifying Multithreaded Programs).

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Accelerating tree-automatic relations.

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters.

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011

The Complexity of Verifying Ground Tree Rewrite Systems.

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems.

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Model Checking Recursive Programs with Numeric Data Types.

Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010

Logical queries over views: Decidability and expressiveness.

ACM Trans. Comput. Log., 2010

Parikh Images of Regular Languages: Complexity and Applications

CoRR, 2010

Parikh Images of Grammars: Complexity and Applications.

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems.

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems.

Proceedings of the Foundations of Software Science and Computational Structures, 2010

2009

Unary finite automata vs. arithmetic progressions.

Inf. Process. Lett., 2009

Algorithmic metatheorems for decidable LTL model checking over infinite systems

CoRR, 2009

On the Computational Complexity of Verifying One-Counter Processes.

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Model Checking FO(R) over One-Counter Processes and beyond.

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008

Unary finite automata vs. arithmetic progressions

CoRR, 2008

Logical Queries over Views: Decidability and Expressiveness

CoRR, 2008

Recurrent Reachability Analysis in Regular Model Checking.

Proceedings of the Logic for Programming, 2008

2006

Review of "Algebraic Complexity Theory by Peter Bürgisser, Michael Clausen and Amin Shokrollahi", Springer 1997.

SIGACT News, 2006

2003

Review of Algorithms sequential & parallel: a unified approach by R. Miller & L. Boxer. Prentice Hall 2000.

SIGACT News, 2003