Two-way cost automata and cost logics over infinite trees-Reference-Cited by-同舟云学术

Two-way cost automata and cost logics over infinite trees

Published:2014-07-14 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
language:
Short-container-title:

Author:

Blumensath Achim¹,Colcombet Thomas²,Kuperberg Denis³,Parys Paweł³,Boom Michael Vanden⁴

Affiliation:

1. TU Darmstadt

2. Université Paris Diderot

3. University of Warsaw

4. University of Oxford

Funder

Seventh Framework Programme

Agence Nationale de la Recherche

Foundation For Polish Science

Deutsche Forschungsgemeinschaft

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2603088.2603104

Reference28 articles.

1. A. Arnold and D. Niwiński . Rudiments of μ-Calculus volume 146 of Studies in Logic and The Foundations of Computer Science . North-Holland 2001 . A. Arnold and D. Niwiński. Rudiments of μ-Calculus volume 146 of Studies in Logic and The Foundations of Computer Science . North-Holland 2001.

2. Regular Repair of Specifications

3. A. Blumensath M. Otto and M. Weyer. Decidability Results for the Boundedness Problem. Logical Methods in Computer Science. to appear. A. Blumensath M. Otto and M. Weyer. Decidability Results for the Boundedness Problem. Logical Methods in Computer Science . to appear.

4. Boundedness of Monadic Second-Order Formulae over Finite Words

5. M. Bojańczyk . A bounding quantifier. In J. Marcinkowski and A. Tarlecki editors CSL volume 3210 of LNCS pages 41 -- 55 . Springer 2004 . ISBN 3-540-23024-6. M. Bojańczyk. A bounding quantifier. In J. Marcinkowski and A. Tarlecki editors CSL volume 3210 of LNCS pages 41--55. Springer 2004. ISBN 3-540-23024-6.

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

1. Cost Automata, Safe Schemes, and Downward Closures;Fundamenta Informaticae;2023-04-07

2. Faster algorithms for quantitative verification in bounded treewidth graphs;Formal Methods in System Design;2021-04-29

3. Intersection Types for Unboundedness Problems;Electronic Proceedings in Theoretical Computer Science;2019-04-23

4. A Step Up in Expressiveness of Decidable Fixpoint Logics;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05

5. Decidable Models of Integer-Manipulating Programs with Recursive Parallelism;Lecture Notes in Computer Science;2016