This paper presents sound and complete Hoare logics for partial and total correctness of recursive parameterless procedures in the context of unbounded nondeterminism. For total co...
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
We describe Orel, a reasoning system for an ontology language which subsumes both the EL and the RL profile of the recently standardised web ontology language OWL 2. Orel performs ...
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can...
Roberto Bruni, Fabio Gadducci, Alberto Lluch-Lafue...