Stem sup$ (all stems)

38 papers:

PLDI-2013-BoddenTRBBM #named #product line

SPL^LIFT: statically analyzing software product lines in minutes instead of years (EB, TT, MR, CB, PB, MM), pp. 355–364.

SAC-2013-HeitkotterMK #development #mobile #modelling

Cross-platform model-driven development of mobile applications with md² (HH, TAM, HK), pp. 526–533.

SAC-2013-KinderenP #approach #named

e³RoME: a value-based approach for method bundling (SdK, HAP), pp. 1469–1471.

SAC-2012-SchaadB #analysis #automation #named

TAM²: automated threat analysis (AS, MB), pp. 1103–1108.

ICSM-2011-KagdiGP #evolution

SE² model to support software evolution (HHK, MG, DP), pp. 512–515.

ICGT-2010-Radke #correctness #graph #source code

Correctness of Graph Programs Relative to HR ⁺ Conditions (HR), pp. 410–412.

ECOOP-2010-BiermanMT #c#

Adding Dynamic Types to C^# (GMB, EM, MT), pp. 76–100.

ICSE-2010-SavageRP #feature model #named

FLAT³: feature location and textual tracing tool (TS, MR, DP), pp. 255–258.

ICFP-2008-RemyY #constraints #ml #performance #type inference

From ML to ML^F: graphic type constraints with efficient type inference (DR, BY), pp. 63–74.

SAC-2008-BenedettiLV #modelling #scheduling

Modeling adversary scheduling with QCSP⁺ (MB, AL, JV), pp. 151–155.

SAC-2008-ZhouTBAG #ambiguity #graph #named #query

G^con: a graph-based technique for resolving ambiguity in query translation candidates (DZ, MT, TJB, HA, JG), pp. 1566–1573.

MoDELS-2007-KonradGC #analysis #incremental #modelling #process

i²MAP : An Incremental and Iterative Modeling and Analysis Process (SK, HG, BHCC), pp. 451–466.

MoDELS-2007-KonradGC #analysis #incremental #modelling #process

i²MAP : An Incremental and Iterative Modeling and Analysis Process (SK, HG, BHCC), pp. 451–466.

CSMR-2006-Kajko-Mattsson #evaluation #industrial #problem

Evaluation of CM³: Front-End Problem Management within Industry (MKM), pp. 367–368.

FLOPS-2006-MarionP #analysis

Resource Analysis by Sup-interpretation (JYM, RP), pp. 163–176.

ECOOP-2006-EmirKRY #c# #constraints

Variance and Generalized Constraints for C^# Generics (BE, AK, CVR, DY), pp. 279–303.

SAC-2005-JanejaA #detection #linear #named #semantics #statistics

LS³: a Linear Semantic Scan Statistic technique for detecting anomalous windows (VPJ, VA), pp. 493–497.

ICSM-2004-Kajko-MattssonAL #named

CM³: Service Level Agreement (MKM, CA, EL), pp. 432–436.

OOPSLA-2004-SachindranMB #garbage collection #named

MC²: high-performance garbage collection for memory-constrained environments (NS, JEBM, EDB), pp. 81–98.

SAC-2004-AntoniouVPHJ #generative #network #simulation

A discrete event based simulation environment for enhanced UMTS 3^rd generation networks (JA, VV, AP, GH, NJ), pp. 369–370.

SAC-2004-MengC #analysis #scalability

Bio-sequence analysis with cradle’s 3SoC^TM software scalable system on chip (XM, VC), pp. 202–206.

ICFP-2003-BotlanR #ml #named #power of #system f

ML^F: raising ML to the power of system F (DLB, DR), pp. 27–38.

ICSM-2002-LauCKL #e-commerce #enterprise #java #legacy #re-engineering

Re-Engineering of E-commerce Legacy Applications for Enterprise Java^TM Environment (TCL, YC, RK, JL), p. 573.

ECOOP-2002-BentonCF #abstraction #c# #concurrent

Modern Concurrency Abstractions for C^# (NB, LC, CF), pp. 415–440.

RTA-2002-Lippi #interactive #interpreter #visual notation

in² : A Graphical Interpreter for Interaction Nets (SL), pp. 380–386.

ICSE-2001-Kajko-MattssonFO #education #maintenance #maturity

Corrective Maintenance Maturity Model (CM³): Maintainer’s Education and Training (MKM, SF, UHO), pp. 610–619.

ICSE-2001-OssherT #java #multi #named

Hyper/J^TM: Multi-Dimensional Separation of Concerns for Java^TM (HO, PLT), pp. 821–822.

ICSE-2001-TarrO #java #multi #named

Hyper/J^TM: Multi-Dimensional Separation of Concerns for Java^TM (PLT, HO), pp. 729–730.

ECOOP-2000-Renaud #component #java #process

HERCULE : Non-invasively Tracking Java^TM Component-Based Application Activity (KR), pp. 447–471.

OOPSLA-2000-Czajkowski #java #virtual machine

Application isolation in the Java^TM Virtual Machine (GC), pp. 354–366.

OOPSLA-2000-IshizakiKYKN #case study #compilation #java

A study of devirtualization techniques for a Java^TM Just-In-Time compiler (KI, MK, TY, HK, TN), pp. 294–310.

OOPSLA-2000-QianGC #java #specification

A formal specification of Java^TM class loading (ZQ, AG, AC), pp. 325–336.

POPL-2000-EsparzaP #algorithm #graph #interprocedural #parallel #performance

Efficient Algorithms for pre^* and post^* on Interprocedural Parallel Flow Graphs (JE, AP), pp. 1–11.

ICSE-2000-Becker-KornstaedtSZ #process

Process engineering with Spearmint^TM/EPG (UBK, LS, JZ), p. 791.

RTA-1999-VermaS #agile #graph grammar #named

L^arrowR²: A Laboratory fro Rapid Term Graph Rewriting (RMV, SS), pp. 252–255.

ICDAR-v1-1995-MankeFW #independence #online #recognition #scalability

NPen/sup ++/: a writer independent, large vocabulary on-line cursive handwriting recognition system (SM, MF, AW), pp. 403–408.

SAC-1995-GudaitisLT #parallel #using

Multicriteria vehicle route-planning using parallel A^* search (MSG, GBL, AJT), pp. 171–176.

RTA-1995-ZantemaG #termination

A Complete Characterization of Termination of O^p 1^q -> 1^r O^s (HZ, AG), pp. 41–55.