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

DOI10.1016/J.JLAP.2009.02.006MaRDI QIDQ1044673zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmsmodularityaverage-case analysiscompositionalityrandomness preservationstatic timing analysisstatic power analysis

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(9)

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

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)