Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that a...
Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, She...
Abstract. We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programmi...
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
Interpretation Reconciled Michael Leuschel1 Department of Computer Science, K.U. Leuven, Belgium DIKU, University of Copenhagen, Denmark fy the relationship between abstract inter...