48 search results - page 3 / 10 » Issues in the Practical Use of Graph Rewriting |
ENTCS
2006
13 years 5 months ago
2006
Model transformation tools implemented using graph transformation techniques are often expected to provide high performance. For this reason, in the Graph Rewriting and Transforma...
CCS
2005
ACM
13 years 11 months ago
2005
ACM
Current software attacks often build on exploits that subvert machine-code execution. The enforcement of a basic safety property, Control-Flow Integrity (CFI), can prevent such at...
AISC
2008
Springer
13 years 7 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
CADE
2003
Springer
14 years 5 months ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
TPHOL
2008
IEEE
13 years 11 months ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...