1173 search results - page 135 / 235 » On the Compositionality of Round Abstraction |
132
click to vote
ICST
2009
IEEE
14 years 10 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...
136
click to vote
FSE
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Blue Midnight Wish (BMW) is one of the fastest SHA-3 candidates in the second round of the competition. In this paper we study the compression function of BMW and we obta...
110
click to vote
CADE
2008
Springer
16 years 29 days ago
2008
Springer
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
RTSS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—The Hierarchical Timing Language (HTL) is a realtime coordination language for distributed control systems. HTL programs must be checked for well-formedness, race freedo...
110
Voted
CAI
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...