1140 search results - page 5 / 228 » Progress on Certifying Algorithms |
CADE
2008
Springer
14 years 10 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
FM
2003
Springer
14 years 3 months ago
2003
Springer
As the systems we have to specify and verify become larger and more complex, there is a mounting need to combine different tools and decision procedures to accomplish large proof ...
CAV
2001
Springer
14 years 2 months ago
2001
Springer
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
IFM
2010
Springer
13 years 7 months ago
2010
Springer
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
SIAMSC
2010
13 years 4 months ago
2010
We present a new "hp" parameter multi-domain certified reduced basis method for rapid and reliable online evaluation of functional outputs associated with parametrized el...