default search action
Anthony Widjaja Lin
Anthony Widjaja To – Anthony W. Lin
Person information
- affiliation: Technical University of Kaiserslautern, Germany
- affiliation (former): University of Edinburgh, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j18]Pascal Bergsträßer
, Moses Ganardi
Ramsey Quantifiers in Linear Arithmetics. Proc. ACM Program. Lang. 8(POPL): 1-32 (2024) - [j17]Chih-Duo Hong
Regular Abstractions for Array Systems. Proc. ACM Program. Lang. 8(POPL): 638-666 (2024) - [j16]Matthew Hague
Parikh's Theorem Made Symbolic. Proc. ACM Program. Lang. 8(POPL): 1945-1977 (2024) - [c43]Julian Gutierrez, Anthony W. Lin, Muhammad Najib
Characterising and Verifying the Core in Concurrent Multi-Player Mean-Payoff Games. CSL 2024: 32:1-32:25 - [c42]Daniel Stan
Concurrent Stochastic Lossy Channel Games. CSL 2024: 46:1-46:19 - [c41]Pablo Barceló, Alexander Kozachinskiy, Anthony Widjaja Lin, Vladimir V. Podolskii:
Logical Languages Accepted by Transformer Encoders with Hard Attention. ICLR 2024 - [i42]Chih-Duo Hong, Anthony W. Lin:
Regular Abstractions for Array Systems. CoRR abs/2401.02618 (2024) - [i41]Pascal Bergsträßer, Chris Köcher, Anthony Widjaja Lin, Georg Zetzsche:
The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective. CoRR abs/2405.16166 (2024) - [i40]Michael Benedikt, Anthony Widjaja Lin, Di-De Yen:
Revisiting the Expressiveness Landscape of Data Graph Queries. CoRR abs/2406.17871 (2024) - [i39]Diego Figueira, Anthony W. Lin, Liat Peterfreund:
Relational Perspective on Graph Query Languages. CoRR abs/2407.06766 (2024) - 2023
- [c40]Artur Jez
Decision Procedures for Sequence Theories. CAV (2) 2023: 18-40 - [i38]Artur Jez, Anthony W. Lin, Oliver Markgraf, Philipp Rümmer:
Decision Procedures for Sequence Theories (Technical Report). CoRR abs/2308.00175 (2023) - [i37]Pablo Barceló, Alexander Kozachinskiy, Anthony Widjaja Lin, Vladimir V. Podolskii:
Logical Languages Accepted by Transformer Encoders with Hard Attention. CoRR abs/2310.03817 (2023) - [i36]Matthew Hague, Artur Jez, Anthony W. Lin:
Parikh's Theorem Made Symbolic. CoRR abs/2311.03901 (2023) - [i35]Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche:
Ramsey Quantifiers in Linear Arithmetics. CoRR abs/2311.04031 (2023) - [i34]Julian Gutierrez, Anthony W. Lin, Muhammad Najib, Thomas Steeples, Michael J. Wooldridge:
Characterising and Verifying the Core in Concurrent Multi-Player Mean-Payoff Games (Full Version). CoRR abs/2311.15883 (2023) - [i33]Daniel Stan, Muhammad Najib, Anthony Widjaja Lin, Parosh Aziz Abdulla:
Concurrent Stochastic Lossy Channel Games. CoRR abs/2311.17037 (2023) - 2022
- [j15]Taolue Chen
Solving string constraints with Regex-dependent functions through transducers with priorities and variables. Proc. ACM Program. Lang. 6(POPL): 1-31 (2022) - [c39]Shuanglong Kan
CertiStr: a certified string solver. CPP 2022: 210-224 - [c38]Pascal Bergsträßer
Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. LICS 2022: 28:1-28:14 - [c37]Diego Figueira, Anthony Widjaja Lin:
Reasoning on Data Words over Numeric Domains. LICS 2022: 37:1-37:13 - [c36]Diego Figueira, Artur Jez, Anthony W. Lin:
Data Path Queries over Embedded Graph Databases. PODS 2022: 189-201 - [e2]Anthony W. Lin, Georg Zetzsche, Igor Potapov:
Reachability Problems - 16th International Conference, RP 2022, Kaiserslautern, Germany, October 17-21, 2022, Proceedings. Lecture Notes in Computer Science 13608, Springer 2022, ISBN 978-3-031-19134-3 [contents] - [i32]Pascal Bergsträßer
Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. CoRR abs/2205.09015 (2022) - 2021
- [j14]Anthony W. Lin, Rupak Majumdar:
Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility. Log. Methods Comput. Sci. 17(4) (2021) - [c35]Daniel Stan, Anthony W. Lin
Regular Model Checking Approach to Knowledge Reasoning over Parameterized Systems. AAMAS 2021: 1254-1262 - [c34]Anthony W. Lin
Regular Model Checking Revisited. Model Checking, Synthesis, and Learning 2021: 97-114 - [c33]Oliver Markgraf
Learning Union of Integer Hypercubes with Queries - (with Applications to Monadic Decomposition). CAV (2) 2021: 243-265 - [c32]Julian Gutierrez, Lewis Hammond, Anthony W. Lin
Rational Verification for Probabilistic Systems. KR 2021: 312-322 - [i31]Daniel Stan, Anthony Widjaja Lin:
Regular Model Checking Approach to Knowledge Reasoning over Parameterized Systems (technical report). CoRR abs/2102.04361 (2021) - [i30]Oliver Markgraf, Daniel Stan, Anthony W. Lin:
Learning Union of Integer Hypercubes with Queries (Technical Report). CoRR abs/2105.13071 (2021) - [i29]Julian Gutierrez, Lewis Hammond, Anthony W. Lin, Muhammad Najib, Michael J. Wooldridge:
Rational Verification for Probabilistic Systems. CoRR abs/2107.09119 (2021) - [i28]Taolue Chen, Alejandro Flores-Lamas, Matthew Hague, Zhilei Han, Denghang Hu, Shuanglong Kan, Anthony Widjaja Lin, Philipp Rümmer, Zhilin Wu:
Solving String Constraints With Regex-Dependent Functions Through Transducers With Priorities And Variables. CoRR abs/2111.04298 (2021) - [i27]Shuanglong Kan, Anthony W. Lin, Philipp Rümmer, Micha Schrader:
CertiStr: A Certified String Solver (technical report). CoRR abs/2112.06039 (2021) - 2020
- [c31]Oliver Markgraf, Chih-Duo Hong
Parameterized Synthesis with Safety Properties. APLAS 2020: 273-292 - [c30]Taolue Chen
A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type. ATVA 2020: 325-342 - [c29]Matthew Hague
Monadic Decomposition in Integer Linear Arithmetic. IJCAR (1) 2020: 122-140 - [i26]Matthew Hague, Anthony Widjaja Lin, Philipp Rümmer, Zhilin Wu:
Monadic Decomposition in Integer Linear Arithmetic (Technical Report). CoRR abs/2004.12371 (2020) - [i25]Anthony W. Lin, Philipp Rümmer:
Regular Model Checking Revisited (Technical Report). CoRR abs/2005.00990 (2020) - [i24]Taolue Chen, Matthew Hague, Jinlong He, Denghang Hu, Anthony Widjaja Lin, Philipp Rümmer, Zhilin Wu:
A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type. CoRR abs/2007.06913 (2020) - [i23]Anthony W. Lin, Rupak Majumdar:
Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility. CoRR abs/2007.15478 (2020) - [i22]Oliver Markgraf, Chih-Duo Hong, Anthony W. Lin, Muhammad Najib, Daniel Neider:
Parameterized Synthesis with Safety Properties. CoRR abs/2009.13459 (2020) - [i21]Xuan Bach Le, Aquinas Hobor, Anthony W. Lin:
Complexity Analysis of Tree Share Structure. CoRR abs/2010.02340 (2020) - [i20]Lukás Holík, Petr Janku, Anthony W. Lin, Philipp Rümmer, Tomás Vojnar:
String Constraints with Concatenation and Transducers Solved Efficiently (Technical Report). CoRR abs/2010.15975 (2020) - [i19]Chih-Duo Hong, Anthony W. Lin, Rupak Majumdar, Philipp Rümmer:
Probabilistic Bisimulation for Parameterized Systems (Technical Report). CoRR abs/2011.02413 (2020)
2010 – 2019
- 2019
- [j13]Taolue Chen
Decision procedures for path feasibility of string-manipulating programs with complex operations. Proc. ACM Program. Lang. 3(POPL): 49:1-49:30 (2019) - [j12]Matthew Hague
CSS Minification via Constraint Solving. ACM Trans. Program. Lang. Syst. 41(2): 12:1-12:76 (2019) - [c28]Chih-Duo Hong
Probabilistic Bisimulation for Parameterized Systems - (with Applications to Verifying Anonymous Protocols). CAV (1) 2019: 455-474 - [c27]Pablo Barceló
Monadic Decomposability of Regular Relations. ICALP 2019: 103:1-103:14 - [e1]Anthony Widjaja Lin
Programming Languages and Systems - 17th Asian Symposium, APLAS 2019, Nusa Dua, Bali, Indonesia, December 1-4, 2019, Proceedings. Lecture Notes in Computer Science 11893, Springer 2019, ISBN 978-3-030-34174-9 [contents] - [i18]Pablo Barceló, Chih-Duo Hong, Xuan Bach Le, Anthony W. Lin, Reino Niskanen:
Monadic Decomposability of Regular Relations. CoRR abs/1903.00728 (2019) - 2018
- [j11]Taolue Chen
What is decidable about string constraints with the ReplaceAll function. Proc. ACM Program. Lang. 2(POPL): 3:1-3:29 (2018) - [j10]Lukás Holík, Petr Janku, Anthony W. Lin
String constraints with concatenation and transducers solved efficiently. Proc. ACM Program. Lang. 2(POPL): 4:1-4:32 (2018) - [j9]Matthew Hague
Decidable models of integer-manipulating programs with recursive parallelism. Theor. Comput. Sci. 750: 24-37 (2018) - [c26]Xuan Bach Le, Aquinas Hobor, Anthony W. Lin:
Complexity Analysis of Tree Share Structure. APLAS 2018: 89-108 - [c25]Anthony W. Lin, Rupak Majumdar:
Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility. ATVA 2018: 352-369 - [i17]Anthony W. Lin, Rupak Majumdar:
Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility. CoRR abs/1805.06701 (2018) - [i16]Taolue Chen, Matthew Hague, Anthony W. Lin, Philipp Rümmer, Zhilin Wu:
Decision Procedures for Path Feasibility of String-Manipulating Programs with Complex Operations. CoRR abs/1811.03167 (2018) - [i15]Matthew Hague, Anthony W. Lin, Chih-Duo Hong:
CSS Minification via Constraint Solving (Technical Report). CoRR abs/1812.02989 (2018) - 2017
- [c24]Yu-Fang Chen, Chih-Duo Hong
Learning to prove safety over parameterised concurrent systems. FMCAD 2017: 76-83 - [c23]Ondrej Lengál
Fair Termination for Parameterized Probabilistic Concurrent Systems. TACAS (1) 2017: 499-517 - [i14]Yu-Fang Chen, Chih-Duo Hong, Anthony W. Lin, Philipp Rümmer:
Learning to Prove Safety over Parameterised Concurrent Systems (Full Version). CoRR abs/1709.07139 (2017) - [i13]Ondrej Lengál, Anthony W. Lin, Rupak Majumdar, Philipp Rümmer:
Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report). CoRR abs/1710.10756 (2017) - [i12]Taolue Chen, Yan Chen, Matthew Hague, Anthony W. Lin, Zhilin Wu:
What Is Decidable about String Constraints with the ReplaceAll Function. CoRR abs/1711.03363 (2017) - 2016
- [j8]Anthony W. Lin
A linear-time algorithm for the orbit problem over cyclic groups. Acta Informatica 53(5): 493-508 (2016) - [c22]Anthony W. Lin, Philipp Rümmer:
Liveness of Randomised Parameterised Systems under Arbitrary Schedulers. CAV (2) 2016: 112-133 - [c21]Xuan Bach Le, Aquinas Hobor, Anthony W. Lin
Decidability and Complexity of Tree Share Formulas. FSTTCS 2016: 19:1-19:14 - [c20]Anthony Widjaja Lin
String solving with word equations and transducers: towards a logic for analysing mutation XSS. POPL 2016: 123-136 - [c19]Matthew Hague
Decidable Models of Integer-Manipulating Programs with Recursive Parallelism. RP 2016: 148-162 - [c18]Anthony W. Lin, Truong Khanh Nguyen, Philipp Rümmer, Jun Sun
Regular Symmetry Patterns. VMCAI 2016: 455-475 - [i11]Matthew Hague, Anthony Widjaja Lin:
Decidable models of integer-manipulating programs with recursive parallelism (technical report). CoRR abs/1605.06868 (2016) - [i10]Anthony W. Lin, Philipp Rümmer:
Liveness of Randomised Parameterised Systems under Arbitrary Schedulers (Technical Report). CoRR abs/1606.01451 (2016) - 2015
- [j7]Pablo Barceló, Gaëlle Fontaine, Anthony Widjaja Lin
Expressive Path Queries on Graph with Data. Log. Methods Comput. Sci. 11(4) (2015) - [c17]Matthew Hague
Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach. OOPSLA 2015: 1-19 - [i9]Anthony W. Lin, Truong Khanh Nguyen, Philipp Rümmer, Jun Sun:
Regular Symmetry Patterns (Technical Report). CoRR abs/1510.08506 (2015) - [i8]Anthony W. Lin, Pablo Barceló:
String Solving with Word Equations and Transducers: Towards a Logic for Analysing Mutation XSS (Full Version). CoRR abs/1511.01633 (2015) - 2014
- [j6]Stefan Göller, Anthony Widjaja Lin
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. ACM Trans. Comput. Log. 15(4): 26:1-26:28 (2014) - [c16]Anthony Widjaja Lin, Sanming Zhou
A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups. CONCUR 2014: 327-341 - [c15]Rémi Bonnet, Stefan Kiefer, Anthony Widjaja Lin:
Analysis of Probabilistic Basic Parallel Processes. FoSSaCS 2014: 43-57 - [i7]Rémi Bonnet, Stefan Kiefer, Anthony Widjaja Lin:
Analysis of Probabilistic Basic Parallel Processes. CoRR abs/1401.4130 (2014) - [i6]Anthony Widjaja Lin, Sanming Zhou:
A linear time algorithm for the orbit problem over cyclic groups. CoRR abs/1411.3164 (2014) - [i5]Matthew Hague, Anthony Widjaja Lin, Luke Ong:
Detecting Redundant CSS Rules in HTML5 Applications: A Tree-Rewriting Approach. CoRR abs/1412.5143 (2014) - 2013
- [c14]Pablo Barceló, Gaëlle Fontaine, Anthony Widjaja Lin:
Expressive Path Queries on Graphs with Data. LPAR 2013: 71-85 - 2012
- [j5]Pablo Barceló, Leonid Libkin
Expressive Languages for Path Queries over Graph-Structured Data. ACM Trans. Database Syst. 37(4): 31:1-31:46 (2012) - [c13]Matthew Hague
Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters. CAV 2012: 260-276 - [c12]Anthony Widjaja Lin
Accelerating tree-automatic relations. FSTTCS 2012: 313-324 - [c11]Anthony Widjaja Lin:
Weakly-Synchronized Ground Tree Rewriting - (with Applications to Verifying Multithreaded Programs). MFCS 2012: 630-642 - [c10]Stefan Göller, Anthony Widjaja Lin
Concurrency Makes Simple Theories Hard. STACS 2012: 148-159 - 2011
- [c9]Matthew Hague
Model Checking Recursive Programs with Numeric Data Types. CAV 2011: 743-759 - [c8]Stefan Göller, Anthony Widjaja Lin:
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. CONCUR 2011: 543-558 - [c7]Stefan Göller, Anthony Widjaja Lin
The Complexity of Verifying Ground Tree Rewrite Systems. LICS 2011: 279-288 - 2010
- [j4]James Bailey, Guozhu Dong, Anthony Widjaja To
Logical queries over views: Decidability and expressiveness. ACM Trans. Comput. Log. 11(2): 8:1-8:35 (2010) - [c6]Anthony Widjaja To, Leonid Libkin:
Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems. FoSSaCS 2010: 221-236 - [c5]Matthew Hague
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems. FSTTCS 2010: 228-239 - [c4]Eryk Kopczynski
Parikh Images of Grammars: Complexity and Applications. LICS 2010: 80-89 - [i4]Anthony Widjaja To:
Parikh Images of Regular Languages: Complexity and Applications. CoRR abs/1002.1464 (2010)
2000 – 2009
- 2009
- [j3]Anthony Widjaja To
Unary finite automata vs. arithmetic progressions. Inf. Process. Lett. 109(17): 1010-1014 (2009) - [c3]Anthony Widjaja To:
Model Checking FO(R) over One-Counter Processes and beyond. CSL 2009: 485-499 - [c2]Stefan Göller, Richard Mayr, Anthony Widjaja To
On the Computational Complexity of Verifying One-Counter Processes. LICS 2009: 235-244 - [i3]Anthony Widjaja To, Leonid Libkin:
Algorithmic metatheorems for decidable LTL model checking over infinite systems. CoRR abs/0910.4932 (2009) - 2008
- [c1]Anthony Widjaja To, Leonid Libkin
Recurrent Reachability Analysis in Regular Model Checking. LPAR 2008: 198-213 - [i2]James Bailey, Guozhu Dong, Anthony Widjaja To:
Logical Queries over Views: Decidability and Expressiveness. CoRR abs/0803.2559 (2008) - [i1]Anthony Widjaja To:
Unary finite automata vs. arithmetic progressions. CoRR abs/0812.1291 (2008) - 2006
- [j2]Anthony Widjaja To:
Review of "Algebraic Complexity Theory by Peter Bürgisser, Michael Clausen and Amin Shokrollahi", Springer 1997. SIGACT News 37(2): 22-27 (2006) - 2003
- [j1]Anthony Widjaja To:
Review of Algorithms sequential & parallel: a unified approach by R. Miller & L. Boxer. Prentice Hall 2000. SIGACT News 34(2): 3-5 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: