1356 search results - page 130 / 272 » The ideal of verified software |
149
click to vote
VSTTE
2010
Springer
15 years 4 months ago
2010
Springer
Garbage collectors are very hard to implement correctly due to their low-level manipulation of memory. In this paper, we construct a copying garbage collector which we have proved ...
200
click to vote
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the descri...
180
click to vote
CC
2010
Springer
15 years 3 months ago
2010
Springer
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
153
click to vote
COMPSEC
2010
15 years 3 months ago
2010
Spi Calculus is an untyped high level modeling language for security protocols, used for formal protocols specification and verification. In this paper, a type system for the Spi ...
299
click to vote
AMAST
2010
Springer
15 years 1 months ago
2010
Springer
Maude modules can be understood as models that can be formally analyzed and verified with respect to different properties expressing various formal requirements. However, Maude lac...