LISA: A specification language based on ws2s

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1414, Issue , 1998, Pages 18-34

  Ayari, Abdelwaheb ^a   Basin, David ^a   Podelski, Andreas ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; FORESTRY; RECONFIGURABLE HARDWARE; SPECIFICATION LANGUAGES; SPECIFICATIONS; TREES (MATHEMATICS);

COMPLEXITY ESTIMATION; DECISION PROCEDURE; HIGH LEVEL SPECIFICATION; MONADIC LOGIC; PROTOTYPE SYSTEM; SECOND ORDERS; TREE AUTOMATA; VERIFICATION TOOLS;

HIGH LEVEL LANGUAGES;

EID: 84957691072     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028005     Document Type: Conference Paper

References (19)

1. H. Ait-Kaci, A. Podelski, and G. Smolka. A feature constraint system for logic programming with entailment. Theoretical Computer Science, 122(l-2):263–283, Jan. 1994.
2. D. N. Arden. Delayed-logic and finite-state machines. In Proceedings of the Second Annual Symposium and Papers from the First Annual Symposium on Switching Circuit Theory and Logical Design, pages 133-151. American Institute of Electrical Engineers, 1961.
3. A. Ayari, D. Basin, and A. Podelski. Lisa: A specification language based on ws2s. Available at http://www.informatik.uni-freiburg.de/~ayari/pubs/, 1998.
4. R. Backofen and G. Smolka. A complete and recursive feature theory. In Proceedings of the 31st ACL, pages 193-200, Columbus, Ohio, 1993. ACL. A full version has appeared as Research Report RR-92-30, Deutsches Forschungszentrum fiir Kunstliche Intelligenz, Saarbrucken, Germany.
5. D. A. Basin and N. Klarlund. Hardware verification using monadic second-order logic. Lecture Notes in Computer Science, 939:31-41, 1995.
6. J. A. Brzozowski and E. Leiss. On equations for regular languages, finite automata, and sequential networks. Theoretical Computer Science, 10(l):19-35, Jan. 1980.
7. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114–133, Jan. 1981.
8. F. Geeseg and M. Steinby. Tree Automata. Akademiai Kiado, Budapest, 1984.
9. J. G. Henriksen, J. Jensen, M. Joergensen, and N. Klarlund. MONA: Monadic second-order logic in practice. Lecture Notes in Computer Science, 1019:89-101, 1995.
10. P. Kelb, T. Margaria, M. Mendler, and C. Gsottberger. MOSEL: A flexible toolset for monadic second-order logic. Lecture Notes in Computer Science, 1217:183-195, 1997.
11. Y. Kesten, O. Maler, M. Marcus, and A. Pnueli. Symbolic model checking with rich assertional languages. Lecture Notes in Computer Science, 1254:424-435, 1997.
12. N. Klarlund, M. Nielsen, and K. Sunesen. A case study in verification based on trace abstractions. Lecture Notes in Computer Science, 1169:341-353, 1996.
13. Z. Manna, N. Bjoerner, A. Browne, and E. Chang. STeP: The Stanford Temporal Prover. Lecture Notes in Computer Science, 915:793-794, 1995.
14. F. Morawietz and T. Cornell. On the recognizibility of relations over a tree definable in a monadic second order tree description language. Research Report SFB 340-Report 85, Sonderforschungsbereich 340 of the Deutsche Forschungsgemein-schaffc, Februar 1997.
15. G. Slutzki. Alternating tree automata. Theoretical Computer Science, 41(2-3):305-318, 1985.
16. J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem in second-order logic. Math. Systems Theory, 2:57-81, 1968.
17. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 4, pages 133-191. Elsevier Science Publishers B. V., 1990.
18. M. Y. Vardi. An automata-theoretic approach to linear temporal logic. Lecture Notes in Computer Science, 1043:238-266, 1996.
19. Vorobyov. An improved lower bound for the elementary theories of trees. Lecture Notes in Computer Science, 1104:275-287, 1996.