2989 search results - page 58 / 598 » Using Domain-Independent Problems for Introducing Formal Met... |
IWFM
2003
14 years 11 months ago
2003
Meadows recently proposed a formal cost-based framework for analysis of denial of service. It was showed how some principles that have already been used to make cryptographic prot...
JAR
2002
14 years 9 months ago
2002
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
IJIT
2004
14 years 11 months ago
2004
Recent advances in both the testing and verification of software based on formal specifications of the system to be built have reached a point where the ideas can be applied in a p...
TLDI
2009
ACM
15 years 6 months ago
2009
ACM
Object-oriented programs are notable for making use of both rder abstractions and mutable, aliased state. Either feature alone is challenging for formal verification, and the com...
EOR
2006
14 years 9 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...