Exploiting Term Hiding to Reduce Run-Time Checking Overhead-Reference-Cited by-同舟云学术

Exploiting Term Hiding to Reduce Run-Time Checking Overhead

Published:2017-12-22 Issue: Volume: Page:99-115
ISSN:0302-9743
Container-title:Practical Aspects of Declarative Languages
language:
Short-container-title:

Author:

Stulova Nataliia^ORCID,Morales José F.^ORCID,Hermenegildo Manuel V.^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-73305-0_7

Reference33 articles.

1. Stulova, N., Morales, J., Hermenegildo, M.: Towards run-time checks simplification via term hiding (extended abstract). In: Technical Communications of ICLP 2017, OASIcs (2017)

2. Hermenegildo, M., Bueno, F., Carro, M., López, P., Mera, E., Morales, J., Puebla, G.: An overview of Ciao and its design philosophy. TPLP 12(1–2), 219–252 (2012)

3. Stulova, N., Morales, J., Hermenegildo, M.: Reducing the overhead of assertion run-time checks via static analysis. In: PPDP 2016, pp. 90–103. ACM, September 2016

4. Swift, T., Warren, D.S.: XSB: extending Prolog with tabled logic programming. TPLP 12(1–2), 157–187 (2012)

5. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);D Cabeza,2000

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fifty Years of Prolog and Beyond;Theory and Practice of Logic Programming;2022-05-17

2. VeriFly: On-the-fly Assertion Checking via Incrementality;Theory and Practice of Logic Programming;2021-11

3. Some trade-offs in reducing the overhead of assertion run-time checks via static analysis;Science of Computer Programming;2018-04