283 search results - page 49 / 57 » Extracting Program Logics From Abstract Interpretations Defi... |
POPL
1993
ACM
13 years 11 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
DIS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Behavioral sequences of the medaka (Oryzias latipes) were continuously investigated through an automatic image recognition system in response to medaka treated with the i...
SEMWEB
2010
Springer
13 years 5 months ago
2010
Springer
Systems based on statistical and machine learning methods have been shown to be extremely effective and scalable for the analysis of large amount of textual data. However, in the r...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...