Sciweavers

4211 search results - page 118 / 843
» Types as Abstract Interpretations
Sort
View
130
Voted
ESOP
1994
Springer
15 years 7 months ago
Local Type Reconstruction by Means of Symbolic Fixed Point Iteration
Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...
Torben Amtoft
136
Voted
MSCS
2006
85views more  MSCS 2006»
15 years 3 months ago
On sequential functionals of type 3
We show that the extensional ordering of the sequential functionals of pure type 3, e.g. as defined via game semantics [2, 4], is not cpo-enriched. ws that this model does not equ...
Dag Normann
129
Voted
OOPSLA
2004
Springer
15 years 9 months ago
A practical type system and language for reference immutability
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The specific constraint exis that the abstract state of the object to whi...
Adrian Birka, Michael D. Ernst
123
Voted
SEFM
2007
IEEE
15 years 10 months ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook
91
Voted
ECAI
2004
Springer
15 years 9 months ago
Automatic Induction of Domain-Related Information: Learning Descriptors Type Domains
Abstract. Learning in complex contexts often requires pure induction to be supported by various kinds of meta-information. Providing such information is a critical, difficult and ...
Stefano Ferilli, Floriana Esposito, Teresa Maria A...