The following pages link to Mechanical program analysis (Q4062612):
Displaying 37 items.
- An experimental logic based on the fundamental deduction principle (Q580998) (← links)
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699) (← links)
- Amortized complexity verified (Q670702) (← links)
- Cost analysis of object-oriented bytecode programs (Q764297) (← links)
- Synthesis with asymptotic resource bounds (Q832230) (← links)
- Lower-bound synthesis using loop specialization and Max-SMT (Q832313) (← links)
- Algebraic simplification in computer algebra: an analysis of bottom-up algorithms (Q914384) (← links)
- Automatic average-case analysis of algorithms (Q1174718) (← links)
- An information technology for efficiency analysis of recursive algorithms using standard complexity recurrences (Q1816324) (← links)
- Automated higher-order complexity analysis (Q1827392) (← links)
- PAN: A portable, parallel Prolog: Its design, realisation and performance. (Q1862650) (← links)
- Function composition and automatic average case analysis (Q1894000) (← links)
- Certified abstract cost analysis (Q2044174) (← links)
- Exponential automatic amortized resource analysis (Q2200835) (← links)
- Run-time complexity bounds using squeezers (Q2233463) (← links)
- A multi-domain incremental analysis engine and its application to incremental resource analysis (Q2346994) (← links)
- Time analysis of actor programs (Q2423757) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- A Transformational Approach to Parametric Accumulated-Cost Static Profiling (Q2798274) (← links)
- Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types (Q2931277) (← links)
- Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation (Q2945628) (← links)
- Inference of Field-Sensitive Reachability and Cyclicity (Q2946745) (← links)
- More Precise Yet Widely Applicable Cost Analysis (Q3075469) (← links)
- Calculating Statically Maximum Log Memory Used by Multi-threaded Transactional Programs (Q3179394) (← links)
- A Transformational Approach to Resource Analysis with Typed-Norms (Q3453647) (← links)
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis (Q3522073) (← links)
- A complexity calculus for recursive tree algorithms (Q3806812) (← links)
- A general framework for static profiling of parametric resource usage (Q4593063) (← links)
- ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS (Q4923290) (← links)
- A Transformational Approach to Resource Analysis with Typed-norms Inference (Q4957197) (← links)
- (Q5028427) (← links)
- Verified Root-Balanced Trees (Q5056001) (← links)
- A General Framework for Static Cost Analysis of Parallel Logic Programs (Q5097623) (← links)
- Denotational semantics as a foundation for cost recurrence extraction for functional languages (Q5101922) (← links)
- Resource Analysis driven by (Conditional) Termination Proofs (Q5108498) (← links)
- (Q5114822) (← links)
- (Q5875426) (← links)
