#### Filter Results:

- Full text PDF available (31)

#### Publication Year

1994

2017

- This year (4)
- Last 5 years (23)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Shaz Qadeer, Jakob Rehof
- TACAS
- 2005

The interaction among concurrently executing threads of a program results in insidious programming errors that are difficult to reproduce and fix. Unfortunately, the problem of verifying a concurrent boolean program is undecidable [24]. In this paper, we prove that the problem is decidable, even in the presence of unbounded parallelism, if the analysis is… (More)

- Jakob Rehof, Torben Æ. Mogensen
- SAS
- 1996

We introduce the notion of definite inequality constraints involving monotone functions in a finite meet-semJlattice, generalizing the logical notion of Horn-clauses, and we give a linear time algorithm for deciding satisfiability. We characterize the expressiveness of the framework of definite constraints and show that the algorithm uniformly solves… (More)

- Manuel Fähndrich, Jakob Rehof, Manuvir Das
- PLDI
- 2000

This paper shows that a type graph (obtained via polymorphic typeinference) harbors explicit directional flow paths between functions. These flow paths arise from the instantiations of polymorphic types and correspond to call-return sequences in first-order programs. We show that flow information can be computed efficiently while considering only paths with… (More)

- Sagar Chaki, Sriram K. Rajamani, Jakob Rehof
- POPL
- 2002

Abstraction and composition are the fundamental issues in making model checking viable for software. This paper proposes new techniques for automating abstraction and decomposition using source level type information provided by the programmer. Our system includes two novel components to achieve this end: (1) a behavioral type-and-effect system for the… (More)

- Fritz Henglein, Jakob Rehof
- LICS
- 1997

A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. We study the complexity of subtype entailment for simple types over lattices of base types. We show that: deciding C j= 0 is coNP-complete. decidingC j= for consistent, atomicC and ;… (More)

- Fritz Henglein, Jakob Rehof
- ICALP
- 1998

We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ordered set of possibly infinite labeled trees. The nonstructural ordering on trees is the one introduced by Amadio and Cardelli for subtyping with recursive types. The structural ordering… (More)

We present a novel refinement relation (stuck-free conformance) for CCS processes, which satisfies the substitutability property: If I conforms to S, and P is any environment such that P | S is stuckfree, then P | I is stuck-free. Stuck-freedom is related to the CSP notion of deadlock, but it is more discriminative by taking orphan messages in asynchronous… (More)

- Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof
- POPL
- 2004

The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used routinely in a variety of compiler optimizations and software defect-detection tools. However, the benefit of summarization is not available to multithreaded programs, for which a… (More)

- Manuvir Das, Ben Liblit, Manuel Fähndrich, Jakob Rehof
- SAS
- 2001

This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimizations? We first describe alias frequency, a metric that measures the ability of a pointer analysis to determine that pairs of memory accesses in C programs cannot be aliases. We… (More)