2 citations · 2 across the 2 of their papers we have counts for
4 papers
What Is Decidable about String Constraints with the ReplaceAll Function
Taolue Chen, Yan Chen, Matthew Hague +2
Recently, it was shown that any theory of strings containing the string-replace function (even the most restricted version where pattern/replacement strings are both constant strin…
Decidable models of integer-manipulating programs with recursive parallelism (technical report)
Matthew Hague, Anthony Widjaja Lin
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…
Generating Concurrency Checks Automatically
Jonathan Hoyland, Matthew Hague
This article introduces ATAB, a tool that automatically generates pairwise reachability checks for action trees. Action trees can be used to study the behaviour of real-world concu…
Annotated Stack Trees
Matthew Hague, Vincent Penelle
Annotated pushdown automata provide an automaton model of higher-order recursion schemes, which may in turn be used to model higher-order programs for the purposes of verification.…