1111 search results - page 119 / 223 » Program Analysis as Model Checking of Abstract Interpretatio... |
122
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...
113
click to vote
ICFP
2004
ACM
16 years 3 months ago
2004
ACM
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
104
click to vote
ZUM
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. This paper reports on an experimental application of formal specification to inform analysis of compiled code. The analyses with are concerned attempt to recover abstract...
101
click to vote
FOSSACS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
127
Voted
ICFCA
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In the past years Software Engineering has experienced several difficulties in modularising crosscutting aspects, like shared, dynamic or scattered behavior of object-ori...