641 search results - page 121 / 129 » Formal Reliability Analysis Using Theorem Proving |
ASIACRYPT
2009
Springer
14 years 3 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
BMCBI
2006
13 years 8 months ago
2006
Background: Scientific literature is a source of the most reliable and comprehensive knowledge about molecular interaction networks. Formalization of this knowledge is necessary f...
CASES
2007
ACM
14 years 23 days ago
2007
ACM
Embedded systems are often used in safety-critical environments. Thus, thorough testing of them is mandatory. A quite active research area is the automatic test-case generation fo...
EMSOFT
2007
Springer
14 years 21 days ago
2007
Springer
The soundness of device drivers generally cannot be verified in isolation, but has to take into account the reactions of the hardware devices. In critical embedded systems, interf...
ISSTA
2009
ACM
14 years 3 months ago
2009
ACM
Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraint-generation phase followed by a constraint-solving phase. Th...