147 search results - page 4 / 30 » A Transformation System for Definite Programs Based on Termi... |
CC
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We introduce the concept of future values. Using future values it is possible to represent programs in a new control-flow form such that on any control flow path the data...
ICLP
1997
Springer
13 years 9 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
VMCAI
2005
Springer
13 years 10 months ago
2005
Springer
We present a technique to prove termination of multipath polynomial programs, an expressive class of loops that enables practical traction and analysis. The technique is based on ï...
ADC
2004
Springer
13 years 10 months ago
2004
Springer
XML is becoming the dominant standard for representing and exchanging data on the World Wide Web. The ability to transform and present data in XML is crucial and XSLT (Extensible ...
POPL
2005
ACM
14 years 5 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...