10 search results - page 1 / 2 » Rewriting Approximations for Fast Prototyping of Static Anal... |
RTA
2007
Springer
13 years 11 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...
ENTCS
2007
13 years 4 months ago
2007
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
EDBT
2010
ACM
13 years 11 months ago
2010
ACM
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
CCS
2003
ACM
13 years 10 months ago
2003
ACM
This paper addresses the issue of identifying buffer overrun vulnerabilities by statically analyzing C source code. We demonstrate a light-weight analysis based on modeling C stri...
CADE
2008
Springer
14 years 5 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...