Sciweavers

26 search results - page 3 / 6
» An Integration of HOL and ACL2
Sort
View
TPHOL
2006
IEEE
13 years 11 months ago
Otter/Ivy
Abstract. We compare the styles of several proof assistants for mathematics. We present Pythagoras’ proof of the irrationality of √ 2 both informal and formalized in (1) HOL, (...
Michael Beeson, William McCune
ATVA
2004
Springer
138views Hardware» more  ATVA 2004»
13 years 9 months ago
Providing Automated Verification in HOL Using MDGs
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
Tarek Mhamdi, Sofiène Tahar
TPHOL
1998
IEEE
13 years 10 months ago
The Village Telephone System: A Case Study in Formal Software Engineering
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...
Karthikeyan Bhargavan, Carl A. Gunter, Elsa L. Gun...
ITP
2010
178views Mathematics» more  ITP 2010»
13 years 7 months ago
Interactive Termination Proofs Using Termination Cores
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
Panagiotis Manolios, Daron Vroon
ENTCS
2006
125views more  ENTCS 2006»
13 years 5 months ago
An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving
To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close int...
Tobias Schmidt-Samoa