203 search results - page 30 / 41 » Datatype-Generic Termination Proofs |
142
click to vote
TPHOL
2009
IEEE
15 years 8 months ago
2009
IEEE
We present four coinductive operational semantics for the While language accounting for both terminating and non-terminating program runs: big-step and small-step relational semant...
120
click to vote
ERSHOV
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
131
click to vote
TABLEAUX
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability with respect to a TBox in the logic ALCI using global state caching. ...
105
click to vote
BIRTHDAY
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
195
click to vote
POPL
2009
ACM
16 years 2 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...