796 search results - page 113 / 160 » The Semantics of Abstract Program Slicing |
POPL
2010
ACM
15 years 11 months ago
2010
ACM
Abstract. The blame calculus of Wadler and Findler gives a high-level semantics to casts in higher-order languages. The coercion calculus of Henglein, on the other hand, provides a...
111
Voted
PADL
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rule...
130
click to vote
ICTAC
2010
Springer
15 years 10 days ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
227
Voted
ICFP
2009
ACM
16 years 3 months ago
2009
ACM
rrent ML, synchronization abstractions can be defined and passed as values, much like functions in ML. This mechanism admits a powerful, modular style of concurrent programming, c...
137
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...