The following pages link to Samir Genaim (Q407519):
Displaying 39 items.
- Corrigendum to ``Reachability-based acyclicity analysis by abstract interpretation'' (Q407521) (← links)
- Cost analysis of object-oriented bytecode programs (Q764297) (← links)
- Lower-bound synthesis using loop specialization and Max-SMT (Q832313) (← links)
- Complexity of Bradley-Manna-Sipma lexicographic ranking functions (Q1702898) (← links)
- Reachability-based acyclicity analysis by abstract interpretation (Q1944776) (← links)
- May-happen-in-parallel analysis with condition synchronization (Q1990482) (← links)
- On multiphase-linear ranking functions (Q2164261) (← links)
- Rely-guarantee termination and cost analyses of loops with concurrent interleavings (Q2398172) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- (Q2763688) (← links)
- May-Happen-in-Parallel Analysis for Priority-Based Scheduling (Q2870112) (← links)
- On the Termination of Integer Loops (Q2891402) (← links)
- Automatic Inference of Resource Consumption Bounds (Q2891436) (← links)
- On the linear ranking problem for integer linear-constraint loops (Q2931783) (← links)
- On the Inference of Resource Usage Upper and Lower Bounds (Q2946710) (← links)
- Inference of Field-Sensitive Reachability and Cyclicity (Q2946745) (← links)
- Inferring Termination Conditions for Logic Programs Using Backwards Analysis (Q2996201) (← links)
- More Precise Yet Widely Applicable Cost Analysis (Q3075469) (← links)
- A Transformational Approach to Resource Analysis with Typed-Norms (Q3453647) (← links)
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis (Q3522073) (← links)
- (Q4411979) (← links)
- (Q4417885) (← links)
- Worst-case groundness analysis using definite Boolean functions (Q4452643) (← links)
- (Q4495072) (← links)
- Inferring termination conditions for logic programs using backwards analysis (Q4673540) (← links)
- (Q4736509) (← links)
- (Q4736992) (← links)
- From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis (Q4930719) (← links)
- A Transformational Approach to Resource Analysis with Typed-norms Inference (Q4957197) (← links)
- May-Happen-in-Parallel Analysis with Returned Futures (Q5096077) (← links)
- Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis (Q5108517) (← links)
- Precise Cost Analysis via Local Reasoning (Q5166697) (← links)
- Termination and Cost Analysis of Loops with Concurrent Interleavings (Q5166699) (← links)
- Inferring non-suspension conditions for logic programs with dynamic scheduling (Q5277806) (← links)
- May-Happen-in-Parallel Analysis for Actor-Based Concurrency (Q5277912) (← links)
- Detecting Determinacy in Prolog Programs (Q5449597) (← links)
- Ranking Functions for Linear-Constraint Loops (Q5501930) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5711500) (← links)
- Comparing Cost Functions in Resource Analysis (Q5747627) (← links)
