Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
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
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract)
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Set-Based Analysis of Reactive Infinite-State Systems
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Generalized Model Checking: Reasoning about Partial State Spaces
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Model Checking for Timed Logic Processes
CL '00 Proceedings of the First International Conference on Computational Logic
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Model Checking Using Adaptive State and Data Abstraction
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A constraint-based approach for specification and verification of real-time systems
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Multi-valued symbolic model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
Tabled resolution + constraints: a recipe for model checking real-time systems
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Describing average- and longtime-behavior by weighted MSO logics
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Weighted automata and multi-valued logics over arbitrary bounded lattices
Theoretical Computer Science
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Weighted tree automata over valuation monoids and their characterization by weighted logics
Algebraic Foundations in Computer Science
Weighted automata and weighted MSO logics for average and long-time behaviors
Information and Computation
Weighted nested word automata and logics over strong bimonoids
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
Model checking is a widely used technique for verifying complex concurrent systems. The models used in classical model checking methods are assumed to be complete and consistent. However, a recent body of work has shown that this is not always the case, and multi-valued logics have been proposed to represent such models, spawning an extension of classical model checking, known as, multi-valued model checking. In this paper, we define a multi-valued set based semantics for the multi-valued modal μ-calculus and present a novel interpretation of logic programs to support multi-valued sets as first-class entities, that can be used as a practical deductive multi-valued model checking framework. This framework provides a semantics preserving encoding of multi-valued transition systems, and allows verification of arbitrary multi-valued modal μ-calculus properties. A prototype implementation of this framework has also been realized.