Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using encryption for authentication in large networks of computers
Communications of the ACM
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Rewrite Methods for Clausal and Non-Clausal Theorem Proving
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Formal Verification of the Horn-Preneel Micropayment Protocol
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Formal analysis of Suzuki & Kasami distributed mutual exclusion algorithm
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
Formally Modeling and Verifying Ricart & Agrawala Distributed Mutual Exclusion Algorithm
APAQS '01 Proceedings of the Second Asia-Pacific Conference on Quality Software
We Present a Complete Study Involving in the One Hand
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
Equational Approach to Formal Analysis of TLS
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
A Lightweight Integration of Theorem Proving and Model Checking for System Verification
APSEC '05 Proceedings of the 12th Asia-Pacific Software Engineering Conference
Automating Invariant Verification of Behavioral Specifications
QSIC '06 Proceedings of the Sixth International Conference on Quality Software
Formal analysis of the iKP electronic payment protocols
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Formal modeling and verification of sensor network encryption protocol in the OTS/CafeOBJ method
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
A combination of forward and backward reachability analysis methods
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Formal analysis of TESLA protocol in the timed OTS/CafeOBJ method
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II
Hi-index | 0.00 |
The induction-guided falsification searches a bounded reachable state space of a transition system for a counterexample that the system satisfies an invariant property. If no counterexamples are found, it tries to verify that the system satisfies the property by mathematical induction on the structure of the reachable state space of the system, from which some other invariant properties may be obtained as lemmas. The verification and falsification process is repeated for each of the properties until a counterexample is found or the verification is completed. The NSPK authentication protocol is used as an example to demonstrate the induction-guided falsification.