Stochastic modelling of communication protocols from source code

DOI10.1016/J.ENTCS.2007.08.013MaRDI QIDQ2870288zbMATH OpenOpenAlexWikidataFDO

Authors Michael J. A. Smith

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.08.013

zbMATH Keywords

static analysiscommunication protocolsstochastic process algebraperformance modelling

Mathematics Subject Classification ID

Theory of programming languages (68N15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)

Recommendations

• A Compositional Approach to Performance Modelling
• scientific article; zbMATH DE number 3892605
• Stochastic process algebras
• Quantitative static analysis of communication protocols using abstract Markov chains
• Construction and verification of performance and reliability models

Cites work

• scientific article; zbMATH DE number 1617330 (Why is no real title available?)
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 1285311 (Why is no real title available?)
• scientific article; zbMATH DE number 1982210 (Why is no real title available?)
• scientific article; zbMATH DE number 1798184 (Why is no real title available?)
• scientific article; zbMATH DE number 2087570 (Why is no real title available?)
• scientific article; zbMATH DE number 2090713 (Why is no real title available?)
• Algorithms for an irreducible and lumpable strong stochastic bound
• CCured, type-safe retrofitting of legacy code
• Formal techniques for performance analysis: blending SAN and PEPA
• Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
• Principal component analysis.
• Quasi Lumpability, Lower-Bounding Coupling Matrices, and Nearly Completely Decomposable Markov Chains

Cited in

(4)

• Quantitative static analysis of communication protocols using abstract Markov chains
• Quantitative static analysis of communication protocols using abstract Markov chains
• Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond
• Probabilistic abstract interpretation of imperative programs using truncated normal distributions

Describes a project that uses

Uses Software

• CIL
• ns-2
• CCured
• SLAM
• BLAST

This page was built for publication: Stochastic modelling of communication protocols from source code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870288)