Sciweavers

395 search results - page 21 / 79
» Program abstractions for behaviour validation
Sort
View
ICALP
2000
Springer
14 years 1 months ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée
VMCAI
2005
Springer
14 years 3 months ago
Generalized Typestate Checking for Data Structure Consistency
Abstract. We present an analysis to verify abstract set specifications for programs that use object field values to determine the membership of objects in abstract sets. In our a...
Patrick Lam, Viktor Kuncak, Martin C. Rinard
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
14 years 3 months ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
Edwin Brady, Kevin Hammond
CADE
2010
Springer
13 years 11 months ago
Multi-Prover Verification of Floating-Point Programs
Abstract. In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral proper...
Ali Ayad, Claude Marché
VSTTE
2005
Springer
14 years 3 months ago
Linking the Meaning of Programs to What the Compiler Can Verify
We formulate some research and development challenges that relate what a verifying compiler can verify to the definition and analysis of the application-content of programs, where...
Egon Börger