Sciweavers

888 search results - page 37 / 178
» The Power of Temporal Proofs
Sort
View
RTA
2004
Springer
15 years 3 months ago
Dependency Pairs Revisited
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
Nao Hirokawa, Aart Middeldorp
HT
1999
ACM
15 years 2 months ago
Structure Analysis for Hypertext with Conditional Linkage
We propose a structure analysis and proof framework for hypertext with conditional linkage. This framework can provide hypertext systems with a powerful and simple tool to help th...
Jean-Hugues Réty
FMCAD
2004
Springer
15 years 1 months ago
Scalable Automated Verification via Expert-System Guided Transformations
Abstract. Transformation-based verification has been proposed to synergistically leverage various transformations to successively simplify and decompose large problems to ones whic...
Hari Mony, Jason Baumgartner, Viresh Paruthi, Robe...
TPHOL
1996
IEEE
15 years 1 months ago
Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...
Bernhard Reus
GLOBECOM
2006
IEEE
15 years 3 months ago
Power Optimal Opportunistic Scheduling
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
Abhijeet Bhorkar, Abhay Karandikar, Vivek S. Borka...