Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
"GP is a systematic, domain-independent method for getting computers to solve problems automatically starting from a high-level statement of what needs to be done. Using ideas...
Riccardo Poli, William B. Langdon, Nicholas Freit...
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
The performance of parallel computing systems is strongly dependent on the runtime behaviour of parallel programs. This paper describes a new approach to measure and analyze the ru...
Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. More...