265 search results - page 26 / 53 » How to Prove Inductive Theorems |
124
Voted
BIRTHDAY
2006
Springer
15 years 7 months ago
2006
Springer
Sometimes it is pragmatically useful to prove a theorem by contradiction rather than finding a direct proof. Some reductio ad absurdum arguments have made mathematical history and ...
118
click to vote
ICFEM
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present a correctness proof for a basic file system implementation. This implementation contains key elements of standard Unix file systems such as inodes and fixed...
131
Voted
TAPSOFT
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
164
Voted
PLPV
2009
ACM
16 years 13 days ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
153
Voted
TPHOL
1998
IEEE
15 years 7 months ago
1998
IEEE
In this paper we illustrate the use of formal methods in the development of a benchmark application we call the Village Telephone System which is characteristic of a class of netwo...