Results 251 to 260 of about 7,269,595 (295)

Software Artifacts Extraction for Program Comprehension

2010
The maintenance of legacy software applications is a complex, expensive, quiet challenging, time consuming and daunting task due to program comprehension difficulties. The first step for software maintenance is to understand the existing software and to extract the high level abstractions from the source code.
Ghulam Rasool 0002, Ilka Philippow
openaire   +2 more sources

Feature Extraction and Classification by Genetic Programming

2008
This paper explores the use of genetic programming for constructing vision systems. A two-stage approach is used, with separate evolution of the feature extraction and classification stages. The strategy taken for the classifier is to evolve a set of partial solutions, each of which works for a single class.
Olly Oechsle, Adrian F. Clark
openaire   +1 more source

Static extraction of program configuration options

Proceedings of the 33rd International Conference on Software Engineering, 2011
Many programs use a key-value model for configuration options. We examined how this model is used in seven open source Java projects totaling over a million lines of code. We present a static analysis that extracts a list of configuration options for a program.
Ariel Rabkin, Randy H. Katz
openaire   +1 more source

An application of PER models to program extraction

Mathematical Structures in Computer Science, 1993
Type theory allows us to extract from a constructive proof that a specification is satisfiable a program that satisfies the specification. Algorithms for optimization of such programs are currently the object of research.In this paper we consider one such algorithm, which was described in Beeson (1985) and which we will call ‘Harrop’.
openaire   +3 more sources

Controlling Program Extraction in Light Logics

2011
We present two refinements, based on program extraction in elementary affine logic and light affine logic, of Krivine & Leivant's system FA2. This system allows higher-order equations to specify the computational content of extracted programs. The user can then prove a generic formula, using these equations as axioms.
openaire   +2 more sources

Program extraction for 2-random reals

Archive for Mathematical Logic, 2013
The main theorem of this paper states that \(\text{WKL}^\omega_0 + \Pi^0_1\text{-CP} + \text{CAC}+ 2\text{-RAN}\) is conservative over \(\text{RCA}_0^\omega\) for sentences of the form \(\forall f \exists x A_{qf}(f,x)\), and that from any proof of such a sentence one can extract a primitive recursive realizer \(t[f]\) for \(x\).
openaire   +1 more source

Refinement of Classical Proofs for Program Extraction

2011
The A-Translation enables us to unravel the computational information in classical proofs, by first transforming them into constructive ones, however at the cost of introducing redundancies in the extracted code. This is due to the fact that all negations inserted during translation are replaced by the computationally relevant form of the goal. In this
openaire   +2 more sources

Extraction of functional from logic program

1991
This paper shows a method of extracting a functional from a logic program, by means of a dataflow dealing with sequences from the set of idempotent substitutions. The dataflow is expressed as a functional involving fair merge functions in order to represent the atom set union over a sequence domain, as well as functions to act on unifiers, to reflect ...
openaire   +2 more sources

EXTRACTION DEVICE, EXTRACTION METHOD, AND EXTRACTION PROGRAM

KOIDE TAKASHI, CHIBA DAIKI
  +9 more sources

EXTRACTION DEVICE, EXTRACTION METHOD, AND EXTRACTION PROGRAM

2022
NAKANO HIROKI, CHIBA DAIKI
openaire   +1 more source