On Probabilistic Techniques for Data Flow Analysis

DOI10.1016/j.entcs.2007.07.005zbMath1279.68034OpenAlexW2044774081MaRDI QIDQ2870284

Herbert Wiklicky, Alessandra Di Pierro, Chris Hankin

Publication date: 17 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.07.005

zbMATH Keywords

data flow analysisprobabilistic programsprobabilistic abstract interpretationlinear operators semantics

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

A Systematic Approach to Probabilistic Pointer Analysis ⋮ Relational Analysis and Precision via Probabilistic Abstract Interpretation

Uses Software

• Octave

Cites Work

• Measuring the confinement of probabilistic systems
• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• Semantics of probabilistic programs
• A structural approach to operational semantics
• Reactive, generative, and stratified models of probabilistic processes
• VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
• Abstract Interpretation for Worst and Average Case Analysis
• Advanced Linear Algebra
• Systematic design of program transformation frameworks by abstract interpretation
• CONCUR 2003 - Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Probabilistic Techniques for Data Flow Analysis