Deciding equivalence of finite tree automata
SIAM Journal on Computing
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Complexity of Tree Automata and Logics of Programs
SIAM Journal on Computing
Making abstract interpretations complete
Journal of the ACM (JACM)
Verification by augmented finitary abstraction
Information and Computation
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principles of Program Analysis
Principles of Program Analysis
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
The Propositional Mu-Calculus is Elementary
Proceedings of the 11th Colloquium on Automata, Languages and Programming
On the Expressiveness of 3-Valued Models
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Optimality in Abstractions of Model Checking
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Model-Checking over Multi-valued Logics
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Model Checking Partial State Spaces with 3-Valued Temporal Logics
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Abstraction-based deductive-algorithmic verification of reactive systems
Abstraction-based deductive-algorithmic verification of reactive systems
Three-Valued Abstractions of Games: Uncertainty, but with Precision
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
The Existence of Finite Abstractions for Branching Time Model Checking
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Stuttering Abstraction for Model Checkin
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
Information and Computation
Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional verification of sequential programs with procedures
Information and Computation
On model checking multiple hybrid views
Theoretical Computer Science
Mixed Transition Systems Revisited
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Refinement Sensitive Formal Semantics of State Machines With Persistent Choice
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata Games for Multiple-model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
More precise partition abstractions
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
On the consistency, expressiveness, and precision of partial modeling formalisms
Information and Computation
Modal abstractions of concurrent behavior
ACM Transactions on Computational Logic (TOCL)
Modal transition systems: composition and LTL model checking
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Underapproximating predicate transformers
SAS'06 Proceedings of the 13th international conference on Static Analysis
On the expressiveness of refinement settings
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Ranked predicate abstraction for branching time: complete, incremental, and precise
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Donut domains: efficient non-convex domains for abstract interpretation
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
p-Automata: New foundations for discrete-time probabilistic verification
Performance Evaluation
| Hi-index | 0.00 |
We propose the use of tree automata as abstractions in the verification of branching time properties, and show several benefits. In this setting, soundness and completeness are trivial. It unifies the abundance of frameworks in the literature, and clarifies the role of concepts therein in terms of the well-studied field of automata theory. Moreover, using automata as models simplifies and generalizes results on maximal model theorems.