37 papers:
- ECSA-2015-WangC #architecture #network #performance #social
- A Specialised Social Network Software Architecture for Efficient Household Water Use Management (ZW, AC), pp. 146–153.
- DAC-2015-HeyseS
- Avoiding transitional effects in dynamic circuit specialisation on FPGAs (KH, DS), p. 6.
- PEPM-2015-KafleG #constraints #horn clause #verification
- Constraint Specialisation in Horn Clause Verification (BK, JPG), pp. 85–90.
- ICEIS-J-2009-LealQ #learning #named #repository
- CrimsonHex: A Service Oriented Repository of Specialised Learning Objects (JPL, RQ), pp. 102–113.
- ESOP-2008-NielsenNN #horn clause
- Iterative Specialisation of Horn Clauses (CRN, FN, HRN), pp. 131–145.
- PADL-2008-KellerCCSB #generative #monte carlo
- Specialising Simulator Generators for High-Performance Monte-Carlo Methods (GK, HCM, MMTC, DS, CBK), pp. 116–132.
- SEFM-2007-Jackson #re-engineering
- Specialising in Software Engineering (MJ), p. 3.
- ICFP-2007-Jones #haskell #source code
- Call-pattern specialisation for haskell programs (SLPJ), pp. 327–337.
- PPDP-2005-CraigL #prolog #self
- Self-tuning resource aware specialisation for prolog (SJC, ML), pp. 23–34.
- PEPM-2004-BarkerLV #data access #flexibility #logic programming #performance
- Efficient and flexible access control via logic program specialisation (SB, ML, MV), pp. 190–199.
- PDCL-2004-LeuschelCBV #deduction #using
- Specialising Interpreters Using Offline Partial Deduction (ML, SJC, MB, WV), pp. 340–375.
- CSEET-2003-X03e #education #independence #re-engineering
- Undergraduate software engineering education options: independent programmes, specialisations or subjects, p. 34.
- LOPSTR-2003-LehmannL #generative #induction #proving #theorem proving #using
- Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce (HL, ML), pp. 1–19.
- ASIA-PEPM-2002-LopezH
- Principal type specialisation (PEML, JH), pp. 94–105.
- IWPC-2001-FoxDHH #comprehension
- Backward Conditioning: A New Program Specialisation Technique and Its Application to Program Comprehension (CF, SD, MH, RMH), pp. 89–97.
- ESOP-2000-Hughes #correctness
- The Correctness of Type Specialisation (JH), pp. 215–229.
- LOPSTR-1999-HoweK #source code #using
- Specialising Fininte Domain Programs Using Polyhedra (JMH, AK), pp. 118–135.
- LOPSTR-1999-LeuschelM #abstract interpretation #infinity #model checking
- Infinite State Model Checking by Abstract Interpretation and Program Specialisation (ML, TM), pp. 62–81.
- LOPSTR-1999-PeraltaG #approach #imperative #using
- Imperative Program Specialisation: An Approach Using CLP (JCP, JPG), pp. 102–117.
- ALP-PLILP-1998-VanhoofSM #bottom-up #framework #logic programming #source code
- A Framework for Bottom Up Specialisation of Logic Programs (WV, DDS, BM), pp. 54–72.
- LOPSTR-1998-BossiR #logic programming #source code #specification
- Specialising Logic Programs with Respect to Call?Post Specifications (AB, SR), pp. 159–178.
- LOPSTR-1998-VanhoofSM #bottom-up #logic programming #source code
- Bottom-Up Specialisation of Logic Programs (WV, DDS, BM), pp. 325–327.
- JICSLP-1998-Leuschel #abstract interpretation
- Program Specialisation and Abstract Interpretation Reconciled (ML), pp. 220–234.
- JICSLP-1998-VanhoofMSV
- Specialising the Other Way Arond (WV, BM, DDS, KDV), pp. 279–293.
- PLDI-1997-DussartHH
- Module-Sensitive Program Specialisation (DD, RH, JH), pp. 206–214.
- LOPSTR-1996-BrogiC #composition #logic programming #source code
- Specialising Meta-level Compositions of Logic Programs (AB, SC), pp. 275–294.
- LOPSTR-1996-LeuschelS #how #logic programming
- Logic Program Specialisation: How to Be More Specific (Abstract) (ML, DDS), p. 58.
- PLILP-1996-LeuschelS #how #logic programming
- Logic Program Specialisation: How To Be More Specific (ML, DDS), pp. 137–151.
- PEPM-1995-DussartBV
- Polyvariant Constructor Specialisation (DD, EB, KDV), pp. 54–65.
- PEPM-1995-LeuschelS #partial evaluation #towards
- Towards Creating Specialised Integrity Checks through Partial Evaluation of Meta-Interpreters (ML, DDS), pp. 253–263.
- PEPM-1995-MalmkjaerO #higher-order
- Polyvariant Specialisation for Higher-Order, Block-Structured Languages (KM, PØ), pp. 66–76.
- ILPS-1995-SchreyeLM #tutorial
- Tutorial on Program Specialisation (Abstract) (DDS, ML, BM), pp. 615–616.
- PEPM-1993-Gallagher #logic programming #source code #tutorial
- Tutorial on Specialisation of Logic Programs (JPG), pp. 88–98.
- LOPSTR-1993-Gurr #logic programming #programming language #representation
- Specialising the Ground Representation in the Logic Programming Language Gödel (CAG), pp. 124–140.
- ILPS-1993-WaalG #logic programming
- Logic Program Specialisation With Deletion of Useless Clauses (DAdW, JPG), p. 632.
- LOPSTR-1991-WaalG #algorithm #unification
- Specialisation of a Unification Algorithm (DAdW, JPG), pp. 205–220.
- CLP-1990-GallagherB90 #algorithm
- The Derivation of an Algorithm for Program Specialisation (JPG, MB), pp. 732–746.