\(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
From MaRDI portal
Publication:1044673
DOI10.1016/j.jlap.2009.02.006zbMath1192.68975MaRDI QIDQ1044673
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
algorithms; compositionality; average-case analysis; modularity; static timing analysis; randomness preservation; static power analysis
Related Items
On reversible Turing machines and their function universality, Running time of the treapsort algorithm, Fundamentals of reversible flowchart languages, Entropy conservation for comparison-based algorithms, A Classical Propositional Logic for Reasoning About Reversible Logic Circuits, Frugal Encoding in Reversible $\mathcal{MOQA}$ : A Case Study for Quicksort
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
