Prespecification in data refinement
Information Processing Letters
A calculus of refinements for program derivations
Acta Informatica
Data refinement of predicate transformers
Theoretical Computer Science
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
A compositional approach to performance modelling
A compositional approach to performance modelling
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Compositional performance modelling with the TIPPtool
Performance Evaluation - Special issue on modelling techniques and tools for performance evaluation
Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Cost-based analysis of probabilistic programs mechanised in HOL
Nordic Journal of Computing
Results on the quantitative μ-calculus qMμ
ACM Transactions on Computational Logic (TOCL)
Formally verified authenticated query dissemination in sensor networks
SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Automating refinement checking in probabilistic system design
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Software engineering in an uncertain world
Proceedings of the FSE/SDP workshop on Future of software engineering research
Quantitative µ-calculus analysis of power management in wireless networks
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
For standard (ie non-probabilistic) systems of reasonable size, correctness is analysed by simulation and/or model checking, possibly with standard program-logical arguments beforehand to reduce the problem size by abstraction. For probabilistic systems there are model checkers and simulators too; but probabilistic program logics are rarer. Thus e.g. model checkers face more severe exposure to state explosion because “front-end” probabilistic abstraction techniques are not so widely known [18]. We formalise probabilistic refinement of action systems [3] in order to provide just such a front end, and we illustrate with the probabilistic model checker PRISM [21] how it can be used to reduce state explosion. The case study is based on a performance analysis of randomised backoff in wireless communication [1].