6274 search results - page 177 / 1255 » Proofs, Programs, Processes |
164
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
153
click to vote
ESOP
2007
Springer
16 years 17 days ago
2007
Springer
Abstract We present the semantics and proof system for an objectoriented language with active objects, asynchronous method calls, and futures. The language, based on Creol, disting...
223
click to vote
ICFP
1997
ACM
15 years 10 months ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
181
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
180
click to vote
ICFEM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...