COSTA

swMATH162MaRDI QIDQ12930FDOQ12930

Author name not available (Why is that?)

Cited In (22)

• 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
• Automatic Type Inference for Amortised Heap-Space Analysis
• Analysis of Executable Software Models
• Closed-form upper bounds in static cost analysis
• Multiple solutions of boundary value problems: An elementary approach via the shooting method
• Validating Timed Models of Deployment Components with Parametric Concurrency
• A non-deterministic view on non-classical negations
• A type-based complexity analysis of object oriented programs
• Critical point theorems and applications to a semilinear elliptic problem
• Mining supervised classification performance studies: a meta-analytic investigation
• Title not available (Why is that?)
• Amortised Resource Analysis with Separation Logic
• Existence and multiplicity of solutions for semilinear elliptic systems
• On the Termination of Integer Loops
• Locally regular coloured graphs
• Comparing Cost Functions in Resource Analysis
• A Hoare Logic for Energy Consumption Analysis
• Efficient Type-Checking for Amortised Heap-Space Analysis
• Automatic Inference of Resource Consumption Bounds
• Ranking Functions for Linear-Constraint Loops

This page was built for software: COSTA