Sciweavers

437 search results - page 63 / 88
» Proving Termination by Divergence
Sort
View
ESOP
2009
Springer
13 years 11 months ago
Verified, Executable Parsing
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
Aditi Barthwal, Michael Norrish
FC
2006
Springer
97views Cryptology» more  FC 2006»
13 years 11 months ago
Privacy-Protecting Coupon System Revisited
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...
Lan Nguyen
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
13 years 11 months ago
Embedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
Klaus Schneider
DOOD
1995
Springer
102views Database» more  DOOD 1995»
13 years 11 months ago
Active Database Rules with Transaction-Conscious Stable-Model Semantics
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...
Carlo Zaniolo
CTRS
1987
13 years 11 months ago
Confluence of Conditional Rewrite Systems
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar