Filters








22,978 Hits in 3.2 sec

Abstraction Refinement for Probabilistic Software [chapter]

Mark Kattenbelt, Marta Kwiatkowska, Gethin Norman, David Parker
2008 Lecture Notes in Computer Science  
We use abstraction-refinement techniques that represent probabilistic programs as Markov decision processes and their abstractions as stochastic two-player games.  ...  We present a methodology and implementation for verifying ANSI-C programs that exhibit probabilistic behaviour, such as failures or randomisation.  ...  We would also like to thank Daniel Kroening for his advice and support regarding SATABS.  ... 
doi:10.1007/978-3-540-93900-9_17 fatcat:kezt6uy4hrasnk3xel74uzk2na

On Quantitative Software Verification [chapter]

Marta Kwiatkowska
2009 Lecture Notes in Computer Science  
The goal is to focus on system software that exhibits probabilistic behaviour, for example through communication failures or randomisation, and quantitative properties of software such as "the maximum  ...  The abstraction-refinement loop proceeds in a quantitative fashion, yielding lower and upper bounds on the probability/expectation values for the computed abstractions.  ... 
doi:10.1007/978-3-642-02652-2_2 fatcat:hyp75jszarepxjt4agjbmwnwqy

Towards accurate probabilistic models using state refinement

Paulo H. Maia, Jeff Kramer, Sebastian Uchitel, Nabor C. Mendonça
2009 Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering on European software engineering conference and foundations of software engineering symposium - ESEC/FSE '09  
We propose state refinement as a technique to mitigate this problem, and present a framework for iteratively improving the accuracy of a probabilistically annotated behaviour model.  ...  Probabilistic models are useful in the analysis of system behaviour and non-functional properties.  ...  One model can have several refinements, since it can have many abstract states. Furthermore, the same abstract set can be refined in different ways.  ... 
doi:10.1145/1595696.1595742 dblp:conf/sigsoft/MaiaKUM09 fatcat:zqm4igzaovd6zicenkdkrswrzy

Quantitative reactive modeling and verification

Thomas A. Henzinger
2013 Computer Science - Research and Development  
and abstraction refinement, model checking, and synthesis.  ...  We therefore propose to introduce quantitative fitness measures for programs, specifically for measuring the function, performance, and robustness of reactive programs such as concurrent processes.  ...  Acknowledgements The author thanks the anonymous reviewers for their valuable suggestions for improving this article.  ... 
doi:10.1007/s00450-013-0251-7 pmid:27069511 pmcid:PMC4811300 fatcat:cimfqu272beijj6dgqpvsz7koy

A Framework for Verification of Software with Time and Probabilities [chapter]

Marta Kwiatkowska, Gethin Norman, David Parker
2010 Lecture Notes in Computer Science  
We outline a quantitative abstraction refinement approach, which can be used to automatically construct and analyse abstractions of probabilistic, real-time programs.  ...  In this paper, we describe a framework for quantitative verification of software that exhibits both real-time and probabilistic behaviour.  ...  Other abstraction refinement frameworks for MDPs are put forward in [12] and [6] . Abstraction-refinement approaches have been proposed for non-probabilistic timed automata, e.g.  ... 
doi:10.1007/978-3-642-15297-9_4 fatcat:5mte3m2r3rfu5mt5efjdxxv5fe

Developing Model Checkers Using PAT [chapter]

Yang Liu, Jun Sun, Jin Song Dong
2010 Lecture Notes in Computer Science  
specific abstraction techniques.  ...  Based on this design, model checkers for concurrent systems, real-time systems, probabilistic systems and Web Services are developed inside the PAT framework, which demonstrates the practicality and scalability  ...  For instance, we have successfully developed the algorithms for divergence checking, timed refinement checking in real-time system module and new deadlock and probabilistic reachability checking.  ... 
doi:10.1007/978-3-642-15643-4_30 fatcat:r7pxhl6qybaltlrps7nklzs7ue

PRISM 4.0: Verification of Probabilistic Real-Time Systems [chapter]

Marta Kwiatkowska, Gethin Norman, David Parker
2011 Lecture Notes in Computer Science  
These include: an extensible toolkit for building, verifying and refining abstractions of probabilistic models; an explicit-state probabilistic model checking library; a discrete-event simulation engine  ...  for statistical model checking; support for generation of optimal adversaries/strategies; and a benchmark suite.  ...  For a full list of PRISM contributors, see [16].  ... 
doi:10.1007/978-3-642-22110-1_47 fatcat:y6aqczsj3fhtrcwwwljw5iqqki

$$2^5$$ Years of Model Checking [chapter]

Edmund M. Clarke, Qinsi Wang
2015 Lecture Notes in Computer Science  
The technique has been used successfully to debug complex computer hardware, communication protocols, and software.  ...  Model Checking is an automatic verification technique for large state transition systems. It was originally developed for reasoning about finite-state concurrent systems.  ...  This is even more serious for software verification than for hardware verification, as software tends to be less structured than hardware.  ... 
doi:10.1007/978-3-662-46823-4_2 fatcat:g4tbd7fribgothf2bfgajkywfe

Practical Probability: Applying pGCL to Lattice Scheduling [chapter]

David Cock
2013 Lecture Notes in Computer Science  
The refinement framework employed is compatible with that used in the L4.verified project, supporting our argument that full-scale verification of probabilistic security properties for realistic systems  ...  software is feasible.  ...  The author is also indebted to the anonymous reviewers for their insightful and constructive feedback, and to Toby Murray and Matthias Daum for reviewing draft copies of this paper.  ... 
doi:10.1007/978-3-642-39634-2_23 fatcat:a56tpm2apbdjbmf3nct6yoyj2a

Dependability-Explicit Engineering with Event-B: Overview of Recent Achievements [article]

Elena Troubitsyna
2012 arXiv   pre-print
As a result, we have created a number of formal approaches to explicitly reason about dependability in the refinement process.  ...  We outline our approaches to integrating safety analysis into the development process, modelling fault tolerant systems and probabilistic dependability evaluation.  ...  However, the analysis of recent software-caused accidents has shown that the current development process is inadequate for achieving high degree of dependability.  ... 
arXiv:1210.7032v1 fatcat:qv43yho3tngxzid45jahjc4vaq

Performance analysis of probabilistic action systems

Stefan Hallerstede, Michael Butler
2004 Formal Aspects of Computing  
In other words, a good refinement corresponds to a reduction of non-optimal behaviour. This also means that the abstract specification sets a boundary for the performance of any implementation.  ...  Formal notations like B or action systems support a notion of refinement. Refinement relates an abstract specification A to a concrete specification C that is as least as deterministic.  ...  Probabilistic action system C refines probabilistic action system A, denoted by A C, if all behaviour possible for C is also possible for A.  ... 
doi:10.1007/s00165-004-0037-6 fatcat:mjyysgl2gje3zn6nbnvsca75se

Confidentiality-Preserving Refinement is Compositional — Sometimes [chapter]

Thomas Santen, Maritta Heisel, Andreas Pfitzmann
2002 Lecture Notes in Computer Science  
the implementation in a probabilistic setting.  ...  It turns out that the refinement relation is not composition in general, but the condition for compositionality can be stated in a way that builds on the analysis of subsystems thus aiding system designers  ...  Thanks also go to Sandra Steinbrecher and Elke Franz for asking good questions and finding some typos.  ... 
doi:10.1007/3-540-45853-0_12 fatcat:4wnvrvnt5fcf3czm64hrtv7tri

Incremental Bisimulation Abstraction Refinement

Lei Song, Lijun Zhang, Holger Hermanns, Jens Chr. Godskesen
2013 2013 13th International Conference on Application of Concurrency to System Design  
This paper proposes an abstraction refinement approach for the probabilistic computation tree logic (PCTL), which is based on incrementally computing a sequence of may-and must-quotient automata.  ...  Abstraction refinement techniques in probabilistic model checking are prominent approaches to the verification of very large or infinite-state probabilistic concurrent systems.  ...  PROBABILISTIC INCREMENTAL BISIMULATION ABSTRACTION REFINEMENT For an equivalence relation R, we can first construct the may and must quotients.  ... 
doi:10.1109/acsd.2013.5 dblp:conf/acsd/Song0HG13 fatcat:yu24ufeu5jcejoromifuqag2ye

Incremental Bisimulation Abstraction Refinement

Lei Song, Lijun Zhang, Holger Hermanns, Jens CHR. Godskesen
2014 ACM Transactions on Embedded Computing Systems  
This paper proposes an abstraction refinement approach for the probabilistic computation tree logic (PCTL), which is based on incrementally computing a sequence of may-and must-quotient automata.  ...  Abstraction refinement techniques in probabilistic model checking are prominent approaches to the verification of very large or infinite-state probabilistic concurrent systems.  ...  PROBABILISTIC INCREMENTAL BISIMULATION ABSTRACTION REFINEMENT For an equivalence relation R, we can first construct the may and must quotients.  ... 
doi:10.1145/2627352 fatcat:xove3b335vflzog2ismacahyg4

From software verification to 'everyware' verification

Marta Kwiatkowska
2013 Computer Science - Research and Development  
Everyday objects -called 'everyware' by Adam Greenfield -are now endowed with sensing, controlled by software, and often wirelessly connected and Internet-enabled.  ...  Our increasing dependence on ubiquitous computing creates an urgent need for modelling and verification technologies to support the design process, and hence improve the reliability and reduce production  ...  The project seeks scalable automated frameworks for extraction and verification of models directly from real software, such as C, which will crucially depend on our ability to formulate efficient abstraction-refinement  ... 
doi:10.1007/s00450-013-0249-1 fatcat:yijv5tfqwjb5rlopsnmy6gpsf4
« Previous Showing results 1 — 15 out of 22,978 results