We describe BDD-based decision procedures for the modal logic K. Our approach is inspired by the automata-theoretic approach, but we avoid explicit automata construction. Instead, ...
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Va...
We compare Meyer and Routley's minimal relevant logic B+ with the recent semanticsbased approach to subtyping introduced by Frisch, Castagna and Benzaken in the definition of...
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...