6274 search results - page 80 / 1255 » Proofs, Programs, Processes |
104
click to vote
ICLP
2005
Springer
15 years 5 months ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
ARTS
1997
Springer
15 years 4 months ago
1997
Springer
In 10 , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We s...
109
click to vote
DCC
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper presents a proof of the rate distortion function of a Poisson process with a queuing distortion measure that is in complete analogy with the proofs associated with the ...
103
click to vote
STOC
1999
ACM
15 years 4 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
116
click to vote
COMPSAC
2009
IEEE
15 years 29 days ago
2009
IEEE
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...