107 search results - page 17 / 22 » Specifying the Correctness of Binding-Time Analysis |
CCS
2009
ACM
13 years 11 months ago
2009
ACM
We present an approach for the design and analysis of an electronic voting machine based on a novel combination of formal verification and systematic testing. The system was desig...
EMSOFT
2008
Springer
13 years 9 months ago
2008
Springer
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
ESANN
2000
13 years 8 months ago
2000
It has been shown that self-organized maps, when adequately trained with the set of integers 1 to 32, lay out real numbers in a 2D map in an ordering that is superior to any of the...
IWFM
2000
13 years 8 months ago
2000
ct Increasingly, model checking is being applied to more abstract problem domains than the traditional protocol analysis. The extent to which such an approach is able to provide us...
POPL
2010
ACM
13 years 7 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...