38 citations · 267 across the 48 of their papers we have counts for
5 papers · 1 filter
Depth-bounded epistemic logic
Farid Arthaud, Martin Rinard
Epistemic logics model how agents reason about their beliefs and the beliefs of other agents. Existing logics typically assume the ability of agents to reason perfectly about propo…
(Un)Decidability Results for Word Equations with Length and Regular Expression Constraints
Vijay Ganesh, Mia Minnes, Armando Solar-Lezama +1
We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constra…
On Spatial Conjunction as Second-Order Logic
Viktor Kuncak, Martin Rinard
Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While researchers…
On the Theory of Structural Subtyping
Viktor Kuncak, Martin Rinard
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructor…
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Viktor Kuncak, Martin Rinard
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We t…