9 Result(s)
within
Nishant Sinha
Mathematical Logic and Formal Languages
-
Chapter and Conference Paper
Commutativity of Reducers
In the Map-Reduce programming model for data parallel computation, a reducer computes an output from a list of input values associated with a key. The inputs however may not arrive at a reducer in a fixed orde...
-
Chapter and Conference Paper
What Gives? A Hybrid Algorithm for Error Trace Explanation
When a program fails, the cause of the failure is often buried in a long, hard-to-understand error trace. We present a new technique for automatic error localization, which formally unifies prior approaches ba...
-
Chapter and Conference Paper
Alternate and Learn: Finding Witnesses without Looking All over
Most symbolic bug detection techniques perform search over the program control flow graph based on either forward symbolic execution or backward weakest preconditions computation. The complexity of determining...
-
Chapter and Conference Paper
Object Model Construction for Inheritance in C++ and Its Applications to Program Analysis
Modern object-oriented programming languages such as C++ provide convenient abstractions and data encapsulation mechanisms for software developers. However, these features also complicate testing and static an...
-
Chapter and Conference Paper
SAT-Based Compositional Verification Using Lazy Learning
A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L * algorithm for learning regular langu...
-
Chapter and Conference Paper
Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions
The state explosion problem is one of the core bottlenecks in the model checking of concurrent software. We show how to ameliorate the problem by combining the ability of partial order techniques to reduce the...
-
Chapter and Conference Paper
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniques for checking correctness of ...
-
Chapter and Conference Paper
Automated Assume-Guarantee Reasoning for Simulation Conformance
We address the issue of efficiently automating assume-guarantee reasoning for simulation conformance between finite state systems and specifications. We focus on a non-circular assume-guarantee proof rule, and...
-
Chapter and Conference Paper
Range Allocation for Separation Logic
Separation Logic consists of a Boolean combination of predicates of the form v i ≥ v j ...
