The following pages link to Gianluca Amato (Q281280):
Displaying 26 items.
- Efficient constraint/generator removal from double description of polyhedra (Q281283) (← links)
- (Q435978) (redirect page) (← links)
- Discovering invariants via simple component analysis (Q435979) (← links)
- Exploiting linearity in sharing analysis of object-oriented programs (Q737080) (← links)
- On the algebraic structure of declarative programming languages (Q1035699) (← links)
- Descending chains and narrowing on template abstract domains (Q1671249) (← links)
- Experimental evaluation of numerical domains for inferring ranges (Q2130561) (← links)
- On collecting semantics for program analysis (Q2182314) (← links)
- Primitive abundant and weird numbers with many prime factors (Q2631707) (← links)
- (Q2722047) (← links)
- (Q2763646) (← links)
- Indexed Categories and Bottom-Up Semantics of Logic Programs (Q2996182) (← links)
- A General Framework for Variable Aliasing: Towards Optimal Operators for Sharing Properties (Q3079911) (← links)
- Optimality in goal-dependent analysis of Sharing (Q3181746) (← links)
- On the interaction between sharing and linearity (Q3400961) (← links)
- Correct Answers for First Order Logic (Q4923518) (← links)
- Deriving Numerical Abstract Domains via Principal Component Analysis (Q4930722) (← links)
- Primitive weird numbers having more than three distinct prime factors (Q4977333) (← links)
- The role of linearity in sharing analysis (Q5055490) (← links)
- The Abstract Domain of Parallelotopes (Q5170166) (← links)
- Narrowing Operators on Template Abstract Domains (Q5206948) (← links)
- Optimal multibinding unification for sharing and linearity analysis (Q5418949) (← links)
- Observational Completeness on Abstract Interpretation (Q5894358) (← links)
- Observational Completeness on Abstract Interpretation (Q5902155) (← links)
- Universal Algebra in UniMath (Q6504361) (← links)
- Uniform Algebras: Models and constructive Completeness for Full, Simply Typed {\lambda}Prolog (Q6730010) (← links)
