Filters








86,175 Hits in 3.1 sec

Program Extraction from Nested Definitions [chapter]

Kenji Miyamoto, Fredrik Nordvall Forsberg, Helmut Schwichtenberg
2013 Lecture Notes in Computer Science  
Minlog is a proof assistant which automatically extracts computational content in an extension of Gödel's T from formalized proofs.  ...  In order to increase the efficiency of the extracted programs, we have also implemented a feature to translate terms into Haskell programs.  ...  Berger [3] studies program extraction and its application to exact real arithmetic. He manually extracts programs from proofs dealing with uniformly continuous functions.  ... 
doi:10.1007/978-3-642-39634-2_27 fatcat:pd3cksivondwjfryiw36c4byiq

Recursive Program Optimization Through Inductive Synthesis Proof Transformation

Peter Madden, Alan Bundy, Alan Smaill
1999 Journal of automated reasoning  
The research described in this paper involved developing transformation techniques which increase the efficiency of the noriginal program, the source, by transforming its synthesis proof into one, the  ...  We describe a working proof transformation system which, by exploiting the duality between mathematical induction and recursion, employs the novel strategy of optimizing recursive programs by transforming  ...  Thus, extract programs are correct with respect to the complete specifications of the synthesis proofs from which they are extracted.  ... 
doi:10.1023/a:1005969312327 dblp:journals/jar/MaddenBS99 fatcat:bfa4t4khaje2donwrokh4u7yc4

Transforming high-level data-parallel programs into vector operations

Jan F. Prins, Daniel W. Palmer
1993 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPOPP '93  
Thus these languages are not parallel programming languages.  ...  A major step in this direction was developed in [Blel90] where it was shown that for nested sequence aggregates subject to a restricted set of operations, an equivalent vector model program operating on  ...  Table i ← [1..5]: sqs(i)] with the definition for sqs from section 2. sqs(n) = [i ← [1..n]: i*i] 1.  ... 
doi:10.1145/155332.155345 dblp:conf/ppopp/PrinsP93 fatcat:gnunajtjcnahfhddeacecsk7ma

Functional pearl: getting a quick fix on comonads

Kenneth Foner
2015 SIGPLAN notices  
A piece of functional programming folklore due to Piponi provides Löb's theorem from modal provability logic with a computational interpretation as an unusual fixed point.  ...  Its computational interpretation permits the definition of a novel fixed point function allowing each part of a structure to refer to its own context within the whole.  ...  must be derived in part from extract.  ... 
doi:10.1145/2887747.2804310 fatcat:iuxkqhvxnvdgnp4q4j5dmeznd4

Research on Integration Algorithm of Global Function Call Path Based on Module Path

Pan Lu, Mu Yong-min, Yang Zhi-jia
2016 International Journal of Signal Processing, Image Processing and Pattern Recognition  
analysis the local function call information, starting from the main function, expanse the function call information layer by layer, and then get the global function call relationship of the program.  ...  Paper proposed that for the single function of C program, analysis and extraction the control flow graph and local function call information stored on a particular data structure, design a algorithm to  ...  Function Call Relation Expansion Graph Figure 10 . 10 Global Function Call Path Extraction from Sequential and Selection Nested Program .  ... 
doi:10.14257/ijsip.2016.9.6.12 fatcat:shu22wvutzcknj4qjf4ummtlr4

Evolution of data models [chapter]

Hans-Jörg Schek, Marc H. Scholl
1990 Lecture Notes in Computer Science  
Specifically, we describe a first evolutionary path from relations through nested relations and complex objects to object networks.  ...  While such mechanisms facilitate the definition of new types and gives rise to inheritance of attributes, methods, or functions, making query formulation easier, they also need new constructs in queries  ...  If we write these type definitions down in a linear syntax, like it is usually done in programming languages, see also [Seh77], then we might obtain for a sample nested relation Dept (dno,name,budget,  ... 
doi:10.1007/3-540-53397-4_35 fatcat:qiebdruvnvgotjkjmpr57aohp4

Analysis of Polymorphically Typed Logic Programs Using ACI-Unification [chapter]

Jan-Georg Smaus
2001 Lecture Notes in Computer Science  
To formalise which properties of terms we want to characterise, we use labelling functions, which are functions that extract subterms from a term along certain paths.  ...  This approach worked for polymorphically typed logic programs. Here, we recast this approach following [5, 11] .  ...  ., in (5) , we extract the only element from a list; coincidentally, this element is a nest. In (1) , we extract all nests from a list of nests, thus including e(7).  ... 
doi:10.1007/3-540-45653-8_19 fatcat:x2ee6awnajh4xoiyzdpq3nwtle

TRACO: An Automatic Loop Nest Parallelizer for Numerical Applications

Marek Palkowski, Tomasz Klimek, Wlodzimierz Bielecki
2015 Proceedings of the 2015 Federated Conference on Computer Science and Information Systems  
We present the source-to-source TRACO compiler allowing for increasing program locality and parallelizing arbitrarily nested loop sequences in numerical applications.  ...  We consider benchmarks, typical from compute-intensive sequences of algebra operations or numerical computation from industry and engineering.  ...  Definition 1.  ... 
doi:10.15439/2015f34 dblp:conf/fedcsis/PalkowskiKB15 fatcat:f2paanfzxnd4tksbthc7zoamci

Variable granularity for improving precision of impact analysis

Maksym Petrenko, Vaclav Rajlich
2009 2009 IEEE 17th International Conference on Program Comprehension  
Impact analysis is a specialized process of program comprehension that investigates the nature and extent of a planned software change.  ...  A component y in program P has nesting level nest(y) = k if there is a component z in P such that nest(z) = k-1 and the definition of x is nested in the definition of y.  ...  Definition 4 . 4 A component x has nesting level nest(x) = 0 if its definition is not present within the definition of any other component in P.  ... 
doi:10.1109/icpc.2009.5090023 dblp:conf/iwpc/PetrenkoR09 fatcat:5x3yufqbtvgxhhkbki255r4m2a

Analysis of Polymorphically Typed Logic Programs Using ACI-Unification [article]

Jan-Georg Smaus
2001 arXiv   pre-print
To formalise which properties of terms we want to characterise, we use labelling functions, which are functions that extract subterms from a term along certain paths.  ...  This approach worked for polymorphically typed programs as in Goedel or HAL. Here, we recast this approach following works by Codish, Lagoon and Stuckey.  ...  The extraction axiom for nest(V) and list(nest(V)) is nest A (x 1 , list A (y) ⊕ x 2 ) = nest A (x 1 , x 2 ) ⊕ y.  ... 
arXiv:cs/0105007v1 fatcat:22hfemiprvhklldoaqol77vtu4

Source Code Verification for Embedded Systems using Prolog

Frank Flederer, Ludwig Ostermayer, Dietmar Seipel, Sergio Montenegro
2017 Electronic Proceedings in Theoretical Computer Science  
A common technique to verify programs is the analysis of their abstract syntax tree (AST). Tree structures can be elegantly analyzed with the logic programming language Prolog.  ...  On the other hand, Prolog's non-determinism and backtracking eases tests of different variations of the program flow without big effort.  ...  To extract the AST from the source code the converter uses Clang, a C/C++ front end for LLVM 2 .  ... 
doi:10.4204/eptcs.234.7 fatcat:pn3fcl7xqbgo5jati2koabmcii

Possibilistic Nested Logic Programs

Juan Carlos Nieves, Helena Lindgren, Marc Herbstritt
2012 International Conference on Logic Programming  
The expressiveness of the possibilistic nested logic programs is illustrated by scenarios from the medical domain.  ...  We introduce the class of possibilistic nested logic programs. These possibilistic logic programs allow us to use nested expressions in the bodies and the heads of their rules.  ...  Hence, the following definition follows from the answer set definition. Definition 6. [10] Let P be a nested logic program and M be a set of literals.  ... 
doi:10.4230/lipics.iclp.2012.267 dblp:conf/iclp/NievesL12 fatcat:qgmstiewvzanrcom2m7pxu7le4

Tuples Extraction from HTML Using Logic Wrappers and Inductive Logic Programming [chapter]

Costin Bădică, Amelia Bădică, Elvira Popescu
2005 Lecture Notes in Computer Science  
This paper presents an approach for applying inductive logic programming to information extraction from HTML documents structured as unranked ordered trees.  ...  We consider information extraction from Web resources that are abstracted as providing sets of tuples.  ...  Definition 1 . 1 (L-wrapper) An L-wrapper is a logic program defining a relation extract(N 1 , . . . , N k ) ⊆ N ×. . .×N .  ... 
doi:10.1007/11495772_8 fatcat:ydaystgponbpbi6cmyd5addvsq

Partial and Nested Recursive Function Definitions in Higher-order Logic

Alexander Krauss
2009 Journal of automated reasoning  
It turns out that this modularity also facilitates termination arguments for total functions, in particular for nested recursions.  ...  Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for reasoning about them.  ...  zero We now define the nested zero function from §1.1.2.  ... 
doi:10.1007/s10817-009-9157-2 fatcat:etpmyhp3c5hmlfs3nqd7q2m76u

Aspect mining in the presence of the C preprocessor

Bram Adams, Bart Van Rompaey, Celina Gibbs, Yvonne Coady
2008 Proceedings of the 2008 AOSD workshop on Linking aspect technology and evolution - LATE '08  
In this paper, we explore the process of aspect mining and extraction in the context of preprocessor-driven systems.  ...  Our aim is to identify both opportunities (extracting conditional compilation into advice) and pitfalls (mining on unpreprocessed code) in migrating preprocessor code to aspects.  ...  Acknowledgements Bram Adams is supported by a BOF grant from Ghent University.  ... 
doi:10.1145/1404953.1404954 dblp:conf/aosd/AdamsRGC08 fatcat:th7yztvc2fckzcugrro7zozpbi
« Previous Showing results 1 — 15 out of 86,175 results