Stem clp$ (all stems)

109 papers:

SAC-2015-DymchenkoM #eclipse #problem #prolog

Declaratively solving tricky google code jam problems with prolog-based ECLiPSe CLP system (SD, MM), pp. 2122–2124.

ICLP-2015-AriasC #execution #interface #towards

Towards a Generic Interface to Integrate CLP and Tabled Execution (Extended Abstract) (JA, MC).

DATE-2014-BalckGP #generative #modelling #protocol #testing #using

Model-based protocol log generation for testing a telecommunication test harness using CLP (KB, OG, JP), pp. 1–4.

SFM-2014-AlbertAGR #concept #concurrent #execution #generative #symbolic computation #testing

Test Case Generation by Symbolic Execution: Basic Concepts, a CLP-Based Instance, and Actor-Based Concurrency (EA, PA, MGZ, JMR), pp. 263–309.

ICLP-J-2013-AlbertBGRS #generative #testing

A CLP heap solver for test case generation (EA, MJGdlB, MGZ, JMR, PJS), pp. 721–735.

FLOPS-2012-GuzmanCHS #framework #implementation

A General Implementation Framework for Tabled CLP (PCdG, MC, MVH, PJS), pp. 104–119.

PADL-2012-AlbertAG #concurrent #execution #symbolic computation

Symbolic Execution of Concurrent Objects in CLP (EA, PA, MGZ), pp. 123–137.

ICLP-2012-AlbertAG #concurrent #testing #towards

Towards Testing Concurrent Objects in CLP (EA, PA, MGZ), pp. 98–108.

LOPSTR-2011-AlbertGR #generative #testing

Resource-Driven CLP-Based Test Case Generation (EA, MGZ, JMR), pp. 25–41.

PPDP-2011-HaemmerleLH #constraints

CLP projection for constraint handling rules (RH, PLG, MVH), pp. 137–148.

ICLP-J-2011-CattafiGNAF #network

Optimal placement of valves in a water distribution network with CLP(FD) (MC, MG, MN, SA, MF), pp. 731–747.

LATA-2010-SaeedloeiG #induction #realtime #verification

Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R) (NS, GG), pp. 536–548.

LOPSTR-2010-AlbertGRP #composition #generative #imperative #testing

Compositional CLP-Based Test Data Generation for Imperative Languages (EA, MGZ, JMR, GP), pp. 99–116.

PADL-2010-Costa #implementation #on the

On the Implementation of the CLP(BN) Language (VSC), pp. 234–248.

ICLP-J-2010-Gomez-ZamalloaAP #generative #imperative #object-oriented #testing

Test case generation for object-oriented imperative languages in CLP (MGZ, EA, GP), pp. 659–674.

ICLP-J-2010-PaluDFP #assembly

CLP-based protein fragment assembly (ADP, AD, FF, EP), pp. 709–724.

ICLP-J-2010-Rodriguez-ArtalejoR #declarative #proximity #semantics

A declarative semantics for CLP with qualification and proximity (MRA, CARD), pp. 627–642.

TAP-2010-BueDKB #abstraction #behaviour #using

Building a Test-Ready Abstraction of a Behavioral Model Using CLP (PCB, FD, ADK, FB), pp. 167–182.

ICLP-2009-Zhou #constraints #encoding

Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC (NFZ), pp. 402–416.

SAS-2008-RuggieriM #constraints #linear #source code #type system

Typing Linear Constraints for Moding CLP() Programs (SR, FM), pp. 128–143.

LOPSTR-2008-AlbertGP #bytecode #generative #partial evaluation #testing

Test Data Generation of Bytecode by CLP Partial Evaluation (EA, MGZ, GP), pp. 4–23.

LOPSTR-2008-BandaG #analysis #hybrid #linear

Analysis of Linear Hybrid Systems in CLP (GB, JPG), pp. 55–70.

ICLP-2007-DovierFP #constraints #multi

Multivalued Action Languages with Constraints in CLP(FD) (AD, AF, EP), pp. 255–270.

VMCAI-2006-JaffarSV #abstraction #composition

A CLP Method for Compositional and Intermittent Predicate Abstraction (JJ, AES, RV), pp. 17–32.

TACAS-2005-BouquetDLU #ml #named #specification #using

JML-Testing-Tools: A Symbolic Animator for JML Specifications Using CLP (FB, FD, BL, MU), pp. 551–556.

PPDP-2005-PaluDP #heuristic #optimisation #parallel #predict

Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD) (ADP, AD, EP), pp. 230–241.

PADL-2005-Munoz-HernandezG #collaboration #fuzzy #problem

Solving Collaborative Fuzzy Agents Problems with CLP(FD) (SMH, JMGP), pp. 187–202.

ICLP-2005-DovierFP #comparison #problem

A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems (AD, AF, EP), pp. 67–82.

ICLP-2005-JaffarSV #modelling

Modeling Systems in CLP (JJ, AES, RV), pp. 412–413.

ICLP-2005-Saidi #bound #mining #process #using

Using CLP to Characterise Linguistic Lattice Boundaries in a Text Mining Process (ASS), pp. 418–420.

LOPSTR-2004-SerebrenikM #on the #source code #termination

On Termination of Binary CLP Programs (AS, FM), pp. 231–244.

ICLP-2004-DefourJP #component #modelling #predict

Applying CLP to Predict Extra-Functional Properties of Component-Based Models (OD, JMJ, NP), pp. 454–455.

ICLP-2004-ElkabaniPS #approach #effectiveness

Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP (IE, EP, TCS), pp. 73–89.

ICLP-2004-LangevineD #debugging #monitoring #visualisation

A Tracer Driver to Enable Debugging, Monitoring and Visualization of CLP Executions from a Single Tracer (LL, MD), pp. 462–463.

ESOP-2003-Flanagan #automation #model checking #using

Automatic Software Model Checking Using CLP (CF), pp. 189–203.

PPDP-2003-PaluDPR #constraints #finite #set

Integrating finite domain constraints and CLP with sets (ADP, AD, EP, GR), pp. 219–229.

PADL-2003-TomasL #generative

A CLP-Based Tool for Computer Aided Generation and Solving of Maths Exercises (APT, JPL), pp. 223–240.

ICLP-2003-DovierPR #set

Intensional Sets in CLP (AD, EP, GR), pp. 284–299.

LOPSTR-2002-PeraltaG #abstraction #source code

Convex Hull Abstractions in Specialization of CLP Programs (JCP, JPG), pp. 90–108.

ICLP-2002-CharatonikMP #constraints #infinity #model checking

Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP (WC, SM, AP), pp. 115–129.

ICLP-2002-CoqueryF #morphism #named #parametricity #polymorphism #type system

TCLP: Overloading, Subtyping and Parametric Polymorphism Made Practical for CLP (EC, FF), p. 480.

ICLP-2002-Craciunescu #equivalence #proving #source code

Proving the Equivalence of CLP Programs (SC), pp. 287–301.

ICLP-2002-DucasseL #analysis #automation #execution

Automated Analysis of CLP(FD) Program Execution Traces (MD, LL), pp. 470–471.

ICLP-2002-VaucheretGM #fuzzy #implementation #prolog #using

Fuzzy Prolog: A Simple General Implementation Using CLP(R) (CV, SG, SMH), p. 469.

PADL-2000-Hickey #constraints #named #theorem proving

CLIP: A CLP(Intervals) Dialect for Metalevel Constraint Solving (TJH), pp. 200–214.

CL-2000-GotliebBR #framework #testing

A CLP Framework for Computing Structural Test Data (AG, BB, MR), pp. 399–413.

TACAS-1999-DelzannoP #model checking

Model Checking in CLP (GD, AP), pp. 223–239.

LOPSTR-1999-PeraltaG #approach #imperative #using

Imperative Program Specialisation: An Approach Using CLP (JCP, JPG), pp. 102–117.

PADL-1999-Lai #constraints #debugging #proving #using

Using Constraints in Local Proofs for CLP Debugging (CL), pp. 350–359.

ICLP-1999-GavanelliLMM

Domains as First Class Objects in CLP(FD) (MG, EL, PM, MM), p. 608.

LOPSTR-1998-ZidoumFH #source code #synthesis

Schema-Guided Synthesis of CLP Programs (HZ, PF, BH), pp. 309–312.

JICSLP-1998-DovierPRP #finite #on the #representation #set

On the Representation and Management of Finite Sets in CLP Languages (AD, CP, GR, EP), pp. 40–54.

JICSLP-1998-FagesP #type system

A Generic Type System for CLP(chi) (FF, MP), pp. 353–354.

JICSLP-1998-FordanY #towards

Towards Early Projection in CLP(R) (AF, RHCY), pp. 359–360.

JICSLP-1998-Ruiz-AndinoR #integration #optimisation #probability

Integration of CLP and Stochastic Optimisation Strategies (ARA, JJR), pp. 351–352.

PEPM-1997-EtalleGM #scheduling

A Transformation System for CLP with Dynamic Scheduling and CCP (SE, MG, EM), pp. 137–150.

ILPS-1997-Pietrzak #type inference

Type Inference for CLP(FD) (PP), p. 407.

SAS-1996-Handjieva #abstract interpretation #named

STAN: A Static Analyzer for CLP(R) Based on Abstract Interpretation (MH), pp. 383–384.

LOPSTR-1996-BenoyK

Inferring Argument Size Relationships with CLP(R) (FB, AK), pp. 204–223.

PLILP-1996-BandaBH #independence #towards

Towards Independent And-Parallelism in CLP (MJGdlB, FB, MVH), pp. 77–91.

SAC-1996-LeeL #concurrent #constraints #incremental #query

Incremental querying in the concurrent CLP language IFD-Constraint Pandora (JHML, HfL), pp. 387–392.

JICSLP-1996-KellyMMSY #compilation #effectiveness #optimisation

Effectiveness of Optimizing Compilation for CLP(R) (ADK, ADM, KM, PJS, RHCY), pp. 37–51.

JICSLP-1996-RefaloH

CLP(Rlin) Revised (PR, PVH), pp. 22–36.

PEPM-1995-EtalleG

The Replacement Operation for CLP Modules (SE, MG), pp. 168–177.

LOPSTR-1995-Mesnard #automation #source code #towards

Towards Automatic Control for CLP(x) Programs (FM), pp. 106–119.

ICLP-1995-BarthB #finite

Finite Domain and Cutting Plane Techniques in CLP(PB) (PB, AB), pp. 133–147.

ICLP-1995-EtalleG #composition #source code

A Transformation System for Modular CLP Programs (SE, MG), pp. 681–695.

ICLP-1995-HeintzeJ #algorithm #analysis

A Generic Algorithm for CLP Analysis (NH, JJ), pp. 49–63.

PLDI-1994-HentenryckR #backtracking

Backtracking without Trailing in CLP(R_Lin) (PVH, VR), pp. 349–360.

LOPSTR-1994-BensaouG #source code

An Extended Transformation System for CLP Programs (NB, IG), pp. 17–35.

PLILP-1994-BreitingerL #scheduling

Improving Search for Job-Shop Scheduling with CLP(FD) (SB, HCRL), pp. 277–291.

PLILP-1994-CodognetD #constraints #performance #theorem proving

clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving (PC, DD), pp. 244–260.

PLILP-1994-JanssensBE

Abstracting Numerical Values in CLP(H, N) (GJ, MB, VE), pp. 400–414.

SAC-1994-StamatopoulosMH #development #parallel

Extending a parallel CLP language to support the development of multi-agent systems (PS, DM, CH), pp. 410–414.

ICLP-1994-BruscoliDPR #compilation #set

Compiling Intensional Sets in CLP (PB, AD, EP, GR), pp. 647–661.

ICLP-1994-BurgLH #backtracking #set

Finding Conflict Sets and Backtrack Points in CLP(R) (JB, SDL, CEH), pp. 323–338.

ICLP-1994-CaseauL #scheduling

Improved CLP Scheduling with Task Intervals (YC, FL), pp. 369–383.

ICLP-1994-DumortierJ #towards

Towards a Practical Full Mode Inference System for CLP(H, N) (VD, GJ), pp. 569–583.

ICLP-1994-MudambiS #network #parallel

Parallel CLP on Heterogeneous Networks (SM, JS), pp. 124–141.

ILPS-1994-BenhamouMH #revisited

CLP(Intervals) Revisited (FB, DAM, PVH), pp. 124–138.

ICLP-1993-BackerB #constraints #linear

A CLP Language Handling Disjunctions of Linear Constraints (BDB, HB), pp. 550–563.

ICLP-1993-DiazC

A Minimal Extension of the WAM for clp(FD) (DD, PC), pp. 774–790.

ICLP-1993-Hanus #analysis #constraints

Analysis of Nonlinear Constraints in CLP(R) (MH), pp. 83–99.

ICLP-1993-LiRSVBPPSCDRSS #named #parallel #using

APPLAUSE: Applications Using the ElipSys Parallel CLP System (LLL, MR, KS, AV, JB, CP, ZP, TS, DAC, SD, CJR, JS, GS), pp. 847–848.

ICLP-1993-Maher #logic programming

A Logic Programming View of CLP (MJM), pp. 737–753.

ILPS-1993-BandaH #analysis #approach #source code

A Practical Approach to the Global Analysis of CLP Programs (MJGdlB, MVH), pp. 437–455.

ILPS-1993-CodognetD #constraints #theorem proving #using

Boolean Constraint Solving Using clp(FD) (PC, DD), pp. 525–539.

ILPS-1993-DovierR #finite #set

Embedding extensional finite sets in CLP (AD, GR), pp. 540–556.

ILPS-1993-MacdonaldSY

Redundancy of Variables in CLP (R) (ADM, PJS, RHCY), pp. 75–93.

ILPS-1993-McDonaldXEF #logic #on the #semantics

On the Denotational and Logical Semantics of CLP-Modules (BM, JX, ME, EF), p. 658.

ILPS-1993-Sidebottom #constraints #optimisation

Optimizing Constraint Processing in CLP(FD) (GS), p. 660.

PLDI-1992-JaffarMSY #automaton

An Abstract Machine for CLP(R) (JJ, SM, PJS, RHCY), pp. 128–139.

WSA-1992-BagnaraGL #source code #static analysis

Static Analysis of CLP Programs over Numeric Domains (RB, RG, GL), pp. 43–50.

WSA-1992-MesnardM #automation #generative #linear #metric #source code

Automatic Generation of Valid Linear Measures for CLP(Q) Programs (FM, MM), pp. 29–34.

ALP-1992-Maher #logic programming

A CLP View of Logic Programming (MJM), pp. 364–383.

PLILP-1992-Barth

CLP(PB), A Meta-Interpreter in CLP(R) (PB), pp. 491–492.

PLILP-1992-DorochevskyV #garbage collection

Binding Techniques and Garbage Collection for OR-Parallel CLP Systems (MD, AV), pp. 39–53.

PEPM-1991-HickeyS #partial evaluation #towards

Toward the Partial Evaluation of CLP Languages (TJH, DAS), pp. 43–51.

PLDI-1991-JaffarMY #constraints

A Methodology for Managing Hard Constraints in CLP Systems (JJ, SM, RHCY), pp. 306–316.

ICLP-1991-Smith #constraints

Constraint Operations for CLP(FT) (DAS), pp. 760–774.

ICLP-1991-Yap #strict

Restriction Site Mapping in CLP(R) (RHCY), pp. 521–534.

ISLP-1991-BackerB #backtracking

Intelligent Backtracking for CLP Languages: An Application to CLP(R) (BDB, HB), pp. 405–419.

ISLP-1991-JorgensenMM #optimisation

Some Global Compile-Time Optimizations for CLP(R) (NJ, KM, SM), pp. 420–434.

NACLP-1990-SmithH #partial evaluation

Partial Evaluation of a CLP Language (DAS, TJH), pp. 119–138.

POPL-1989-Hickey #abstraction #constraints

CLP* and Constraint Abstraction (TJH), pp. 125–133.

JICSCP-1988-HuynhL88 #analysis

A CLP(R) Options Trading Analysis System (TH, CL), pp. 59–69.

JICSCP-1988-Saraswat88 #logic

A Somewhat Logical Formulation of CLP Synchronisation Primitives (VAS), pp. 1298–1314.

ICLP-1987-HeintzeMS87 #problem

CLP(R) and Some Electrical Engineering Problems (NH, SM, PJS), pp. 675–703.

ICLP-1987-JaffarM87 #implementation

Methodology and Implementation of a CLP System (JJ, SM), pp. 196–218.