23 papers:
SAS-2011-GodefroidLR #composition #generative #incremental #summary #testing #validation- Statically Validating Must Summaries for Incremental Compositional Dynamic Test Generation (PG, SKL, CRG), pp. 112–128.
DLT-2011-BonizzoniJ #constant- Regular Splicing Languages Must Have a Constant (PB, NJ), pp. 82–92.
SIGIR-2011-StuparM #named- Picasso — to sing, you must close your eyes and draw (AS, SM), pp. 715–724.
DATE-2010-Horowitz #design #why- Why design must change: Rethinking digital design (MH), p. 791.
OOPSLA-2010-Stanley- To achieve our highest goals, we must be willing to abandon them (KOS), p. 3.
POPL-2010-GodefroidNRT #composition #power of #program analysis- Compositional may-must program analysis: unleashing the power of alternation (PG, AVN, SKR, ST), pp. 43–56.
CAV-2010-SinghGP #abstraction #component #interface #learning- Learning Component Interfaces with May and Must Abstractions (RS, DG, CSP), pp. 527–542.
FM-2009-SeidlVV #alias #analysis #linear #polynomial- A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis (HS, VV, VV), pp. 644–659.
ECOOP-2009-XuRS #alias #analysis #points-to #scalability #using- Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis (G(X, AR, MS), pp. 98–122.
SCAM-2008-StoneSB #analysis #automation #data flow #set- Automatic Determination of May/Must Set Usage in Data-Flow Analysis (AS, MS, SB), pp. 153–162.
CHI-2008-JonssonHN #how #information management- How accurate must an in-car information system be?: consequences of accurate and inaccurate information in cars (IMJ, HH, CN), pp. 1665–1674.
SAC-2008-AdaikkalavanC #exclamation- Events must be complete in event processing! (RA, SC), pp. 1038–1039.
PASTE-2007-QianXM #alias #analysis #data flow #dependence- Interstatement must aliases for data dependence analysis of heap locations (JQ, BX, HM), pp. 17–24.
- POPL-2007-NaikA #alias #concurrent #detection
- Conditional must not aliasing for static race detection (MN, AA), pp. 327–338.
ICSE-2003-Cohoon #women- Must There Be So Few? Including Women in CS (JMC), pp. 668–675.
CBSE-2000-Hall #case study #component #education #question #what- Educational Case Study–What is the Model of an Ideal Component? Must it be an Object? (PH), p. 8.
- CHI-2000-EspinosaCRKSL #tool support #why
- Coming to the wrong decision quickly: why awareness tools must be matched with appropriate tasks (JAE, JJC, LRG, REK, WLS, GL), pp. 392–399.
- ICSE-2000-Rifkin #diagrams #precedence
- When the project absolutely must get done: marrying the organization chart with the precedence diagram (SR), pp. 588–596.
- POPL-1998-JagannathanTWW #alias #analysis #higher-order
- Single and Loving It: Must-Alias Analysis for Higher-Order Languages (SJ, PT, SW, AKW), pp. 329–341.
TACAS-1997-DArgenioKRT #bound #exclamation #protocol- The Bounded Retransmission Protocol Must Be on Time! (PRD, JPK, TCR, JT), pp. 416–431.
- POPL-1995-AltucherL #alias #analysis
- An Extended Form of Must Alias Analysis for Dynamic Allocation (RA, WL), pp. 74–84.
ICALP-1983-HartS #concurrent #how #probability- Concurrent Probabilistic Program, or: How to Schedule if You Must (SH, MS), pp. 304–318.
STOC-1973-WeinerSB #algorithm- Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient (PW, SLS, AB), pp. 207–213.
