✦ LIBER ✦

A logic covering undefinedness in program proofs

✍ Scribed by H. Barringer; J. H. Cheng; C. B. Jones

Publisher: Springer-Verlag
Year: 1984
Tongue: English
Weight: 768 KB
Volume: 21
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00264250

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proof of termination within a weak logic

Proof of termination within a weak logic of programs

✍ David C. Luckham; Norihisa Suzuki 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 679 KB

A Companion to Philosophical Logic || Pr

A Companion to Philosophical Logic || Proofs and Expressiveness in Alethic Modal Logic

✍ Jacquette, Dale 📂 Article 📅 2006 🏛 Blackwell Publishing Ltd 🌐 English ⚖ 146 KB 👁 2 views

Edited By Dale Jacquette. Includes Bibliographical References And Index.

A Constructive Proof of a Theorem in Rel

A Constructive Proof of a Theorem in Relevance Logic

✍ Aleksandar Kron 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 461 KB 👁 1 views

In this paper we investigate a propositional systeni L related t o T,-W of relevance logic. It has been conjectured that for any formulas A and B

Predicate abstraction in a program logic

Predicate abstraction in a program logic calculus

✍ Benjamin Weiß 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 335 KB

Predicate abstraction is a form of abstract interpretation where the abstract domain is constructed from a finite set of predicates over the variables of the program. This paper explores a way to integrate predicate abstraction into a calculus for deductive program verification based on symbolic exe

Hypothetical reasoning in logic programm

Hypothetical reasoning in logic programming: a semantic approach

✍ Antonio Brogi; Evelina Lamma; Paula Mello 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 517 KB

A finiteness proof for modified dantzig

A finiteness proof for modified dantzig cuts in integer programming

✍ V. J. Bowman Jr.; G. L. Nemhauser 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB

where R is the index set associated with the nonbasic variables. If all of the variables are constrained to be nonnegative integers and xu is not an integer in the basic solution, the linear constraint is implied. We prove that including these "cuts" in a specified way yields a finite dual simplex a