Sciweavers

325 search results - page 24 / 65
» Abstract Rewriting
Sort
View
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 7 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
RP
2010
Springer
146views Control Systems» more  RP 2010»
13 years 6 months ago
Depth Boundedness in Multiset Rewriting Systems with Name Binding
Abstract. In this paper we consider ν-MSR, a formalism that combines the two main existing approaches for multiset rewriting, namely MSR and CMRS. In ν-MSR we rewrite multisets o...
Fernando Rosa Velardo
WRLA
2010
13 years 5 months ago
A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
Francisco Durán, José Meseguer
ESORICS
2009
Springer
14 years 8 months ago
Isolating JavaScript with Filters, Rewriting, and Wrappers
Abstract. We study methods that allow web sites to safely combine JavaScript from untrusted sources. If implemented properly, filters can prevent dangerous code from loading into t...
Sergio Maffeis, John C. Mitchell, Ankur Taly
RTA
2010
Springer
13 years 11 months ago
A Rewriting Logic Semantics Approach to Modular Program Analysis
The K framework, based on rewriting logic semantics, provides a powerful logic for defining the semantics of programming languages. While most work in this area has focused on de...
Mark Hills, Grigore Rosu