Pages that link to "Item:Q1640983"
From MaRDI portal
The following pages link to A type-based complexity analysis of object oriented programs (Q1640983):
Displaying 7 items.
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs (Q2119987) (← links)
- A computational complexity analysis of tunable type inference for Generic Universe Types (Q2304565) (← links)
- Analyzing the implicit computational complexity of object-oriented programs (Q3165969) (← links)
- (Q4506393) (← links)
- Type-Based Complexity Analysis for Fork Processes (Q4910427) (← links)
- An empirical study into COBOL type inferencing (Q5943084) (← links)
- Refinements of complexity results on type consistency for object-oriented databases (Q5946054) (← links)