Sciweavers

182 search results - page 24 / 37
» Static Analysis by Abstract Interpretation: A Mathematical P...
Sort
View
POPL
2010
ACM
13 years 8 months ago
Nested interpolants
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
Matthias Heizmann, Jochen Hoenicke, Andreas Podels...
PKDD
2000
Springer
107views Data Mining» more  PKDD 2000»
14 years 1 days ago
Expert Constrained Clustering: A Symbolic Approach
Abstract. A new constrained model is discussed as a way of incorporating efficiently a priori expert knowledge into a clustering problem of a given individual set. The first innova...
Fabrice Rossi, Frédérick Vautrain
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
14 years 3 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko
POPL
2004
ACM
14 years 8 months ago
Symbolic transfer function-based approaches to certified compilation
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
Xavier Rival
SMC
2007
IEEE
103views Control Systems» more  SMC 2007»
14 years 2 months ago
A new evaluation measure for information retrieval systems
Abstract— Some of the established approaches to evaluating text clustering algorithms for information retrieval show theoretical flaws. In this paper, we analyze these flaws an...
Martin Mehlitz, Christian Bauckhage, Jér&oc...