MOQA; unlocking the potential of compositional static average-case analysis

DOI10.1016/J.JLAP.2009.02.006zbMATH Open1192.68975OpenAlexW2067961203MaRDI QIDQ1044673FDOQ1044673

Authors: M. Schellekens 

Publication date: 18 December 2009

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2009.02.006

Recommendations

• Sorting algorithms in \textsc{MOQA}
• Functionally-generalised \textsc{MOQA} operations
• A random bag preserving product operation
• Function composition and automatic average case analysis
• Automating program analysis

zbMATH Keywords

algorithmsmodularityaverage-case analysiscompositionalityrandomness preservationstatic timing analysisstatic power analysis

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40)

Cites Work

• Introduction to algorithms
• Analytic combinatorics
• Title not available (Why is that?)
• The correspondence between partial metrics and semivaluations
• A characterization of partial metrizability: Domains are quantifiable.
• Irreversibility and Heat Generation in the Computing Process
• The Smyth Completion
• Title not available (Why is that?)
• Logical Reversibility of Computation
• Title not available (Why is that?)
• Quasi-metric properties of complexity spaces
• Weightable quasi-metric semigroups and semilattices
• Partial metric monoids and semivaluation spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Semantics of probabilistic programs
• Title not available (Why is that?)
• Duality and quasi-normability for complexity spaces
• Attribute grammars and automatic complexity analysis
• Deletions That Preserve Randomness
• Automatic average-case analysis of algorithms
• The Analysis of Heapsort
• Automating program analysis
• The quasi-metric of complexity convergence
• A trivial algorithm whose analysis isn't
• Norm-weightable Riesz spaces and the dual complexity space
• Cauchy filters and strong completeness of quasi-uniform spaces
• Title not available (Why is that?)
• Two languages for estimating program efficiency
• A random bag preserving product operation
• Principles and Practice of Constraint Programming – CP 2004

Cited In (9)

• A classical propositional logic for reasoning about reversible logic circuits
• On reversible Turing machines and their function universality
• Fundamentals of reversible flowchart languages
• Functionally-generalised \textsc{MOQA} operations
• Sorting algorithms in \textsc{MOQA}
• Frugal encoding in reversible \(\mathcal{MOQA}\): a case study for Quicksort
• Entropy conservation for comparison-based algorithms
• A random bag preserving product operation
• Running time of the treapsort algorithm

This page was built for publication: \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis

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