A compositional approach to CTL∗ verification

This publication has 12 references indexed in Scilit:

• An axiomatization of full Computation Tree Logic
  The Journal of Symbolic Logic, 2001
• Verification by Augmented Finitary Abstraction
  Information and Computation, 2000
• Completing the temporal picture
  Theoretical Computer Science, 1991
• Verification of concurrent programs: the automata-theoretic framework*
  Annals of Pure and Applied Logic, 1991
• The μ-calculus as an assertion-language for fairness arguments
  Information and Computation, 1989
• Modalities for model checking: branching time logic strikes back
  Science of Computer Programming, 1987
• “Sometimes” and “not never” revisited
  Journal of the ACM, 1986
• Checking that finite state concurrent programs satisfy their linear specification
  Published by Association for Computing Machinery (ACM) ,1985
• Impartiality, justice and fairness: The ethics of concurrent termination
  Published by Springer Nature ,1981
• Theories of automata on ω-tapes: A simplified approach
  Journal of Computer and System Sciences, 1974