Sciweavers

48 search results - page 8 / 10
» Epigram: Practical Programming with Dependent Types
Sort
View
CSFW
2003
IEEE
14 years 23 days ago
Probabilistic Noninterference through Weak Probabilistic Bisimulation
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...
Geoffrey Smith
POPL
2002
ACM
14 years 7 months ago
Mining specifications
Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally...
Glenn Ammons, James R. Larus, Rastislav Bodí...
ICALP
2005
Springer
14 years 1 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...
SIGMOD
2009
ACM
161views Database» more  SIGMOD 2009»
14 years 2 months ago
Dependency-aware reordering for parallelizing query optimization in multi-core CPUs
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
Wook-Shin Han, Jinsoo Lee
TLCA
2005
Springer
14 years 29 days ago
Recursive Functions with Higher Order Domains
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
Ana Bove, Venanzio Capretta