Cited in
(28)- Validating timed models of deployment components with parametric concurrency
- Comparing cost functions in resource analysis
- On the number of singularities, zero curvature points and vertices of a simple convex space curve
- A framework for computing finite SLD trees
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs
- Amortised resource analysis with separation logic
- Closed-form upper bounds in static cost analysis
- Multiple solutions of boundary value problems: An elementary approach via the shooting method
- Ranking functions for linear-constraint loops
- A non-deterministic view on non-classical negations
- A type-based complexity analysis of object oriented programs
- On the termination of integer loops
- Critical point theorems and applications to a semilinear elliptic problem
- Mining supervised classification performance studies: a meta-analytic investigation
- A Hoare logic for energy consumption analysis
- Automatic type inference for amortised heap-space analysis
- SPEED
- COSTABS
- DPPD
- ResAna
- SACO
- Refal
- scientific article; zbMATH DE number 7453196 (Why is no real title available?)
- Existence and multiplicity of solutions for semilinear elliptic systems
- Analysis of executable software models
- Automatic inference of resource consumption bounds
- Locally regular coloured graphs
- Efficient Type-Checking for Amortised Heap-Space Analysis
This page was built for software: COSTA
