Complexity of pattern-based verification for multithreaded programs
Authors:
Open Access
- 26 January 2011
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 46 (1) , 499-510
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Parikhʼs theorem: A simple and direct automaton constructionInformation Processing Letters, 2011
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads2009
- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete2008
- Context-Bounded Model Checking of Concurrent Software2005
- Context-sensitive synchronization-sensitive analysis is undecidableACM Transactions on Programming Languages and Systems, 2000
- Subclasses of presburger arithmetic and the polynomial-time hierarchyTheoretical Computer Science, 1988
- Complexity of subcases of Presburger arithmeticTransactions of the American Mathematical Society, 1984
- A bound on solutions of linear integer equalities and inequalitiesProceedings of the American Mathematical Society, 1978
- On Context-Free LanguagesJournal of the ACM, 1966
- Semigroups, Presburger formulas, and languagesPacific Journal of Mathematics, 1966