Advanced Search
DSpace@MIT

Browsing CSAIL Technical Reports (July 1, 2003 - present) by Title

Research and Teaching Output of the MIT Community

Browsing CSAIL Technical Reports (July 1, 2003 - present) by Title

Sort by: Order: Results:

  • Zibin, Yoav; Potanin, Alex; Artzi, Shay; Kiezun, Adam; Ernst, Michael D. (2007-03-16)
    A compiler-checked immutability guarantee provides useful documentation, facilitates reasoning, and enables optimizations. This paper presents Immutability Generic Java (IGJ), a novel language extension that expresses ...
  • Kinsy, Michel; Wen, Tina; Shim, Keun Sup; Lis, Mieszko; Cho, Myong Hyon; Devadas, Srinivas (2009-03-27)
    Oblivious routing can be implemented on simple router hardware, but network performance suffers when routes become congested. Adaptive routing attempts to avoid hot spots by re-routing flows, but requires more complex ...
  • Gilbert, Seth; Guerraoui, Rachid; Newport, Calvin (2006-04-19)
    How much damage can a malicious tiny device cause in a single-hopwireless network? Imagine two players, Alice and Bob, who want toexchange information. Collin, a malicious adversary, wants to preventthem from communicating. ...
  • Fan, Rui; Lynch, Nancy (2006-07-23)
    We prove an $\Omega(n \log n)$ lower bound on the number ofnon-busywaiting memory accesses by any deterministic algorithm solving$n$ process mutual exclusion that communicates via shared registers.The cost of the algorithm ...
  • Marnette, Bruno; Kuncak, Viktor; Rinard, Martin (2005-08-03)
    Typestate systems ensure many desirable properties of imperativeprograms, including initialization of object fields and correct use ofstateful library interfaces. Abstract sets with cardinalityconstraints naturally ...
  • Caponnetto, Andrea; Poggio, Tomaso; Smale, Steve (2008-04-04)
    In this paper we present a class of algorithms for similarity learning on spaces of images. The general framework that we introduce is motivated by some well-known hierarchical pre-processing architectures for object ...
  • Kuncak, Viktor; Rinard, Martin (2004-11-30)
    An important feature of object-oriented programming languages is the ability todynamically instantiate user-defined container data structures such as lists, trees,and hash tables. Programs implement such data structures ...
  • Abari, Omid; Rahul, Hariharan; Katabi, Dina (2014-04-27)
    Implementing distributed wireless protocols at the physical layer today is challenging because different nodes have different clocks, each of which has slightly different frequencies. This causes the nodes to have frequency ...
  • Salakhutdinov, Ruslan; Tenenbaum, Josh; Torralba, Antonio (2010-10-13)
    We develop a hierarchical Bayesian model that learns to learn categories from single training examples. The model transfers acquired knowledge from previously learned categories to a novel category, in the form of a prior ...
  • Woo, Grace; Katabi, Dina; Chachulski, Szymon (2008-10-18)
    The fundamental problem of wireless video multicast is to scalably serve multiple receivers which may have very different channel characteristics. Ideally, one would like to broadcast a single stream that allows each ...
  • Wies, Thomas; Kuncak, Viktor; Lam, Patrick; Podelski, Andreas; Rinard, Martin (2005-11-03)
    We introduce field constraint analysis, a new technique for verifying data structure invariants. A field constraint for a field is a formula specifying a set of objects to which the field can point. Field constraints ...
  • Kuncak, Viktor; Rinard, Martin (2004-04-06)
    We have previously introduced role logic as a notation fordescribing properties of relational structures in shapeanalysis, databases and knowledge bases. A natural fragmentof role logic corresponds to two-variable logic ...
  • Monteleoni, Claire; Kaariainen, Matti (2007-01-23)
    We compare the practical performance of several recently proposed algorithms for active learning in the online setting. We consider two algorithms (and their combined variants) that are strongly online, in that they do ...
  • Monteleoni, Claire; Jaakkola, Tommi (2005-11-17)
    We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a class of universal learning algorithms involving ...
  • Lam, Patrick; Kuncak, Viktor; Rinard, Martin (2003-12-18)
    We present a technique that enables the focused applicationof multiple analyses to different modules in the same program. Our researchhas two goals: 1) to address the scalability limitations of preciseanalyses by focusing ...
  • Lam, Patrick; Kuncak, Viktor; Rinard, Martin (2004-10-04)
    We present a technique that enables the focused applicationof multiple analyses to di erent modules in thesame program. In our approach, each module encapsulatesone or more data structures and uses membershipin abstract ...
  • Perez, Alejandro (2013-11-18)
    We present a sampling-based algorithm that generates a set of locally-optimal paths that differ in visibility.
  • Kuncak, Viktor; Jackson, Daniel (2005-04-05)
    We present a technique that enables the use of finite modelfinding to check the satisfiability of certain formulaswhose intended models are infinite. Such formulas arisewhen using the language of sets and relations to ...
  • Kuncak, Viktor; Rinard, Martin (2003-10-24)
    We present role logic, a notation for describing propertiesof relational structures in shape analysis, databases, andknowledge bases. We construct role logic using the ideas ofde Bruijn's notation for lambda calculus, an ...
  • Kuncak, Viktor; Rinard, Martin (2004-10-25)
    Spatial conjunction is a powerful construct for reasoning about dynamically allocateddata structures, as well as concurrent, distributed and mobile computation. Whileresearchers have identified many uses of spatial ...
MIT-Mirage