Mona & Fido: The logic-automaton connection in practice-Reference-Cited by-同舟云学术

Mona & Fido: The logic-automaton connection in practice

Published:1998 Issue: Volume: Page:311-326
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Klarlund Nils

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0028022

Reference34 articles.

1. A. Arnold. A syntactic congruence for rational ω-languages. Theoretical Computer Science, 39:333–335, 1985.

2. D. Basin and N. Klarlund. Beyond the finite in hardware verification. Submitted for publication. Extended version of: “Hardware verification using monadic second-order logic,” CAV '95, LNCS 939, 1996.

3. M. Biehl, N. Klarlund, and T. Rauhe. Algorithms for guided tree automata. In First International Workshop on Implementing Automata, WIA '96, Lecture Notes in Computer Science, 1260. Springer Verlag, 1996.

4. A. Boudet and H. Comon. Diophantine equations, presburger arithmetic and finite automata. In Trees and algebra in programming-CRAP, volume 1059 of LNCS, 1995.

5. R. E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing surveys, 24(3):293–318, September 1992.

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

1. A Survey on String Constraint Solving;ACM Computing Surveys;2023-01-31

2. Efficient Algorithms for LTL$$_f$$ Synthesis;Multi-Agent Systems;2023

3. Universal First-Order Quantification over Automata;Implementation and Application of Automata;2023

4. An efficient regression testing approach for PHP Web applications using test selection and reusable constraints;Software Quality Journal;2019-06-11

5. Logic programming approach to automata-based decision procedures;Journal of Logical and Algebraic Methods in Programming;2017-01