Lecture Notes in Computer Science - Automated Deduction – CADE-23
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642224379, 9783642224386

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Deciding Security for Protocols with Recursive Tests

Lecture Notes in Computer Science - Automated Deduction – CADE-23 ◽

10.1007/978-3-642-22438-6_6 ◽

2011 ◽

pp. 49-63 ◽

Cited By ~ 4

Author(s):

Mathilde Arnaud ◽

Véronique Cortier ◽

Stéphanie Delaune

Download Full-text

AC Completion with Termination Tools

Lecture Notes in Computer Science - Automated Deduction – CADE-23 ◽

10.1007/978-3-642-22438-6_37 ◽

2011 ◽

pp. 492-498 ◽

Cited By ~ 1

Author(s):

Sarah Winkler ◽

Aart Middeldorp

Download Full-text

On Transfinite Knuth-Bendix Orders

Lecture Notes in Computer Science - Automated Deduction – CADE-23 ◽

10.1007/978-3-642-22438-6_29 ◽

2011 ◽

pp. 384-399 ◽

Cited By ~ 3

Author(s):

Laura Kovács ◽

Georg Moser ◽

Andrei Voronkov

Download Full-text

Predicate Completion for non-Horn Clause Sets

Lecture Notes in Computer Science - Automated Deduction – CADE-23 ◽

10.1007/978-3-642-22438-6_24 ◽

2011 ◽

pp. 315-330

Author(s):

Matthias Horbach

Keyword(s):

Horn Clause

Download Full-text

Exploiting Symmetry in SMT Problems

Lecture Notes in Computer Science - Automated Deduction – CADE-23 ◽

10.1007/978-3-642-22438-6_18 ◽

2011 ◽

pp. 222-236 ◽

Cited By ~ 8

Author(s):

David Déharbe ◽

Pascal Fontaine ◽

Stephan Merz ◽

Bruno Woltzenlogel Paleo

Download Full-text

CSI – A Confluence Tool

Lecture Notes in Computer Science - Automated Deduction – CADE-23 ◽

10.1007/978-3-642-22438-6_38 ◽

2011 ◽

pp. 499-505 ◽

Cited By ~ 14

Author(s):

Harald Zankl ◽

Bertram Felgenhauer ◽

Aart Middeldorp

Download Full-text

Efficient General Unification for XOR with Homomorphism

Lecture Notes in Computer Science - Automated Deduction – CADE-23 ◽

10.1007/978-3-642-22438-6_31 ◽

2011 ◽

pp. 407-421 ◽

Cited By ~ 4

Author(s):

Zhiqiang Liu ◽

Christopher Lynch

Download Full-text

A Hybrid Method for Probabilistic Satisfiability

Lecture Notes in Computer Science - Automated Deduction – CADE-23 ◽

10.1007/978-3-642-22438-6_27 ◽

2011 ◽

pp. 354-368 ◽

Cited By ~ 6

Author(s):

Pavel Klinov ◽

Bijan Parsia

Keyword(s):

Hybrid Method ◽

Probabilistic Satisfiability

Download Full-text

Heaps and Data Structures: A Challenge for Automated Provers

Lecture Notes in Computer Science - Automated Deduction – CADE-23 ◽

10.1007/978-3-642-22438-6_15 ◽

2011 ◽

pp. 177-191 ◽

Cited By ~ 8

Author(s):

Sascha Böhme ◽

Michał Moskal

Keyword(s):

Data Structures

Download Full-text

Sine Qua Non for Large Theory Reasoning

Lecture Notes in Computer Science - Automated Deduction – CADE-23 ◽

10.1007/978-3-642-22438-6_23 ◽

2011 ◽

pp. 299-314 ◽

Cited By ~ 47

Author(s):

Kryštof Hoder ◽

Andrei Voronkov

Keyword(s):

Theory Reasoning

Download Full-text

Lecture Notes in Computer Science - Automated Deduction – CADE-23Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Deciding Security for Protocols with Recursive Tests

AC Completion with Termination Tools

On Transfinite Knuth-Bendix Orders

Predicate Completion for non-Horn Clause Sets

Exploiting Symmetry in SMT Problems

CSI – A Confluence Tool

Efficient General Unification for XOR with Homomorphism

A Hybrid Method for Probabilistic Satisfiability

Heaps and Data Structures: A Challenge for Automated Provers

Sine Qua Non for Large Theory Reasoning

Lecture Notes in Computer Science - Automated Deduction – CADE-23
Latest Publications