Jakob Rehof

According to our database, Jakob Rehof authored at least 61 papers between 1994 and 2023.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of three.

2023

A knowledge-driven framework for synthesizing designs from modular components.

Constantin Chaumet, Jakob Rehof, Thomas Schuster

CoRR, 2023

CLS-CAD: Synthesizing CAD Assemblies in Fusion 360.

Constantin Chaumet, Jakob Rehof

CoRR, 2023

2022

Knowledge-Driven Data Ecosystems Toward Data Transparency.

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

ACM J. Data Inf. Qual., 2022

Automatic Component-Based Synthesis of User-Configured Manufacturing Simulation Models.

Alexander Mages, Carina Mieth, Jens Hetzler, Fadil Kallat, Jakob Rehof, Christian Riest, Tristan Schäfer

Proceedings of the Winter Simulation Conference, 2022

Design Space Exploration for Sampling-Based Motion Planning Programs with Combinatory Logic Synthesis.

Tristan Schäfer, Jan Bessai, Constantin Chaumet, Jakob Rehof, Christian Riest

Proceedings of the Algorithmic Foundations of Robotics XV, 2022

Restricting Tree Grammars with Term Rewriting.

Jan Bessai, Lukasz Czajka, Felix Laarmann, Jakob Rehof

Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021

Knowledge-driven Data Ecosystems Towards Data Transparency.

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

CoRR, 2021

2019

Principality and approximation under dimensional bound.

Andrej Dudenhefner, Jakob Rehof

Proc. ACM Program. Lang., 2019

Undecidability of Intersection Type Inhabitation at Rank 3 and its Formalization.

Andrej Dudenhefner, Jakob Rehof

Fundam. Informaticae, 2019

Data Ecosystems: Sovereign Data Exchange among Organizations (Dagstuhl Seminar 19391).

Cinzia Cappiello, Avigdor Gal, Matthias Jarke, Jakob Rehof

Dagstuhl Reports, 2019

Trends in Automatic Composition of Structures for Simulation Models in Production and Logistics.

Sigrid Wenzel, Jana Stolipin, Jakob Rehof, Jan Winkels

Proceedings of the 2019 Winter Simulation Conference, 2019

2018

Mixin Composition Synthesis based on Intersection Types.

Jan Bessai, Tzu-Chun Chen, Andrej Dudenhefner, Boris Düdder, Ugo de'Liguoro, Jakob Rehof

Log. Methods Comput. Sci., 2018

A Simpler Undecidability Proof for System F Inhabitation.

Andrej Dudenhefner, Jakob Rehof

Proceedings of the 24th International Conference on Types for Proofs and Programs, 2018

Automatic Composition of Rough Solution Possibilities in the Target Planning of Factory Planning Projects by Means of Combinatory Logic.

Jan Winkels, Julian Graefenstein, Tristan Schäfer, David Scholz, Jakob Rehof, Michael Henke

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Industrial Practice, 2018

A Methodology for Combinatory Process Synthesis: Process Variability in Clinical Pathways.

Tristan Schäfer, Frederik Möller, Anja Burmann, Yevgen Pikus, Norbert Weißenberg, Marcus Hintze, Jakob Rehof

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Industrial Practice, 2018

Fast Verified BCD Subtyping.

Jan Bessai, Jakob Rehof, Boris Düdder

Proceedings of the Models, Mindsets, 2018

2017

The Algebraic Intersection Type Unification Problem.

Andrej Dudenhefner, Moritz Martens, Jakob Rehof

Log. Methods Comput. Sci., 2017

Rank 3 Inhabitation of Intersection Types Revisited (Extended Version).

Andrej Dudenhefner, Jakob Rehof

CoRR, 2017

Lower End of the Linial-Post Spectrum.

Andrej Dudenhefner, Jakob Rehof

Proceedings of the 23rd International Conference on Types for Proofs and Programs, 2017

The Complexity of Principal Inhabitation.

Andrej Dudenhefner, Jakob Rehof

Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Intersection type calculi of bounded dimension.

Andrej Dudenhefner, Jakob Rehof

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Typability in bounded dimension.

Andrej Dudenhefner, Jakob Rehof

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

The Intersection Type Unification Problem.

Andrej Dudenhefner, Moritz Martens, Jakob Rehof

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

A Long and Winding Road Towards Modular Synthesis.

George T. Heineman, Jan Bessai, Boris Düdder, Jakob Rehof

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques, 2016

ModSyn-PP: Modular Synthesis of Programs and Processes Track Introduction.

Boris Düdder, George T. Heineman, Jakob Rehof

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques, 2016

Combinatory Process Synthesis.

Jan Bessai, Andrej Dudenhefner, Boris Düdder, Moritz Martens, Jakob Rehof

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques, 2016

Modal Intersection Types, Two-Level Languages, and Staged Synthesis.

Fritz Henglein, Jakob Rehof

Proceedings of the Semantics, Logics, and Calculi, 2016

2015

Modular synthesis of product lines (ModSyn-PL).

Jakob Rehof, George T. Heineman

Proceedings of the 19th International Conference on Software Product Line, 2015

Towards migrating object-oriented frameworks to enable synthesis of product line members.

George T. Heineman, Armend Hoxha, Boris Düdder, Jakob Rehof

Proceedings of the 19th International Conference on Software Product Line, 2015

Synthesizing type-safe compositions in feature oriented software designs using staged composition.

Boris Düdder, Jakob Rehof, George T. Heineman

Proceedings of the 19th International Conference on Software Product Line, 2015

Staged Composition Synthesis.

Boris Düdder, Moritz Martens, Jakob Rehof

Proceedings of the Software Engineering & Management 2015, Multikonferenz der GI-Fachbereiche Softwaretechnik (SWT) und Wirtschaftsinformatik (WI), FA WI-MAW, 17. März, 2015

Combinatory Synthesis of Classes Using Feature Grammars.

Jan Bessai, Boris Düdder, George T. Heineman, Jakob Rehof

Proceedings of the Formal Aspects of Component Software - 12th International Conference, 2015

2014

Design and Synthesis from Components (Dagstuhl Seminar 14232).

Jakob Rehof, Moshe Y. Vardi

Dagstuhl Reports, 2014

Combinatory Logic Synthesizer.

Jan Bessai, Andrej Dudenhefner, Boris Düdder, Moritz Martens, Jakob Rehof

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2014

2013

Intersection Type Matching with Subtyping.

Boris Düdder, Moritz Martens, Jakob Rehof

Proceedings of the Typed Lambda Calculi and Applications, 11th International Conference, 2013

2012

Using Inhabitation in Bounded Combinatory Logic with Intersection Types for Composition Synthesis.

Boris Düdder, Oliver Garbe, Moritz Martens, Jakob Rehof, Pawel Urzyczyn

Proceedings of the Proceedings Sixth Workshop on Intersection Types and Related Systems, 2012

Bounded Combinatory Logic.

Boris Düdder, Moritz Martens, Jakob Rehof, Pawel Urzyczyn

Proceedings of the Computer Science Logic (CSL'12), 2012

The Complexity of Inhabitation with Explicit Intersection.

Jakob Rehof, Pawel Urzyczyn

Proceedings of the Logic and Program Semantics, 2012

2011

Finite Combinatory Logic with Intersection Types.

Jakob Rehof, Pawel Urzyczyn

Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

2010

Logistic Clouds - Nutzung von Cloud Computing Services in der Logistik (Vorwort).

Jakob Rehof, Bernhard Holtkamp

Proceedings of the 40. Jahrestagung der Gesellschaft für Informatik, Service Science - Neue Perspektiven für die Informatik, INFORMATIK 2010, Leipzig, Germany, September 27, 2010

2008

Type-based flow analysis and context-free language reachability.

Manuel Fähndrich, Jakob Rehof

Math. Struct. Comput. Sci., 2008

2005

Context-Bounded Model Checking of Concurrent Software.

Shaz Qadeer, Jakob Rehof

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

2004

Summarizing procedures in concurrent programs.

Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof

Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

Models for Contract Conformance.

Jakob Rehof, Sriram K. Rajamani

Proceedings of the International Symposium on Leveraging Applications of Formal Methods, 2004

Stuck-Free Conformance.

Cédric Fournet, C. A. R. Hoare, Sriram K. Rajamani, Jakob Rehof

Proceedings of the Computer Aided Verification, 16th International Conference, 2004

Zing: A Model Checker for Concurrent Software.

Tony Andrews, Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof, Yichen Xie

Proceedings of the Computer Aided Verification, 16th International Conference, 2004

2002

Types as models: model checking message-passing programs.

Sagar Chaki, Sriram K. Rajamani, Jakob Rehof

Proceedings of the Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002

Conformance Checking for Models of Asynchronous Message Passing Software.

Sriram K. Rajamani, Jakob Rehof

Proceedings of the Computer Aided Verification, 14th International Conference, 2002

2001

Type elaboration and subtype completion for Java bytecode.

Todd B. Knoblock, Jakob Rehof

ACM Trans. Program. Lang. Syst., 2001

A Behavioral Module System for the Pi-Calculus.

Sriram K. Rajamani, Jakob Rehof

Proceedings of the Static Analysis, 8th International Symposium, 2001

Estimating the Impact of Scalable Pointer Analysis on Optimization.

Manuvir Das, Ben Liblit, Manuel Fähndrich, Jakob Rehof

Proceedings of the Static Analysis, 8th International Symposium, 2001

Type-base flow analysis: from polymorphic subtyping to CFL-reachability.

Jakob Rehof, Manuel Fähndrich

Proceedings of the Conference Record of POPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2001

2000

Scalable context-sensitive flow analysis using instantiation constraints.

Manuel Fähndrich, Jakob Rehof, Manuvir Das

Proceedings of the 2000 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2000

1999

Tractable Constraints in Finite Semilattices.

Jakob Rehof, Torben Æ. Mogensen

Sci. Comput. Program., 1999

1998

Constraint Automata and the Complexity of Recursive Subtype Entailment.

Fritz Henglein, Jakob Rehof

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

The complexity of simple subtyping systems.

Jakob Rehof

PhD thesis, 1998

1997

Minimal Typings in Atomic Subtyping.

Jakob Rehof

Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997

The Complexity of Subtype Entailment for Simple Types.

Fritz Henglein, Jakob Rehof

Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

1996

Strong Normalization for Non-Structural Subtyping via Saturated Sets.

Jakob Rehof

Inf. Process. Lett., 1996

1995

Safe Polymorphic Type Inference for Scheme: Translating Scheme to ML.

Fritz Henglein, Jakob Rehof

Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995

1994

The Lambda_Delta-calculus.

Jakob Rehof, Morten Heine Sørensen

Proceedings of the Theoretical Aspects of Computer Software, 1994