Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Induction = I-axiomatization + first-order consistency
Information and Computation - Special issue on RTA-98
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Alloy: a lightweight object modelling notation
ACM Transactions on Software Engineering and Methodology (TOSEM)
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Deductive Search for Errors in Free Data Type Specifications Using Model Generation
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Flaw Detection in Formal Specifications
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Predicate Synthesis for Correcting Faulty Conjectures: The Proof Planning Paradigm
Automated Software Engineering
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Random Testing in Isabelle/HOL
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Attacking Group Multicast Key Management Protocols Using Coral
Electronic Notes in Theoretical Computer Science (ENTCS)
Some encounters on the productive use of a failed proof attempt or a counterexample
MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
| Hi-index | 0.00 |
We argue that the detection and refutation of non-theorems, and the discovery of appropriate counterexamples, is of vital importance to the Grand Challenge of a Program Verifier.