default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJakob Rehof
Person information
- affiliation: Technical University of Dortmund, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[e4]Jakob Rehof:
9th International Conference on Formal Structures for Computation and Deduction, FSCD 2024, July 10-13, 2024, Tallinn, Estonia. LIPIcs 299, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-323-2 [contents]- 2023
- [c51]Andrej Dudenhefner, Christoph Stahl, Constantin Chaumet, Felix Laarmann, Jakob Rehof:
Finite Combinatory Logic with Predicates. TYPES 2023: 2:1-2:22 - [i8]Constantin Chaumet, Jakob Rehof:
CLS-CAD: Synthesizing CAD Assemblies in Fusion 360. CoRR abs/2311.18492 (2023) - [i7]Constantin Chaumet, Jakob Rehof, Thomas Schuster:
A knowledge-driven framework for synthesizing designs from modular components. CoRR abs/2311.18533 (2023) - 2022
- [j9]Sandra Geisler
, Maria-Esther Vidal, Cinzia Cappiello, Bernadette Farias Lóscio, Avigdor Gal, Matthias Jarke, Maurizio Lenzerini, Paolo Missier, Boris Otto, Elda Paja, Barbara Pernici, Jakob Rehof:
Knowledge-Driven Data Ecosystems Toward Data Transparency. ACM J. Data Inf. Qual. 14(1): 3:1-3:12 (2022) - [c50]Jan Bessai, Lukasz Czajka, Felix Laarmann, Jakob Rehof:
Restricting Tree Grammars with Term Rewriting. FSCD 2022: 14:1-14:19 - [c49]Tristan Schäfer, Jan Bessai, Constantin Chaumet, Jakob Rehof, Christian Riest:
Design Space Exploration for Sampling-Based Motion Planning Programs with Combinatory Logic Synthesis. WAFR 2022: 36-51 - [c48]Alexander Mages, Carina Mieth, Jens Hetzler, Fadil Kallat, Jakob Rehof, Christian Riest, Tristan Schäfer:
Automatic Component-Based Synthesis of User-Configured Manufacturing Simulation Models. WSC 2022: 1841-1852 - 2021
- [i6]Sandra Geisler, Maria-Esther Vidal, Cinzia Cappiello, Bernadette Farias Lóscio, Avigdor Gal, Matthias Jarke, Maurizio Lenzerini, Paolo Missier, Boris Otto, Elda Paja, Barbara Pernici, Jakob Rehof:
Knowledge-driven Data Ecosystems Towards Data Transparency. CoRR abs/2105.09312 (2021)
2010 – 2019
- 2019
- [j8]Andrej Dudenhefner, Jakob Rehof:
Undecidability of Intersection Type Inhabitation at Rank 3 and its Formalization. Fundam. Informaticae 170(1-3): 93-110 (2019) - [j7]Andrej Dudenhefner, Jakob Rehof:
Principality and approximation under dimensional bound. Proc. ACM Program. Lang. 3(POPL): 8:1-8:29 (2019) - [c47]Sigrid Wenzel, Jana Stolipin, Jakob Rehof, Jan Winkels:
Trends in Automatic Composition of Structures for Simulation Models in Production and Logistics. WSC 2019: 2190-2200 - [i5]Cinzia Cappiello, Avigdor Gal, Matthias Jarke, Jakob Rehof:
Data Ecosystems: Sovereign Data Exchange among Organizations (Dagstuhl Seminar 19391). Dagstuhl Reports 9(9): 66-134 (2019) - 2018
- [j6]Jan Bessai, Tzu-Chun Chen, Andrej Dudenhefner, Boris Düdder, Ugo de'Liguoro, Jakob Rehof:
Mixin Composition Synthesis based on Intersection Types. Log. Methods Comput. Sci. 14(1) (2018) - [c46]Jan Bessai, Jakob Rehof, Boris Düdder:
Fast Verified BCD Subtyping. Models, Mindsets, Meta 2018: 356-371 - [c45]Tristan Schäfer, Frederik Möller, Anja Burmann, Yevgen Pikus, Norbert Weißenberg, Marcus Hintze, Jakob Rehof:
A Methodology for Combinatory Process Synthesis: Process Variability in Clinical Pathways. ISoLA (4) 2018: 472-486 - [c44]Jan Winkels, Julian Graefenstein, Tristan Schäfer, David Scholz, Jakob Rehof, Michael Henke:
Automatic Composition of Rough Solution Possibilities in the Target Planning of Factory Planning Projects by Means of Combinatory Logic. ISoLA (4) 2018: 487-503 - [c43]Andrej Dudenhefner, Jakob Rehof:
A Simpler Undecidability Proof for System F Inhabitation. TYPES 2018: 2:1-2:11 - 2017
- [j5]Andrej Dudenhefner, Moritz Martens, Jakob Rehof:
The Algebraic Intersection Type Unification Problem. Log. Methods Comput. Sci. 13(3) (2017) - [c42]Andrej Dudenhefner, Jakob Rehof:
Typability in bounded dimension. LICS 2017: 1-12 - [c41]Andrej Dudenhefner, Jakob Rehof:
Intersection type calculi of bounded dimension. POPL 2017: 653-665 - [c40]Andrej Dudenhefner, Jakob Rehof:
The Complexity of Principal Inhabitation. FSCD 2017: 15:1-15:14 - [c39]Andrej Dudenhefner, Jakob Rehof:
Lower End of the Linial-Post Spectrum. TYPES 2017: 2:1-2:15 - [i4]Andrej Dudenhefner, Jakob Rehof:
Rank 3 Inhabitation of Intersection Types Revisited (Extended Version). CoRR abs/1705.06070 (2017) - [i3]Jan Bessai, Tzu-Chun Chen, Andrej Dudenhefner, Boris Düdder, Ugo de'Liguoro, Jakob Rehof:
Mixin Composition Synthesis based on Intersection Types. CoRR abs/1712.06906 (2017) - 2016
- [c38]Fritz Henglein, Jakob Rehof:
Modal Intersection Types, Two-Level Languages, and Staged Synthesis. Semantics, Logics, and Calculi 2016: 289-312 - [c37]Boris Düdder, George T. Heineman, Jakob Rehof:
ModSyn-PP: Modular Synthesis of Programs and Processes Track Introduction. ISoLA (1) 2016: 261-265 - [c36]Jan Bessai, Andrej Dudenhefner, Boris Düdder, Moritz Martens, Jakob Rehof:
Combinatory Process Synthesis. ISoLA (1) 2016: 266-281 - [c35]George T. Heineman, Jan Bessai, Boris Düdder, Jakob Rehof:
A Long and Winding Road Towards Modular Synthesis. ISoLA (1) 2016: 303-317 - [c34]Andrej Dudenhefner, Moritz Martens, Jakob Rehof:
The Intersection Type Unification Problem. FSCD 2016: 19:1-19:16 - [i2]Andrej Dudenhefner, Moritz Martens, Jakob Rehof:
The Intersection Type Unification Problem. CoRR abs/1611.05672 (2016) - 2015
- [c33]Jan Bessai, Boris Düdder, George T. Heineman, Jakob Rehof:
Combinatory Synthesis of Classes Using Feature Grammars. FACS 2015: 123-140 - [c32]Boris Düdder, Moritz Martens, Jakob Rehof:
Staged Composition Synthesis. Software Engineering & Management 2015: 89-90 - [c31]George T. Heineman, Armend Hoxha, Boris Düdder, Jakob Rehof:
Towards migrating object-oriented frameworks to enable synthesis of product line members. SPLC 2015: 56-60 - [c30]Jakob Rehof, George T. Heineman:
Modular synthesis of product lines (ModSyn-PL). SPLC 2015: 393 - [c29]Boris Düdder, Jakob Rehof, George T. Heineman:
Synthesizing type-safe compositions in feature oriented software designs using staged composition. SPLC 2015: 398-401 - [c28]Jan Bessai, Andrej Dudenhefner, Boris Düdder, Tzu-Chun Chen, Ugo de'Liguoro, Jakob Rehof:
Mixin Composition Synthesis Based on Intersection Types. TLCA 2015: 76-91 - [e3]Jakob Rehof:
Proceedings Seventh Workshop on Intersection Types and Related Systems, ITRS 2014, Vienna, Austria, 18 July 2014. EPTCS 177, 2015 [contents] - [e2]Michael ten Hompel, Jakob Rehof, Oliver Wolf:
Cloud Computing for Logistics. Lecture Notes in Logistics, Springer 2015, ISBN 978-3-319-13403-1 [contents] - 2014
- [c27]Boris Düdder, Moritz Martens, Jakob Rehof:
Staged Composition Synthesis. ESOP 2014: 67-86 - [c26]Jan Bessai, Andrej Dudenhefner, Boris Düdder, Moritz Martens, Jakob Rehof:
Combinatory Logic Synthesizer. ISoLA (1) 2014: 26-40 - [i1]Jakob Rehof, Moshe Y. Vardi:
Design and Synthesis from Components (Dagstuhl Seminar 14232). Dagstuhl Reports 4(6): 29-47 (2014) - 2013
- [c25]Boris Düdder, Moritz Martens, Jakob Rehof:
Intersection Type Matching with Subtyping. TLCA 2013: 125-139 - 2012
- [c24]Jakob Rehof, Pawel Urzyczyn:
The Complexity of Inhabitation with Explicit Intersection. Logic and Program Semantics 2012: 256-270 - [c23]Boris Düdder, Moritz Martens, Jakob Rehof, Pawel Urzyczyn:
Bounded Combinatory Logic. CSL 2012: 243-258 - [c22]Boris Düdder, Oliver Garbe, Moritz Martens, Jakob Rehof, Pawel Urzyczyn:
Using Inhabitation in Bounded Combinatory Logic with Intersection Types for Composition Synthesis. ITRS 2012: 18-34 - 2011
- [c21]Jakob Rehof, Pawel Urzyczyn:
Finite Combinatory Logic with Intersection Types. TLCA 2011: 169-183 - 2010
- [c20]Jakob Rehof, Bernhard Holtkamp:
Logistic Clouds - Nutzung von Cloud Computing Services in der Logistik (Vorwort). GI Jahrestagung (1) 2010: 297-298
2000 – 2009
- 2008
- [j4]Manuel Fähndrich, Jakob Rehof:
Type-based flow analysis and context-free language reachability. Math. Struct. Comput. Sci. 18(5): 823-894 (2008) - [e1]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. Lecture Notes in Computer Science 4963, Springer 2008, ISBN 978-3-540-78799-0 [contents] - 2005
- [c19]Shaz Qadeer, Jakob Rehof:
Context-Bounded Model Checking of Concurrent Software. TACAS 2005: 93-107 - 2004
- [c18]Cédric Fournet, C. A. R. Hoare, Sriram K. Rajamani, Jakob Rehof:
Stuck-Free Conformance. CAV 2004: 242-254 - [c17]Tony Andrews, Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof, Yichen Xie:
Zing: A Model Checker for Concurrent Software. CAV 2004: 484-487 - [c16]Sriram K. Rajamani, Jakob Rehof:
Models for Contract Conformance. ISoLA 2004: 181-196 - [c15]Jakob Rehof, Sriram K. Rajamani:
Models for Contract Conformance. ISoLA (Preliminary proceedings) 2004: 253-260 - [c14]Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof:
Summarizing procedures in concurrent programs. POPL 2004: 245-255 - 2002
- [c13]Sriram K. Rajamani, Jakob Rehof:
Conformance Checking for Models of Asynchronous Message Passing Software. CAV 2002: 166-179 - [c12]Sagar Chaki, Sriram K. Rajamani, Jakob Rehof:
Types as models: model checking message-passing programs. POPL 2002: 45-57 - 2001
- [j3]Todd B. Knoblock, Jakob Rehof:
Type elaboration and subtype completion for Java bytecode. ACM Trans. Program. Lang. Syst. 23(2): 243-272 (2001) - [c11]Jakob Rehof, Manuel Fähndrich:
Type-base flow analysis: from polymorphic subtyping to CFL-reachability. POPL 2001: 54-66 - [c10]Manuvir Das, Ben Liblit, Manuel Fähndrich, Jakob Rehof:
Estimating the Impact of Scalable Pointer Analysis on Optimization. SAS 2001: 260-278 - [c9]Sriram K. Rajamani, Jakob Rehof:
A Behavioral Module System for the Pi-Calculus. SAS 2001: 375-394 - 2000
- [c8]Manuel Fähndrich, Jakob Rehof, Manuvir Das:
Scalable context-sensitive flow analysis using instantiation constraints. PLDI 2000: 253-263 - [c7]Todd B. Knoblock, Jakob Rehof:
Type Elaboration and Subtype Completion for Java Bytecode. POPL 2000: 228-242
1990 – 1999
- 1999
- [j2]Jakob Rehof, Torben Æ. Mogensen:
Tractable Constraints in Finite Semilattices. Sci. Comput. Program. 35(2): 191-221 (1999) - 1998
- [b1]Jakob Rehof:
The complexity of simple subtyping systems. University of Copenhagen, Denmark, Technical report / University of Copenhagen / Datalogisk institut 98/19, 1998 - [c6]Fritz Henglein, Jakob Rehof:
Constraint Automata and the Complexity of Recursive Subtype Entailment. ICALP 1998: 616-627 - 1997
- [c5]Fritz Henglein, Jakob Rehof:
The Complexity of Subtype Entailment for Simple Types. LICS 1997: 352-361 - [c4]Jakob Rehof:
Minimal Typings in Atomic Subtyping. POPL 1997: 278-291 - 1996
- [j1]Jakob Rehof:
Strong Normalization for Non-Structural Subtyping via Saturated Sets. Inf. Process. Lett. 58(4): 157-162 (1996) - [c3]Jakob Rehof, Torben Æ. Mogensen:
Tractable Constraints in Finite Semilattices. SAS 1996: 285-300 - 1995
- [c2]Fritz Henglein, Jakob Rehof:
Safe Polymorphic Type Inference for Scheme: Translating Scheme to ML. FPCA 1995: 192-203 - 1994
- [c1]Jakob Rehof, Morten Heine Sørensen:
The LambdaDelta-calculus. TACS 1994: 516-542
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
