Sciweavers

718 search results - page 13 / 144
» Extraction of Structured Programs from Specification Proofs
Sort
View
BIRTHDAY
2010
Springer
13 years 8 months ago
Programming Inductive Proofs - A New Approach Based on Contextual Types
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
Brigitte Pientka
CADE
2009
Springer
14 years 9 months ago
Integrated Reasoning and Proof Choice Point Selection in the Jahob System - Mechanisms for Program Survival
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
Martin C. Rinard
JSC
2006
71views more  JSC 2006»
13 years 8 months ago
Towards a clausal analysis of cut-elimination
In this paper we show that a large class of cut-elimination methods can be analyzed by clause terms representing sets of characteristic clauses extractable from the original proof...
Matthias Baaz, Alexander Leitsch
APIN
2010
107views more  APIN 2010»
13 years 8 months ago
Extracting reduced logic programs from artificial neural networks
Artificial neural networks can be trained to perform excellently in many application areas. While they can learn from raw data to solve sophisticated recognition and analysis prob...
Jens Lehmann, Sebastian Bader, Pascal Hitzler
CBSE
2009
Springer
14 years 1 months ago
Extracting Behavior Specification of Components in Legacy Applications
A challenge of componentizing legacy applications is to extract behavior specification of suggested components. It is desirable to preserve a relation between the original structur...
Tomás Poch, Frantisek Plasil