Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...
Springer2010
