293 search results - page 17 / 59 » Reasoning About States of Probabilistic Sequential Programs |
FAC
2007
13 years 7 months ago
2007
In object-oriented programming, reentrant method invocations and shared references make it difficult to achieve adequate encapsulation for sound modular reasoning. This tutorial p...
CAV
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
LPAR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...
CSFW
2005
IEEE
14 years 1 months ago
2005
IEEE
To reason about information flow based on beliefs, a new model is developed that describes how attacker beliefs change due to the attacker’s observation of the execution of a p...
CCS
2006
ACM
13 years 11 months ago
2006
ACM
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...