Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
Authors:
- 2 April 2008
- book chapter
- Published by Springer Nature
- p. 2-17
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Automated Assumption Generation for Compositional Verification2007
- Symbolic Compositional Verification by Learning Assumptions2005
- Automated Assume-Guarantee Reasoning for Simulation Conformance2005
- Learning Assumptions for Compositional Verification2003
- Fast LTL to Büchi Automata Translation2001
- On the Learnability of Infinitary Regular SetsInformation and Computation, 1995
- Ultimately periodic words of rational ω-languagesLecture Notes in Computer Science, 1994
- Inference of Finite Automata Using Homing SequencesInformation and Computation, 1993
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- A syntactic congruence for rational ω-languagesTheoretical Computer Science, 1985