Travelled to:1 × Belgium
1 × Canada
1 × Cyprus
1 × Spain
1 × Sweden
2 × Denmark
2 × France
2 × Germany
2 × Japan
3 × United Kingdom
5 × USA
Collaborated with:P.J.Stuckey K.Marriott M.V.Hermenegildo F.Bueno B.Demoen C.Holzbaur G.J.Duck G.Puebla W.Harvey M.Wallace D.Jeffery J.Wazny T.Schrijvers Z.Somogyi R.Rafeh M.Cameron P.Moulder E.Albert M.Gómez-Zamalloa J.M.Rojas M.Codish A.Mulkers M.Bruynooghe R.Becket D.Overton N.Nethercote J.Correas M.J.Maher J.K.Slaney T.Walsh
Talks about:constraint (9) analysi (7) hal (7) program (6) independ (5) model (5) logic (5) schedul (4) solver (4) compil (4)
Person: Maria J. García de la Banda
DBLP: Banda:Maria_J=_Garc=iacute=a_de_la
Contributed to:
2013
200720062005
20042004
2004
2003200220022001
200020002000199919971996199619951994
19941993
1993
1992Wrote 30 papers:
- ICLP-J-2013-AlbertBGRS #generative #testing
- A CLP heap solver for test case generation (EA, MJGdlB, MGZ, JMR, PJS), pp. 721–735.
- PADL-2007-RafehBMW #design
- From Zinc to Design Model (RR, MJGdlB, KM, MW), pp. 215–229.
- PADL-2006-BecketBMSSW #constraints #theorem proving
- Adding Constraint Solving to Mercury (RB, MJGdlB, KM, ZS, PJS, MW), pp. 118–133.
- ICLP-2005-StuckeyBMMSSWW #independence #modelling #performance
- The G12 Project: Mapping Solver Independent Models to Efficient Solutions (PJS, MJGdlB, MJM, KM, JKS, ZS, MW, TW), pp. 9–13.
- FLOPS-2004-BuenoB
- Set-Sharing Is Not Always Redundant for Pair-Sharing (FB, MJGdlB), pp. 117–131.
- ICLP-2004-DuckBS #compilation #constraints
- Compiling Ask Constraints (GJD, MJGdlB, PJS), pp. 105–119.
- ICLP-2004-DuckSBH #constraints #semantics
- The Refined Operational Semantics of Constraint Handling Rules (GJD, PJS, MJGdlB, CH), pp. 90–104.
- PDCL-2004-DemoenBHMOS #constraints
- Herbrand Constraints in HAL (BD, MJGdlB, WH, KM, DO, PJS), pp. 499–538.
- 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.
- PPDP-2003-BandaSW #satisfiability #set
- Finding all minimal unsatisfiable subsets (MJGdlB, PJS, JW), pp. 32–43.
- PPDP-2003-CameronBMM #debugging #named #visual notation
- ViMer: a visual debugger for mercury (MC, MJGdlB, KM, PM), pp. 56–66.
- PPDP-2003-DuckSBH #constraints
- Extending arbitrary solvers with constraint handling rules (GJD, PJS, MJGdlB, CH), pp. 79–90.
- FLOPS-2002-BandaDMS #tutorial
- To the Gates of HAL: A HAL Tutorial (MJGdlB, BD, KM, PJS), pp. 47–66.
- ICLP-2002-SchrijversBD #analysis
- Trailing Analysis for HAL (TS, MJGdlB, BD), pp. 38–53.
- ICLP-2001-BandaJMNSH #constraints #theorem proving
- Building Constraint Solvers with HAL (MJGdlB, DJ, KM, NN, PJS, CH), pp. 90–104.
- ICLP-2001-HolzbaurBJS #compilation #constraints #optimisation
- Optimizing Compilation of Constraint Handling Rules (CH, MJGdlB, DJ, PJS), pp. 74–89.
- CL-2000-BandaSHM #model checking
- Model Checking in HAL (MJGdlB, PJS, WH, KM), pp. 1270–1284.
- 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-DemoenBHMS #constraints #theorem proving
- Herbrand Constraint Solving in HAL (BD, MJGdlB, WH, KM, PJS), pp. 260–274.
- ICLP-1997-PueblaBMS #logic programming #optimisation #scheduling #source code
- Optimization of Logic Programs with Dynamic Scheduling (GP, MJGdlB, KM, PJS), pp. 93–107.
- ALP-1996-BandaHM #independence #logic
- Independence in Dynamically Scheduled Logic Languages (MJGdlB, MVH, KM), pp. 47–61.
- PLILP-1996-BandaBH #independence #towards
- Towards Independent And-Parallelism in CLP (MJGdlB, FB, MVH), pp. 77–91.
- ILPS-1995-BandaMS #analysis #logic programming #performance #scheduling #source code
- Efficient Analysis of Logic Programs with Dynamic Scheduling (MJGdlB, KM, PJS), pp. 417–431.
- 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.
- 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.
- PEPM-1993-CodishMBBH #abstract interpretation
- Improving Abstract Interpretations by Combining Domains (MC, AM, MB, MJGdlB, MVH), pp. 194–205.
- WSA-1992-BandaH
- A Practical Application of Sharing and Freeness Inference (MJGdlB, MVH), pp. 118–125.