Jakob Rehof

发表

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

Andrej Dudenhefner, Jakob Rehof, 2017, ArXiv.

A Behavioral Module System for the Pi-Calculus

Jakob Rehof, Sriram K. Rajamani, 2001, SAS.

Session details: Program analysis

Jakob Rehof, 2004 .

Combinatory Logic Synthesizer

Andrej Dudenhefner, Jakob Rehof, Jan Bessai, 2014, ISoLA.

Design and Synthesis from Components (Dagstuhl Seminar 14232)

Jakob Rehof, Moshe Y. Vardi, 2014, Dagstuhl Reports.

Combinatory Synthesis of Classes Using Feature Grammars

Jakob Rehof, George T. Heineman, Jan Bessai, 2015, FACS.

Combinatory Process Synthesis

Andrej Dudenhefner, Jakob Rehof, Jan Bessai, 2016, ISoLA.

Fast Verified BCD Subtyping

Jakob Rehof, Jan Bessai, Boris Düdder, 2018, Models, Mindsets, Meta.

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

Jakob Rehof, Bernhard Holtkamp, 2010, GI Jahrestagung.

Automated Processing of Planning Modules in Factory Planning by Means of Constraint Solving Using the Example of Production Segmentation

Jakob Rehof, Michael Henke, Julian Graefenstein, 2018 .

From Polymorphic Subtyping to CFL Reachability: Context-Sensitive Flow Analysis Using Instantiation Constraints

Jakob Rehof, Manuvir Das, Manuel Fähndrich, 2000 .

A Simpler Undecidability Proof for System F Inhabitation

Andrej Dudenhefner, Jakob Rehof, J. Rehof, 2018, TYPES.

The Complexity of Inhabitation with Explicit Intersection

Jakob Rehof, Pawel Urzyczyn, 2012, Logic and Program Semantics.

Type-based flow analysis and context-free language reachability

Jakob Rehof, Manuel Fähndrich, J. Rehof, 2008, Mathematical Structures in Computer Science.

Behavioral Types for Structured Asynchronous Programming

James R. Larus, Jakob Rehof, Sriram K. Rajamani, 2001 .

Staged Composition Synthesis

Jakob Rehof, Boris Düdder, Moritz Martens, 2014, Software Engineering & Management.

Type elaboration and subtype completion for Java bytecode

Jakob Rehof, Todd B. Knoblock, 2001 .

The complexity of subtype entailment for simple types

Fritz Henglein, Jakob Rehof, F. Henglein, 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

Stuck-Free Conformance

C. A. R. Hoare, Jakob Rehof, Cédric Fournet, 2004, CAV.

Intersection Type Matching with Subtyping

Jakob Rehof, Boris Düdder, Moritz Martens, 2013, TLCA.

Constraint Automata and the Complexity of Recursive Subtype Entailment

Fritz Henglein, Jakob Rehof, F. Henglein, 1998, ICALP.

Intersection type calculi of bounded dimension

Andrej Dudenhefner, Jakob Rehof, J. Rehof, 2017, POPL.

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

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

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

Fritz Henglein, Jakob Rehof, F. Henglein, 2015, Semantics, Logics, and Calculi.

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

Fritz Henglein, Jakob Rehof, F. Henglein, 1995 .

Types as models: model checking message-passing programs

Sagar Chaki, Jakob Rehof, Sriram K. Rajamani, 2002, POPL '02.

Type elaboration and subtype completion for Java bytecode

Jakob Rehof, Todd B. Knoblock, J. Rehof, 2000, TOPL.

Tractable Constraints in Finite Semilattices

Jakob Rehof, Torben Æ. Mogensen, 1999, Sci. Comput. Program..

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

C. R. Ramakrishnan, Jakob Rehof, 2008, TACAS.

Minimal typings in atomic subtyping

Jakob Rehof, 1997, POPL '97.

Proceedings Seventh Workshop on Intersection Types and Related Systems: Preface

Jakob Rehof, 2015 .

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

Jakob Rehof, Yevgen Pikus, Norbert Weißenberg, 2018, ISoLA.

Cloud Computing for Logistics

Jakob Rehof, Michael ten Hompel, Oliver Wolf, 2015, Lecture Notes in Logistics.

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

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

Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems

C. R. Ramakrishnan, Jakob Rehof, 2008 .

Mixin Composition Synthesis based on Intersection Types pdf

Andrej Dudenhefner, Jakob Rehof, Ugo de'Liguoro, 2017, TLCA.

Modular synthesis of product lines (ModSyn-PL)

Jakob Rehof, George T. Heineman, 2015, SPLC.

Finite Combinatory Logic with Intersection Types

Jakob Rehof, Pawel Urzyczyn, 2011, TLCA.

The Algebraic Intersection Type Unification Problem

Andrej Dudenhefner, Jakob Rehof, Moritz Martens, 2017, Log. Methods Comput. Sci..

Lower End of the Linial-Post Spectrum

Andrej Dudenhefner, Jakob Rehof, J. Rehof, 2017, TYPES.

Tractable Constraints in Finite Semilattices

Jakob Rehof, Torben Æ. Mogensen, J. Rehof, 1996, Sci. Comput. Program..

Safe polymorphic type inference for a dynamically typed language: translating Scheme to ML

Fritz Henglein, Jakob Rehof, F. Henglein, 1995, FPCA '95.

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

Jakob Rehof, Michael Henke, Julian Graefenstein, 2018, ISoLA.

The LambdaDelta-calculus

Jakob Rehof, Morten Heine Sørensen, 1994, TACS.

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

Jakob Rehof, Pawel Urzyczyn, Boris Düdder, 2012, ITRS.

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

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

Summarizing procedures in concurrent programs

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

Typability in bounded dimension

Andrej Dudenhefner, Jakob Rehof, J. Rehof, 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

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

Jakob Rehof, Manuel Fähndrich, J. Rehof, 2001, POPL '01.

Context-Bounded Model Checking of Concurrent Software

Jakob Rehof, Shaz Qadeer, S. Qadeer, 2005, TACAS.

Scalable context-sensitive flow analysis using instantiation constraints

Jakob Rehof, Manuvir Das, Manuel Fähndrich, 2000, PLDI '00.

Estimating the Impact of Scalable Pointer Analysis on Optimization

Jakob Rehof, Manuvir Das, Manuel Fähndrich, 2001, SAS.

The complexity of simple subtyping systems

Jakob Rehof, J. Rehof, 1998, Technical report / University of Copenhagen / Datalogisk institut.

Strong Normalization for Non-Structural Subtyping via Saturated Sets

Jakob Rehof, J. Rehof, 1996, Inf. Process. Lett..

Stuck-Free Conformance Theory for CCS

Jakob Rehof, Tony Hoare, Cédric Fournet, 2004 .

Principality and approximation under dimensional bound

Andrej Dudenhefner, Jakob Rehof, J. Rehof, 2019, Proc. ACM Program. Lang..

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

Sigrid Wenzel, Jakob Rehof, Jan Winkels, 2019, 2019 Winter Simulation Conference (WSC).

Bounded Combinatory Logic

Jakob Rehof, Pawel Urzyczyn, Boris Düdder, 2012, CSL.

Conformance Checking for Models of Asynchronous Message Passing Software

Jakob Rehof, Sriram K. Rajamani, S. Rajamani, 2002, CAV.

The Complexity of Principal Inhabitation

Andrej Dudenhefner, Jakob Rehof, 2017, FSCD.

The Intersection Type Unification Problem

Andrej Dudenhefner, Jakob Rehof, Moritz Martens, 2016, FSCD.

Models for Contract Conformance

Jakob Rehof, Sriram K. Rajamani, S. Rajamani, 2004, ISoLA.

Zing: A Model Checker for Concurrent Software

Jakob Rehof, Yichen Xie, Sriram K. Rajamani, 2004, CAV.

A Long and Winding Road Towards Modular Synthesis

Jakob Rehof, George T. Heineman, Jan Bessai, 2016, ISoLA.

Using Component-based Software Synthesis and Constraint Solving to generate Sets of Manufacturing Simulation Models

Jakob Rehof, Carina Mieth, Anne Meyer, 2020 .

Static Deadlock Prevention in Dynamically Configured Communication Networks

Jakob Rehof, Sriram K. Rajamani, Manuel Fähndrich, 2008 .

Proceedings Seventh Workshop on Intersection Types and Related Systems, ITRS 2014, Vienna, Austria, 18 July 2014

Jakob Rehof, 2015, ITRS.

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

Matthias Jarke, Avigdor Gal, Jakob Rehof, 2019, Dagstuhl Reports.

Undecidability of Intersection Type Inhabitation at Rank 3 and its Formalization

Andrej Dudenhefner, Jakob Rehof, 2019, Fundam. Informaticae.

Portable working machine

Bassam Tabbara, Galen C. Hunt, Jakob Rehof, 2006 .

Knowledge-driven Data Ecosystems Towards Data Transparency pdf

Matthias Jarke, Maurizio Lenzerini, Sandra Geisler, 2021, ArXiv.

Type-Based Flow Analysis : From Polymorphi Subtyping to CFL-Rea hability

Jakob Rehof, Manuel Fahndri, 2006 .

Extracting a formally verified Subtyping Algorithm for Intersection Types from Ideals and Filters

Andrej Dudenhefner, Jakob Rehof, Jan Bessai, 2016 .

Finite Combinatory Logic with Intersection Types (Extended Version)

Jakob Rehof, 2011 .

Towards Combinatory Logic Synthesis

Jakob Rehof, J. Rehof, 2013 .