Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
A framework for the synthesis of reactive modules
International Conference on Concurrency on Concurrency 88
The &mgr;-calculus as an assertion-language for fairness arguments
Information and Computation
Completing the temporal picture
Selected papers of the 16th international colloquium on Automata, languages, and programming
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Reasoning about infinite computations
Information and Computation
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Verification by augmented finitary abstraction
Information and Computation
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Proceedings of the 8th Colloquium on Automata, Languages and Programming
From Falsification to Verification
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A Decision Algorithm for Full Propositional Temporal Logic
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Another Look at LTL Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Algorithmic Verification of Linear Temporal Logic Specifications
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems
Temporal Logic in Specification
STeP: The Stanford Temporal Prover
STeP: The Stanford Temporal Prover
Model Checking with Strong Fairness,
Model Checking with Strong Fairness,
The relative completeness of a version of CTL
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Information and Computation
A compositional approach to CTL* verification
Theoretical Computer Science - Formal methods for components and objects
Multi-agent Logics with Interacting Agents Based on Linear Temporal Logic: Deciding Algorithms
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Information and Computation
A proof-based approach to verifying reachability properties
Proceedings of the 2011 ACM Symposium on Applied Computing
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
Proving Reachability in B using Substitution Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Linear temporal logic with until and before on integer numbers, deciding algorithms
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
International Journal of Intelligent Information Technologies
A complete proof system for propositional projection temporal logic
Theoretical Computer Science
| Hi-index | 0.01 |
The paper presents a sound and (relatively) complete deductive proof system for the verification of CTL* properties over possibly infinite-state reactive systems.T he proof system is based on a set of proof rules for the verification of basic CTL* formulas, namely CTL* formulas with no embedded path quantifiers.W e first show how to decompose the proof of a general (non-basic) CTL* formula into proofs of basic CTL* formulas.W e then present proof rules for some of the most useful basic CTL* formulas, then present a methodology for transforming an arbitrary basic formula into one of these special cases.