Linear-invariant generation for probabilistic programs: automated support for proof-based methods

Authors:
Joost-Pieter Katoen;Annabelle K. McIver;Larissa A. Meinicke;Carroll C. Morgan
Affiliations:
RWTH Aachen University, Germany;Dept. Computer Science, Macquarie University, NSW, Australia;Dept. Computer Science, Macquarie University, NSW, Australia;School of Comp. Sci. and Eng., Univ. New South Wales, NSW, Australia
Venue:
SAS'10 Proceedings of the 17th international conference on Static analysis
Year:
2010

Citing 18
Cited 7

REDLOG: computer algebra meets computer logic

ACM SIGSAM Bulletin
Concurrent constraint programming: towards probabilistic abstract interpretation

Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
An axiomatic basis for computer programming

Communications of the ACM
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Discipline of Programming

A Discipline of Programming
Measuring the Precision of Abstract Interpretations

LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
Abstract Interpretation of Probabilistic Semantics

SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Non-linear loop invariant generation using Gröbner bases

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)

Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Probabilistic guarded commands mechanized in HOL

Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems

QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Program analysis as constraint solving

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Probabilistic CEGAR

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Abstraction Refinement for Probabilistic Software

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
On automated verification of probabilistic programs

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
PRISM: a tool for automatic verification of probabilistic systems

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Proof rules for probabilistic loops

FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement

Probabilistic abstract interpretation

ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Static analysis for probabilistic programs: inferring whole program properties from finitely many paths

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Bayesian inference using data flow analysis

Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
Probabilistic program analysis with martingales

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
PRINSYS: on a quest for probabilistic loop invariants

QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Bridging boolean and quantitative synthesis using smoothed proof search

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Operational versus weakest pre-expectation semantics for the probabilistic guarded command language

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a constraint-based method for automatically generating quantitative invariants for linear probabilistic programs, and we show how it can be used, in combination with proof-based methods, to verify properties of probabilistic programs that cannot be analysed using existing automated methods. To our knowledge, this is the first automated method proposed for quantitative-invariant generation.