9626 search results - page 34 / 1926 » Invariant Based Programming |
180
click to vote
ALC
1997
15 years 2 months ago
1997
A predicative semantics is a mapping of programs to predicates. These predicates characterize sets of acceptable observations. The presence of time in the observations makes the o...
107
click to vote
ICALP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Given an ML function f : (int->int)->int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its func...
119
click to vote
VSTTE
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. The Composite design pattern is an exemplar of specification and verification challenges for sequential object-oriented programs. Region logic is a Hoare logic augmente...
123
click to vote
CADE
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
133
click to vote
ASIAN
2006
Springer
15 years 5 months ago
2006
Springer
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...