4 papers · 1 filter
Intensional Kleene and Rice Theorems for Abstract Program Semantics
Paolo Baldan, Francesco Ranzato, Linpeng Zhang
Classical results in computability theory, notably Rice's theorem, focus on the extensional content of programs, namely, on the partial recursive functions that programs compute. L…
Minimisation of Event Structures
Paolo Baldan, Alessandra Raffaetà
Event structures are fundamental models in concurrency theory, providing a representation of events in computation and of their relations, notably concurrency, conflict and causali…
Fixpoint Games on Continuous Lattices
Paolo Baldan, Barbara König, Tommaso Padoan +1
Many analysis and verifications tasks, such as static program analyses and model-checking for temporal logics reduce to the solution of systems of equations over suitable lattices.…
Towards Trace Metrics via Functor Lifting
Paolo Baldan, Filippo Bonchi, Henning Kerstan +1
We investigate the possibility of deriving metric trace semantics in a coalgebraic framework. First, we generalize a technique for systematically lifting functors from the category…