9626 search results - page 121 / 1926 » Invariant Based Programming |
164
click to vote
ESOP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In previous work, we described a new approach to supporting userdefined type qualifiers, which augment existing types to specify and check additional properties of intere...
137
Voted
FLOPS
2004
Springer
15 years 10 months ago
2004
Springer
We present a method for automatic program inversion of functional programs based on methods of LR parsing. We formalize the transformation and illustrate it with the inversion of a...
150
Voted
EMSOFT
2005
Springer
15 years 10 months ago
2005
Springer
It is difficult to write device drivers. One factor is that writing low-level code for accessing devices and manipulating their registers is tedious and error-prone. For many syst...
239
Voted
TOPLAS
2008
15 years 4 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
144
click to vote
APLAS
2004
ACM
2004
ACM
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
15 years 10 months ago
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...