561 search results - page 11 / 113 » Inferring better contracts |
LPAR
2001
Springer
13 years 12 months ago
2001
Springer
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
AI
2004
Springer
14 years 29 days ago
2004
Springer
Building conversation protocols has traditionally been an art more than a science, as their construction is often guided by designers’ intuition rather than by a principled appro...
PLDI
2003
ACM
14 years 24 days ago
2003
ACM
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Contract-based property checkers hold the potential for precise, scalable, and incremental reasoning. However, it is difficult to apply such checkers to large program mod...