The following pages link to Resource bound certification (Q5178852):
Displaying 23 items.
- 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)
- Space-aware ambients and processes (Q875514) (← links)
- A type system for counting instances of software components (Q1758151) (← links)
- Automated techniques for provably safe mobile code. (Q1853627) (← links)
- Distributed call-tracking for security (Q1869981) (← links)
- Certified abstract cost analysis (Q2044174) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- Linear dependent types in a call-by-value scenario (Q2441513) (← links)
- A type system for lock-free processes (Q2497143) (← links)
- A Coq Library for Internal Verification of Running-Times (Q2798271) (← links)
- More Precise Yet Widely Applicable Cost Analysis (Q3075469) (← links)
- More Typed Assembly Languages for Confidentiality (Q3498434) (← links)
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis (Q3522073) (← links)
- A Type System for Usage of Software Components (Q3638253) (← links)
- Termination checking with types (Q4659886) (← links)
- Verified Root-Balanced Trees (Q5056001) (← links)
- Denotational semantics as a foundation for cost recurrence extraction for functional languages (Q5101922) (← links)
- Programming Languages and Systems (Q5316573) (← links)
- Oracle-guided scheduling for controlling granularity in implicitly parallel languages (Q5371969) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705934) (← links)
- FM 2005: Formal Methods (Q5716916) (← links)
