A compositional approach to CTL\(^*\) verification
type: Item
instance of: scholarly article
title: A compositional approach to CTL\(^*\) verification
zbMATH Open document ID: 1079.68059
author: Yonit Kesten
author: Amir Pnueli
published in: Theoretical Computer Science
publication date: 2005-04-06T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 2153166
zbMATH Keywords: symbolic model-checking
zbMATH Keywords: deductive verification
describes a project that uses: STeP
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.09.023
OpenAlex ID: W2078078820
cites work: Theories of automata on \(\omega\)-tapes: a simplified approach
cites work: Q4385542
cites work: “Sometimes” and “not never” revisited
cites work: Modalities for model checking: Branching time logic strikes back
cites work: Verification by augmented finitary abstraction
cites work: Model checking with strong fairness
cites work: Q3922147
cites work: Completing the temporal picture
cites work: Q4002642
cites work: Q4553254
cites work: Q4474227
cites work: Q3814796
cites work: An axiomatization of full computation tree logic
cites work: The \(\mu\)-calculus as an assertion-language for fairness arguments
cites work: Verification of concurrent programs: The automata-theoretic framework
DOI: 10.1016/J.TCS.2004.09.023
description: scientific article; zbMATH DE number 2153166