1716 search results - page 96 / 344 » Proving Conditional Termination |
104
Voted
FC
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. At FC'05, Chen et al. introduced an elegant privacy protecting coupon (PPC) system, CESSS05 [13], in which users can purchase multi-coupons and redeem them unlinkabl...
104
Voted
DOOD
1995
Springer
15 years 4 months ago
1995
Springer
Semantics represents a major problem area for active databases inasmuch as (i) there is l framework for defining the abstract semantics of active rules, and (ii) the various syst...
90
Voted
ICFP
2010
ACM
15 years 1 months ago
2010
ACM
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
CORR
2010
Springer
15 years 27 days ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
99
Voted
JAR
2006
15 years 24 days ago
2006
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...