Sciweavers

1763 search results - page 118 / 353
» A Formalization of Polytime Functions
Sort
View
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
14 years 8 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
ICML
2007
IEEE
15 years 10 months ago
Intractability and clustering with constraints
Clustering with constraints is a developing area of machine learning. Various papers have used constraints to enforce particular clusterings, seed clustering algorithms and even l...
Ian Davidson, S. S. Ravi
TPHOL
2007
IEEE
15 years 4 months ago
Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
Lukas Bulwahn, Alexander Krauss, Tobias Nipkow
CAV
2007
Springer
127views Hardware» more  CAV 2007»
15 years 4 months ago
CVC3
Abstract. CVC3, a joint project of NYU and U Iowa, is the new and latest version of the Cooperating Validity Checker. CVC3 extends and builds on the functionality of its predecesso...
Clark Barrett, Cesare Tinelli
SIGIR
2006
ACM
15 years 3 months ago
Theoretical benchmarks of XML retrieval
This poster investigates the use of theoretical benchmarks to describe the matching functions of XML retrieval systems and the properties of specificity and exhaustivity in XML r...
Tobias Blanke, Mounia Lalmas