8 citations · 25 across the 18 of their papers we have counts for
4 papers · 1 filter
Decision Procedures for Path Feasibility of String-Manipulating Programs with Complex Operations
Taolue Chen, Matthew Hague, Anthony W. Lin +2
The design and implementation of decision procedures for checking path feasibility in string-manipulating programs is an important problem, whose applications include symbolic exec…
Register automata with linear arithmetic
Yu-Fang Chen, Ondrej Lengal, Tony Tan +1
We propose a novel automata model over the alphabet of rational numbers, which we call register automata over the rationals (RA-Q). It reads a sequence of rational numbers and outp…
The Commutativity Problem of the MapReduce Framework: A Transducer-based Approach
Yu-Fang Chen, Lei Song, Zhilin Wu
MapReduce is a popular programming model for data parallel computation. In MapReduce, the reducer produces an output from a list of inputs. Due to the scheduling policy of the plat…
A Decidable Extension of Data Automata
Zhilin Wu
Data automata on data words is a decidable model proposed by Bojańczyk et al. in 2006. Class automata, introduced recently by Bojańczyk and Lasota, is an extension of data automata…