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 × Australia
1 × Canada
1 × India
1 × Ireland
1 × Israel
1 × Korea
2 × Hungary
2 × Sweden
23 × USA
3 × France
3 × Portugal
4 × Belgium
4 × Denmark
4 × Germany
4 × Japan
5 × Spain
6 × Italy
7 × United Kingdom
Collaborated with:
G.Puebla M.Carro P.López-García F.Bueno J.F.Morales M.J.G.d.l.Banda P.C.d.Guzmán A.Casas E.Albert D.C.Gras K.Marriott K.Muthukumar S.K.Debray E.Mera F.Rossi N.Stulova J.A.Navas J.Correas M.Marron D.Kapur M.Méndez-Lojo P.J.Stuckey R.Haemmerlé N.Lin P.Pietrzak D.Stefanovic D.Cabeza G.Gupta V.S.Costa K.Shen F.Giannotti K.J.Greene R.I.Nasr A.Serrano J.M.Gómez L.Scandolo C.Kunz C.Ochoa J.P.Gallagher L.M.G.Henríquez M.Olmedilla H.Kuchen J.J.Moreno-Navarro R.Warren Z.Drey T.Trigo P.Arenas-Sánchez U.Montanari E.Pontelli R.Yang E.Trias E.S.Ackley S.Forrest C.Silva R.Rocha M.Codish A.Mulkers M.Bruynooghe Maximiliano Klemen Pedro López-García 0001 U.Liqat S.Kerrison K.Georgiou N.Grech K.Eder
Talks about:
program (49) analysi (30) logic (30) parallel (25) abstract (18) independ (17) use (14) base (13) execut (11) implement (10)

Person: Manuel V. Hermenegildo

DBLP DBLP: Hermenegildo:Manuel_V=

Facilitated 12 volumes:

ICLP 2010Ed
ICLP 2010Ed
POPL 2010Ed
VMCAI 2010Ed
FLOPS 2008Ed
PADL 2005Ed
SAS 2002Ed
PPDP 1995Ed
PLILP 1994Ed
NACLP 1990Ed
CC 2016Ed
PEPM 2019Ed

Contributed to:

ICLP 20152015
ICLP 20142014
LOPSTR 20142014
PPDP 20142014
LOPSTR 20132013
PADL 20132013
FLOPS 20122012
ICLP 20122012
PADL 20122012
ICLP 20112011
LOPSTR 20112011
PADL 20112011
PPDP 20112011
ICLP 20092009
ISMM 20092009
LOPSTR 20092009
PADL 20092009
CC 20082008
ICLP 20082008
PADL 20082008
PASTE 20082008
PEPM 20082008
PPDP 20082008
VMCAI 20082008
ICLP 20072007
LOPSTR 20072007
PADL 20072007
PASTE 20072007
FLOPS 20062006
ICLP 20062006
LOPSTR 20062006
PADL 20062006
SAS 20062006
ICLP 20052005
LOPSTR 20052005
PPDP 20052005
FLOPS 20042004
ICLP 20042004
LOPSTR 20042004
PADL 20042004
PDCL 20042004
ICLP 20032003
PEPM 20032003
SAS 20032003
ICALP 20022002
CL 20002000
LOPSTR 20002000
LOPSTR 20002000
ICLP 19991999
LOPSTR 19991999
PEPM 19991999
ICLP 19971997
ILPS 19971997
ALP 19961996
ESOP 19961996
LOPSTR 19961996
PLILP 19961996
SAS 19961996
ICLP 19951995
PEPM 19951995
ALP 19941994
ICLP 19941994
ILPS 19941994
POPL 19941994
SAS 19941994
ICLP 19931993
ILPS 19931993
LOPSTR 19931993
PEPM 19931993
PLILP 19921992
WSA 19921992
ICLP 19911991
ILPS 19911991
PLILP 19911991
ICLP 19901990
PLDI 19901990
NACLP 19891989
ICLP/SPL 19881988
ICLP 19871987
ICLP 19861986
PPDP 20162016
PPDP 20182018

Wrote 108 papers:

ICLP-J-2015-StulovaMH #runtime
Practical run-time checking via unobtrusive property caching (NS, JFM, MVH), pp. 726–741.
ICLP-J-2014-SerranoLH #abstract interpretation #analysis #logic programming #resource management #source code #using
Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types (AS, PLG, MVH), pp. 739–754.
LOPSTR-2014-MoralesH #prolog
Pre-indexed Terms for Prolog (JFM, MVH), pp. 317–331.
PPDP-2014-StulovaMH #debugging #higher-order #source code
Assertion-based Debugging of Higher-Order (C)LP Programs (NS, JFM, MVH), pp. 225–235.
LOPSTR-2013-LiqatKSGLGHE #analysis #energy #modelling #source code
Energy Consumption Analysis of Programs Based on XMOS ISA-Level Models (UL, SK, AS, KG, PLG, NG, MVH, KE), pp. 72–90.
PADL-2013-DreyMHC #debugging
Reversible Language Extensions and Their Application in Debugging (ZD, JFM, MVH, MC), pp. 206–221.
PADL-2013-GuzmanCH
Supporting Pruning in Tabled LP (PCdG, MC, MVH), pp. 60–76.
FLOPS-2012-GuzmanCHS #framework #implementation
A General Implementation Framework for Tabled CLP (PCdG, MC, MVH, PJS), pp. 104–119.
ICLP-J-2012-MoralesHCH #compilation #javascript #lightweight
Lightweight compilation of (C)LP to JavaScript (JFM, RH, MC, MVH), pp. 755–773.
PADL-2012-GuzmanCCH #approach
A Segment-Swapping Approach for Executing Trapped Computations (PCdG, AC, MC, MVH), pp. 138–152.
ICLP-J-2011-GuzmanCCH #backtracking #independence #parallel
Parallel backtracking with answer memoing for independent and-parallelism (PCdG, AC, MC, MVH), pp. 555–574.
LOPSTR-2011-MoralesHH #composition #logic
Modular Extensions for Modular (Logic) Languages (JFM, MVH, RH), pp. 139–154.
PADL-2011-MeraTLH #debugging #logic programming #performance #profiling #runtime #source code
Profiling for Run-Time Checking of Computational Properties and Performance Debugging in Logic Programs (EM, TT, PLG, MVH), pp. 38–53.
PPDP-2011-HaemmerleLH #constraints
CLP projection for constraint handling rules (RH, PLG, MVH), pp. 137–148.
ICLP-2009-GuzmanCH #implementation #multi
A Tabling Implementation Based on Variables with Multiple Bindings (PCdG, MC, MVH), pp. 190–204.
ICLP-2009-MeraLH #framework #runtime #testing #verification
Integrating Software Testing and Run-Time Checking in an Assertion Verification Framework (EM, PLG, MVH), pp. 281–295.
ISMM-2009-MarronKH #identification
Identification of logically related heap regions (MM, DK, MVH), pp. 89–98.
LOPSTR-2009-ScandoloKH #parallel #pipes and filters #using
Program Parallelization Using Synchronized Pipelining (LS, CK, MVH), pp. 173–187.
PADL-2009-GuzmanCH #execution #program transformation #towards
Towards a Complete Scheme for Tabled Execution Based on Program Transformation (PCdG, MC, MVH), pp. 224–238.
CC-2008-MarronHKS #analysis #graph #modelling #performance
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models (MM, MVH, DK, DS), pp. 245–259.
ICLP-2008-CasasCH #implementation #independence #nondeterminism #strict
A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism (AC, MC, MVH), pp. 651–666.
ICLP-2008-GuzmanCH #execution #program transformation #sketching
A Sketch of a Complete Scheme for Tabled Execution Based on Program Transformation (PCdG, MC, MVH), pp. 795–800.
ICLP-2008-TriasNAFH
Negative Ternary Set-Sharing (ET, JAN, ESA, SF, MVH), pp. 301–316.
PADL-2008-CasasCH #execution #implementation #independence #strict #towards
Towards a High-Level Implementation of Execution Primitives for Unrestricted, Independent And-Parallelism (AC, MC, MVH), pp. 230–247.
PADL-2008-GuzmanCHSR #continuation #implementation
An Improved Continuation Call-Based Implementation of Tabling (PCdG, MC, MVH, CS, RR), pp. 197–213.
PASTE-2008-MarronMHSK #analysis #array #recursion
Sharing analysis of arrays, collections, and recursive structures (MM, MML, MVH, DS, DK), pp. 43–49.
PEPM-2008-PietrzakCPH #analysis #composition #prolog #source code #verification
A practical type analysis for verification of modular prolog programs (PP, JC, GP, MVH), pp. 61–70.
PPDP-2008-MeraLCH #automaton #estimation #execution #towards
Towards execution time estimation in abstract machine-based languages (EM, PLG, MC, MVH), pp. 174–184.
PPDP-2008-MoralesCH #automaton #generative #using
Comparing tag scheme variations using an abstract machine generator (JFM, MC, MVH), pp. 32–43.
VMCAI-2008-Mendez-LojoH #analysis #precise #set #source code
Precise Set Sharing Analysis for Java-Style Programs (MML, MVH), pp. 172–187.
ICLP-2007-NavasMLH #analysis #bound #logic programming #source code
User-Definable Resource Bounds Analysis for Logic Programs (JAN, EM, PLG, MVH), pp. 348–363.
ICLP-2007-PietrzakH #automation #fault #logic programming #source code
Automatic Binding-Related Error Diagnosis in Logic Programs (PP, MVH), pp. 333–347.
LOPSTR-2007-CasasCH #algorithm #independence #logic programming #source code #strict
Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs (AC, MC, MVH), pp. 138–153.
LOPSTR-2007-Mendez-LojoNH #analysis #approach #flexibility #object-oriented #source code
A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs (MML, JAN, MVH), pp. 154–168.
PADL-2007-MeraLPCH #execution #profiling #static analysis
Combining Static Analysis and Profiling for Estimating Execution Times (EM, PLG, GP, MC, MVH), pp. 140–154.
PASTE-2007-MarronSHK #analysis #library
Heap analysis in the presence of collection libraries (MM, DS, MVH, DK), pp. 31–36.
FLOPS-2006-CasasCH #approach #evaluation #functional #higher-order #lazy evaluation
A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems (AC, DC, MVH), pp. 146–162.
ICLP-2006-AlbertAPH
Reduced Certificates for Abstraction-Carrying Code (EA, PAS, GP, MVH), pp. 163–178.
ICLP-2006-MeraLPCH #estimation #execution #logic programming #profiling #static analysis #using
Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation (EM, PLG, GP, MC, MVH), pp. 431–432.
LOPSTR-2006-MoralesCH #automaton #optimisation #prolog #towards
Towards Description and Optimization of Abstract Machines in an Extension of Prolog (JFM, MC, MVH), pp. 77–93.
PADL-2006-NavasBH #analysis #clique #performance #top-down #using
Efficient Top-Down Set-Sharing Analysis Using Cliques (JAN, FB, MVH), pp. 183–198.
SAS-2006-PueblaAH #abstract interpretation
Abstract Interpretation with Specialized Definitions (GP, EA, MVH), pp. 107–126.
ICLP-2005-MoralesCPH #automaton #generative #implementation #performance
A Generator of Efficient Abstract Machine Implementations and Its Application to Emulator Minimization (JFM, MC, GP, MVH), pp. 21–36.
ICLP-2005-PueblaAH #analysis #framework #logic programming #source code
A Generic Framework for the Analysis and Specialization of Logic Programs (GP, EA, MVH), pp. 407–409.
LOPSTR-2005-CorreasPHB #analysis #composition #source code
Experiments in Context-Sensitive Analysis of Modular Programs (JC, GP, MVH, FB), pp. 163–178.
LOPSTR-2005-OchoaPH #prolog #source code
Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs (CO, GP, MVH), pp. 80–97.
PPDP-2005-HermenegildoALP #abstraction
Abstraction carrying code and resource-awareness (MVH, EA, PLG, GP), pp. 1–11.
FLOPS-2004-BuenoLH #abstract interpretation #analysis #multi #standard
Multivariant Non-failure Analysis via Standard Abstract Interpretation (FB, PLG, MVH), pp. 100–116.
ICLP-2004-AlbertPH #abstract interpretation #certification #mobile
Abstract Interpretation-Based Mobile Code Certification (EA, GP, MVH), pp. 446–447.
LOPSTR-2004-Lopez-GarciaBH #analysis #logic programming #source code #using
Determinacy Analysis for Logic Programs Using Mode and Type Information (PLG, FB, MVH), pp. 19–35.
LOPSTR-2004-PueblaAH #performance #prolog
Efficient Local Unfolding with Ancestor Stacks for Full Prolog (GP, EA, MVH), pp. 149–165.
PADL-2004-CorreasGCCH #implementation #persistent
A Generic Persistence Model for (C)LP Systems (and Two Useful Implementations) (JC, JMG, MC, DC, MVH), pp. 104–119.
PADL-2004-MoralesCH #c #compilation #prolog #using
Improved Compilation of Prolog to C Using Moded Types and Determinism Information (JFM, MC, MVH), pp. 86–103.
PDCL-2004-PueblaCHBBMS #analysis #composition #framework #source code
A Generic Framework for Context-Sensitive Analysis of Modular Programs (GP, JC, MVH, FB, MJGdlB, KM, PJS), pp. 233–260.
ICLP-2003-CorreasGCGH #persistent
A Generic Persistence Model for (C)LP Systems (JC, JMG, MC, DCG, MVH), pp. 481–482.
PEPM-2003-PueblaH
Abstract specialization and its applications (GP, MVH), pp. 29–43.
SAS-2003-HermenegildoPBL #abstract interpretation #development #preprocessor #using
Program Development Using Abstract Interpretation (And The Ciao System Preprocessor) (MVH, GP, FB, PLG), pp. 127–152.
ICALP-2002-HermenegildoPBL #approximate #debugging #semantics #specification #using #validation
Program Debugging and Validation Using Semantic Approximations and Partial Specifications (MVH, GP, FB, PLG), pp. 69–72.
CL-2000-GrasH #prolog
A New Module System for Prolog (DCG, MVH), pp. 131–148.
CL-2000-Hermenegildo #documentation #generative
A Documentation Generator for (C)LP Systems (MVH), pp. 1345–1361.
LOPSTR-2000-BuenoBHMPS #analysis #compilation #optimisation
A model for inter-module analysis and optimizing compilation (FB, MJGdlB, MVH, KM, GP, PJS).
LOPSTR-J-2000-BuenoBHMPS #analysis #compilation #optimisation
A Model for Inter-module Analysis and Optimizing Compilation (FB, MJGdlB, MVH, KM, GP, PJS), pp. 86–102.
ICLP-1999-CarroH #concurrent #database #prolog #thread #using
Concurrency in Prolog Using Threads and a Shared Database (MC, MVH), pp. 320–334.
ICLP-1999-HermenegildoBPL #debugging #optimisation #preprocessor #program analysis #using
Program Analysis, Debugging, and Optimization Using the Ciao System Preprocessor (MVH, FB, GP, PLG), pp. 52–66.
LOPSTR-1999-PueblaBH #constraints #debugging #logic programming #source code
Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs (GP, FB, MVH), pp. 273–292.
PEPM-1999-PueblaHG #abstract interpretation #framework #integration #partial evaluation
An Integration of Partial Evaluation in a Generic Abstract Interpretation Framework (GP, MVH, JPG), pp. 75–84.
ICLP-1997-DebrayGH #analysis #logic programming #source code
Non-Failure Analysis for Logic Programs (SKD, PLG, MVH), pp. 48–62.
ILPS-1997-DebrayLHL #bound #estimation #logic programming #source code
Lower Bound Cost Estimation for Logic Programs (SKD, PLG, MVH, NWL), pp. 291–305.
ILPS-1997-Hermenegildo #analysis #programming
Programming with Global Analysis (MVH), pp. 49–50.
ALP-1996-BandaHM #independence #logic
Independence in Dynamically Scheduled Logic Languages (MJGdlB, MVH, KM), pp. 47–61.
ESOP-1996-BuenoGHP #analysis #prolog #source code #standard
Global Analysis of Standard Prolog Programs (FB, DCG, MVH, GP), pp. 108–124.
LOPSTR-1996-PueblaH #parallel
Abstract Specialization and Its Application to Program Parallelization (GP, MVH), pp. 169–186.
PLILP-1996-BandaBH #independence #towards
Towards Independent And-Parallelism in CLP (MJGdlB, FB, MVH), pp. 77–91.
PLILP-1996-PueblaH #automation #logic programming #optimisation #scheduling #source code
Automatic Optimization of Dynamic Scheduling in Logic Programs (GP, MVH), pp. 475–476.
SAS-1996-PueblaH #algorithm #analysis #incremental #logic programming #source code
Optimized Algorithms for Incremental Analysis of Logic Programs (GP, MVH), pp. 270–284.
ICLP-1995-HermenegildoGC #concurrent #implementation #logic programming #parallel #using
Using Attributed Variables in the Implementation of Concurrent and Parallel Logic Programming Systems (MVH, DCG, MC), pp. 631–645.
ICLP-1995-HermenegildoL #performance
Efficient Term Size Computation for Granularity Control (MVH, PLG), pp. 647–661.
ICLP-1995-HermenegildoPMS #analysis #incremental #logic programming #source code
Incremental Analysis of Logic Programs (MVH, GP, KM, PJS), pp. 797–811.
PEPM-1995-PueblaH #implementation #logic programming #multi #source code
Implementation of Multiple Specialization in Logic Programs (GP, MVH), pp. 77–87.
ALP-1994-BuenoHMR #concurrent #semantics #source code
From Eventual to Atomic Locally Atomic CC Programs: A Concurrent Semantics (FB, MVH, UM, FR), pp. 114–132.
ICLP-1994-GuptaHPC #execution #logic programming #named #source code
ACE: And/Or-parallel Copying-based Execution of Logic Programs (GG, MVH, EP, VSC), pp. 93–109.
ILPS-1994-BuenoBH #analysis #automation #effectiveness #parallel #strict
Effectiveness of Global Analysis in Strict Independence-Based Automatic Parallelization (FB, MJGdlB, MVH), pp. 320–336.
POPL-1994-MarriottBH #logic programming #scheduling #source code
Analyzing Logic Programs with Dynamic Scheduling (KM, MJGdlB, MVH), pp. 240–253.
SAS-1994-DebrayGHL #logic programming #source code
Estimating the Computational Cost of Logic Programs (SKD, PLG, MVH, NWL), pp. 255–265.
SAS-1994-GrasH #independence #strict #using
Extracting Non-Strict Independent And-Parallelism Using Sharing and Freeness Information (DCG, MVH), pp. 297–313.
ICLP-1993-CarroGH #execution #logic programming #paradigm #parallel #source code #visualisation
Some Paradigms for Visualizing Parallel Execution of Logic Programs (MC, LMGH, MVH), pp. 184–200.
ILPS-1993-BandaH #analysis #approach #source code
A Practical Approach to the Global Analysis of CLP Programs (MJGdlB, MVH), pp. 437–455.
ILPS-1993-BandaHM #constraints #independence #logic programming #source code
Independence in Constraint Logic Programs (MJGdlB, MVH, KM), pp. 130–146.
LOPSTR-1993-OlmedillaBH #automation #independence
Automatic Exploitation of Non-Determinate Independent And-Parallelism in the Basic Andorra Model (MO, FB, MVH), pp. 177–195.
PEPM-1993-CodishMBBH #abstract interpretation
Improving Abstract Interpretations by Combining Domains (MC, AM, MB, MJGdlB, MVH), pp. 194–205.
PLILP-1992-KuchenMH #implementation #independence
Independent AND-Parallel Implementation of Narrowing (HK, JJMN, MVH), pp. 24–38.
WSA-1992-BandaH
A Practical Application of Sharing and Freeness Inference (MJGdlB, MVH), pp. 118–125.
ICLP-1991-MuthukumarH #abstract interpretation
Combined Determination of Sharing and Freeness of Program Variables through Abstract Interpretation (KM, MVH), pp. 49–63.
ISLP-1991-GuptaCYH #independence #named
IDIOM: Integrating Dependent And-, Independent And-, and Or-parallelism (GG, VSC, RY, MVH), pp. 152–166.
ISLP-1991-ShenH #independence #simulation
A Simulation Study of Or- and and Independent And-parallelism (KS, MVH), pp. 135–151.
PLILP-1991-GiannottiH #detection #recursion #specification
A Technique for Recursive Invariance Detection and Selective Program Specification (FG, MVH), pp. 323–334.
CLP-1990-HermenegildoG90 #independence #performance #prolog
&-Prolog and its Performance: Exploiting Independent And-Parallelism (MVH, KJG), pp. 253–268.
CLP-1990-HermenegildoR90 #independence #strict
Non-Strict Independent And-Parallelism (MVH, FR), pp. 237–252.
CLP-1990-MuthukumarH90 #automation #definite clause grammar #independence #logic programming #parallel #source code
The DCG, UDG, and MEL Methods for Automatic Compile-time Parallelization of Logic Programs for Independent And-parallelism (KM, MVH), pp. 221–236.
PLDI-1990-DebrayLH #analysis #logic programming #source code
Task Granularity Analysis in Logic Programs (SKD, NWL, MVH), pp. 174–188.
NACLP-1989-HermenegildoR #correctness #independence #logic programming #on the #performance #source code
On the Correctness and Efficiency of Independent And-Parallelism in Logic Programs (MVH, FR), pp. 369–389.
NACLP-1989-MuthukumarH #abstract interpretation #dependence
Determination of Variable Dependence Information through Abstract Interpretation (KM, MVH), pp. 166–185.
JICSCP-1988-WarrenHD88 #analysis #logic programming #on the #source code
On the Practicality of Global Flow Analysis of Logic Programs (RW, MVH, SKD), pp. 684–699.
ICLP-1987-Hermenegildo87 #execution #logic programming #memory management #precedence #source code
Relating Goal-Scheduling, Precedence, and Memory Management in AND-Parallel Execution of Logic Programs (MVH), pp. 556–575.
ICLP-1986-Hermenegildo86 #automaton #execution #logic programming #source code #strict
An Abstract Machine for Restricted AND-Parallel Execution of Logic Programs (MVH), pp. 25–39.
ICLP-1986-HermenegildoN86 #backtracking #performance
Efficient Management of Backtracking in AND-Parallelism (MVH, RIN), pp. 40–54.
PPDP-2016-StulovaMH #runtime #static analysis
Reducing the overhead of assertion run-time checks via static analysis (NS, JFM, MVH), pp. 90–103.
PPDP-2018-KlemenS0MH #performance #runtime #source code
Static Performance Guarantees for Programs with Runtime Checks (MK, NS, PLG0, JFM, MVH), p. 13.

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.