Sciweavers

293 search results - page 10 / 59
» Reasoning About States of Probabilistic Sequential Programs
Sort
View
POPL
2007
ACM
14 years 7 months ago
Implementing deterministic declarative concurrency using sieves
The predominant thread-based approach to concurrent programming is bug-prone, difficult to reason about, and does not scale well to large numbers of processors. Sieves provide a s...
Sam Lindley
VSTTE
2010
Springer
13 years 5 months ago
Local Reasoning and Dynamic Framing for the Composite Pattern and Its Clients
Abstract. The Composite design pattern is an exemplar of specification and verification challenges for sequential object-oriented programs. Region logic is a Hoare logic augmente...
Stan Rosenberg, Anindya Banerjee, David A. Naumann
PLDI
2004
ACM
14 years 28 days ago
KISS: keep it simple and sequential
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
Shaz Qadeer, Dinghao Wu
ICLP
2004
Springer
14 years 26 days ago
Possible Worlds Semantics for Probabilistic Logic Programs
Abstract. In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic Logi...
Alex Dekhtyar, Michael I. Dekhtyar
PPOPP
2011
ACM
12 years 10 months ago
Cooperative reasoning for preemptive execution
We propose a cooperative methodology for multithreaded software, where threads use traditional synchronization idioms such as locks, but additionally document each point of potent...
Jaeheon Yi, Caitlin Sadowski, Cormac Flanagan