The following pages link to (Q4319801):
Displaying 9 items.
- Selectors make set-based analysis too hard (Q812081) (← links)
- Class invariants as abstract interpretation of trace semantics (Q1749225) (← links)
- Static analysis for the \(\pi\)-calculus with applications to security (Q1854437) (← links)
- Idealized coinductive type systems for imperative object-oriented programs (Q3006157) (← links)
- Formal reasoning about modules, reuse and their correctness (Q4632313) (← links)
- Synthesizing objects (Q4790902) (← links)
- Partial redundancy elimination for access path expressions (Q4791060) (← links)
- Comparing flow-based binding-time analyses (Q5096754) (← links)
- Refinements of complexity results on type consistency for object-oriented databases (Q5946054) (← links)
