Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Matthew Hague"'
Autor:
Arnaud Carayol, Matthew Hague
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 151, Iss Proc. AFL 2014, Pp 1-24 (2014)
We present a survey of the saturation method for model-checking pushdown systems.
Externí odkaz:
https://doaj.org/article/12dd2362b2864eba8d82a0d03a1b7f73
Autor:
Matthew Hague, C. -H. Luke Ong
Publikováno v:
Logical Methods in Computer Science, Vol Volume 4, Issue 4 (2008)
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested "stack of stacks" structure. These systems may be used to model higher-order programs and are closely related to the Caucal hie
Externí odkaz:
https://doaj.org/article/38898c7d17ff4ed7ab18b5af7f46ba7f
Publikováno v:
European Journal of Surgical Oncology. 49:e253-e254
Publikováno v:
European Journal of Orthopaedic Surgery & Traumatology. 33:61-66
In treating distal third tibial fractures, restoration of the axial alignment and therefore accurate reduction of the distal fragment minimise the risk of tibiotalar joint malalignment. The aim of this study is to investigate whether there was a diff
Autor:
Andrzej S. Murawski, Olivier Serre, Matthew Hague, Christopher H. Broadbent, C.-H. Luke Ong, Arnaud Carayol
Publikováno v:
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, Association for Computing Machinery, 2021, 22 (3), pp.16:1-16:51
ACM Transactions on Computational Logic, Association for Computing Machinery, 2021, 22 (3), pp.16:1-16:51
This paper studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely those generated by collapsible pushdown automata. The main motivation for studying these games comes from the connections from colla
Autor:
Matthew Hague
Publikováno v:
ACM SIGLOG News. 6:4-22
The first edition of MOSCA, the Meeting on String Constraints and Applications was held in May 2019 in the otherworldly location of Bertinoro [D'Antoni et al. 2019]. For one week, 43 participants presented surveys and discussed recent research into t
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
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
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
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