Readings in nonmonotonic reasoning
Predicate calculus and program semantics
Predicate calculus and program semantics
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Fundamenta Informaticae - Special issue: logics for artificial intelligence
Fundamenta Informaticae - Special issue on modal logics in knowledge representation
Automated deduction in multiple-valued logics
Automated deduction in multiple-valued logics
Parametric shape analysis via 3-valued logic
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking
Composite model-checking: verification with type-specific symbolic representations
ACM Transactions on Software Engineering and Methodology (TOSEM)
Model-checking infinite state-space systems with fine-grained abstractions using SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
A framework for multi-valued reasoning over inconsistent viewpoints
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Implementing a Multi-valued Symbolic Model Checker
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Generalized Model Checking: Reasoning about Partial State Spaces
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Compositional model checking of partially ordered state spaces
Compositional model checking of partially ordered state spaces
Model-checking infinite state-space systems with fine-grained abstractions using SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Abstraction in Software Model Checking: Principles and Practice (Tutorial Overview and Bibliography)
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Implementing a Multi-valued Symbolic Model Checker
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Extending Timed Automaton and Real-Time Logic to Many-Valued Reasoning
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
chi-Chek: A Multi-valued Model-Checker
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Direct Algorithm for Multi-valued Bounded Model Checking
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Verifying Software Requirements Based on Answer Set Programming
KSEM '09 Proceedings of the 3rd International Conference on Knowledge Science, Engineering and Management
Lattice-valued binary decision diagrams
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Inconsistency-based strategy for clarifying vague software requirements
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Incremental specification with SCTL/MUS-T: a case study
Journal of Systems and Software
| Hi-index | 0.00 |
Multiple-valued logics can be effectively used to reason about incomplete and/or inconsistent systems, e.g. during early software requirements or as the systems evolve. We specify multiple-valued logics using finite lattices. In this paper, we use lattice representation theory to cast the multiple-valued model-checking problem in terms of symbolic operations on classical sets of states, provided the lattices are distributive. This allows us to partially reuse existing symbolic model-checking technology and improve efficiency over previous implementations that were based on multiple-valued decision diagrams.