activity
20002017
most citedAlternating register automata on finite words and trees

39 citations · 127 across the 31 of their papers we have counts for

collaborators
Showing 2005Show all

6 papers · 1 filter

cs.PL2005★ 1 cited

Practical Datatype Specializations with Phantom Types and Recursion Schemes

Matthew Fluet, Riccardo Pucella

Datatype specialization is a form of subtyping that captures program invariants on data structures that are expressed using the convenient and intuitive datatype notation. Of parti…

cs.AI2005★ 1 cited

Evidence with Uncertain Likelihoods

Joseph Y. Halpern, Riccardo Pucella

An agent often has a number of hypotheses, and must choose among them based on observations, or outcomes of experiments. Each of these observations can be viewed as providing evide…

cs.LO2005

Logic Column 12: Logical Verification and Equational Verification

Riccardo Pucella

This article examines two approaches to verification, one based on using a logic for expressing properties of a system, and one based on showing the system equivalent to a simpler…

cs.AI2005★ 2 cited

Probabilistic Algorithmic Knowledge

Joseph Y. Halpern, Riccardo Pucella

The framework of algorithmic knowledge assumes that agents use deterministic knowledge algorithms to compute the facts they explicitly know. We extend the framework to allow for ra…

cs.LO2005★ 2 cited

Logic Column 11: The Finite and the Infinite in Temporal Logic

Riccardo Pucella

This article examines the interpretation of the LTL temporal operators over finite and infinite sequences. This is used as the basis for deriving a sound and complete axiomatizatio…

cs.LO2005★ 2 cited

On Partially Additive Kleene Algebras

Riccardo Pucella

We define the notion of a partially additive Kleene algebra, which is a Kleene algebra where the + operation need only be partially defined. These structures formalize a number of…