Abstraction Refinement for Probabilistic Software Mark Kattenbelt, Marta Kwiatkowska, Gethin Norman, and David Parker Oxford University Computing Laboratory, Parks Road, Oxford, OX1 3QD Abstract. We present a methodolog

First Page		Document Content
Date: 2008-10-24 07:08:14 Metaphysics Formal methods Theoretical computer science Modal logic Philosophical logic Predicate abstraction Markov decision process Logic Refinement Abstraction Krivine machine		Abstraction Refinement for Probabilistic Software Mark Kattenbelt, Marta Kwiatkowska, Gethin Norman, and David Parker Oxford University Computing Laboratory, Parks Road, Oxford, OX1 3QD Abstract. We present a methodolog Add to Reading List Source URL: qav.comlab.ox.ac.uk Download Document from Source Website File Size: 523,17 KB Share Document on Facebook

	SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri1 , Robert Nieuwenhuis2 , and Albert Oliveras2 1 DocID: 1xVJt - View Document
	Predicate Abstraction for Relaxed Memory Models Andrei Dan1 , Yuri Meshman2 , Martin Vechev1 , and Eran Yahav2 1 ETH Zurich {andrei.dan, martin.vechev}@inf.ethz.ch DocID: 1xVFk - View Document
	Predicate Abstraction for Programmable Logic Controllers Sebastian Biallas, Mirco Giacobbe and Stefan Kowalewski Embedded Software Laboratory, RWTH Aachen University, Germany Abstract. In this paper, we present a predic DocID: 1xUQe - View Document
	SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri? , Robert Nieuwenhuis?? , and Albert Oliveras?? Abstract. Predicate abstraction is a technique for automatically extracting finite-state abstractions for s DocID: 1xUHn - View Document
	Predicate Abstraction for Relaxed Memory Models Andrei Dan Martin Vechev DocID: 1xTZn - View Document