Filters








13,564 Hits in 4.3 sec

AutopaR: An Automatic Parallelization Tool for Recursive Calls

Mert Emin Kalender, Cem Mergenci, Ozcan Ozturk
2014 2014 43rd International Conference on Parallel Processing Workshops  
Our approach, Autopar, specifically aims at achieving automatic parallelization of recursive applications using static program analysis.  ...  It first decides on the recursive functions of a given program. Then, it performs analysis and collects information about these recursive functions.  ...  They apply a quantifier-eliminationbased derivation of operators to shrink function closures. Using such an operator, they split the input structure and perform computation parallelly.  ... 
doi:10.1109/icppw.2014.32 dblp:conf/icppw/KalenderMO14 fatcat:nxviv37jnngg3kf4zbux3l7pk4

Quantifier elimination in automatic loop parallelization

Armin Größlinger, Martin Griebl, Christian Lengauer
2006 Journal of symbolic computation  
We present an application of quantifier elimination techniques in the automatic parallelization of nested loop programs.  ...  Our purpose here is to make the research community of quantifier elimination, in a tutorial style, aware of our application domain -loop parallelization -and to highlight the role of quantifier elimination  ...  We also thank the reviewers for their useful comments.  ... 
doi:10.1016/j.jsc.2005.09.012 fatcat:kthnoi725barfpca66ngdp6spy

Verification by Parallelization of Parametric Code [chapter]

Tobias Gedell, Reiner Hähnle
2007 Lecture Notes in Computer Science  
A loop can be parallelized, whenever the execution of a generic iteration of its body depends only on the step parameter and not on other iterations.  ...  This guarantees soundness of a proof rule that transforms a loop into a universally quantified update of the state change information effected by the loop body.  ...  The valuable comments of the anonymous reviewer led to several improvements.  ... 
doi:10.1007/978-3-540-75939-3_10 fatcat:r4w2xo5jezey7o4wwm7ghv6ke4

Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH

Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2003 Electronical Notes in Theoretical Computer Science  
more general notion of computability and complexity working over arbitrary structures.  ...  Considering the Blum, Shub, and Smale computational model for real numbers, extended by Poizat to general structures, classical complexity can be considered as the restriction to finite structures of a  ...  Therefore, on a structure with quantifier elimination, this predicative minimization is computable in finite time. We now introduce a new set of functions.  ... 
doi:10.1016/s1571-0661(03)00005-7 fatcat:ncowozpzxrhmbpce6o3odbevxe

Automatic Verification of Iterated Separating Conjunctions using Symbolic Execution [article]

Peter Müller, Malte Schwerhoff, Alexander J. Summers
2016 arXiv   pre-print
It is compatible with other features of permission logics such as fractional permissions, recursive predicates, and abstraction functions.  ...  Despite its usefulness, no automatic program verifier natively supports iterated separating conjunctions; they are especially difficult to incorporate into symbolic execution engines, the prevalent technique  ...  The recursive calls to smaller array segments are performed concurrently using parallel composition .  ... 
arXiv:1603.00649v3 fatcat:qfu5xauy75ebhdikybni6etfgu

Automatic Verification of Iterated Separating Conjunctions Using Symbolic Execution [chapter]

Peter Müller, Malte Schwerhoff, Alexander J. Summers
2016 Lecture Notes in Computer Science  
It is compatible with other features of permission logics such as fractional permissions, recursive predicates, and abstraction functions.  ...  Despite its usefulness, no automatic program verifier natively supports iterated separating conjunctions; they are especially difficult to incorporate into symbolic execution engines, the prevalent technique  ...  The recursive calls to smaller array segments are performed concurrently using parallel composition .  ... 
doi:10.1007/978-3-319-41528-4_22 fatcat:gvcjg2f3dbdtbg67iaoyaw3v2q

Size slicing

Troels Henriksen, Martin Elsman, Cosmin E. Oancea
2014 Proceedings of the 3rd ACM SIGPLAN workshop on Functional high-performance computing - FHPC '14  
This approach leads to a shape-dependent system with existentially-quantified types, where static shape inference corresponds to eliminating existential quantifications from the types of program expressions  ...  We present a shape inference analysis for a purely-functional language, named Futhark, that supports nested parallelism via array combinators such as map, reduce, filter, and scan.  ...  This research has been partially supported by the Danish Strategic Research Council, Program Committee for Strategic Growth Technologies, for the research center 'HIPERFIT: Functional High Performance  ... 
doi:10.1145/2636228.2636238 dblp:conf/icfp/HenriksenEO14 fatcat:iodnodhudbhxrjh6qji2egtczi

Automating Verification of Loops by Parallelization [chapter]

Tobias Gedell, Reiner Hähnle
2006 Lecture Notes in Computer Science  
This makes it possible to use automatic first order reasoning techniques to deal with loops. The method has been implemented in the KeY verification tool.  ...  It guarantees soundness of a proof rule that transforms a loop into a universally quantified update of the state change information represented by the loop body.  ...  It would be possible to let the user provide this function at the price of making the method less automatic.  ... 
doi:10.1007/11916277_23 fatcat:xbqr2wu5zvdfxoia4rmowf7ftm

Combining interaction and automation in process algebra verification [chapter]

Albert Camilleri, Paola Inverardi, Monica Nesi
1991 Lecture Notes in Computer Science  
To achieve our goal, we use the interactive theorem prover ItOL as a framework for supporting the theory of observational congruence of ccs, and provide a set of automatic proof tools, based on the algebraic  ...  axiomatization of the language, which can be used interactively.  ...  Acknowledgements We are grateful to Rocco De Nicola of IEI-CNR for his technical advice and continuous encouragement, and to Robin Gallimore and Roger Fleming of Hewlett-Packard Laboratories for supporting  ... 
doi:10.1007/3540539816_72 fatcat:qlsitftnj5gzbjax2nbgoqemoe

A Combined Analytical and Search-Based Approach for the Inductive Synthesis of Functional Programs

Emanuel Kitzelmann
2010 Künstliche Intelligenz  
Inductive program synthesis addresses the problem of automatically generating (declarative) recursive programs from ambiguous specifications such as input/output examples.  ...  The main contribution of my dissertation [4] is the algorithm Igor2 for the induction of functional programs.  ...  Igor2 can use background knowledge (BK) and automatically invents subfunctions. It finds complex recursion schemes like that of Ackermann or the mutual-recursive definition of odd/even.  ... 
doi:10.1007/s13218-010-0071-x fatcat:ms3u7dk2hfbxtk55o4q6rcw5te

Automatic Modular Abstractions for Linear Constraints [article]

David Monniaux
2008 arXiv   pre-print
Our algorithms are based on new quantifier elimination and symbolic manipulation techniques.  ...  In addition to loop-free code, the same method also applies for obtaining least fixed points as functions of the precondition, which permits the analysis of loops and recursive functions.  ...  By quantifier elimination, we obtain (C = 91) ∧ (δ = ∆ = −10) ∧ (A = 101) ∧ (B = 100) within a fraction of a second using Mjollnir (see Sec. 6).  ... 
arXiv:0811.0166v1 fatcat:auwheackgvax7gin5dd63563mq

Calculating modules in contextual logic program refinement [article]

Robert Colvin, Ian J. Hayes, Paul Strooper
2006 arXiv   pre-print
Contextual refinement simplifies the refinement process by abstractly capturing the context of a subcomponent of a program, which typically includes information about the values of the free variables.  ...  replaced with calls to the corresponding procedures of C.  ...  The authors would like to thank David Hemer and three anonymous referees for constructive comments on earlier versions of the paper.  ... 
arXiv:cs/0608110v1 fatcat:345pyz34gjevddpo3e2c45xktq

Recursive Program Optimization Through Inductive Synthesis Proof Transformation

Peter Madden, Alan Bundy, Alan Smaill
1999 Journal of automated reasoning  
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  ...  We compare and contrast this approach with the more traditional approaches to program transformation, and highlight the benefits of proof transformation with regards to search, correctness, automatability  ...  This will both introduce recursion into the target function and eliminate all reference to the source fib function from the target definition. An application of^?  ... 
doi:10.1023/a:1005969312327 dblp:journals/jar/MaddenBS99 fatcat:bfa4t4khaje2donwrokh4u7yc4

Automatic modular abstractions for linear constraints

David P. Monniaux
2008 Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '09  
Our algorithms are based on new quantifier elimination and symbolic manipulation techniques.  ...  In addition to loop-free code, the same method also applies for obtaining least fixed points as functions of the precondition, which permits the analysis of loops and recursive functions.  ...  By quantifier elimination, we obtain (C = 91) ∧ (δ = ∆ = −10) ∧ (A = 101) ∧ (B = 100) within a fraction of a second using Mjollnir (see Sec. 6).  ... 
doi:10.1145/1480881.1480899 dblp:conf/popl/Monniaux09 fatcat:gacpr3scergsxcojcjfxzhmfkm

Machine Learning for Inductive Theorem Proving [chapter]

Yaqing Jiang, Petros Papapanagiotou, Jacques Fleuriot
2018 Lecture Notes in Computer Science  
We evaluate the framework using a number of inductive proof corpora. In each case, our approach achieves a higher success rate than running ATPS or the Boyer-Moore tool individually.  ...  In this work, we explore a combination of machine learning, a simple Boyer-Moore model and ATPs as a means of improving the automation of inductive proofs in the proof assistant HOL Light.  ...  Acknowledgements This research was supported by EPSRC grants: Proof-Peer: Collaborative Theorem Proving EP/L011794/1 and The Integration and Interaction of Multiple Mathematical Reasoning Processes EP/  ... 
doi:10.1007/978-3-319-99957-9_6 fatcat:bexvmw6k4bezfpji74hfv3evhi
« Previous Showing results 1 — 15 out of 13,564 results