4036 search results - page 348 / 808 » Formal Methods |
211
click to vote
DDECS
2006
IEEE
15 years 10 months ago
2006
IEEE
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...
202
click to vote
FMCAD
2004
Springer
16 years 3 days ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
200
click to vote
SDM
2010
SIAM
15 years 8 months ago
2010
SIAM
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
182
click to vote
FMCAD
2007
Springer
16 years 27 days ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
178
click to vote
CAV
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, sof...