58 search results - page 6 / 12 » Probabilistic Proof Systems: A Primer |
SP
1990
IEEE
15 years 1 months ago
1990
IEEE
In recent times information flow and non-interference have become very popular concepts for expressing both integrity and privacy properties. We present the first general definitio...
88
Voted
CONCUR
2004
Springer
15 years 2 months ago
2004
Springer
We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavi...
103
Voted
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
IPL
2006
14 years 9 months ago
2006
In the past 5 years, a series of verification algorithms has been proposed for infinite Markov chains that have a finite attractor, i.e., a set that will be visited infinitely oft...
104
click to vote
ICALP
2011
Springer
14 years 29 days ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...