Event fairness and non-interleaving concurrency
Formal Aspects of Computing
Design and validation of computer protocols
Design and validation of computer protocols
Automating recursive type definitions in higher order logic
Current trends in hardware verification and automated theorem proving
Handbook of theoretical computer science (vol. B)
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
An improvement in formal verification
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
Combining Model Checking and Theorem Proving to Verify Parallel Processes
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Verification of a Multiplier: 64 Bits and Beyond
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
Combining Partial Order Reductions with On-the-fly Model-Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
An Integration of Model Checking with Automated Proof Checking
Proceedings of the 7th International Conference on Computer Aided Verification
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
Four statements equivalent to well-foundedness (well-founded induction, existence of recursively defined functions, uniqueness of recursively defined functions, and absence of descending ω-chains) have been proved in Mizar and the proofs mechanically ...