1204 search results - page 139 / 241 » Termination of Polynomial Programs |
106
click to vote
LOPSTR
2007
Springer
15 years 6 months ago
2007
Springer
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...
127
click to vote
CIE
2008
Springer
15 years 2 months ago
2008
Springer
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
112
click to vote
RSA
2008
15 years 5 days ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
112
Voted
ECOOP
1993
Springer
15 years 4 months ago
1993
Springer
Abstract. We have designed and implemented a type inference algorithm for the Self language. The algorithm can guarantee the safety and disambiguity of message sends, and provide u...
137
Voted
PEPM
1995
ACM
15 years 4 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...