Decidable Fragments of Many-Sorted Logic-Reference-Cited by-同舟云学术

Decidable Fragments of Many-Sorted Logic

Published: Issue: Volume: Page:17-31
ISSN:
Container-title:Logic for Programming, Artificial Intelligence, and Reasoning
language:
Short-container-title:

Author:

Abadi Aharon,Rabinovich Alexander,Sagiv Mooly

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-75560-9_4.pdf

Reference16 articles.

1. The alloy analyzer home page, http://alloy.mit.edu

2. http://alloy.mit.edu/case-studies.php

3. Abadi, A.: Decidable fragments of many-sorted logic. Master’s thesis, Tel-Aviv University (2007)

4. Beauquier, D., Slissenko, A.: Verification of timed algorithms: Gurevich abstract state machines versus first order timed logic. In: Proc. of ASM 2000 International Workshop (March 2000)

5. Beauquier, D., Slissenko, A.: Decidable verification for reducible timed automata specified in a first order logic with time. Theoretical Computer Science 275, 347–388 (2002)

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

1. Decidable $${\exists }^*{\forall }^*$$ First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates;Journal of Automated Reasoning;2020-07-18

2. Foundations for natural proofs and quantifier instantiation;Proceedings of the ACM on Programming Languages;2018-01

3. On Finite Domains in First-Order Linear Temporal Logic;Automated Technology for Verification and Analysis;2016

4. GRASShopper;Tools and Algorithms for the Construction and Analysis of Systems;2014

5. Automating Separation Logic with Trees and Data;Computer Aided Verification;2014