Probabilistic Abstractions with Arbitrary Domains

Details Probabilistic Abstractions with Arbitrary Domains Probabilistic Abstractions with Arbitrary Domains

2011-06-07

arxiv.org/abs/1106.1364v2

Computer Science

Logic in Computer Science

This is a technical report that goes along with an article to appear in the Proceedings of the 18th International Static Analy

Scientific paper

Recent work by Hermanns et al. and Kattenbelt et al. has extended counterexample-guided abstraction refinement (CEGAR) to probabilistic programs. These approaches are limited to predicate abstraction. We present a novel technique, based on the abstract reachability tree recently introduced by Gulavani et al., that can use arbitrary abstract domains and widening operators (in the sense of abstract interpretation). We show how suitable widening operators can deduce loop invariants diffcult to find for predicate abstraction, and propose refinement techniques.

Affiliated with

Also associated with

No associations

Rating

Probabilistic Abstractions with Arbitrary Domains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Probabilistic Abstractions with Arbitrary Domains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic Abstractions with Arbitrary Domains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26778