Travelled to:
1 × Belgium
1 × Cyprus
1 × Germany
1 × Hungary
1 × Japan
2 × France
2 × Italy
2 × Portugal
3 × Spain
5 × United Kingdom
7 × USA
Collaborated with:
M.Bruynooghe Q.Phan V.Dumortier D.S.Shterionov N.Mazur F.Catthoor W.Simoens T.Mantadelis J.Jansen R.Tronçon B.Demoen I.Dasseville K.C.Shashidhar A.Jorissen S.Verdoolaege Z.Somogyi H.Vandecasteele W.Vanhoof A.Kågedal V.Englebert A.Mariën M.v.d.Hallen M.Denecker J.Devriendt P.Ross A.Mulkers M.Codish A.Callebaut K.Paridel Y.Vanrompay Y.Berbers
Talks about:
program (8) abstract (7) mercuri (6) analysi (5) system (5) interpret (4) region (4) logic (4) probabilist (3) constraint (3)
Person: Gerda Janssens
DBLP: Janssens:Gerda
Facilitated 1 volumes:
Contributed to:
Wrote 29 papers:
- ICLP-J-2015-DassevilleHJD #composition #framework #logic #semantics
- Semantics of templates in a compositional framework for building logics (ID, MvdH, GJ, MD), pp. 681–695.
- PADL-2015-ShterionovJ #implementation #performance #pipes and filters #probability
- Implementation and Performance of Probabilistic Inference Pipelines (DSS, GJ), pp. 90–104.
- SAC-2015-ShterionovJ #component #pipes and filters #probability
- Crucial components in probabilistic inference pipelines (DSS, GJ), pp. 1887–1889.
- PPDP-2014-JansenDDJ #evaluation #state of the art
- Experimental Evaluation of a State-Of-The-Art Grounder (JJ, ID, JD, GJ), pp. 249–258.
- ICLP-J-2013-JansenJJ #compilation #induction #prolog
- Compiling Input* FO(·) inductive definitions into tabled prolog rules for IDP3 (JJ, AJ, GJ), pp. 691–704.
- PADL-2011-MantadelisPJVB #ad hoc #mobile #network
- Analysing a Publish/Subscribe System for Mobile Ad Hoc Networks with ProbLog (TM, KP, GJ, YV, YB), pp. 34–37.
- ICLP-2010-MantadelisJ10 #probability
- Dedicated Tabling for a Probabilistic Setting (TM, GJ), pp. 124–133.
- CAV-2009-VerdoolaegeJB #equivalence #source code #using
- Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences (SV, GJ, MB), pp. 599–613.
- PPDP-2009-PhanJ #analysis #source code
- Path-sensitive region analysis for mercury programs (QP, GJ), pp. 161–170.
- ISMM-2008-PhanSJ #memory management #runtime
- Runtime support for region-based memory management in Mercury (QP, ZS, GJ), pp. 61–70.
- ICLP-2007-PhanJ #analysis
- Static Region Analysis for Mercury (QP, GJ), pp. 317–332.
- ICLP-2006-PhanJ #memory management #source code #towards
- Towards Region-Based Memory Management for Mercury Programs (QP, GJ), pp. 433–435.
- CC-2005-ShashidharBCJ #equivalence #program transformation #source code #verification
- Verification of Source Code Transformations by Program Equivalence Checking (KCS, MB, FC, GJ), pp. 221–236.
- DATE-2005-ShashidharBCJ #algebra #equivalence #functional #source code #verification
- Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code (KCS, MB, FC, GJ), pp. 1310–1315.
- ICLP-2004-TronconJV #compilation #control flow #evaluation #lazy evaluation #performance #query
- Fast Query Evaluation with (Lazy) Control Flow Compilation (RT, GJ, HV), pp. 240–253.
- LOPSTR-2002-MazurJV #optimisation
- Collecting Potential Optimisations (NM, GJ, WV), pp. 109–110.
- VMCAI-2002-TronconBJC #array #reduction
- Storage Size Reduction by In-place Mapping of Arrays (RT, MB, GJ, FC), pp. 167–181.
- ICLP-2001-MazurRJB #aspect-oriented #garbage collection
- Practical Aspects for a Working Compile Time Garbage Collection System for Mercury (NM, PR, GJ, MB), pp. 105–119.
- CL-2000-MazurJB #analysis #memory management #reuse
- A Module Based Analysis for Memory Reuse in Mercury (NM, GJ, MB), pp. 1255–1269.
- ICLP-1997-BruynoogheJK #analysis #logic programming #programming language
- Live-Structure Analysis for Logic Programming Languages with Declarations (MB, GJ, AK), pp. 33–47.
- ICLP-1995-MulkersSJB #equation #on the
- On the Practicality of Abstract Equation Systems (AM, WS, GJ, MB), pp. 781–795.
- ILPS-1995-JanssensBD #abstract interpretation #automaton #constraints #logic programming #source code
- A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs (GJ, MB, VD), pp. 336–350.
- CC-1994-JanssensS #abstract interpretation #constraints #implementation #logic programming #on the #source code
- On the Implementation of Abstract Interpretation Systems for (Constraint) Logic Programs (GJ, WS), pp. 172–187.
- ICLP-1994-DumortierJ #towards
- Towards a Practical Full Mode Inference System for CLP(H, N) (VD, GJ), pp. 569–583.
- PLILP-1994-JanssensBE
- Abstracting Numerical Values in CLP(H, N) (GJ, MB, VE), pp. 400–414.
- ICLP-1993-DumortierJBC #analysis #constraints
- Freeness Analysis in the Presence of Numerical Constraints (VD, GJ, MB, MC), pp. 100–115.
- JICSCP-1988-BruynoogheJ88 #abstract interpretation
- An Instance of Abstract Interpretation Integrating Type and Mode Inferencing (MB, GJ), pp. 669–683.
- JICSCP-1988-JanssensDM88 #unification
- Improving the Register Allocation of WAM by Recording Unification (GJ, BD, AM), pp. 1388–1402.
- SLP-1987-BruynoogheJCD87 #abstract interpretation #optimisation #prolog #source code #towards
- Abstract Interpretation: Towards the Global Optimization of Prolog Programs (MB, GJ, AC, BD), pp. 192–204.