Search
Now showing items 151-160 of 377
Identifying Method Memoization Opportunities in Java Programs
(2017-12-13)
Memorization of a method is a commonly used re-factoring wherein developer modules the code of a method to save return values for some or all incoming parameter values. Whenever a parameter-tuple is received for the second ...
A Low-Complexity Algorithm For Intrusion Detection In A PIR-Based Wireless Sensor Network
(2011-08-25)
This thesis investigates the problem of detecting an intruder in the presence of clutter in a Passive Infra-Red (PIR) based Wireless Sensor Network (WSN). As one of the major objectives in a WSN is to maximize battery life, ...
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
(2017-12-16)
In many real world situations, especially involving multiagent systems and artificial intelligence, participating agents often need to agree upon a common alternative even if they have differing preferences over the available ...
Constructing Provably Secure Identity-Based Signature Schemes
(2018-04-03)
An identity-based cryptosystem (IBC) is a public-key system where the public key can be represented by any arbitrary string such as an e-mail address. The notion was introduced by Shamir with the primary goal of simplifying ...
A Study of the Performance Benefits of Controlling Parallel Asynochrous Iteractive Applications
(Indian Institute of Science, 2005-03-11)
High performance networks of workstation are becoming increasingly popular a parallel computing platform because of their lower cost. Both message passing and software distributed shared memory (DSM) programming paradigms ...
Construction of Secure and Efficient Private Set Intersection Protocol
(2018-03-17)
Private set intersection(PSI) is a two party protocol where both parties possess a private set and at the end of the protocol, one party (client) learns the intersection while other party (server) learns nothing. Motivated ...
A Theoretical Study of the Synergy and Lazy Annotation Algorithms
(2018-04-03)
Given a program with assertions, the assertion checking problem is to tell whether there is an execution of the program that violates one of the assertions. One approach to this problem is to explore different paths towards ...
Improving the Precision of a Scalable Demand-Driven Null- Dereference Verification for Java
(2018-03-19)
The problem addressed in this thesis is sound, scalable, demand-driven null-dereference verification for Java programs via over-approximated weakest preconditions analysis. The base version of this analysis having been ...
Integrated Scheduling For Clustered VLIW Processors
(Indian Institute of Science, 2005-11-25)
Clustered architecture processors are preferred for embedded systems because centralized register file architectures scale poorly in terms of clock rate, chip area, and power consumption. Scheduling for clustered architectures ...
Transducer-based Algorithmic Verification of Retransmission Protocols over Noisy Channels
(2018-04-05)
Unreliable communication channels are a practical reality. They add to the complexity of protocol design and verification. In this work, we consider noisy channels which can corrupt messages. We present an approach to model ...