Sciweavers

180 search results - page 14 / 36
» Loop Invariants on Demand
Sort
View
ATVA
2007
Springer
77views Hardware» more  ATVA 2007»
14 years 2 months ago
Proving Termination of Tree Manipulating Programs
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 ...
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tom&...
JCT
2011
93views more  JCT 2011»
12 years 10 months ago
A graph-theoretic approach to quasigroup cycle numbers
Abstract. Norton and Stein associated a number with each idempotent quasigroup or diagonalized Latin square of given finite order n, showing that it is congruent mod 2 to the tria...
Brent Kerby, Jonathan D. H. Smith
PLDI
2000
ACM
14 years 9 days ago
Exploiting superword level parallelism with multimedia instruction sets
Increasing focus on multimedia applications has prompted the addition of multimedia extensions to most existing general purpose microprocessors. This added functionality comes pri...
Samuel Larsen, Saman P. Amarasinghe
KBSE
2008
IEEE
14 years 2 months ago
Automatic Inference of Frame Axioms Using Static Analysis
Many approaches to software verification are currently semi-automatic: a human must provide key logical insights — e.g., loop invariants, class invariants, and frame axioms tha...
Zvonimir Rakamaric, Alan J. Hu
SIAMIS
2011
12 years 10 months ago
On the Illumination Invariance of the Level Lines under Directed Light: Application to Change Detection
We analyze the illumination invariance of the level lines of an image. We show that if the scene surface has Lambertian reflectance and the light is directed, then a necessary and...
Pierre Weiss, Alexandre Fournier, Laure Blanc-F&ea...