#### Filter Results:

- Full text PDF available (30)

#### Publication Year

2000

2013

- This year (0)
- Last 5 years (6)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Vineet Kahlon, Franjo Ivancic, Aarti Gupta
- CAV
- 2005

We propose a new technique for the static analysis of concurrent programs comprised of multiple threads. In general, the problem is known to be undecidable even for programs with only two threads but where the threads communicate using CCS-style pairwise rendezvous [10]. However, in practice, a large fraction of concurrent programs can either be directly… (More)

- E. Allen Emerson, Vineet Kahlon
- CADE
- 2000

Systems with an arbitrary number of homogeneous processes occur in many applications. The Parametrized Model Checking Problem (PMCP) is to determine whether a temporal property is true for every size instance of the system. Unfortunately, it is undecidable in general. We are able to establish, nonetheless, decidability of the PMCP in quite a broad… (More)

- E. Allen Emerson, Vineet Kahlon
- TACAS
- 2002

In this paper, techniques are proposed for limiting state explosion in the context of resource allocation problems. It is shown that given any system organized into a — possibly irregular — network of — possibly heterogeneous — processes, model checking over that system can be reduced by an efficient, fully automatic and exact method to model checking over… (More)

- Vineet Kahlon
- PLDI
- 2008

We propose a framework for improving both the scalability as well as the accuracy of pointer alias analysis, irrespective of its flow or context-sensitivities, by leveraging a three-pronged strategy that effectively combines <i>divide and conquer, parallelization and function summarization</i>. A key step in our approach is to first identify small subsets… (More)

- Vineet Kahlon, Chao Wang, Aarti Gupta
- CAV
- 2009

We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration for model checking concurrent software. Our technique hinges on a new characterization of partial orders defined by computations of a concurrent program in terms of quasi-monotonic… (More)

- Vineet Kahlon, Chao Wang
- CAV
- 2010

Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is the behavioral complexity resulting from the large number of interleavings of operations of different threads. Efficient static techniques, therefore, play a critical role in restricting the set of interleavings that need be explored in greater depth. The goal… (More)

- E. Allen Emerson, Vineet Kahlon
- LICS
- 2003

The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, , comprised of a control process, , and finitely, but arbitrarily, many copies of a user process, , executing concurrently with interleaving semantics. We delineate the decidability/undecidability boundary of the PMCP for all… (More)

- E. Allen Emerson, Vineet Kahlon
- CHARME
- 2003

We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. For reasoning about general snoopy cache protocols, we introduce the guarded broadcast protocols model and show how an abstract history graph construction can be used to reason about safety… (More)

- Chao Wang, Zijiang Yang, Vineet Kahlon, Aarti Gupta
- TACAS
- 2008

We present a symbolic dynamic partial order reduction (POR) method for model checking concurrent software. We introduce the notion of guarded independent transitions, i.e., transitions that can be considered as independent in certain (but not necessarily all) execution paths. These can be exploited by using a new peephole reduction method. A symbolic… (More)

- E. Allen Emerson, Vineet Kahlon
- CSL
- 2004

The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, , comprised of finite, but arbitrarily many, copies of a template process . Unfortunately, it is undecidable in general [3]. In this paper, we consider the PMCP for systems comprised of processes arranged in a ring that communicate… (More)