Sciweavers

502 search results - page 64 / 101
» Verifying Balanced Trees
Sort
View
ASIAN
2003
Springer
109views Algorithms» more  ASIAN 2003»
14 years 3 months ago
Deaccumulation - Improving Provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automated verification usually fails for functions with accumulating ar...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
DAC
1999
ACM
14 years 2 months ago
Buffer Insertion with Accurate Gate and Interconnect Delay Computation
Buffer insertion has become a critical step in deep submicron design, and several buffer insertion/sizing algorithms have been proposed in the literature. However, most of these m...
Charles J. Alpert, Anirudh Devgan, Stephen T. Quay
ICCAD
1994
IEEE
67views Hardware» more  ICCAD 1994»
14 years 2 months ago
The reproducing placement problem with applications
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
Wei-Liang Lin, Majid Sarrafzadeh, Chak-Kuen Wong
ATVA
2006
Springer
133views Hardware» more  ATVA 2006»
14 years 1 months ago
Branching-Time Property Preservation Between Real-Time Systems
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
Jinfeng Huang, Marc Geilen, Jeroen Voeten, Henk Co...
AIPS
2006
13 years 11 months ago
Reconfigurable Path Planning for an Autonomous Unmanned Aerial Vehicle
In this paper, we present a motion planning framework for a fully deployed autonomous unmanned aerial vehicle which integrates two sample-based motion planning techniques, Probabi...
Mariusz Wzorek, Patrick Doherty