Travelled to:1 × Brazil
1 × Cyprus
1 × Estonia
1 × Norway
1 × Poland
1 × Russia
1 × The Netherlands
2 × Canada
2 × Ireland
2 × Portugal
3 × Italy
3 × Spain
5 × France
8 × USA
Collaborated with:E.Albert A.M.Ben-Amram P.Arenas G.Puebla M.Gómez-Zamalloa M.Codish A.King A.N.Masud D.Zanardini G.Román-Díez P.J.Stuckey P.Ganty D.E.Alonso-Blas F.Spoto A.Flores-Montoya E.B.Johnsen R.Schlatte R.Bubel R.Hähnle P.Gordillo R.Gutiérrez L.Lu E.Martin-Martin M.Bruynooghe W.Vanhoof J.P.Gallagher V.Lagoon H.Søndergaard J.Doménech D.V.Ramírez-Deantes S.L.T.Tarifa J.Correas
Talks about:analysi (19) cost (7) program (6) termin (5) approach (4) resourc (4) concurr (4) bytecod (4) field (4) java (4)
Person: Samir Genaim
DBLP: Genaim:Samir
Contributed to:
2015
2015
2015
20142013
2013
2013
2012
2012
20122012
20122011
201120112011
2010201020092009
2009
20082008
20072007
200620052003200220022001200120172017Wrote 34 papers:
- CAV-2015-Ben-AmramG #complexity #ranking
- Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions (AMBA, SG), pp. 304–321.
- FM-2015-AlbertACGGMPR #analysis #concurrent #distributed #source code
- Resource Analysis: From Sequential to Concurrent and Distributed Programs (EA, PA, JC, SG, MGZ, EMM, GP, GRD), pp. 3–17.
- SAS-2015-AlbertGG #analysis #interprocedural #source code
- May-Happen-in-Parallel Analysis for Asynchronous Programs with Inter-Procedural Synchronization (EA, SG, PG), pp. 72–89.
- TACAS-2014-AlbertAFGGMPR #concurrent #named
- SACO: Static Analyzer for Concurrent Objects (EA, PA, AFM, SG, MGZ, EMM, GP, GRD), pp. 562–567.
- CAV-2013-GantyG #proving #termination
- Proving Termination Starting from the End (PG, SG), pp. 397–412.
- LOPSTR-2013-AlbertGG #analysis #approach
- A Transformational Approach to Resource Analysis with Typed-Norms (EA, SG, RG), pp. 38–53.
- POPL-2013-Ben-AmramG #constraints #integer #linear #on the #problem #ranking
- On the linear ranking problem for integer linear-constraint loops (AMBA, SG), pp. 51–62.
- FASE-2012-AlbertBGHR #source code
- Verified Resource Guarantees for Heap Manipulating Programs (EA, RB, SG, RH, GRD), pp. 130–145.
- FSE-2012-AlbertFG #concurrent #named
- MayPar: a may-happen-in-parallel analyzer for concurrent objects (EA, AFM, SG), p. 14.
- PEPM-2012-AlbertAGGP #named #termination
- COSTABS: a cost and termination analyzer for ABS (EA, PA, SG, MGZ, GP), pp. 151–154.
- SAS-2012-Alonso-BlasG #approach #cost analysis #on the
- On the Limits of the Classical Approach to Cost Analysis (DEAB, SG), pp. 405–421.
- VMCAI-2012-Ben-AmramGM #integer #on the #termination
- On the Termination of Integer Loops (AMBA, SG, ANM), pp. 72–87.
- FM-2011-AlbertGGJST #behaviour #bound #concurrent #simulation #worst-case
- Simulating Concurrent Behaviors with Worst-Case Cost Bounds (EA, SG, MGZ, EBJ, RS, SLTT), pp. 353–368.
- LCTES-2011-AlbertAGZ #analysis #parallel
- Task-level analysis for a language with async/finish parallelism (EA, PA, SG, DZ), pp. 21–30.
- PEPM-2011-AlbertBGHPR #using
- Verified resource guarantees using COSTA and KeY (EA, RB, SG, RH, GP, GRD), pp. 73–76.
- VMCAI-2011-AlbertGM #cost analysis #precise
- More Precise Yet Widely Applicable Cost Analysis (EA, SG, ANM), pp. 38–53.
- ISMM-2010-AlbertGG #garbage collection #memory management #parametricity #requirements
- Parametric inference of memory requirements for garbage collected languages (EA, SG, MGZ), pp. 121–130.
- SAS-2010-AlbertAGPD #analysis #approach
- From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis (EA, PA, SG, GP, DVRD), pp. 100–116.
- FM-2009-AlbertAGP #analysis
- Field-Sensitive Value Analysis by Field-Insensitive Analysis (EA, PA, SG, GP), pp. 370–386.
- ISMM-2009-AlbertGG #analysis #garbage collection
- Live heap space analysis for languages with garbage collection (EA, SG, MGZ), pp. 129–138.
- PPDP-2009-CodishGS #declarative #encoding #satisfiability
- A declarative encoding of telecommunications feature subscription in SAT (MC, SG, PJS), pp. 255–266.
- SAC-2008-AlbertAGPZ #bytecode #cost analysis #java
- Removing useless variables in cost analysis of Java bytecode (EA, PA, SG, GP, DZ), pp. 368–375.
- SAS-2008-AlbertAGP #automation #bound #cost analysis
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis (EA, PA, SG, GP), pp. 221–237.
- ESOP-2007-AlbertAGPZ #bytecode #cost analysis #java
- Cost Analysis of Java Bytecode (EA, PA, SG, GP, DZ), pp. 157–172.
- ISMM-2007-AlbertGG #analysis #bytecode #java
- Heap space analysis for java bytecode (EA, SG, MGZ), pp. 105–116.
- ICLP-2006-KingLG #detection #prolog #source code
- Detecting Determinacy in Prolog Programs (AK, LL, SG), pp. 132–147.
- VMCAI-2005-GenaimS #analysis #bytecode #data flow #java
- Information Flow Analysis for Java Bytecode (SG, FS), pp. 346–362.
- ESOP-2003-GenaimK #analysis #independence #logic programming #scheduling #source code
- Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling (SG, AK), pp. 84–98.
- SAS-2002-BruynoogheCGV #analysis #logic programming #reuse #source code #termination #using
- Reuse of Results in Termination Analysis of Typed Logic Programs (MB, MC, SG, WV), pp. 477–492.
- VMCAI-2002-GenaimCGL #termination
- Combining Norms to Prove Termination (SG, MC, JPG, VL), pp. 126–138.
- ESOP-2001-GenaimC #analysis #approach #dependence
- The Def-inite Approach to Dependency Analysis (SG, MC), pp. 417–432.
- ICLP-2001-CodishGSS #analysis
- Higher-Precision Groundness Analysis (MC, SG, HS, PJS), pp. 135–149.
- FASE-2017-DomenechGJS #agile #development #named #prototype #research #tool support #user interface
- EasyInterface: A Toolkit for Rapid Development of GUIs for Research Prototype Tools (JD, SG, EBJ, RS), pp. 379–383.
- CAV-2017-Ben-AmramG #multi #on the #ranking
- On Multiphase-Linear Ranking Functions (AMBA, SG), pp. 601–620.