The poor man's proof assistant: using prolog to develop formal language theoretic proofs. - Joey Eremondi (SPLASH (Companion Volume), 2013)

The ASPECTA toolkit: affordable full coverage displays. - Julian Petford; Miguel A. Nacenta; Carl Gutwin; Joseph Eremondi; Cody Ede (PerDis, 2016)

Deletion operations on deterministic families of automata. - Joey Eremondi; Oscar H. Ibarra; Ian McQuillan (Inf. Comput., 2017)

On the complexity and decidability of some problems involving shuffle. - Joey Eremondi; Oscar H. Ibarra; Ian McQuillan (Inf. Comput., 2018)

On the Density of Context-Free and Counter Languages. - Joey Eremondi; Oscar H. Ibarra; Ian McQuillan (Int. J. Found. Comput. Sci., 2018)

Set Constraints, Pattern Match Analysis, and SMT. - Joseph Eremondi (TFP, 2019)

A framework for improving error messages in dependently-typed languages. - Joseph Eremondi; Wouter Swierstra; Jurriaan Hage (Open Comput. Sci., 2019)

Insertion operations on deterministic reversal-bounded counter machines. - Joey Eremondi; Oscar H. Ibarra; Ian McQuillan (J. Comput. Syst. Sci., 2019)

Approximate normalization for gradual dependent types. - Joseph Eremondi; Éric Tanter; Ronald Garcia (Proc. ACM Program. Lang., 2019)

Approximate Normalization and Eager Equality Checking for Gradual Inductive Families. - Joseph Eremondi; Ronald Garcia; Éric Tanter (CoRR, 2021)

Propositional equality for gradual dependently typed programming. - Joseph Eremondi; Ronald Garcia; Éric Tanter (Proc. ACM Program. Lang., 2022)

Strictly Monotone Brouwer Trees for Well Founded Recursion over Multiple Arguments. - Joseph Eremondi (CPP, 2024)

Coverage Semantics for Dependent Pattern Matching. - Joseph Eremondi; Ohad Kammar (ESOP (1), 2025)