Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Formal theories of knowledge in AI and robotics
New Generation Computing
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Model checking vs. theorem proving: a manifesto
Artificial intelligence and mathematical theory of computation
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Reasoning about knowledge
An efficient state space generation for analysis of real-time systems
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Formal Methods in System Design - Special issue on symmetry in automatic verification
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
A partial order approach to branching time logic model checking
Information and Computation
Logic in computer science: modelling and reasoning about systems
Logic in computer science: modelling and reasoning about systems
Model checking
Modal logic
Symbolic Model Checking
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Bounded model checking for the universal fragment of CTL
Fundamenta Informaticae
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Symbolic Reachability Analysis Based on SAT-Solvers
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
NUSMV: A New Symbolic Model Verifier
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Applying SAT Methods in Unbounded Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Exploiting Symmetry In Temporal Logic Model Checking
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Distributed Processes and the Logic of Knowledge
Proceedings of the Conference on Logic of Programs
Boolean and Cartesian Abstraction for Model Checking C Programs
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Model Checking Using Adaptive State and Data Abstraction
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Verifying epistemic properties of multi-agent systems via bounded model checking
Fundamenta Informaticae - Concurrency specification and programming
Symbolic Model Checking the Knowledge of the Dining Cryptographers
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Efficient SAT-based unbounded symbolic model checking using circuit cofactoring
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach (Studies in Computational Intelligence)
From Bounded to Unbounded Model Checking for Temporal Epistemic Logic
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Bounded model checking for knowledge and real time
Artificial Intelligence
VerICS 2007 - a Model Checker for Knowledge and Real-Time
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Improving the Translation from ECTL to SAT
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Abstraction in model checking multi-agent systems
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
A Data Symmetry Reduction Technique for Temporal-epistemic Logic
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Bounded Model Checking for Deontic Interpreted Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
√erics: a tool for verifying timed automata and estelle specifications
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Distributed BDD-based BMC for the verification of multi-agent systems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Parallel Model Checking for Temporal Epistemic Logic
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Automatic data-abstraction in model checking multi-agent systems
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Improved bounded model checking for a fair branching-time temporal epistemic logic
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Selective search in bounded model checking of reachability properties
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
SAT based bounded model checking with partial order semantics for timed automata
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Bounded model checking for knowledge and linear time
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
| Hi-index | 0.00 |
We survey some of the recent work in verification via symbolic model checking of temporal-epistemic logic. Specifically, we discuss OBDD-based and SAT-based approaches for epistemic logic built on discrete and real-time branching time temporal logic. The underlying semantical model considered throughout is the one of interpreted system, suitably extended whenever necessary.