Sciweavers

159 search results - page 5 / 32
» Structural abstract interpretation, A formal study using Coq
Sort
View
TPHOL
2008
IEEE
15 years 4 months ago
Canonical Big Operators
In this paper, we present an approach to describe uniformly iterated “big” operations, like Pn i=0 f(i) or maxi∈I f(i) and to provide lemmas that encapsulate all the commonly...
Yves Bertot, Georges Gonthier, Sidi Ould Biha, Ioa...
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
15 years 6 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
ICCD
2004
IEEE
137views Hardware» more  ICCD 2004»
15 years 6 months ago
Comparative Study of Strategies for Formal Verification of High-Level Processors
Compared are different methods for evaluation of formulas expressing microprocessor correctness in the logic of Equality with Uninterpreted Functions and Memories (EUFM) by transl...
Miroslav N. Velev
SAS
2004
Springer
15 years 3 months ago
The Octahedron Abstract Domain
hedron Abstract Domain Robert Claris´o and Jordi Cortadella Universitat Polit`ecnica de Catalunya Barcelona, Spain Abstract. An interesting area in static analysis is the study of...
Robert Clarisó, Jordi Cortadella
POPL
2007
ACM
15 years 10 months ago
A very modal model of a modern, major, general type system
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...