Sciweavers

23201 search results - page 113 / 4641
» Rewriting Systems with Data
Sort
View
TCS
2010
15 years 3 months ago
Left-forbidding cooperating distributed grammar systems
In a left-forbidding grammar, a set of nonterminals is attached to every context-free production, and such a production can rewrite a nonterminal if no symbol from the attached se...
Filip Goldefus, Tomás Masopust, Alexander M...
ENTCS
2006
93views more  ENTCS 2006»
15 years 5 months ago
A Rule-based System for Web site Verification
In this paper, we describe a system, written in Haskell, for the automated verification of Web sites which can be used to specify (partial) correctness and completeness properties...
Demis Ballis, Javier García-Vivó
ASPLOS
1996
ACM
15 years 9 months ago
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
Daniel J. Scales, Kourosh Gharachorloo, Chandramoh...
ICDE
2006
IEEE
179views Database» more  ICDE 2006»
16 years 6 months ago
ACXESS - Access Control for XML with Enhanced Security Specifications
We present ACXESS (Access Control for XML with Enhanced Security Specifications), a system for specifying and enforcing enhanced security constraints on XML via virtual "secu...
Sriram Mohan, Jonathan Klinginsmith, Arijit Sengup...
137
Voted
CSL
2006
Springer
15 years 5 months ago
A linguistically motivated approach to grapheme-to-phoneme conversion for Korean
This paper describes a hand-written rule-based grapheme-to-phoneme (GTP) conversion system for Korean built within the Festival text-to-speech (TTS) synthesis framework. The core ...
Kyuchul Yoon, Chris Brew