Sciweavers

564 search results - page 54 / 113
» Runtime Verification of C Programs
Sort
View
CCS
2008
ACM
13 years 10 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung
POPL
2003
ACM
14 years 9 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
SP
2008
IEEE
14 years 3 months ago
Preventing Memory Error Exploits with WIT
Attacks often exploit memory errors to gain control over the execution of vulnerable programs. These attacks remain a serious problem despite previous research on techniques to pr...
Periklis Akritidis, Cristian Cadar, Costin Raiciu,...
ERLANG
2007
ACM
14 years 22 days ago
Optimising TCP/IP connectivity
With the increased use of network enabled applications and server hosted software systems, scalability with respect to network connectivity is becoming an increasingly important s...
Oscar Hellström
ICFP
2010
ACM
13 years 10 months ago
Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation
Partial evaluation aims to improve the efficiency of a program by specialising it with respect to some known inputs. In this paper, we show that partial evaluation can be an effec...
Edwin Brady, Kevin Hammond