Travelled to:1 × Australia
1 × Austria
1 × Belgium
1 × Denmark
1 × Israel
1 × Italy
1 × United Kingdom
10 × USA
2 × France
2 × Germany
Collaborated with:B.L.Charlier Y.Deville L.Michel M.Dincbas V.Ramachandran ∅ A.Cortesi H.Simonis J.Yip P.Refalo O.Degimbe J.Imbert P.Q.Dung M.Das T.W.Reps F.Benhamou D.A.McAllester S.Rossi K.Musumbu C.Blundell K.Fisler S.Krishnamurthi L.Perron J.Régin C.Braem S.Modart V.Englebert D.Roland A.Aggoun A.Herold
Talks about:constraint (10) program (9) prolog (9) abstract (8) logic (8) interpret (7) analysi (5) framework (3) algorithm (3) generic (3)
Person: Pascal Van Hentenryck
DBLP: Hentenryck:Pascal_Van
Facilitated 3 volumes:
Ed
Ed
EdContributed to:
2009
2004
2002
19991996
199519951994
1994
19941993199319921992199219911991199119901990
198819881987Wrote 29 papers:
- SAC-2009-DungDH #constraints #framework #graph #optimisation
- LS(graph & tree): a local search framework for constraint optimization on graphs and trees (PQD, YD, PVH), pp. 1402–1407.
- SAC-2009-YipH #bound #consistency #constraints
- Length-lex bound consistency for knapsack constraints (JY, PVH), pp. 1397–1401.
- ASE-2004-BlundellFKH #interface #product line #verification
- Parameterized Interfaces for Open System Verification of Product Lines (CB, KF, SK, PVH), pp. 258–267.
- OOPSLA-2002-MichelH #architecture #constraints
- A constraint-based architecture for local search (LM, PVH), pp. 83–100.
- PPDP-1999-HentenryckMPR #constraints #programming
- Constraint Programming in OPL (PVH, LM, LP, JCR), pp. 98–116.
- JICSLP-1996-RefaloH
- CLP(Rlin) Revised (PR, PVH), pp. 22–36.
- PEPM-1995-DasRH #analysis #imperative #semantics #source code
- Semantic Foundations of Binding Time Analysis for Imperative Programs (MD, TWR, PVH), pp. 100–110.
- SAS-1995-RamachandranH
- LSign Reordered (VR, PVH), pp. 330–347.
- ILPS-1994-BenhamouMH #revisited
- CLP(Intervals) Revisited (FB, DAM, PVH), pp. 124–138.
- ILPS-1994-BraemCMH #analysis #prolog
- Cardinality Analysis of Prolog (CB, BLC, SM, PVH), pp. 457–471.
- ILPS-1994-CharlierRH #abstract interpretation #framework #prolog
- An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut (BLC, SR, PVH), pp. 157–171.
- PLDI-1994-HentenryckCC #analysis #graph #prolog #using
- Type Analysis of Prolog Using Type Graphs (PVH, AC, BLC), pp. 337–348.
- PLDI-1994-HentenryckR #backtracking
- Backtracking without Trailing in CLP(RLin) (PVH, VR), pp. 349–360.
- POPL-1994-CortesiCH #abstract domain #logic programming
- Combinations of Abstract Domains for Logic Programming (AC, BLC, PVH), pp. 227–239.
- PEPM-1993-CharlierH #analysis #evaluation #implementation #prolog
- Groundness Analysis for PROLOG: Implementation and Evaluation of the Domain Prop (BLC, PVH), pp. 99–110.
- WSA-1993-CharlierDMH #abstract interpretation #algorithm #fixpoint #optimisation #performance #prolog
- Optimization Techniques for General Purpose Fixpoint Algorithms — Practical Efficiency for the Abstract Interpretation of Prolog (BLC, OD, LM, PVH), pp. 15–26.
- WSA-1993-HentenryckDCM #abstract interpretation #prolog
- The Impact of Granularity in Abstract Interpretation of Prolog (PVH, OD, BLC, LM), pp. 1–14.
- JICSLP-1992-CharlierH #abstract interpretation #prolog
- Reexecution in Abstract Interpretation of Prolog (BLC, PVH), pp. 750–764.
- PLILP-1992-EnglebertCRH #abstract interpretation #algorithm #evaluation #optimisation #prolog
- Generic Abstract Interpretation Algorithms For Prolog: Tow Optimization Techniques and Their Experimental Evaluation (VE, BLC, DR, PVH), pp. 310–325.
- WSA-1992-CharlierH #abstract interpretation #design #framework #on the
- On the Design of Generic Abstract Interpretation Frameworks (BLC, PVH), pp. 229–246.
- ICLP-1991-CharlierMH #abstract interpretation #algorithm #analysis #complexity
- A Generic Abstract Interpretation Algorithm and its Complexity Analysis (BLC, KM, PVH), pp. 64–78.
- ICLP-1991-HentenryckD #constraints #logic #logic programming
- The Cardinality Operator: A New Logical Connective for Constraint Logic Programming (PVH, YD), pp. 745–759.
- PLILP-1991-HentenryckD #constraints #finite #logic programming #semantics
- Operational Semantics of Constraint Logic Programming over Finite Domains (PVH, YD), pp. 395–406.
- WSA-1991-ImbertH #french
- A propos des redondances dans les systèmes d’inéquations linéaires (JLI, PVH), pp. 210–216.
- CLP-1990-Hentenryck90 #constraints #incremental #logic programming
- Incremental Constraint Satisfaction in Logic Programming (PVH), pp. 189–202.
- NACLP-1990-Hentenryck #constraints #logic programming
- Constraint Logic Programming: From Theory to Applications (PVH), p. 841.
- CADE-1988-DincbasHSAH #constraints #prolog
- The CHIP System: Constraint Handling In Prolog (MD, PVH, HS, AA, AH), pp. 774–775.
- JICSCP-1988-DincbasSH88 #constraints #logic programming #problem
- Solving a Cutting-Stock Problem in Constraint Logic Programming (MD, HS, PVH), pp. 42–58.
- ICLP-1987-HentenryckD87 #logic programming
- Forward Checking in Logic Programming (PVH, MD), pp. 229–256.