A decision procedure for subset constraints over regular languages
- 15 June 2009
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 44 (6) , 188-198
- https://doi.org/10.1145/1542476.1542498
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- State complexity of combined operationsTheoretical Computer Science, 2007
- The Power of Commuting with Finite Sets of WordsTheory of Computing Systems, 2007
- SaturnACM Transactions on Programming Languages and Systems, 2007
- Predicate Abstraction via Symbolic Decision ProceduresLogical Methods in Computer Science, 2007
- Simplify: a theorem prover for program checkingJournal of the ACM, 2005
- Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open TermsPublished by Springer Nature ,2004
- Zapato: Automatic Theorem Proving for Predicate Abstraction RefinementPublished by Springer Nature ,2004
- From symptom to causeACM SIGPLAN Notices, 2003
- The calculus of constructionsInformation and Computation, 1988
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979