608 search results - page 59 / 122 » Tests, Proofs and Refinements |
DAM
2008
13 years 8 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
FUIN
2008
13 years 7 months ago
2008
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...
ICST
2009
IEEE
13 years 5 months ago
2009
IEEE
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...
DCC
2008
IEEE
14 years 7 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 ...
ESOP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract We present the semantics and proof system for an objectoriented language with active objects, asynchronous method calls, and futures. The language, based on Creol, disting...