Genaim, Samir - Facultad de Informática, Universidad Politécnica de Madrid

• Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
• Heap Space Analysis for Java Bytecode Elvira Albert
• Termination and Cost Analysis with COSTA and its User Interfaces
• Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
• Constancy Analysis Samir Genaim and Fausto Spoto
• Inferring Non-Suspension Conditions for Logic Programs with Dynamic Scheduling
• COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode
• Applications of Static Slicing in Cost Analysis of Java Bytecode
• Cost Analysis of Java Bytecode , P. Arenas1
• Information Flow Analysis for Java Bytecode Samir Genaim and Fausto Spoto
• Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling
• One Loop at a Time Michael Codish Samir Genaim Maurice Bruynooghe
• The Def-inite Approach to Dependency Analysis Samir Genaim and Michael Codish
• Incremental Re nement of Semantic Based Program Analysis for Logic Programs
• Field-Sensitive Value Analysis by Field-Insensitive Analysis
• Experiments in Cost Analysis of Java Bytecode
• Termination Analysis of Logic Programs Through Combination of Type-Based Norms
• Asymptotic Resource Usage Bounds , D. Alonso1
• Termination Analysis of Java Bytecode , P. Arenas1
• Removing Useless Variables in Cost Analysis of Java Bytecode
• Detecting Determinacy in Prolog Programs , Lunjin Lu2
• Dealing with Numeric Fields in Termination Analysis of Java-like Languages
• Modeling Secure Information Flow with Boolean Samir Genaim , Roberto Giacobazzi, and Isabella Mastroeni
• Live Heap Space Analysis for Languages with Garbage Collection Elvira Albert
• ByteCode 2008 A Cost and Termination Analyzer
• The Def-inite Approach to Dependency Analysis Samir Genaim and Michael Codish
• Optimized Eager Evaluation of Fixed Points for the Analysis of Logic Programs
• Resource Usage Analysis and Its Application to Resource Certification
• Reuse of Results in Termination Analysis of Typed Logic Programs
• Combining Norms to Prove Termination Samir Genaim1
• Worst-Case Groundness Analysis using Definite Boolean Functions
• A Semantic Based Workbench for the Termination Analysis
• Termination Analysis of Java Bytecode Elvira Albert1
• A Declarative Encoding of Telecommunications Feature Subscription in SAT
• Inferring Termination Conditions for Logic Programs using Backwards Analysis
• Information Flow Analysis for Java Bytecode Samir Genaim and Fausto Spoto
• Preference-based Configuration of Web Page Content Carmel Domshlak Samir Genaim Ronen Brafman
• Inferring Termination Conditions for Logic Programs Using Backwards Analysis
• Higher-Precision Groundness Analysis Michael Codish1
• Under consideration for publication in Theory and Practice of Logic Programming 1 Inferring Termination Conditions for Logic
• Comparing Cost Functions in Resource Analysis , P. Arenas1
• The COSTA Cost and Termination Analyzer for Java Bytecode and its Web Interface
• Upper Bounds of Resource Usage for Java Bytecode using COSTA and its Web Interface