Sciweavers

564 search results - page 88 / 113
» Proof General: A Generic Tool for Proof Development
Sort
View
ICFP
2012
ACM
13 years 2 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
KDD
2003
ACM
120views Data Mining» more  KDD 2003»
16 years 4 days ago
On detecting differences between groups
Understanding the differences between contrasting groups is a fundamental task in data analysis. This realization has led to the development of a new special purpose data mining t...
Geoffrey I. Webb, Shane M. Butler, Douglas A. Newl...
MOBIHOC
2008
ACM
15 years 11 months ago
Optimal relay assignment for cooperative communications
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
Yi Shi, Sushant Sharma, Y. Thomas Hou, Sastry Komp...
VMCAI
2010
Springer
15 years 9 months ago
Temporal Reasoning for Procedural Programs
While temporal verification of programs is a topic with a long history, its traditional basis--semantics based on word languages--is illsuited for modular reasoning about procedura...
Rajeev Alur, Swarat Chaudhuri
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
15 years 6 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch