Now showing items 461-480 of 761

    • Object and Reference Immutability using Java Generics 

      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 ...
    • Oblivious Routing in On-Chip Bandwidth-Adaptive Networks 

      Kinsy, Michel; Wen, Tina; Shim, Keun Sup; Lis, Mieszko; Cho, Myong Hyon; e.a. (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 ...
    • Of Malicious Motes and Suspicious Sensors 

      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. ...
    • An $\Omega(n \log n)$ Lower Bound on the Cost of Mutual Exclusion 

      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 ...
    • On a model of visual cortex: learning invariance and selectivity 

      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 ...
    • On Algorithms and Complexity for Sets with Cardinality Constraints 

      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 ...
    • On Decision Procedures for Set-Value Fields 

      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 ...
    • On Field Constraint Analysis 

      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 ...
    • On Generalized Records and Spatial Conjunction in Role Logic 

      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 ...
    • On Modular Pluggable Analyses Using Set Interfaces 

      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 ...
    • On Our Experience with Modular Pluggable Analyses 

      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 ...
    • On Randomized Path Coverage of Configuration Spaces 

      Perez, Alejandro (2013-11-18)
      We present a sampling-based algorithm that generates a set of locally-optimal paths that differ in visibility.
    • On Relational Analysis of Algebraic Datatypes 

      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 ...
    • On Role Logic 

      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 ...
    • On Spatial Conjunction as Second-Order Logic 

      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 ...
    • On the Adaptive Real-Time Detection of Fast-Propagating Network Worms 

      Jung, Jaeyeon; Milito, Rodolfo A.; Paxson, Vern (2006-11-10)
      We present two light-weight worm detection algorithms thatoffer significant advantages over fixed-threshold methods.The first algorithm, RBS (rate-based sequential hypothesis testing)aims at the large class of worms that ...
    • On The Boolean Algebra of Shape Analysis Constraints 

      Kuncak, Viktor; Rinard, Martin (2003-08-22)
      Shape analysis is a promising technique for statically verifyingand extracting properties of programs that manipulatecomplex data structures. We introduce a new characterizationof constraints that arise in parametric ...
    • On the difficulty of feature-based attentional modulations in visual object recognition: A modeling study. 

      Schneider, Robert; Riesenhuber, Maximilian (2004-01-14)
      Numerous psychophysical experiments have shown an important role for attentional modulations in vision. Behaviorally, allocation of attention can improve performance in object detection and recognition tasks. At the neural ...
    • On the Formal Semantics of the Cognitive Middleware AWDRAT 

      Khan, Muhammad Taimoor; Serpanos, Dimitrios; Shrobe, Howard (2015-03-03)
      The purpose of this work is two fold: on one hand we want to formalize the behavior of critical components of the self generating and adapting cognitive middleware AWDRAT such that the formalism not only helps to understand ...
    • On the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows 

      Hajiaghayi, MohammadTaghi; Leighton, F. Thomson (2003-07-05)
      We give a pure combinatorial problem whose solution determines max-flow min-cut ratio for directed multicommodity flows. In addition, this combinatorial problem has applications in improving the approximation factor of ...