1716 search results - page 81 / 344 » Proving Conditional Termination |
CORR
2004
Springer
13 years 8 months ago
2004
Springer
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
ENTCS
2002
13 years 8 months ago
2002
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the im...
TCS
1998
13 years 8 months ago
1998
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— This paper presents proof-certificate based sufficient conditions for the existence of Zeno behavior in hybrid systems near non-isolated Zeno equilibria. To establish...
RTA
2010
Springer
14 years 20 days ago
2010
Springer
We revisit (un)soundness of transformations of conditional into unconditional rewrite systems. The focus here is on so-called unravelings, the most simple and natural kind of such ...