18 citations · 46 across the 7 of their papers we have counts for
4 papers · 1 filter
Approximate Normalization for Gradual Dependent Types
Joseph Eremondi, Éric Tanter, Ronald Garcia
Dependent types help programmers write highly reliable code. However, this reliability comes at a cost: it can be challenging to write new prototypes in (or migrate old code to) de…
Set Constraints, Pattern Match Analysis, and SMT
Joseph Eremondi
Set constraints provide a highly general way to formulate program analyses. However, solving arbitrary boolean combinations of set constraints is NEXPTIME-hard. Moreover, while the…
Insertion Operations on Deterministic Reversal-Bounded Counter Machines
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
Several insertion operations are studied applied to languages accepted by one-way and two-way deterministic reversal-bounded multicounter machines. These operations are defined by…
On the Density of Context-Free and Counter Languages
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
A language is said to be dense if every word in the universe is an infix of some word in . This notion has been generalized from the infix operation to arbitrary word operat…