Travelled to:1 × Belgium
1 × Canada
1 × Denmark
1 × Estonia
1 × Italy
2 × France
2 × Germany
2 × Portugal
23 × USA
3 × United Kingdom
Collaborated with:M.Fähndrich E.L.Wimmers Z.Su T.Terauchi Y.Xie D.Gay J.S.Foster B.Liblit J.Kodumal B.R.Murphy A.Nicolau T.K.Lakshman ∅ A.X.Zheng M.I.Jordan S.Goldsmith R.O'Callahan K.A.Yelick S.Schleimer D.S.Wilkerson R.Levien L.Huelsbergen J.R.Larus J.Widom J.M.Hellerstein J.H.Williams D.Kozen M.Y.Vardi M.Naik J.Niehren T.Priesnitz R.Treinen C.Olston A.Woodruff M.Chu V.Ercegovac M.Lin M.Spalding M.Stonebraker
Talks about:type (12) constraint (11) program (7) analysi (5) infer (5) detect (4) data (4) base (4) set (4) parallel (3)
Person: Alexander Aiken
DBLP: Aiken:Alexander
Facilitated 1 volumes:
EdContributed to:
2005
2005
2005
20052005
2005
2005200420032003
200320022002
20012001200020001999199819981998
199819971996
19951995
199419941994
19931993
1992199219911991199019881988Wrote 42 papers:
- CAV-2005-XieA #debugging #detection #named #satisfiability
- Saturn: A SAT-Based Tool for Bug Detection (YX, AA), pp. 139–143.
- ESEC-FSE-2005-XieA #detection #memory management
- Context- and path-sensitive memory leak detection (YX, AA), pp. 115–125.
- ICFP-2005-TerauchiA
- Witnessing side-effects (TT, AA), pp. 105–115.
- OOPSLA-2005-GoldsmithOA #query #relational
- Relational queries over program traces (SG, RO, AA), pp. 385–402.
- PLDI-2005-LiblitNZAJ #debugging #scalability #statistics
- Scalable statistical bug isolation (BL, MN, AXZ, AA, MIJ), pp. 15–26.
- POPL-2005-XieA #detection #fault #satisfiability #scalability #using
- Scalable error detection using boolean satisfiability (YX, AA), pp. 351–363.
- SAS-2005-KodumalA #analysis #constraints #named #scalability #tool support
- Banshee: A Scalable Constraint-Based Analysis Toolkit (JK, AA), pp. 218–234.
- SAS-2005-TerauchiA #data flow #problem #safety
- Secure Information Flow as a Safety Problem (TT, AA), pp. 352–367.
- PLDI-2004-KodumalA #constraints #reachability #set
- The set constraint/CFL reachability connection in practice (JK, AA), pp. 207–218.
- PLDI-2003-AikenFKT #alias
- Checking and inferring local non-aliasing (AA, JSF, JK, TT), pp. 129–140.
- PLDI-2003-LiblitAZJ #debugging
- Bug isolation via remote program sampling (BL, AA, AXZ, MIJ), pp. 141–154.
- SAS-2003-LiblitAY #distributed #type system
- Type Systems for Distributed Data Sharing (BL, AA, KAY), pp. 273–294.
- SIGMOD-2003-SchleimerWA #algorithm #documentation #named
- Winnowing: Local Algorithms for Document Fingerprinting (SS, DSW, AA), pp. 76–85.
- PLDI-2002-FosterTA
- Flow-Sensitive Type Qualifiers (JSF, TT, AA), pp. 1–12.
- POPL-2002-SuANPT #constraints #first-order #type system
- The first-order theory of subtyping constraints (ZS, AA, JN, TP, RT), pp. 203–216.
- ESOP-2001-SuA #constraints #similarity
- Entailment with Conditional Equality Constraints (ZS, AA), pp. 170–189.
- PLDI-2001-GayA
- Language Support for Regions (DG, AA), pp. 70–80.
- POPL-2000-LiblitA #data type #distributed #type system
- Type Systems for Distributed Data Structures (BL, AA), pp. 199–213.
- POPL-2000-SuFA #constraints #graph
- Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs (ZS, MF, AA), pp. 81–95.
- SAS-2000-FosterFA #analysis #c #points-to #polymorphism
- Polymorphic versus Monomorphic Flow-Insensitive Points-to Analysis for C (JSF, MF, AA), pp. 175–198.
- PLDI-1999-FosterFA #formal method
- A Theory of Type Qualifiers (JSF, MF, AA), pp. 192–203.
- PLDI-1998-FahndrichFSA #constraints #graph #online
- Partial Online Cycle Elimination in Inclusion Constraint Graphs (MF, JSF, ZS, AA), pp. 85–96.
- PLDI-1998-GayA #memory management
- Memory Management with Explicit Regions (DG, AA), pp. 313–323.
- POPL-1998-AikenG
- Barrier Inference (AA, DG), pp. 342–354.
- SIGMOD-1998-OlstonWACELSS
- DataSplash (CO, AW, AA, MC, VE, ML, MS, MS), pp. 550–552.
- TACAS-1998-AikenFS #detection #logic programming #source code
- Detecting Races in Relay Ladder Logic Programs (AA, MF, ZS), pp. 184–200.
- SAS-1997-FahndrichA #constraints #program analysis #set #using
- Program Analysis Using Mixed Term and Set Constraints (MF, AA), pp. 114–126.
- SAS-1996-Aiken #constraints #program analysis
- Constraint-Based Program Analysis (AA), p. 1.
- FPCA-1995-AikenF #dynamic typing #type inference #type system
- Dynamic Typing and Subtype Inference (AA, MF), pp. 182–191.
- PLDI-1995-AikenFL #analysis #higher-order #memory management
- Better Static Memory Management: Improving Region-Based Analysis of Higher-Order Languages (AA, MF, RL), pp. 174–185.
- LFP-1994-HuelsbergenLA #data type #runtime #thread #using
- Using the Run-Time Sizes of Data Structures to Guide Parallel-Thread Creation (LH, JRL, AA), pp. 79–90.
- POPL-1994-AikenWL #type system
- Soft Typing with Conditional Types (AA, ELW, TKL), pp. 163–173.
- SAS-1994-AikenL #logic programming #source code #type checking
- Directional Type Checking of Logic Programs (AA, TKL), pp. 43–60.
- CSL-1993-AikenKVW #complexity #constraints #set
- The Complexity of Set Constraints (AA, DK, MYV, ELW), pp. 1–17.
- FPCA-1993-AikenW #constraints #type inference
- Type Inclusion Constraints and Type Inference (AA, ELW), pp. 31–41.
- LICS-1992-AikenW #constraints #set
- Solving Systems of Set Constraints (AA, ELW), pp. 329–340.
- SIGMOD-1992-AikenWH #behaviour #confluence #database #termination
- Behavior of Database Production Rules: Termination, Confluence, and Observable Determinism (AA, JW, JMH), pp. 59–68.
- FPCA-1991-AikenM #implementation
- Implementing Regular Tree Expressions (AA, BRM), pp. 427–447.
- POPL-1991-AikenM #static typing #type inference
- Static Type Inference in a Dynamically Typed Language (AA, BRM), pp. 279–290.
- POPL-1990-AikenWW #fault #program transformation
- Program Transformation in the Presence of Errors (AA, JHW, ELW), pp. 210–217.
- ESOP-1988-AikenN #parallel #pipes and filters
- Perfect Pipelining: A New Loop Parallelization Technique (AA, AN), pp. 221–235.
- PLDI-1988-AikenN #parallel
- Optimal Loop Parallelization (AA, AN), pp. 308–317.