4573 search results - page 902 / 915 » Automated Reasoning |
199
click to vote
POPL
2008
ACM
16 years 1 days ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
199
click to vote
POPL
2005
ACM
16 years 1 days ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
ICSE
2005
IEEE-ACM
15 years 11 months ago
2005
IEEE-ACM
The need for software architecture evaluation has drawn considerable attention in recent years. In practice, this is a challenging exercise for two main reasons. First, in deploye...
118
click to vote
POPL
2010
ACM
15 years 9 months ago
2010
ACM
We present Low-Level Liquid Types, a refinement type system for C based on Liquid Types. Low-Level Liquid Types combine refinement types with three key elements to automate verifi...
POPL
2010
ACM
15 years 9 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...