default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoritz Martens
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2009
[b1]Moritz Martens:
Establishing properties of interaction systems. University of Mannheim, Germany, 2009, pp. 1-227
Journal Articles
- 2017
- [j2]Andrej Dudenhefner
, Moritz Martens, Jakob Rehof:
The Algebraic Intersection Type Unification Problem. Log. Methods Comput. Sci. 13(3) (2017) - 2012
- [j1]Moritz Martens, Mila E. Majster-Cederbaum:
Deadlock-freedom in component systems with architectural constraints. Formal Methods Syst. Des. 41(2): 129-177 (2012)
Conference and Workshop Papers
- 2016
- [c15]Jan Bessai, Andrej Dudenhefner, Boris Düdder, Moritz Martens, Jakob Rehof:
Combinatory Process Synthesis. ISoLA (1) 2016: 266-281 - [c14]Andrej Dudenhefner, Moritz Martens, Jakob Rehof:
The Intersection Type Unification Problem. FSCD 2016: 19:1-19:16 - 2015
- [c13]Boris Düdder, Moritz Martens, Jakob Rehof:
Staged Composition Synthesis. Software Engineering & Management 2015: 89-90 - 2014
- [c12]Boris Düdder, Moritz Martens, Jakob Rehof:
Staged Composition Synthesis. ESOP 2014: 67-86 - [c11]Jan Bessai, Andrej Dudenhefner, Boris Düdder, Moritz Martens, Jakob Rehof:
Combinatory Logic Synthesizer. ISoLA (1) 2014: 26-40 - 2013
- [c10]Boris Düdder, Moritz Martens, Jakob Rehof:
Intersection Type Matching with Subtyping. TLCA 2013: 125-139 - 2012
- [c9]Boris Düdder, Moritz Martens, Jakob Rehof, Pawel Urzyczyn:
Bounded Combinatory Logic. CSL 2012: 243-258 - [c8]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 - 2009
- [c7]Moritz Martens, Mila E. Majster-Cederbaum:
Using Architectural Constraints for Deadlock-Freedom of Component Systems with Multiway Cooperation. TASE 2009: 225-232 - 2008
- [c6]Mila E. Majster-Cederbaum, Moritz Martens:
Compositional analysis of deadlock-freedom for tree-like component architectures. EMSOFT 2008: 199-206 - 2007
- [c5]Mila E. Majster-Cederbaum, Moritz Martens:
Robustness in Interaction Systems. FORTE 2007: 325-340 - [c4]Gregor Gößler, Susanne Graf, Mila E. Majster-Cederbaum, Moritz Martens, Joseph Sifakis:
An Approach to Modelling and Verification of Component Based Systems. SOFSEM (1) 2007: 295-308 - [c3]Mila E. Majster-Cederbaum, Moritz Martens, Christoph Minnameier:
A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems. SOFSEM (1) 2007: 888-899 - [c2]Mila E. Majster-Cederbaum, Moritz Martens, Christoph Minnameier:
Liveness in Interaction Systems. FACS 2007: 57-74 - 2006
- [c1]Gregor Gößler, Susanne Graf, Mila E. Majster-Cederbaum, Moritz Martens, Joseph Sifakis:
Ensuring Properties of Interaction Systems. Program Analysis and Compilation 2006: 201-224
Informal and Other Publications
- 2016
- [i1]Andrej Dudenhefner, Moritz Martens, Jakob Rehof:
The Intersection Type Unification Problem. CoRR abs/1611.05672 (2016)
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-04-24 23:01 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:
