Perfect Model Checking via Unfold/Fold Transformations
CL '00 Proceedings of the First International Conference on Computational Logic
An unfold/fold transformation framework for definite logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Narrowing and Rewriting Logic: from Foundations to Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
The Importance of Non-theorems and Counterexamples in Program Verification
Verified Software: Theories, Tools, Experiments
Superposition for Fixed Domains
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Decidability Results for Saturation-Based Model Building
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Annals of Mathematics and Artificial Intelligence
Attacking Group Multicast Key Management Protocols Using Coral
Electronic Notes in Theoretical Computer Science (ENTCS)
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Superposition for fixed domains
ACM Transactions on Computational Logic (TOCL)
Deciding the inductive validity of ∀∃* queries
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Finite models for formal security proofs
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Disunification for ultimately periodic interpretations
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Predicate completion for non-Horn clause sets
CADE'11 Proceedings of the 23rd international conference on Automated deduction
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Natural narrowing for general term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |