139 search results - page 28 / 28 » Automated Termination Proofs for Logic Programs by Term Rewr... |
125
Voted
KBSE
2005
IEEE
15 years 6 months ago
2005
IEEE
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
103
Voted
CADE
2001
Springer
16 years 1 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
123
click to vote
TPHOL
1997
IEEE
15 years 5 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...
128
Voted
JACM
2002
15 years 16 days ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...