Sciweavers

957 search results - page 120 / 192
» Modular Static Program Analysis
Sort
View
ADAEUROPE
2004
Springer
15 years 3 months ago
On the Tree Width of Ada Programs
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
Bernd Burgstaller, Johann Blieberger, Bernhard Sch...
FPCA
1995
15 years 1 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
RP
2009
Springer
124views Control Systems» more  RP 2009»
15 years 4 months ago
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
Denis Lugiez
CCS
2009
ACM
15 years 1 months ago
Dynamic integrity measurement and attestation: towards defense against return-oriented programming attacks
Despite the many efforts made in recent years to mitigate runtime attacks such as stack and heap based buffer overflows, these attacks are still a common security concern in today...
Lucas Davi, Ahmad-Reza Sadeghi, Marcel Winandy
IWPC
2006
IEEE
15 years 3 months ago
Dynamic Analysis of Software Systems using Execution Pattern Mining
Software system analysis for extracting system functionality remains as a major problem in the reverse engineering literature and the early approaches mainly rely on static proper...
Hossein Safyallah, Kamran Sartipi