BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Belgium
1 × Canada
1 × Cyprus
1 × Denmark
1 × Hungary
1 × Portugal
1 × Serbia
1 × Sweden
1 × The Netherlands
1 × USA
2 × Estonia
2 × France
2 × Germany
3 × Japan
4 × Spain
5 × United Kingdom
7 × Italy
Collaborated with:
∅ M.Alpuente M.Falaschi N.Nishida E.Albert J.Silva M.Hanus M.Leuschel J.G.Ramos F.Mesnard É.Payet S.Antoy B.Braßel F.Huch J.Iborra G.Arroyo S.Tamarit J.M.Almendros-Jiménez G.Moreno S.Fischer P.J.Iranzo C.Ochoa A.Yamada S.Lucas M.J.Ramis
Talks about:
program (22) partial (16) evalu (15) logic (14) function (11) narrow (9) termin (6) declar (5) paradigm (4) special (4)

Person: Germán Vidal

DBLP DBLP: Vidal:Germ=aacute=n

Facilitated 5 volumes:

LOPSTR 2011Ed
FLOPS 2010Ed
PEPM 2009Ed
SAS 2008Ed
PPDP 2016Ed

Contributed to:

CADE 20152015
ICLP 20152015
LOPSTR 20142014
LOPSTR 20132013
ICLP 20122012
LOPSTR 20122012
SCAM 20122012
RTA 20112011
LOPSTR 20102010
LOPSTR 20092009
FLOPS 20082008
ICLP 20082008
LOPSTR 20082008
ICFP 20072007
LOPSTR 20072007
PEPM 20072007
IFL 20062006
LOPSTR 20062006
ESOP 20052005
ICFP 20052005
LOPSTR 20042004
PEPM 20042004
PPDP 20042004
LOPSTR 20022002
PEPM 20022002
FLOPS 20012001
LOPSTR 20012001
LOPSTR 20002000
LOPSTR 20002000
FLOPS 19991999
ICFP 19991999
SAS 19981998
ALP/HOA 19971997
PEPM 19971997
ESOP 19961996
ALP 19941994
ILPS 19931993
PLILP 19931993
PPDP 20172017

Wrote 42 papers:

CADE-2015-IborraNVY #dependence #problem #termination
Reducing Relative Termination to Dependency Pair Problems (JI, NN, GV, AY), pp. 163–178.
ICLP-J-2015-MesnardPV #logic programming #testing
Concolic testing in logic programming (FM, ÉP, GV), pp. 711–725.
LOPSTR-2014-Vidal #execution #generative #prolog #testing
Concolic Execution and Test Case Generation in Prolog (GV), pp. 167–181.
LOPSTR-2013-NishidaV #finite #representation
A Finite Representation of the Narrowing Space (NN, GV), pp. 54–71.
LOPSTR-2013-Vidal #erlang #term rewriting #towards #verification
Towards Erlang Verification by Term Rewriting (GV), pp. 109–126.
ICLP-J-2012-Vidal #independence #logic programming #partial evaluation #source code
Annotation of logic programs for independent AND-parallelism by partial evaluation (GV), pp. 583–600.
LOPSTR-2012-NishidaV #term rewriting
Computing More Specific Versions of Conditional Rewriting Systems (NN, GV), pp. 137–154.
SCAM-2012-Vidal #execution #symbolic computation #termination #verification
Closed Symbolic Execution for Verifying Program Termination (GV), pp. 34–43.
RTA-2011-NishidaV #recursion
Program Inversion for Tail Recursive Functions (NN, GV), pp. 283–298.
LOPSTR-2010-Vidal #approach #hybrid #logic programming #partial evaluation #source code
A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs (GV), pp. 200–214.
LOPSTR-2009-IborraNV #dependence #proving #termination
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing (JI, NN, GV), pp. 52–66.
LOPSTR-2009-Vidal #declarative #partial evaluation #scalability #source code #towards
Towards Scalable Partial Evaluation of Declarative Programs (GV), pp. 1–4.
FLOPS-2008-Vidal #linear #termination
Termination of Narrowing in Left-Linear Constructor Systems (GV), pp. 113–129.
ICLP-2008-Vidal #analysis #effectiveness #partial evaluation #predict
Trace Analysis for Predicting the Effectiveness of Partial Evaluation (GV), pp. 790–794.
LOPSTR-2008-ArroyoRTV #approach #functional #higher-order #source code
A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs (GA, JGR, ST, GV), pp. 40–54.
LOPSTR-2008-LeuschelV #logic programming #partial evaluation #performance #scalability #source code
Fast Offline Partial Evaluation of Large Logic Programs (ML, GV), pp. 119–134.
ICFP-2007-BrasselHFHV #call-by #evaluation #lazy evaluation
Lazy call-by-value evaluation (BB, MH, SF, FH, GV), pp. 265–276.
LOPSTR-2007-FischerSTV #functional #lazy evaluation #partial evaluation #source code
Preserving Sharing in the Partial Evaluation of Lazy Functional Programs (SF, JS, ST, GV), pp. 74–89.
PEPM-2007-Vidal #logic programming #partial evaluation #source code #termination
Quasi-terminating logic programs for ensuring the termination of partial evaluation (GV), pp. 51–60.
IFL-2006-Almendros-JimenezV #automation
Automatic Partial Inversion of Inductively Sequential Functions (JMAJ, GV), pp. 253–270.
LOPSTR-2006-ArroyoRSV #graph #partial evaluation #using
Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs (GA, JGR, JS, GV), pp. 60–76.
ESOP-2005-LeuschelV #deduction #slicing
Forward Slicing by Conjunctive Partial Deduction and Argument Filtering (ML, GV), pp. 61–76.
ICFP-2005-RamosSV #partial evaluation #performance #source code
Fast narrowing-driven partial evaluation for inductively sequential programs (JGR, JS, GV), pp. 228–239.
LOPSTR-2004-BrasselHHSV #functional #logic programming #profiling #runtime #source code
Run-Time Profiling of Functional Logic Programs (BB, MH, FH, JS, GV), pp. 182–197.
PEPM-2004-OchoaSV #slicing
Dynamic slicing based on redex trails (CO, JS, GV), pp. 123–134.
PPDP-2004-BrasselHHV #declarative #multi #semantics #source code
A semantics for tracing declarative multi-paradigm programs (BB, MH, FH, GV), pp. 179–190.
LOPSTR-2002-Vidal #declarative #multi #partial evaluation #slicing #source code
Forward Slicing of Multi-paradigm Declarative Programs Based on Partial Evaluation (GV), pp. 219–237.
PEPM-2002-Vidal
Cost-augmented narrowing-driven specialization (GV), pp. 52–62.
FLOPS-2001-AlbertHV #declarative #multi
A Practical Partial Evaluator for a Multi-Paradigm Declarative Language (EA, MH, GV), pp. 326–342.
LOPSTR-2001-AlbertV #declarative #multi #profiling
Symbolic Profiling for Multi-paradigm Declarative Languages (EA, GV), pp. 148–167.
LOPSTR-2000-AlbertAV #effectiveness #partial evaluation
Measuring the Effectiveness of Partial Evaluation (EA, SA, GV).
LOPSTR-J-2000-AlbertAV #effectiveness #functional #logic #partial evaluation
Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages (EA, SA, GV), pp. 103–124.
FLOPS-1999-AlpuenteFMV #functional #lazy evaluation #logic programming #source code
A Transformation System for Lazy Functional Logic Programs (MA, MF, GM, GV), pp. 147–162.
ICFP-1999-AlpuenteHLV #functional #logic programming #source code
Specialization of Inductively Sequential Functional Logic Programs (MA, MH, SL, GV), pp. 273–283.
SAS-1998-AlbertAFJV #functional #logic programming
Improving Control in Functional Logic Program Specialization (EA, MA, MF, PJI, GV), pp. 262–277.
ALP-1997-AlpuenteFMV
Safe Folding/Unfolding with Conditional Narrowing (MA, MF, GM, GV), pp. 1–15.
PEPM-1997-AlpuenteFJV #functional #lazy evaluation #logic programming #source code
Specialization of Lazy Functional Logic Programs (MA, MF, PJI, GV), pp. 151–162.
ESOP-1996-AlpuenteFV #functional #logic programming #partial evaluation #source code
Narrowing-Driven Partial Evaluation of Functional Logic Programs (MA, MF, GV), pp. 45–61.
ALP-1994-AlpuenteFV #analysis #composition #equation #source code
Compositional Analysis for Equational Horn Programs (MA, MF, GV), pp. 77–94.
ILPS-1993-AlpuenteFV #analysis #constraints #equation #incremental
Incremental Equational Constraint Analyses (MA, MF, GV), p. 657.
PLILP-1993-AlpuenteFRV #approximate #equation #logic programming #optimisation #source code
Narrowing Approximations as an Optimization for Equational Logic Programs (MA, MF, MJR, GV), pp. 391–409.
PPDP-2017-MesnardPV #constraints #logic programming #unification
Selective unification in constraint logic programming (FM, ÉP, GV), pp. 115–126.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.