Proof-theoretic notions for software maintenance

DOI10.1016/S1571-0661(05)80048-9zbMath1264.68059MaRDI QIDQ4923374

Reinhard Kahle

Publication date: 6 June 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Linear logic
• The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction
• A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules
• On Databases with Incomplete Information
• A Complete Axiomatization of the Three valued Completion of Logic Programs
• Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages
• CUT-PROPERTY AND NEGATION AS FAILURE
• A declarative semantics for depth-first logic programs1The research reported here is based on Ref. [12.1]
• Hypothetical reasoning and definitional reflection in logic programming
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proof-theoretic notions for software maintenance