Sciweavers

506 search results - page 32 / 102
» Proving Properties about Lists Using Containers
Sort
View
COLING
2008
15 years 1 months ago
Representations for category disambiguation
As it serves as a basis for POS tagging, category induction, and human category acquisition, we investigate the information needed to disambiguate a word in a local context, when ...
Markus Dickinson
CORR
2008
Springer
105views Education» more  CORR 2008»
14 years 12 months ago
Certifying floating-point implementations using Gappa
High confidence in floating-point programs requires proving numerical properties of final and intermediate values. One may need to guarantee that a value stays within some range, ...
Florent de Dinechin, Christoph Quirin Lauter, Guil...
FOSSACS
2005
Springer
15 years 5 months ago
A Simpler Proof Theory for Nominal Logic
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
James Cheney
JMLR
2010
157views more  JMLR 2010»
14 years 10 months ago
Kronecker Graphs: An Approach to Modeling Networks
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...
POPL
2011
ACM
14 years 2 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu