Sciweavers

861 search results - page 8 / 173
» Symbolic Program Analysis Using Term Rewriting and Generaliz...
Sort
View
PASTE
2005
ACM
15 years 3 months ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen
PLILP
1998
Springer
15 years 2 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
ERSHOV
2009
Springer
15 years 1 months ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...
AMAST
2004
Springer
15 years 3 months ago
Formal JVM Code Analysis in JavaFAN
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...
Azadeh Farzan, José Meseguer, Grigore Rosu
CSL
2010
Springer
14 years 10 months ago
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
Christian Sternagel, René Thiemann