100 search results - page 12 / 20 » Invariant inference for static checking |
ICFP
2004
ACM
14 years 9 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
JFP
2008
13 years 9 months ago
2008
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The...
ESOP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
VMCAI
2009
Springer
14 years 4 months ago
2009
Springer
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource ...
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
A plausible representation of relational information among entities in dynamic systems such as a living cell or a social community is a stochastic network which is topologically r...