1140 search results - page 4 / 228 » Progress on Certifying Algorithms |
STACS
2010
Springer
14 years 4 months ago
2010
Springer
Given two 3-connected graphs G and H, a construction sequence constructs
G from H (e. g. from the K4) with three basic operations, called
the Barnette-Grünbaum operations. These...
TACAS
2010
Springer
13 years 7 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
ENTCS
2008
13 years 9 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
CAV
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. The theme of this paper is certifying software for state estimation of dynamic systems, which is an important problem found in spacecraft, aircraft, geophysical, and in m...
SIGMOD
2011
ACM
13 years 18 days ago
2011
ACM
Correctness of data residing in a database is vital. While integrity constraint enforcement can often ensure data consistency, it is inadequate to protect against updates that inv...