Sciweavers

322 search results - page 18 / 65
» Developing and Reasoning About Probabilistic Programs in pGC...
Sort
View
ESOP
2004
Springer
14 years 1 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
POPL
2008
ACM
14 years 8 months ago
Cryptographically sound implementations for typed information-flow security
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
Cédric Fournet, Tamara Rezk
ENTCS
2008
97views more  ENTCS 2008»
13 years 7 months ago
Meta-programming With Built-in Type Equality
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
Tim Sheard, Emir Pasalic
ICLP
1995
Springer
13 years 11 months ago
Variants of the Event Calculus
Abstract. The Event Calculus is a narrative based formalism for reasoning about actions and change originally proposed in logic programming form by Kowalski and Sergot. In this pap...
Fariba Sadri, Robert A. Kowalski
ICFP
2009
ACM
14 years 8 months ago
Purely functional lazy non-deterministic programming
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
Sebastian Fischer, Oleg Kiselyov, Chung-chieh Shan