Sciweavers

13383 search results - page 139 / 2677
» Abstractions from proofs
Sort
View
CPM
2004
Springer
138views Combinatorics» more  CPM 2004»
15 years 11 months ago
Reversal Distance without Hurdles and Fortresses
Abstract. This paper presents an elementary proof of the HannenhalliPevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the vari...
Anne Bergeron, Julia Mixtacki, Jens Stoye
RTA
2004
Springer
15 years 11 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
CSCLP
2003
Springer
15 years 11 months ago
A Comparative Study of Arithmetic Constraints on Integer Intervals
Abstract. We propose here a number of approaches to implement constraint propagation for arithmetic constraints on integer intervals. To this end we introduce integer interval arit...
Krzysztof R. Apt, Peter Zoeteweij
FMCAD
2004
Springer
15 years 10 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...
153
Voted
STOC
1995
ACM
114views Algorithms» more  STOC 1995»
15 years 9 months ago
On data structures and asymmetric communication complexity
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi...