Sciweavers

923 search results - page 107 / 185
» Proving the value of formal methods
Sort
View
SAS
2005
Springer
134views Formal Methods» more  SAS 2005»
15 years 11 months ago
Using Dependent Types to Certify the Safety of Assembly Code
There are many source-level analyses or instrumentation tools that enforce various safety properties. In this paper we present an infrastructure that can be used to check independe...
Matthew Harren, George C. Necula
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
15 years 11 months ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula
IFL
1998
Springer
139views Formal Methods» more  IFL 1998»
15 years 10 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
FMCO
2009
Springer
134views Formal Methods» more  FMCO 2009»
15 years 4 months ago
Verification of Context-Dependent Channel-Based Service Models
Abstract. The paradigms of service-oriented computing and modeldriven development are becoming of increasing importance in the field of software engineering. According to these par...
Natallia Kokash, Christian Krause, Erik P. de Vink
ARITH
1999
IEEE
15 years 10 months ago
Correctness Proofs Outline for Newton-Raphson Based Floating-Point Divide and Square Root Algorithms
This paper describes a study of a class of algorithms for the floating-point divide and square root operations, based on the Newton-Raphson iterative method. The two main goals we...
Marius A. Cornea-Hasegan, Roger A. Golliver, Peter...