Sciweavers

534 search results - page 71 / 107
» Proving Termination of Rewrite Systems Using Bounds
Sort
View
KBSE
2005
IEEE
14 years 2 months ago
Learning to verify branching time properties
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
Abhay Vardhan, Mahesh Viswanathan
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
14 years 3 months ago
State estimation of nonlinear systems with Markov state reset
— We present a novel observer design for a class of single-output nonlinear systems with Markov jumps. The Markov jump process interferes with a deterministic nonlinear dynamics ...
Stefano Battilotti
VCIP
2000
148views Communications» more  VCIP 2000»
13 years 10 months ago
Aircraft recognition and pose estimation
This work presents a geometry based vision system for aircraft recognition and pose estimation using single images. Pose estimation improves the tracking performance of guided wea...
Hatem Hmam, Jijoong Kim
DAC
1994
ACM
14 years 28 days ago
BDD Variable Ordering for Interacting Finite State Machines
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
Adnan Aziz, Serdar Tasiran, Robert K. Brayton
POPL
2011
ACM
12 years 11 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen