We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deduc...
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
In this paper we propose a methodology for brain parcellation with anatomical and functional constraints dedicated to fMRI data analysis. The aim is to provide a representation of...
Abstract. In this paper, we propose a general model of schema matching based on the following ideas: on the one hand, a schema is viewed as a context (namely as a partial and appro...
Abstract— In bounded model checking (BMC)-based verification flows lack of reachability constraints often leads to false negatives. At present, it is daily practice of a veri...
Minh D. Nguyen, Dominik Stoffel, Markus Wedler, Wo...