Rewriting logic as a framework for generic verification tools

Electronic Notes in Theoretical Computer Science

Volumn 36, Issue , 2000, Pages 121-137

  Leucker, Martin ^a   Noll, Thomas ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SOFTWARE; DATA REDUCTION; GENETIC ALGORITHMS; LOGIC PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROGRAM COMPILERS; SEMANTICS; SOFTWARE PROTOTYPING;

MODEL-CHECKING; PARSING; REWRITING LOGIC; TRANSITION SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0009925499     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80123-9     Document Type: Conference Paper

References (29)

1. Baader F., Nipkow T. "Term Rewriting and All That," 1998;Cambridge University Press, New York
2. Baader F., Siekmann J. Unification theory. Gabbay D., Hogger C., Robinson J. Handbook of Logic in Artificial Intelligence and Logic Programming. 1994;Oxford University Press, Oxford, UK
3. Borovansky, P., C. Kirchner, H. Kirchner, P. Moreau and M. Vittek, Elan: A logical framework based on computational systems, in: Proc. of the First Int. Workshop on Rewriting Logic, Electronic Notes in Theoretical Computer Science 4 (1996). URL http://wwwl.elsevier.nl/mcs/tcs/pc/volume4.htm
4. Clarke E.M., Wing J. Formal methods: State of the art and future directions. Technical Report CMU-CS-Carnegie Mellon University (CMU). URL ftp://reports.adm.cs.emu.edu/usr/anon/1996/CMU-CS-96-178.ps. 1996;96-178
5. Clavel, M., S. Eker, P. Lincoln and J. Meseguer, Principles of Maude, in: J. Meseguer, editor, Proceedings of the First International Workshop on Rewriting Logic, Electronic Notes in Theoretical Computer Science 4, Elsevier, 1996, pp. 65-89. URL http://www.csl.sri.com/~clavel/pubs/rwl96b.ps
6. Cleaveland R. Tableau-based model checking in the propositional mu-calculus. Acta Informatica. URL http://www.cs.sunysb.edu/~rance/publications/ papers/ai90.ps. 27:1990;725-748
7. Cleaveland, R., E. Madelaine and S. Sims, A front-end generator for verification tools, in: Proc. of the Int. Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'95), Lecture Notes in Computer Science 1019, 1995, pp. 153-173. URL http://www.esc.ncsu.edu/eos/users/s/stsims/ WWW/papers/pac.ps
8. Cleaveland, R. and S. Sims, The NCSU concurrency workbench, in: Proceedings of the Eighth International Conference on Computer Aided Verification (CAV'96), Lecture Notes in Computer Science 1102, 1996, pp. 394-397.
9. The concurrency mailing list. URL http://www.cwi.nl/~bertl/concurrency/ concurrency.html
10. Diaconescu R., Futatsugi K. "CafeOBJ Report," World Scientific, Singapore. 1998
11. Emerson E.A. "Automated Temporal Reasoning about Reactive Systems," Lecture Notes in Computer Science. 1043:1996;41-101 Springer-Verlag Inc, New York, NY, USA
12. Gregoire J.-C., Holzmann G.J., Peled D.A. "The Spin Verification System," DIMACS series. 32:1997;203 American Mathematical Society. iSBN 0-8218-0680-7
13. Herold A., Siekmann J.J. Unification in Abelian semigroups. Journal of Automated Reasoning. 3:1987;247-284
14. Kozen D. Results on the propositional mu-calculus. Theoretical Computer Science. 27:1983;333-354
15. Lange M., Leucker M., Noll T., Tobies S. Truth - a verification platform for concurrent systems. Tool Support for System Specification, Development, and Verification, Advances in Computing Science. 1999;Springer-Verlag Wien, New York
16. Leucker, M. and T. Noll, Rapid prototyping of specification language implementations, in: Proceedings of the 10th IEEE International Workshop on Rapid System Prototyping (1999), pp. 60-65.
17. Martí-Oliet N., Meseguer J. Rewriting logic as a logical and semantic framework. First International Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science. 4:1996;352-358
18. McMillan K.L. The SMV system, symbolic model checking - an approach. Technical Report CMU-CS-92-131, Carnegie Mellon University. 1992
19. Meseguer, J., Rewriting as a unified model of concurrency, in: Proceedings Concur'90 Conference, Lecture Notes in Computer Science, Volume 458 (1990), pp. 384-400, also, Report SRI-CSL-90-02R, Computer Science Lab, SRI International.
20. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science. 96:1992;73-155
21. Meseguer J. Rewriting logic as a semantic framework for concurrency: a progress report. Seventh International Conference on Concurrency Theory (CONCUR '96). Lecture Notes in Computer Science. 1119:1996;331-372
22. Middeldorp A., Hamoen E. Completeness results for basic narrowing. Journal of Applicable Algebra in Engineering, Communication and Computing. 5:1994;313-353
23. Milner R. "Communication and Concurrency," International Series in Computer Science. 1989;Prentice Hall
24. Milner, R., J. Parrow and D. Walker, A calculus of mobile processes, Parts I and II, Information and Computation 100 (1992), pp. 1-77.
25. Moller F. "The Edinburgh Concurrency Workbench (Version 6.1)," Department of Computer Science, University of Edinburgh. 1992
26. Noll, T., On coherence properties in term rewriting models of concurrency, in: Proceedings of the 10th International Conference on Concurrency Theory (CONCUR'99), LNCS 1664 (1999), pp. 478-493.
27. Verdejo A. N. Marti-Oliet. Executing and verifying ccs in maude. Technical Report TR-SIP-99-00, Universidad Complutense de Madrid, Spain. 2000
28. Viry, P., Rewriting: An effective model of concurrency, in: Proceedings of PARLE '94 - Parallel Architectures and Languages Europe, Lecture Notes in Computer Science 817 (1994), pp. 648-660.
29. Viry P. Rewriting modulo a rewrite system. Technical Report TR-95-20, Dipartimento di Informatica, Universita di Pisa. 1995;. URL ftp://ftp.di.unipi. it/pub/techreports/TR-95-20.ps.Z