Proceedings of the international workshop on Automatic verification methods for finite state systems
Verifying temporal properties of systems
Verifying temporal properties of systems
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Fundamenta Informaticae - Special issue on modal logics in knowledge representation
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of logic in computer science (vol. 3)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parametric shape analysis via 3-valued logic
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Software reliability methods
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
xlinkit: a consistency checking and smart link generation service
ACM Transactions on Internet Technology (TOIT)
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
A Constraint Oriented Proof Methodology Based on Modal Transition Systems
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
On the Expressiveness of 3-Valued Models
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Automatic Abstraction Using Generalized Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
An Improved Algorithm for the Evaluation of Fixpoint Expressions
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Multi-valued symbolic model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
A domain equation for refinement of partial systems
Mathematical Structures 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
Merging partial behavioural models
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Refinement is complete for implementations
Formal Aspects of Computing
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
On model checking multiple hybrid views
Theoretical Computer Science
EXPTIME-complete Decision Problems for Modal and Mixed Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity of decision problems for mixed and modal specifications
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
On the expressiveness of refinement settings
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Hi-index | 0.00 |
3-valued models have been advocated as a means of system abstraction such that verifications and refutations of temporal-logic properties transfer from abstract models to the systems they represent. Some application domains, however, require multiple models of a concrete or virtual system. We build the mathematical foundations for 3-valued property verification and refutation applied to sets of common concretizations of finitely many models. We show that validity checking for the modal mu-calculus has the same cost (EXPTIME-complete) on such sets as on all 2-valued models, provide an efficient algorithm for checking whether common concretizations exist for a fixed number of models, and propose using parity games on variants of tree automata to efficiently approximate validity checks of multiple models. We prove that the universal topological model in [M. Huth, R. Jagadeesan, and D. A. Schmidt. A domain equation for refinement of partial systems. Mathematical Structures in Computer Science, 14(4):469-505, 5 August 2004] is not bounded complete. This confirms that the approximations aforementioned are reasonably precise only for tree-automata-like models, unless all models are assumed to be deterministic.