Languages, Rewriting Systems, and Verification of Infinite-State Systems
Author:
- 4 July 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 24-39
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Permutation rewriting and algorithmic verification2002
- Polynomial closure and unambiguous productTheory of Computing Systems, 1997
- Reachability sets of parameterized rings as regular languagesElectronic Notes in Theoretical Computer Science, 1997
- A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)Electronic Notes in Theoretical Computer Science, 1997
- Unreliable Channels Are Easier to Verify Than Perfect ChannelsInformation and Computation, 1996
- Logics for ConcurrencyLecture Notes in Computer Science, 1996
- On the regular structure of prefix rewritingTheoretical Computer Science, 1992
- Static determination of dynamic properties of generalized type unionsACM SIGPLAN Notices, 1977