25 search results - page 1 / 5 » Transformations of Logic Programs on Infinite Lists |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
LOPSTR
2009
Springer
14 years 8 days ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
CADE
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
POPL
2008
ACM
14 years 6 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...