180 search results - page 7 / 36 » Loop Invariants on Demand |
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis...
CDC
2009
IEEE
14 years 21 days ago
2009
IEEE
— This paper presents a sufficient condition that establishes closed loop stability for linear time invariant dynamical systems with transfer functions that are analytic in the ...
CADE
2006
Springer
14 years 8 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
PLDI
2010
ACM
14 years 5 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 ...
GFKL
2007
Springer
13 years 12 months ago
2007
Springer
Kernel methods offer a flexible toolbox for pattern analysis and machine learning. A general class of kernel functions which incorporates known pattern invariances are invariant d...