1356 search results - page 155 / 272 » The ideal of verified software |
184
click to vote
ISQED
2011
IEEE
14 years 10 months ago
2011
IEEE
Due to the dramatic increase in design complexity, verifying the functional correctness of a circuit is becoming more difficult. Therefore, bugs may escape all verification effo...
164
click to vote
PKC
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
177
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
Parallel architectures are the way of the future, but are notoriously difficult to program. In addition to the low-level constructs they often present (e.g., locks, DMA, and non-...
162
click to vote
EPIA
2009
Springer
16 years 28 days ago
2009
Springer
Inductive Logic Programming (ILP) [1] systems are general purpose learners that have had significant success on solving a number of relational problems, particularly from the biol...
180
click to vote
FOSSACS
2010
Springer
16 years 25 days ago
2010
Springer
Abstract. We study the semantic meaning of block structure using game semantics and introduce the notion of block-innocent strategies, which turns out to characterise call-by-value...