Stem qualifi$ (all stems)

29 papers:

ICSE-v1-2015-VakilianPEJ #named

Cascade: A Universal Programmer-Assisted Type Qualifier Inference Tool (MV, AP, MDE, REJ), pp. 234–245.

ICST-2015-LelliBB #fault #user interface

Classifying and Qualifying GUI Defects (VL, AB, BB), pp. 1–10.

AMT-2013-FinotMSD #metamodelling #testing #using

Using Meta-model Coverage to Qualify Test Oracles (OF, JMM, GS, TD), pp. 12–21.

CSEET-2009-CastilloOFE #approach #developer #education #programming #towards

Toward an Approach to Programming Education to Produce Qualified Software Developers (JFC, CMdO, ESF, PVE), pp. 101–104.

ICLP-2009-CaballeroRR #functional #logic programming

Qualified Computations in Functional Logic Programming (RC, MRA, CARD), pp. 449–463.

DocEng-2008-SturgillS #algorithm #approach #recognition

An optical character recognition approach to qualifying thresholding algorithms (MS, SJS), pp. 263–266.

PPDP-2008-CaballeroRR #logic programming #reasoning #similarity

Similarity-based reasoning in qualified logic programming (RC, MRA, CARD), pp. 185–194.

ICFP-2007-HageHM #analysis

A generic usage analysis with subeffect qualifiers (JH, SH, AM), pp. 235–246.

OOPSLA-2007-GreenfieldboyceF #java

Type qualifier inference for java (DG, JSF), pp. 321–336.

DATE-DF-2006-Daglio #design #embedded #verification

A complete and fully qualified design flow for verification of mixed-signal SoC with embedded flash memories (PD), pp. 94–99.

ESOP-2006-ChinMMP

Inference of User-Defined Type Qualifiers and Qualifier Rules (BC, SM, TDM, JP), pp. 264–278.

ICPC-2006-FluriG

Classifying Change Types for Qualifying Change Couplings (BF, HCG), pp. 35–45.

PLDI-2005-ChinMM #semantics

Semantic type qualifiers (BC, SM, TDM), pp. 85–95.

ICFP-2005-LeijenL

Qualified types for MLF (DL, AL), pp. 144–155.

SEKE-2004-OFallonPKA #component #design

Defining and Qualifying Components in the Design Phase (AO, OP, AK, AAA), pp. 129–134.

DATE-2003-CarbognaniLICB #modelling #precise #standard #using #verification

Qualifying Precision of Abstract SystemC Models Using the SystemC Verification Standard (FC, CKL, CNI, AC, PB), pp. 20088–20094.

DATE-2003-DaglioR #bottom-up #design #top-down

A Fully Qualified Top-Down and Bottom-Up Mixed-Signal Design Flow for Non Volatile Memories Technologies (PD, CR), pp. 20274–20279.

PLDI-2002-FosterTA

Flow-Sensitive Type Qualifiers (JSF, TT, AA), pp. 1–12.

SIGAda-2002-Santhanam #ada #compilation #set

The anatomy of an FAA-qualifiable Ada subset compiler (VS), pp. 40–43.

PLDI-1999-FosterFA #formal method

A Theory of Type Qualifiers (JSF, MF, AA), pp. 192–203.

WCRE-1995-CimitileLM #execution #reuse #symbolic computation #using

Qualifying Reusable Functions Using Symbolic Execution (AC, ADL, MM).

FPCA-1995-Jones

Simplifying and Improving Qualified Types (MPJ), pp. 160–169.

VLDB-1994-GaasterlandL

Qualified Answers That Reflect User Needs and Preferences (TG, JL), pp. 309–320.

ESOP-J-1992-Jones94 #formal method

A Theory of Qualified Types (MPJ), pp. 231–256.

ESOP-1992-Jones #formal method

A Theory of Qualified Types (MPJ), pp. 287–306.

TOOLS-EUROPE-1992-Steinmuller #industrial

Qualifying C++-Foundation Classes for Use in Industrial Applications (US), pp. 47–59.

KR-1991-HollunderB #concept #strict

Qualifying Number Restrictions in Concept Languages (BH, FB), pp. 335–346.

ICLP-1986-Vasey86

Qualified Answers and their Application to Transformation (PV), pp. 425–432.

POPL-1980-HolleyR #data flow #problem

Qualified Data Flow Problems (LHH, BKR), pp. 68–82.