488 search results - page 17 / 98 » Compositional Verification of Probabilistic Systems Using Le... |
CONCUR
1998
Springer
15 years 3 months ago
1998
Springer
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...
CP
2006
Springer
15 years 2 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
IEE
2010
14 years 9 months ago
2010
A key problem in compositional model checking of software systems is that typical model checkers accept only closed systems (runnable programs) and therefore a component cannot be ...
105
click to vote
IPPS
1999
IEEE
15 years 3 months ago
1999
IEEE
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
197
Voted
POPL
2009
ACM
15 years 11 months ago
2009
ACM
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...