\(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis

DOI10.1016/j.jlap.2009.02.006zbMath1192.68975OpenAlexW2067961203MaRDI QIDQ1044673

Michel 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

algorithmscompositionalityaverage-case analysismodularitystatic timing analysisrandomness preservationstatic power analysis

Mathematics Subject Classification ID

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

Related Items (6)

On reversible Turing machines and their function universality ⋮ Frugal Encoding in Reversible $\mathcal{MOQA}$ : A Case Study for Quicksort ⋮ Running time of the treapsort algorithm ⋮ Fundamentals of reversible flowchart languages ⋮ A Classical Propositional Logic for Reasoning About Reversible Logic Circuits ⋮ Entropy conservation for comparison-based algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial metric monoids and semivaluation spaces
• Semantics of probabilistic programs
• Automatic average-case analysis of algorithms
• A trivial algorithm whose analysis isn't
• Attribute grammars and automatic complexity analysis
• A characterization of partial metrizability: Domains are quantifiable.
• Quasi-metric properties of complexity spaces
• The correspondence between partial metrics and semivaluations
• The quasi-metric of complexity convergence
• The Analysis of Heapsort
• Irreversibility and Heat Generation in the Computing Process
• Automating program analysis
• Deletions That Preserve Randomness
• The Smyth Completion
• Two languages for estimating program efficiency
• Duality and quasi-normability for complexity spaces
• Weightable quasi-metric semigroups and semilattices
• A Random Bag Preserving Product Operation
• Logical Reversibility of Computation
• Principles and Practice of Constraint Programming – CP 2004

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