Sciweavers

493 search results - page 86 / 99
» Bounded LTL Model Checking with Stable Models
Sort
View
DDECS
2006
IEEE
146views Hardware» more  DDECS 2006»
13 years 11 months ago
Automatic Identification of Timing Anomalies for Cycle-Accurate Worst-Case Execution Time Analysis
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
Jochen Eisinger, Ilia Polian, Bernd Becker, Alexan...
PUK
2000
13 years 8 months ago
Heuristic Search Planning with BDDs
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
Stefan Edelkamp
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
14 years 2 months ago
Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Philip J. Charles, Jacob M. Howe, Andy King
QEST
2007
IEEE
14 years 1 months ago
Symbolic Bisimulations for Probabilistic Systems
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
Peng Wu 0002, Catuscia Palamidessi, Huimin Lin
SAT
2004
Springer
97views Hardware» more  SAT 2004»
14 years 26 days ago
Incremental Compilation-to-SAT Procedures
We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push the standard CTS approaches beyond their limits. We propose the first comprehensive framework...
Marco Benedetti, Sara Bernardini