A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on r...
Agostino Cortesi, Baudouin Le Charlier, Sabina Ros...
We study the automation of the verification of Unity programs with infinite or parameterized state space. This paper presents methods allowing the transformation of some second-ord...
I provide several lessons learned from running a number of conference program committees over the past decade, as well as some additional thoughts on conference organization and t...
Abstract. We investigate the quality of solutions obtained from sample-average approximations to two-stage stochastic linear programs with recourse. We use a recently developed sof...
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...