Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Moritz Martens"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 3 (2017)
The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type unificatio
Externí odkaz:
https://doaj.org/article/f707db9efd1f4096abc5f54281676aaa
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 121, Iss Proc. ITRS 2012, Pp 18-34 (2013)
We describe ongoing work on a framework for automatic composition synthesis from a repository of software components. This work is based on combinatory logic with intersection types. The idea is that components are modeled as typed combinators, and a
Externí odkaz:
https://doaj.org/article/dc61de5bcb454f4f957e0e0d2d2a76d3
Autor:
Moritz Martens, Mila Majster-Cederbaum
Publikováno v:
Formal Methods in System Design. 41:129-177
We present a compositional analysis of deadlock-freedom in component systems with multiway cooperation. We require the systems to satisfy an architectural constraint which makes sure that the communication structure between the components is given by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f08a0ecbc61ac7f71e79ce1b2086bb9f
https://doi.org/10.1007/s10703-012-0160-6
https://doi.org/10.1007/s10703-012-0160-6
Publikováno v:
Programming Languages and Systems ISBN: 9783642548321
ESOP
ESOP
A framework for composition synthesis is provided in which metalanguage combinators are supported and the execution of synthesized programs can be staged into composition-time code generation stagei¾?1 and run-time execution stagei¾?2. By extending
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83237bc999a148af6c36b4f64ea6834a
https://doi.org/10.1007/978-3-642-54833-8_5
https://doi.org/10.1007/978-3-642-54833-8_5
Publikováno v:
ITRS
Electronic Proceedings in Theoretical Computer Science, Vol 121, Iss Proc. ITRS 2012, Pp 18-34 (2013)
Electronic Proceedings in Theoretical Computer Science, Vol 121, Iss Proc. ITRS 2012, Pp 18-34 (2013)
We describe ongoing work on a framework for automatic composition synthesis from a repository of software components. This work is based on combinatory logic with intersection types. The idea is that components are modeled as typed combinators, and a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1a959459e0bff7d9a99bcb0475f0d2b
http://arxiv.org/abs/1307.8203
http://arxiv.org/abs/1307.8203
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642389450
TLCA
TLCA
Type matching problems occur in a number of contexts, including library search, component composition, and inhabitation. We consider the intersection type matching problem under the standard notion of subtyping for intersection types: Given intersect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54f49b649de7fbfb4e6d07d7a44c0074
https://doi.org/10.1007/978-3-642-38946-7_11
https://doi.org/10.1007/978-3-642-38946-7_11
Autor:
Moritz Martens, Mila Majster-Cederbaum
Publikováno v:
TASE
We present a compositional analysis of deadlock-freedom in component systems with multiway cooperation. We require the systems to satisfy architectural constraints which make sure that the communication structure between the components is given by a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::620123a51e566c4501f2cca9729e66cd
https://doi.org/10.1109/tase.2009.18
https://doi.org/10.1109/tase.2009.18
Autor:
Moritz Martens, Mila Majster-Cederbaum
Publikováno v:
EMSOFT
We study architectural constraints for component systems in order to be able to guarantee safety-properties. Representing safety-properties, we investigate deadlock-freedom. We present a compositional and hence polynomial time condition for deadlock-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3de55877385fedded0141049043a8c55
https://doi.org/10.1145/1450058.1450085
https://doi.org/10.1145/1450058.1450085
Autor:
Mila Majster-Cederbaum, Moritz Martens
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540731955
FORTE
FORTE
We treat the effect of absence/failure of ports or components on properties of component-based systems. We do so in the framework of interaction systems, a formalism for component-based systems that strictly separates the issues of local behavior and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1db183913f0293a17077f63f1bb72620
https://doi.org/10.1007/978-3-540-73196-2_21
https://doi.org/10.1007/978-3-540-73196-2_21
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540695066
SOFSEM (1)
SOFSEM (1)
Interaction systems are a formal model for component-based systems. Combining components via connectors to form more complex systems may give rise to deadlock situations. Deciding the existence of deadlocks is NP-hard as it involves global state anal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66a96c497ecd0544572acec6540af042
https://doi.org/10.1007/978-3-540-69507-3_77
https://doi.org/10.1007/978-3-540-69507-3_77