Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
Abstract. We propose a privacy-preserving formulation of a linear program whose constraint matrix is partitioned into groups of columns where each group of columns and its correspo...
Analysis and design by contract allows the definition of a formal agreement between a class and its clients, expressing each party’s rights and obligations. Contracts written in ...
Wojciech J. Dzidek, Lionel C. Briand, Yvan Labiche
This research aims at reconciling web personalization with privacy constraints imposed by legal restrictions and by users’ privacy preferences. We propose a software product line...