BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Germany
1 × Italy
1 × Serbia
1 × The Netherlands
2 × Denmark
2 × Poland
2 × United Kingdom
4 × France
5 × USA
Collaborated with:
S.K.Rajamani B.Düdder F.Henglein A.Dudenhefner M.Fähndrich S.Qadeer M.Martens P.Urzyczyn G.T.Heineman M.Das T.B.Knoblock T.Æ.Mogensen S.Chaki A.Hoxha C.Fournet C.A.R.Hoare B.Liblit T.Andrews Y.Xie J.Bessai T.Chen U.de'Liguoro
Talks about:
type (11) subtyp (6) model (5) intersect (4) composit (4) softwar (4) bound (4) constraint (3) synthesi (3) concurr (3)

Person: Jakob Rehof

DBLP DBLP: Rehof:Jakob

Facilitated 1 volumes:

TACAS 2008Ed

Contributed to:

SPLC 20152015
TLCA 20152015
ESOP 20142014
TLCA 20132013
CSL 20122012
TLCA 20112011
TACAS 20052005
CAV 20042004
POPL 20042004
CAV 20022002
POPL 20022002
POPL 20012001
SAS 20012001
PLDI 20002000
POPL 20002000
ICALP 19981998
LICS 19971997
POPL 19971997
SAS 19961996
FPCA 19951995
POPL 20172017
POPL 20192019

Wrote 25 papers:

SPLC-2015-DudderRH #composition #design #staged #type safety #using
Synthesizing type-safe compositions in feature oriented software designs using staged composition (BD, JR, GTH), pp. 398–401.
SPLC-2015-HeinemanHDR #framework #migration #object-oriented #product line #synthesis #towards
Towards migrating object-oriented frameworks to enable synthesis of product line members (GTH, AH, BD, JR), pp. 56–60.
TLCA-2015-BessaiDDCdR #composition #mixin #synthesis
Mixin Composition Synthesis Based on Intersection Types (JB, AD, BD, TCC, Ud, JR), pp. 76–91.
ESOP-2014-DudderMR #composition #staged #synthesis
Staged Composition Synthesis (BD, MM, JR), pp. 67–86.
TLCA-2013-DudderMR #type system
Intersection Type Matching with Subtyping (BD, MM, JR), pp. 125–139.
CSL-2012-DudderMRU #bound #combinator #logic
Bounded Combinatory Logic (BD, MM, JR, PU), pp. 243–258.
TLCA-2011-RehofU #combinator #finite #logic
Finite Combinatory Logic with Intersection Types (JR, PU), pp. 169–183.
TACAS-2005-QadeerR #bound #concurrent #model checking
Context-Bounded Model Checking of Concurrent Software (SQ, JR), pp. 93–107.
CAV-2004-AndrewsQRRX #concurrent #model checking #named
Zing: A Model Checker for Concurrent Software (TA, SQ, SKR, JR, YX), pp. 484–487.
CAV-2004-FournetHRR #consistency
Stuck-Free Conformance (CF, CARH, SKR, JR), pp. 242–254.
POPL-2004-QadeerRR #concurrent #source code
Summarizing procedures in concurrent programs (SQ, SKR, JR), pp. 245–255.
CAV-2002-RajamaniR #consistency #message passing #modelling
Conformance Checking for Models of Asynchronous Message Passing Software (SKR, JR), pp. 166–179.
POPL-2002-ChakiRR #message passing #model checking #modelling #source code
Types as models: model checking message-passing programs (SC, SKR, JR), pp. 45–57.
POPL-2001-RehofF #analysis #polymorphism #type system
Type-base flow analysis: from polymorphic subtyping to CFL-reachability (JR, MF), pp. 54–66.
SAS-2001-DasLFR #impact analysis #optimisation #pointer #scalability
Estimating the Impact of Scalable Pointer Analysis on Optimization (MD, BL, MF, JR), pp. 260–278.
SAS-2001-RajamaniR #behaviour #π-calculus
A Behavioral Module System for the π-Calculus (SKR, JR), pp. 375–394.
PLDI-2000-FahndrichRD #analysis #constraints #scalability #using
Scalable context-sensitive flow analysis using instantiation constraints (MF, JR, MD), pp. 253–263.
POPL-2000-KnoblockR #bytecode #java #type system
Type Elaboration and Subtype Completion for Java Bytecode (TBK, JR), pp. 228–242.
ICALP-1998-HengleinR #automaton #complexity #constraints #recursion #type system
Constraint Automata and the Complexity of Recursive Subtype Entailment (FH, JR), pp. 616–627.
LICS-1997-HengleinR #complexity #type system
The Complexity of Subtype Entailment for Simple Types (FH, JR), pp. 352–361.
POPL-1997-Rehof #type system
Minimal Typings in Atomic Subtyping (JR), pp. 278–291.
SAS-1996-RehofM #constraints #finite
Tractable Constraints in Finite Semilattices (JR, TÆM), pp. 285–300.
FPCA-1995-HengleinR #ml #polymorphism #type inference
Safe Polymorphic Type Inference for Scheme: Translating Scheme to ML (FH, JR), pp. 192–203.
POPL-2017-DudenhefnerR #bound #calculus
Intersection type calculi of bounded dimension (AD, JR), pp. 653–665.
POPL-2019-DudenhefnerR #approximate #bound
Principality and approximation under dimensional bound (AD, JR), p. 29.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.