TPHOL
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
TPHOL
2003
IEEE
14 years 1 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
TPHOL
2003
IEEE
14 years 1 months ago
2003
IEEE
TPHOL
2003
IEEE
14 years 1 months ago
2003
IEEE
MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative p...
TPHOL
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
TPHOL
2003
IEEE
14 years 1 months ago
2003
IEEE
TPHOL
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
TPHOL
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract. A second-level security protocol is defined as a security protocol that relies on an underlying security protocol in order to achieve its goals. The verification of cla...
TPHOL
2003
IEEE
14 years 1 months ago
2003
IEEE
TPHOL
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model ...