Sciweavers

1023 search results - page 159 / 205
» A Formal Method for Program Slicing
Sort
View
POPL
2010
ACM
16 years 2 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
POPL
2000
ACM
15 years 8 months ago
Modular Refinement of Hierarchic Reactive Machines
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
Rajeev Alur, Radu Grosu
169
Voted
WWW
2004
ACM
16 years 5 months ago
Securing web application code by static analysis and runtime protection
Security remains a major roadblock to universal acceptance of the Web for many kinds of transactions, especially since the recent sharp increase in remotely exploitable vulnerabil...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
SAS
2009
Springer
162views Formal Methods» more  SAS 2009»
16 years 5 months ago
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
Antoine Miné, Ji Wang, Liqian Chen, Patrick...
SAS
2005
Springer
135views Formal Methods» more  SAS 2005»
15 years 10 months ago
Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian Statistical Post Analysis
Abstract. We present our experience of combining, in a realistic setting, a static analyzer with a statistical analysis. This combination is in order to reduce the inevitable false...
Yungbum Jung, Jaehwang Kim, Jaeho Shin, Kwangkeun ...