Sciweavers

319 search results - page 47 / 64
» Space-Efficient Bounded Model Checking
Sort
View
VLDB
1998
ACM
111views Database» more  VLDB 1998»
14 years 2 months ago
Filtering with Approximate Predicates
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
Narayanan Shivakumar, Hector Garcia-Molina, Chandr...
ICRA
2006
IEEE
103views Robotics» more  ICRA 2006»
14 years 3 months ago
A Time-budgeted Collision Detection Method
- Collision detection is a critical module in many applications such as computer graphics, robot motion planning, physical simulation, CAD/CAM, and molecular modeling. Many efficie...
Yu-Te Lin, Tsai-Yen Li
ENTCS
2007
182views more  ENTCS 2007»
13 years 9 months ago
Automated Fault Localization for C Programs
If a program does not fulfill a given specification, a model checker delivers a counterexample, a run which demonstrates the wrong behavior. Even with a counterexample, locating...
Andreas Griesmayer, Stefan Staber, Roderick Bloem
ATVA
2005
Springer
131views Hardware» more  ATVA 2005»
14 years 3 months ago
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
Fuzhi Wang, Marta Z. Kwiatkowska
FMOODS
2008
13 years 11 months ago
Symbolic Step Encodings for Object Based Communicating State Machines
In this work, novel symbolic step encodings of the transition relation for object based communicating state machines are presented. This class of systems is tailored to capture the...
Jori Dubrovin, Tommi A. Junttila, Keijo Heljanko