Skip to main navigation Skip to search Skip to main content

Static analysis of programs with imprecise probabilistic inputs

  • ENS Paris-Saclay
  • Institut Pierre Simon Laplace, CNRS and CEA

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Having a precise yet sound abstraction of the inputs of numerical programs is important to analyze their behavior. For many programs, these inputs are probabilistic, but the actual distribution used is only partially known. We present a static analysis framework for reasoning about programs with inputs given as imprecise probabilities: we define a collecting semantics based on the notion of previsions and an abstract semantics based on an extension of Dempster-Shafer structures. We prove the correctness of our approach and show on some realistic examples the kind of invariants we are able to infer.

Original languageEnglish
Title of host publicationVerified Software
Subtitle of host publicationTheories, Tools, Experiments - 5th International Conference, VSTTE 2013, Revised Selected Papers
EditorsErnie Cohen, Andrey Rybalchenko, Andrey Rybalchenko
PublisherSpringer Verlag
Pages22-47
Number of pages26
ISBN (Electronic)9783642541070
DOIs
Publication statusPublished - 1 Jan 2014
Externally publishedYes
Event5th International Conference on Verified Software: Theories, Tools, Experiments, VSTTE 2013 - Menlo Park, United States
Duration: 17 May 201319 May 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8164
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Verified Software: Theories, Tools, Experiments, VSTTE 2013
Country/TerritoryUnited States
CityMenlo Park
Period17/05/1319/05/13

Fingerprint

Dive into the research topics of 'Static analysis of programs with imprecise probabilistic inputs'. Together they form a unique fingerprint.

Cite this