| 2008 |
|---|
| 24 | | C. R. Ramakrishnan,
Jakob Rehof:
Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings
Springer 2008 |
| 23 | EE | Manuel Fähndrich,
Jakob Rehof:
Type-based flow analysis and context-free language reachability.
Mathematical Structures in Computer Science 18(5): 823-894 (2008) |
| 2005 |
|---|
| 22 | EE | Shaz Qadeer,
Jakob Rehof:
Context-Bounded Model Checking of Concurrent Software.
TACAS 2005: 93-107 |
| 2004 |
|---|
| 21 | EE | Cédric Fournet,
C. A. R. Hoare,
Sriram K. Rajamani,
Jakob Rehof:
Stuck-Free Conformance.
CAV 2004: 242-254 |
| 20 | EE | Tony Andrews,
Shaz Qadeer,
Sriram K. Rajamani,
Jakob Rehof,
Yichen Xie:
Zing: A Model Checker for Concurrent Software.
CAV 2004: 484-487 |
| 19 | EE | Sriram K. Rajamani,
Jakob Rehof:
Models for Contract Conformance.
ISoLA 2004: 181-196 |
| 18 | | Jakob Rehof,
Sriram K. Rajamani:
Models for Contract Conformance.
ISoLA (Preliminary proceedings) 2004: 253-260 |
| 17 | EE | Shaz Qadeer,
Sriram K. Rajamani,
Jakob Rehof:
Summarizing procedures in concurrent programs.
POPL 2004: 245-255 |
| 2002 |
|---|
| 16 | EE | Sriram K. Rajamani,
Jakob Rehof:
Conformance Checking for Models of Asynchronous Message Passing Software.
CAV 2002: 166-179 |
| 15 | EE | Sagar Chaki,
Sriram K. Rajamani,
Jakob Rehof:
Types as models: model checking message-passing programs.
POPL 2002: 45-57 |
| 2001 |
|---|
| 14 | EE | Jakob Rehof,
Manuel Fähndrich:
Type-base flow analysis: from polymorphic subtyping to CFL-reachability.
POPL 2001: 54-66 |
| 13 | EE | Manuvir Das,
Ben Liblit,
Manuel Fähndrich,
Jakob Rehof:
Estimating the Impact of Scalable Pointer Analysis on Optimization.
SAS 2001: 260-278 |
| 12 | EE | Sriram K. Rajamani,
Jakob Rehof:
A Behavioral Module System for the Pi-Calculus.
SAS 2001: 375-394 |
| 11 | EE | Todd B. Knoblock,
Jakob Rehof:
Type elaboration and subtype completion for Java bytecode.
ACM Trans. Program. Lang. Syst. 23(2): 243-272 (2001) |
| 2000 |
|---|
| 10 | EE | Manuel Fähndrich,
Jakob Rehof,
Manuvir Das:
Scalable context-sensitive flow analysis using instantiation constraints.
PLDI 2000: 253-263 |
| 9 | EE | Todd B. Knoblock,
Jakob Rehof:
Type Elaboration and Subtype Completion for Java Bytecode.
POPL 2000: 228-242 |
| 1999 |
|---|
| 8 | | Jakob Rehof,
Torben Æ. Mogensen:
Tractable Constraints in Finite Semilattices.
Sci. Comput. Program. 35(2): 191-221 (1999) |
| 1998 |
|---|
| 7 | EE | Fritz Henglein,
Jakob Rehof:
Constraint Automata and the Complexity of Recursive Subtype Entailment.
ICALP 1998: 616-627 |
| 1997 |
|---|
| 6 | EE | Fritz Henglein,
Jakob Rehof:
The Complexity of Subtype Entailment for Simple Types.
LICS 1997: 352-361 |
| 5 | EE | Jakob Rehof:
Minimal Typings in Atomic Subtyping.
POPL 1997: 278-291 |
| 1996 |
|---|
| 4 | | Jakob Rehof,
Torben Æ. Mogensen:
Tractable Constraints in Finite Semilattices.
SAS 1996: 285-300 |
| 3 | EE | Jakob Rehof:
Strong Normalization for Non-Structural Subtyping via Saturated Sets.
Inf. Process. Lett. 58(4): 157-162 (1996) |
| 1995 |
|---|
| 2 | | Fritz Henglein,
Jakob Rehof:
Safe Polymorphic Type Inference for Scheme: Translating Scheme to ML.
FPCA 1995: 192-203 |
| 1994 |
|---|
| 1 | | Jakob Rehof,
Morten Heine Sørensen:
The LambdaDelta-calculus.
TACS 1994: 516-542 |
