Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Anthony W. Lin"'
Autor:
Anthony W. Lin, Rupak Majumdar
Publikováno v:
Logical Methods in Computer Science, Vol Volume 17, Issue 4 (2021)
Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables and constants. Its solution amounts to a function mapping variables to constant strings tha
Externí odkaz:
https://doaj.org/article/a67cb9a1db0c45a7bab19cf3a4c50944
Publikováno v:
Proceedings of the ACM on Programming Languages
The design and implementation of decision procedures for checking path feasibility in string-manipulating programs is an important problem, with such applications as symbolic execution of programs with strings and automated detection of cross-site sc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1fe6bb1ef82a3b70e88fa6bc26116aaf
https://doi.org/10.1145/3290362
https://doi.org/10.1145/3290362
Autor:
Taolue Chen, Alejandro Flores-Lamas, Matthew Hague, Zhilei Han, Denghang Hu, Shuanglong Kan, Anthony W. Lin, Philipp Rümmer, Zhilin Wu
Publikováno v:
Proceedings of the ACM on Programming Languages
Regular expressions are a classical concept in formal language theory. Regular expressions in programming languages (RegEx) such as JavaScript, feature non-standard semantics of operators (e.g. greedy/lazy Kleene star), as well as additional features
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b4f6fcd01017155ee671ce7c2603507
Publikováno v:
Computer Aided Verification ISBN: 9783030816872
CAV (2)
Computer Aided Verification 2021
CAV (2)
Computer Aided Verification 2021
We study the problem of learning a finite union of integer (axis-aligned) hypercubes over the d-dimensional integer lattice, i.e., whose edges are parallel to the coordinate axes. This is a natural generalization of the classic problem in the computa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b515a3be25ee45f2117a57726de0b78
https://doi.org/10.1007/978-3-030-81688-9_12
https://doi.org/10.1007/978-3-030-81688-9_12
Publikováno v:
KR
Rational verification is the problem of determining which temporal logic properties will hold in a multi-agent system, under the assumption that agents in the system act rationally, by choosing strategies that collectively form a game-theoretic equil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6557986172002791e2449e92b821d42
Autor:
Denghang Hu, Matthew Hague, Zhilin Wu, Jinlong He, Anthony W. Lin, Taolue Chen, Philipp Rümmer
Publikováno v:
Automated Technology for Verification and Analysis ISBN: 9783030591519
ATVA
Automated Technology for Verification and Analysis-18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Technology for Verification and Analysis
ATVA
Automated Technology for Verification and Analysis-18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Technology for Verification and Analysis
In this paper, we propose a decision procedure for a class of string-manipulating programs which includes not only a wide range of string operations such as concatenation, replaceAll, reverse, and finite transducers, but also those involving the inte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83092c39485edc3bcf2252748d592680
https://doi.org/10.1007/978-3-030-59152-6_18
https://doi.org/10.1007/978-3-030-59152-6_18
Autor:
Rupak Majumdar, Anthony W. Lin
Publikováno v:
Logical Methods in Computer Science
Automated Technology for Verification and Analysis-16th International Symposium, ATVA 2018, Los Angeles, CA, USA, October 7-10, 2018, Proceedings
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Technology for Verification and Analysis
Automated Technology for Verification and Analysis ISBN: 9783030010898
ATVA
Automated Technology for Verification and Analysis-16th International Symposium, ATVA 2018, Los Angeles, CA, USA, October 7-10, 2018, Proceedings
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Technology for Verification and Analysis
Automated Technology for Verification and Analysis ISBN: 9783030010898
ATVA
Word equations are a crucial element in the theoretical foundation of constraint solving over strings, which have received a lot of attention in recent years. A word equation relates two words over string variables and constants. Its solution amounts
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::002689d6e1702a4cbb4a519c50aea33d
Autor:
Anthony W. Lin, Matthew Hague
Publikováno v:
Theoretical Computer Science. 750:24-37
We study safety verification for multithreaded programs with recursive parallelism (i.e. unbounded thread creation and recursion) as well as unbounded integer variables. Since the threads in each program configuration are structured in a hierarchical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fdc4a9449153ed3f5dc8606b63219e61
https://doi.org/10.1016/j.tcs.2018.04.050
https://doi.org/10.1016/j.tcs.2018.04.050
This book constitutes the refereed proceedings of the 15th International Conference on Reachability Problems, RP 2022, held in Kaiserslautern, Germany, in October 2022.The 8 full papers presented were carefully reviewed and selected from 14 submissio