279 search results - page 27 / 56 » Invariant Patterns for Program Reasoning |
FLOPS
2006
Springer
13 years 11 months ago
2006
Springer
We propose a new method to control memory resources by static analysis. For this, we introduce the notion of sup-interpretation which bounds from above the size of function outputs...
LOPSTR
1997
Springer
13 years 11 months ago
1997
Springer
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
CONCUR
2009
Springer
14 years 4 days ago
2009
Springer
Abstract. A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange la...
ACL2
2006
ACM
13 years 11 months ago
2006
ACM
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
ECTEL
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Expressing generality, recognising and analysing patterns and articulating structure is a complex task and one that is invariably problematic for students. Nonetheless, v...