592 search results - page 8 / 119 » Can Component Service-Based Systems Be Proved Correct |
ICSE
2007
IEEE-ACM
14 years 7 months ago
2007
IEEE-ACM
The Verifying Compiler (VC) project is a core component of the Dependable Systems Evolution Grand Challenge. The VC offers the promise of automatically proving that a program or c...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—In lattice-coded multiple-input multiple-output (MIMO) systems, optimal decoding amounts to solving the closest vector problem (CVP). Embedding is a powerful technique for the a...
EMSOFT
2004
Springer
14 years 26 days ago
2004
Springer
We present an extension of a mathematical framework proposed by the authors to deal with the composition of heterogeneous reactive systems. Our extended framework encompasses dive...
ICECCS
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract—Transactional Memory (TM) is a promising technique that addresses the difficulty of parallel programming. Since TM takes responsibility for all concurrency control, TM ...
ENTCS
2008
13 years 7 months ago
2008
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...