Sciweavers

293 search results - page 25 / 59
» Reasoning About States of Probabilistic Sequential Programs
Sort
View
PLDI
2010
ACM
13 years 10 months ago
DRFX: a simple and efficient memory model for concurrent programming languages
The most intuitive memory model for shared-memory multithreaded programming is sequential consistency (SC), but it disallows the use of many compiler and hardware optimizations th...
Daniel Marino, Abhayendra Singh, Todd D. Millstein...
POPL
2009
ACM
14 years 8 months ago
A calculus of atomic actions
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
Tayfun Elmas, Shaz Qadeer, Serdar Tasiran
POPL
2002
ACM
14 years 7 months ago
Stochastic lambda calculus and monads of probability distributions
Probability distributions are useful for expressing the meanings of probabilistic languages, which support formal modeling of and reasoning about uncertainty. Probability distribu...
Norman Ramsey, Avi Pfeffer
IFIP
2009
Springer
14 years 2 months ago
Applied Quantitative Information Flow and Statistical Databases
We firstly describe an algebraic structure which serves as solid basis to quantitatively reason about information flows. We demonstrate how programs in form of partition of state...
Jonathan Heusser, Pasquale Malacaria
CAV
2007
Springer
118views Hardware» more  CAV 2007»
14 years 1 months ago
Local Proofs for Global Safety Properties
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...
Ariel Cohen 0002, Kedar S. Namjoshi