132 search results - page 7 / 27 » A Rewriting Logic Semantics Approach to Modular Program Anal... |
107
click to vote
RTA
2007
Springer
15 years 5 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
110
click to vote
ENTCS
2007
14 years 11 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
106
click to vote
JAIR
2007
14 years 11 months ago
2007
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
AMAST
2004
Springer
15 years 5 months ago
2004
Springer
JavaFAN uses a Maude rewriting logic specification of the JVM semantics as the basis of a software analysis tool with competitive performance. It supports formal analysis of concu...
FLOPS
2008
Springer
15 years 1 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...