✦ LIBER ✦

Practical Aspects of Automated Deduction for Program Verification

✍ Scribed by Wolfgang Ahrendt; Bernhard Beckert; Martin Giese; Philipp Rümmer

Book ID: 107690026
Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 307 KB
Volume: 24
Category: Article
ISSN: 0933-1875
DOI: 10.1007/s13218-010-0001-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Logic programming as a basis for lean au

Logic programming as a basis for lean automated deduction

✍ Bernhard Beckert; Joachim Posegga 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Algorithms for automated deduction of to

Algorithms for automated deduction of topological information

✍ Tang-Hung Nguyen; Amr A. Oloufa; Khaled Nassar 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 339 KB

Automated verification of pointer progra

Automated verification of pointer programs in pointer logic

✍ Wang, Zhifang ;Chen, Yiyun ;Wang, Zhenming ;Hua, Baojian 📂 Article 📅 2008 🏛 Higher Education Press and Springer 🌐 English ⚖ 534 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computer Aided Verification Volume 4590 || The Why/Krakatoa/Caduceus Platform for Deductive Program Verification

✍ Damm, Werner; Hermanns, Holger 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 334 KB

Automated Deduction Techniques for the M

Automated Deduction Techniques for the Management of Personalized Documents

✍ Peter Baumgartner; Ulrich Furbach 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 446 KB

Towards an automated deduction system fo

Towards an automated deduction system for first-order possibilistic logic programming with fuzzy constants

✍ Teresa Alsinet; Lluís Godo 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB

In this article, we present a first-order logic programming language for fuzzy reasoning under possibilistic uncertainty and poorly known information. Formulas are represented by a pair (ϕ, α), in which ϕ is a first-order Horn clause or a query with fuzzy constants and regular predicates, and α ∈ [0