Zobrazeno 1 - 10
of 104
pro vyhledávání: '"Yanhong A. Liu"'
Autor:
K. Tuncay Tekle, Yanhong A. Liu
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 306, Iss Proc. ICLP 2019, Pp 241-254 (2019)
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting from the facts or top-down starting from the query. For efficiency, top-down evaluation is extended with memoization of inferred facts, and bott
Externí odkaz:
https://doaj.org/article/71ba2b3e6a6f40db8b323e829877b3ac
Autor:
Yanhong A. Liu, Scott D. Stoller
Publikováno v:
Logical Foundations of Computer Science ISBN: 9783030930998
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1d1f27f09c170489c0bb3d65b01aca3
https://doi.org/10.1007/978-3-030-93100-1_11
https://doi.org/10.1007/978-3-030-93100-1_11
Autor:
Joost Vennekens, Veronica Dahl, Alex Brik, Neng-Fa Zhou, Andrea Formisano, Gian Luca Pozzato, Bart Bogaerts, Carmine Dodaro, Yanhong A. Liu, Paul Fodor
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 345
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8db57f172b50d369480c5a396ec1e0a8
https://doi.org/10.4204/eptcs.345.0
https://doi.org/10.4204/eptcs.345.0
Autor:
Yanhong A. Liu, Saksham Chand
Publikováno v:
PODC
Distributed consensus algorithms such as Paxos have been studied extensively. Many different liveness properties and assumptions have been stated for them, but there are no systematic comparisons for better understanding of these properties. This pap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::863d59de8f033a03b9c4acee43e853d0
https://doi.org/10.1145/3465084.3467947
https://doi.org/10.1145/3465084.3467947
Autor:
Yanhong A. Liu, Scott D. Stoller
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 325:220-222
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afc8c39632d4cf2febe49f1624c70389
https://doi.org/10.4204/eptcs.325.26
https://doi.org/10.4204/eptcs.325.26
Autor:
Bogaerts, Bart, Brik, Alex, Dahl, Veronica, Dodaro, Carmine, Fodor, Paul, Formisano, Andrea, Yanhong, Annie Liu, Pozzato, Gian Luca, Vennekens, Joost, Zhou, Neng-Fa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3848::0498f18e529c5c90a9b6b888cfcd3db8
https://doi.org/10.4204/eptcs.345
https://doi.org/10.4204/eptcs.345
Autor:
Yanhong A. Liu, Matthew Castellana
Publikováno v:
SIGCSE
Discrete mathematics is the foundation of computer science. It focuses on concepts and reasoning methods that are studied using math notations. It has long been argued that discrete math is better taught with programming, which takes concepts and com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07f47712d818f8c3f1f5607f61ae9e37
http://arxiv.org/abs/2011.14059
http://arxiv.org/abs/2011.14059
Autor:
Yanhong A. Liu, Scott D. Stoller
Publikováno v:
Runtime Verification ISBN: 9783030605070
RV
RV
This paper presents a general framework and methods for complete programming and checking of distributed algorithms at a high-level, as in pseudocode languages, but precisely specified and directly executable, as in formal specification languages and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::919ce02722911addc7099f0a2ea86243
https://doi.org/10.1007/978-3-030-60508-7_3
https://doi.org/10.1007/978-3-030-60508-7_3