Sciweavers

1818 search results - page 68 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
TPHOL
2007
IEEE
14 years 3 months ago
Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
Lukas Bulwahn, Alexander Krauss, Tobias Nipkow
ISCAS
2005
IEEE
139views Hardware» more  ISCAS 2005»
14 years 2 months ago
The missing observations theorem and a new proof of Levinson's recursion
— A principle of linear mean-square estimation which we call the “missing observations theorem” is presented here and used to provide a simple alternative derivation of Levin...
Charles W. Therrien
ICFEM
2004
Springer
14 years 2 months ago
Formal Proof from UML Models
Abstract. We present a practical approach to a formal analysis of UMLbased models. This is achieved by an underlying formal representation in Z, which allows us to pose and dischar...
Nuno Amálio, Susan Stepney, Fiona Polack
SYNASC
2007
IEEE
105views Algorithms» more  SYNASC 2007»
14 years 3 months ago
Decompositions of Natural Numbers: From a Case Study in Mathematical Theory Exploration
In this technical report we present the proofs of properties appearing when solving the problem of prime decomposition of natural numbers using a scheme-based systematic exploratio...
Adrian Craciun, Madalina Hodorog
CADE
2005
Springer
14 years 9 months ago
Proof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
Claudio Castellini, Alan Smaill