15792 search results - page 4 / 3159 » Computational Abstraction Steps |
LICS
2009
IEEE
14 years 12 days ago
2009
IEEE
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
ICRA
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract— In this paper, the possibility and necessity of multistep trajectory planning in Extended Kalman Filter (EKF) based SLAM is investigated. The objective of the trajector...
TABLEAUX
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π0 1 -formulae and Π0 2 -...
ICCAD
2006
IEEE
13 years 11 months ago
2006
IEEE
This paper addresses SAT-based Unbounded Model Checking based on Craig Interpolants. This recently introduced methodology is often able to outperform BDDs and other SAT-based tech...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...