We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
We present an analysis which takes as its input a sequential program, augmented with annotations indicating potential parallelization opportunities, and a sequential proof, writte...
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
Today more and more security-relevant data is stored on computer systems; security-critical business processes are mapped to their digital counterparts. This situation applies to ...
Karsten Sohr, Michael Drouineaud, Gail-Joon Ahn, M...
This paper discusses Curry’s work on how to implement the problem of inverse interpolation on the ENIAC (1946) and his subsequent work on developing a theory of program compositi...
Liesbeth De Mol, Maarten Bullynck, Martin Carl&eac...