288 search results - page 34 / 58 » Interactive Termination Proofs Using Termination Cores |
166
click to vote
CSFW
1997
IEEE
15 years 10 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
181
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
177
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
170
click to vote
DCG
2010
15 years 6 months ago
2010
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions. The algorithm protects edges with weighted points to avoid the difficulty po...
132
click to vote
VTC
2006
IEEE
16 years 5 days ago
2006
IEEE
— A multi-hop virtual cellular network (VCN) was proposed for future mobile communication systems. In VCN, the transmitted signal from a mobile terminal is relayed via multi-hop ...