Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Moritz Kiefer"'
Autor:
Bernhard Beckert, Timo Bingmann, Moritz Kiefer, Peter Sanders, Mattias Ulbrich, Alexander Weigl
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 268, Iss Proc. MARS/VPT 2018, Pp 185-199 (2018)
Distributed programs are often formulated in popular functional frameworks like MapReduce, Spark and Thrill, but writing efficient algorithms for such frameworks is usually a non-trivial task. As the costs of running faulty algorithms at scale can be
Externí odkaz:
https://doaj.org/article/226f178990cf41a5b6f33d97620ea1ba
Autor:
Zubin Duggal, Javier Neira Sanchez, Pepe Iborra, Neil Mitchell, Luke Lau, Alan Zimmerman, Matthew Pickering, Hannes Siebenhandl, Moritz Kiefer
Publikováno v:
IFL
When developing a Haskell IDE we hit upon an idea – why not base an IDE on an build system? In this paper we’ll explain how to go from that idea to a usable IDE, including the difficulties imposed by reusing a build system, and those imposed by t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f930fae47e2e08e26f7bf548e5b14560
https://doi.org/10.1145/3462172.3462180
https://doi.org/10.1145/3462172.3462180
Autor:
Peter Sanders, Bernhard Beckert, Mattias Ulbrich, Timo Bingmann, Moritz Kiefer, Alexander Weigl
Publikováno v:
MARS/VPT@ETAPS
Electronic Proceedings in Theoretical Computer Science, Vol 268, Iss Proc. MARS/VPT 2018, Pp 185-199 (2018)
Electronic Proceedings in Theoretical Computer Science, Vol 268, Iss Proc. MARS/VPT 2018, Pp 185-199 (2018)
Distributed programs are often formulated in popular functional frameworks like MapReduce, Spark and Thrill, but writing efficient algorithms for such frameworks is usually a non-trivial task. As the costs of running faulty algorithms at scale can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f1f55f956fb6865e2d44913e5e7c6570
https://doi.org/10.4204/eptcs.268.7
https://doi.org/10.4204/eptcs.268.7
Publikováno v:
Journal of Automated Reasoning. 60:337-363
Relational program reasoning is concerned with formally comparing pairs of executions of programs. Prominent examples of relational reasoning are program equivalence checking (which considers executions from different programs) and detecting illicit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83a0686fab473a0361ea92220a2c2a20
https://doi.org/10.1007/s10817-017-9433-5
https://doi.org/10.1007/s10817-017-9433-5
Autor:
Mattias Ulbrich, Bernhard Beckert, Peter Sanders, Timo Bingmann, Moritz Kiefer, Alexander Weigl
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030035914
VSTTE
VSTTE
MapReduce frameworks are widely used for the implementation of distributed algorithms. However, translating imperative algorithms into these frameworks requires significant structural changes to the algorithm. As the costs of running faulty algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::519f7c2ce37d7fd0c62d29192640724c
https://doi.org/10.1007/978-3-030-03592-1_14
https://doi.org/10.1007/978-3-030-03592-1_14
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319488684
VSTTE
VSTTE
Relational program reasoning is concerned with formally comparing pairs of executions of programs. Prominent examples of relational reasoning are program equivalence checking (which considers executions from different programs) and detecting illicit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2b441bc799e6fc977da42f89a44b382
https://doi.org/10.1007/978-3-319-48869-1_12
https://doi.org/10.1007/978-3-319-48869-1_12