Sciweavers

151 search results - page 19 / 31
» Using Informal and Formal Techniques for the Reverse Enginee...
Sort
View
LPNMR
2001
Springer
13 years 12 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
SIGSOFT
2007
ACM
14 years 8 months ago
SLEDE: lightweight verification of sensor network security protocol implementations
Finding flaws in security protocol implementations is hard. Finding flaws in the implementations of sensor network security protocols is even harder because they are designed to p...
Youssef Hanna
CASCON
2000
119views Education» more  CASCON 2000»
13 years 8 months ago
Efficient mapping of software system traces to architectural views
Information about a software system's execution can help a developer with many tasks, including software testing, performance tuning, and program understanding. In almost all...
Robert J. Walker, Gail C. Murphy, Jeffrey Steinbok...
SAS
2001
Springer
166views Formal Methods» more  SAS 2001»
13 years 12 months ago
Estimating the Impact of Scalable Pointer Analysis on Optimization
This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimiza...
Manuvir Das, Ben Liblit, Manuel Fähndrich, Ja...
POPL
2003
ACM
14 years 7 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