279 search results - page 29 / 56 » Invariant Patterns for Program Reasoning |
ENTCS
2007
13 years 7 months ago
2007
Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
PADL
2011
Springer
12 years 10 months ago
2011
Springer
Modern challenges led to a design of a wide range of programming models for reactive, parallel and concurrent programming, but these are often t to encode in general purpose langua...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
DAGSTUHL
1996
13 years 8 months ago
1996
We revisit the main techniques of program transformation which are used in partial evaluation, mixed computation, supercompilation, generalized partial computation, rule-based prog...
LOPSTR
2004
Springer
14 years 27 days ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...