Sciweavers

1023 search results - page 152 / 205
» A Formal Method for Program Slicing
Sort
View
SAS
2004
Springer
109views Formal Methods» more  SAS 2004»
15 years 6 months ago
Pointer-Range Analysis
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
Suan Hsi Yong, Susan Horwitz
SIGSOFT
2003
ACM
15 years 6 months ago
Evaluating and improving the automatic analysis of implicit invocation systems
Model checking and other finite-state analysis techniques have been very successful when used with hardware systems and less successful with software systems. It is especially di...
Jeremy S. Bradbury, Jürgen Dingel
IFL
1998
Springer
139views Formal Methods» more  IFL 1998»
15 years 5 months ago
Higher Order Demand Propagation
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
Dirk Pape
105
Voted
FPL
2006
Springer
113views Hardware» more  FPL 2006»
15 years 5 months ago
A Novel Heuristic and Provable Bounds for Reconfigurable Architecture Design
This paper is concerned with the application of formal optimisation methods to the design of mixed-granularity FPGAs. In particular, we investigate the appropriate mix and floorpl...
Alastair M. Smith, George A. Constantinides, Peter...
FM
2008
Springer
137views Formal Methods» more  FM 2008»
15 years 3 months ago
JML Runtime Assertion Checking: Improved Error Reporting and Efficiency Using Strong Validity
Abstract. The Java Modeling Language (JML) recently switched to an assertion semantics based on "strong validity" in which an assertion is taken to be valid precisely whe...
Patrice Chalin, Frédéric Rioux