Browsing CSAIL Digital Archive by Title
Now showing items 492-511 of 806
-
On Algorithms and Complexity for Sets with Cardinality Constraints
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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.
(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
(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
(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 ... -
On the Non-Existence of Blockwise 2-Local PRGs with Applications to Indistinguishability Obfuscation
(2017-04-06)Lin and Tessaro (Eprint 2017/250) recently proposed indistinguishability obfuscation and functional encryption candidates and proved their security based on a standard assumption on bilinear maps and a non-standard assumption ... -
On Using First-Order Theorem Provers in the Jahob Data Structure Verification System
(2006-11-09)This paper presents our integration of efficient resolution-based theorem provers into the Jahob data structure verification system. Our experimental results show that this approach enables Jahob to automatically ... -
On Verifying a File System Implementation
(2004-05-06)We present a correctness proof for a basic file system implementation. This implementation contains key elements of standard Unix file systems such as inodes and fixed-size disk blocks. We prove the implementation correct ... -
One Clock to Rule Them All: A Primitive for Distributed Wireless Protocols at the Physical Layer
(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 ... -
One Video Stream to Serve Diverse Receivers
(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 ...
