Anthony Widjaja Lin

Orcid: 0000-0003-4715-5096

Affiliations:
  • Technical University of Kaiserslautern, Germany
  • University of Edinburgh, UK (former)


According to our database1, Anthony Widjaja Lin authored at least 77 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Regular Abstractions for Array Systems.
Proc. ACM Program. Lang., January, 2024

Parikh's Theorem Made Symbolic.
Proc. ACM Program. Lang., January, 2024

Ramsey Quantifiers in Linear Arithmetics.
Proc. ACM Program. Lang., January, 2024

Relational Perspective on Graph Query Languages.
CoRR, 2024

Revisiting the Expressiveness Landscape of Data Graph Queries.
CoRR, 2024

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective.
CoRR, 2024

Logical Languages Accepted by Transformer Encoders with Hard Attention.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Concurrent Stochastic Lossy Channel Games.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

Characterising and Verifying the Core in Concurrent Multi-Player Mean-Payoff Games.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023
Characterising and Verifying the Core in Concurrent Multi-Player Mean-Payoff Games (Full Version).
CoRR, 2023

Decision Procedures for Sequence Theories (Technical Report).
CoRR, 2023

Decision Procedures for Sequence Theories.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
Solving string constraints with Regex-dependent functions through transducers with priorities and variables.
Proc. ACM Program. Lang., 2022

Data Path Queries over Embedded Graph Databases.
Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Reasoning on Data Words over Numeric Domains.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

CertiStr: a certified string solver.
Proceedings of the CPP '22: 11th ACM SIGPLAN International Conference on Certified Programs and Proofs, Philadelphia, PA, USA, January 17, 2022

2021
Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility.
Log. Methods Comput. Sci., 2021

CertiStr: A Certified String Solver (technical report).
CoRR, 2021

Learning Union of Integer Hypercubes with Queries (Technical Report).
CoRR, 2021

Regular Model Checking Approach to Knowledge Reasoning over Parameterized Systems (technical report).
CoRR, 2021

Rational Verification for Probabilistic Systems.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Learning Union of Integer Hypercubes with Queries - (with Applications to Monadic Decomposition).
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Regular Model Checking Revisited.
Proceedings of the Model Checking, Synthesis, and Learning, 2021

Regular Model Checking Approach to Knowledge Reasoning over Parameterized Systems.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020
Probabilistic Bisimulation for Parameterized Systems (Technical Report).
CoRR, 2020

String Constraints with Concatenation and Transducers Solved Efficiently (Technical Report).
CoRR, 2020

Regular Model Checking Revisited (Technical Report).
CoRR, 2020

Monadic Decomposition in Integer Linear Arithmetic (Technical Report).
CoRR, 2020

Monadic Decomposition in Integer Linear Arithmetic.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type.
Proceedings of the Automated Technology for Verification and Analysis, 2020

Parameterized Synthesis with Safety Properties.
Proceedings of the Programming Languages and Systems - 18th Asian Symposium, 2020

2019
CSS Minification via Constraint Solving.
ACM Trans. Program. Lang. Syst., 2019

Decision procedures for path feasibility of string-manipulating programs with complex operations.
Proc. ACM Program. Lang., 2019

Monadic Decomposability of Regular Relations.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Probabilistic Bisimulation for Parameterized Systems - (with Applications to Verifying Anonymous Protocols).
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018
Decidable models of integer-manipulating programs with recursive parallelism.
Theor. Comput. Sci., 2018

String constraints with concatenation and transducers solved efficiently.
Proc. ACM Program. Lang., 2018

What is decidable about string constraints with the ReplaceAll function.
Proc. ACM Program. Lang., 2018

CSS Minification via Constraint Solving (Technical Report).
CoRR, 2018

Complexity Analysis of Tree Share Structure.
Proceedings of the Programming Languages and Systems - 16th Asian Symposium, 2018

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 Informatica, 2016

Regular Symmetry Patterns.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 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.
Log. Methods Comput. Sci., 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

Analysis of Probabilistic Basic Parallel Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 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

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

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
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


  Loading...