Loop invariant

Known as: Invariant, Loop invarient, Loop-invariant code 
In computer science, a loop invariant is a property of a program loop that is true before (and after) each iteration. It is a logical assertion… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
As a culture, object-orientation encourages programmers to create objects, both shortand long-lived, without concern for cost… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Techniques for verifying program assertions using symbolic execution exhibit a significant limitation: they typically require… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
We present a novel static analysis technique that substantially improves the quality of invariants inferred by standard loop… (More)
  • figure 1
  • figure 3
  • table 1
Is this relevant?
2010
2010
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2010
2010
Automated verification of memory safety and functional correctness for heap-manipulating programs has been a challenging task… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Vectorization has been an important method of using data-level parallelism to accelerate scientific workloads on vector machines… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
This paper presents a method for automatically generating all polynomial invariants in simple loops. It is first shown that the… (More)
  • figure 1
  • figure 2
Is this relevant?
2007
2007
Many automated techniques for invariant generation are based on the idea that the invariant should show that something “bad” will… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a new technique for the generation of non-linear (algebraic) invariants of a program. Our technique uses the theory of… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Softm-are verification is recognized as an important and difficult problem. We present a norel framework, based on symbolic… (More)
Is this relevant?