Sciweavers

1557 search results - page 6 / 312
» Programming up to Congruence
Sort
View
CADE
2001
Springer
15 years 11 months ago
A New Meta-complexity Theorem for Bottom-Up Logic Programs
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
Harald Ganzinger, David A. McAllester
FMCAD
2008
Springer
15 years 2 days ago
Scaling Up the Formal Verification of Lustre Programs with SMT-Based Techniques
We present a general approach for verifying safety properties of Lustre programs automatically. Key aspects of the approach are the choice of an expressive first-order logic in wh...
George Hagen, Cesare Tinelli
CSB
2003
IEEE
135views Bioinformatics» more  CSB 2003»
15 years 3 months ago
Stepping Up the Pace of Discovery: the Genomes to Life Program
Genomes to Life (GTL), the U.S. Department of Energy Office of Science’s systems biology program, focuses on environmental microbiology. Over the next 10 to 20 years, GTL’s ke...
Marvin Frazier, David Thomassen, Aristides Patrino...
AOR
2010
14 years 8 months ago
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
Brian C. Dean
IPPS
2003
IEEE
15 years 3 months ago
Towards a Theory of Bisimulation for a Fragment of Verilog
In this paper, we have developed an operational semantic framework for a non-trival subset of Verilog which features event–driven computation, shared variable concurrency. The b...
Li Yongjian, Jifeng He