Sciweavers

1000 search results - page 74 / 200
» Nominal rewriting systems
Sort
View
WADT
1998
Springer
13 years 12 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...
SIS
2007
13 years 9 months ago
A General Approach to Securely Querying XML
Access control models for XML data can be classified in two major categories: node filtering and query rewriting systems. The first category includes approaches that use access ...
Ernesto Damiani, Majirus Fansi, Alban Gabillon, St...
ACL
2004
13 years 9 months ago
Generalized Multitext Grammars
Generalized Multitext Grammar (GMTG) is a synchronous grammar formalism that is weakly equivalent to Linear Context-Free Rewriting Systems (LCFRS), but retains much of the notatio...
I. Dan Melamed, Giorgio Satta, Benjamin Wellington
IANDC
2007
106views more  IANDC 2007»
13 years 7 months ago
Tyrolean termination tool: Techniques and features
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...
Nao Hirokawa, Aart Middeldorp
CORR
2011
Springer
197views Education» more  CORR 2011»
12 years 11 months ago
Securing The Kernel via Static Binary Rewriting and Program Shepherding
Recent Microsoft security bulletins show that kernel vulnerabilities are becoming more and more important security threats. Despite the pretty extensive security mitigations many ...
Piotr Bania