Sciweavers

3713 search results - page 675 / 743
» Constructing a Calculus of Programs
Sort
View
CORR
2008
Springer
78views Education» more  CORR 2008»
13 years 10 months ago
Verified Null-Move Pruning
In this article we review standard null-move pruning and introduce our extended version of it, which we call verified null-move pruning. In verified null-move pruning, whenever th...
Omid David-Tabibi, Nathan S. Netanyahu
FAC
2008
108views more  FAC 2008»
13 years 10 months ago
Property-directed incremental invariant generation
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typ...
Aaron R. Bradley, Zohar Manna
IANDC
2008
84views more  IANDC 2008»
13 years 10 months ago
A theory of system behaviour in the presence of node and link failure
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...
Adrian Francalanza, Matthew Hennessy
COMPUTER
2006
160views more  COMPUTER 2006»
13 years 10 months ago
Developing Applications Using Model-Driven Design Environments
Model-driven development (MDD) is an emerging paradigm that improves the software development lifecycle, particularly for large software systems by providing a higherabstraction fo...
Krishnakumar Balasubramanian, Aniruddha S. Gokhale...
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 10 months ago
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
This paper describes an efficient implementation of binning for decode-and-forward (DF) in relay channels using lowdensity parity-check (LDPC) codes. Bilayer LDPC codes are devised...
Peyman Razaghi, Wei Yu