We address the issue of automatic invariant synthesis for sequential programs manipulating singly-linked lists carrying data over infinite data doe define for that a framework ba...
Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, A...
Visual programming languages (VPLs) provide notations for representing both the intermediate and the final results of a knowledge engineering process. Whereas some VPLs particula...
The Nhan Luong, Patrick Etcheverry, Christophe Mar...
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...