696 search results - page 7 / 140 » Explaining abstract counterexamples |
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
CAV
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
TIT
2010
13 years 2 months ago
2010
Abstract--Gibilisco and Isola have recently proposed a definition of Fisher information for random variables taking values in a finite group that is analogous to the definition for...
CDC
2009
IEEE
14 years 3 days ago
2009
IEEE
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
OL
2007
13 years 6 months ago
2007
Abstract The metric polytope metn is the polyhedron associated with all semimetrics on n nodes and defined by the triangle inequalities xij − xik − xjk ≤ 0 and xij + xik + x...