503 search results - page 18 / 101 » Verifying Quantitative Properties Using Bound Functions |
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
In addition to its technical merits as a challenging non-rigid motion and structural integrity analysis problem, quantitative estimation of cardiac regional functions and material...
72
Voted
PLDI
2010
ACM
15 years 7 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
QEST
2008
IEEE
15 years 4 months ago
2008
IEEE
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...
ISVLSI
2007
IEEE
15 years 4 months ago
2007
IEEE
Formal verification has become an important step in circuit and system design. A prominent technique is Bounded Model Checking (BMC) which is widely used in industry. In BMC it i...
CCCG
2004
14 years 11 months ago
2004
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...