Sciweavers

4940 search results - page 697 / 988
» On the Complexity of Universal Programs
Sort
View
ICFP
2010
ACM
15 years 7 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
BMCBI
2006
108views more  BMCBI 2006»
15 years 6 months ago
An improved map of conserved regulatory sites for Saccharomyces cerevisiae
Background: The regulatory map of a genome consists of the binding sites for proteins that determine the transcription of nearby genes. An initial regulatory map for S. cerevisiae...
Kenzie D. MacIsaac, Ting Wang, D. Benjamin Gordon,...
TPDS
2008
113views more  TPDS 2008»
15 years 6 months ago
Evaluating a High-Level Parallel Language (GpH) for Computational GRIDs
Computational Grids potentially offer low cost, readily available, and large-scale high-performance platforms. For the parallel execution of programs, however, computational GRIDs ...
Abdallah Al Zain, Philip W. Trinder, Greg Michaels...
STVR
2010
99views more  STVR 2010»
15 years 5 months ago
Fault localization based on information flow coverage
Failures triggered by hard to debug defects usually involve complex interactions between many program elements. We hypothesize that information flows present a good model for such ...
Wes Masri
ASPLOS
2011
ACM
14 years 10 months ago
RCDC: a relaxed consistency deterministic computer
Providing deterministic execution significantly simplifies the debugging, testing, replication, and deployment of multithreaded programs. Recent work has developed deterministic...
Joseph Devietti, Jacob Nelson, Tom Bergan, Luis Ce...