328 search results - page 34 / 66 » Proving Termination of Communicating Programs |
JFP
2000
13 years 7 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
WIMOB
2008
IEEE
14 years 2 months ago
2008
IEEE
—In this paper, we propose two robust precoder designs for multiple-input multiple-output (MIMO) broadcast channels with imperfect channel state information (CSI). First, we cons...
SCP
2011
13 years 2 months ago
2011
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
CC
2009
Springer
14 years 8 months ago
2009
Springer
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...