Filters








179,348 Hits in 3.1 sec

Effect-Dependent Transformations for Concurrent Programs [article]

Nick Benton, Martin Hofmann, Vivek Nigam
2015 arXiv   pre-print
We describe a denotational semantics for an abstract effect system for a higher-order, shared-variable concurrent programming language.  ...  We prove the soundness of a number of general effect-based program equivalences, including a parallelization equation that specifies sufficient conditions for replacing sequential composition with parallel  ...  A major reason for tracking effects is to justify program transformations, most obviously in optimizing compilation [9] .  ... 
arXiv:1510.02419v1 fatcat:caspmk5ghzbxzcb2z63yuzy37a

Towards effective automatic parallelization for multicore systems

Uday Bondhugula, Muthu Baskaran, Albert Hartono, Sriram Krishnamoorthy, J. Ramanujam, Atanas Rountev, P. Sadayappan
2008 Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)  
In this paper we describe our recent efforts towards developing an effective automatic parallelization system that uses a polyhedral model for data dependences and program transformations.  ...  The ubiquity of multicore processors in commodity computing systems has raised a significant programming challenge for their effective use.  ...  Acknowledgments We would like to acknowledge Cédric Bastoul and other contributors to the CLooG code generator and Martin Griebl and team for the LooPo infrastructure.  ... 
doi:10.1109/ipdps.2008.4536401 dblp:conf/ipps/BondhugulaBHKRRS08 fatcat:gv2yaercm5dp7awfy7buz2pvte

Safe Concurrency Introduction through Slicing

Huiqing Li, Simon Thompson
2015 Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation - PEPM '15  
In this paper, we introduce three novel refactorings for retrofitting concurrency to Erlang applications, and demonstrate how the use of program slicing makes the automation of these refactorings possible  ...  Acknowledgments This research is supported by EU FP7 project RELEASE, grant number 287510, (www.release-project.eu); we thank our funders and colleagues for their support and collaboration.  ...  Cheng introduces three new types of primary program dependences in concurrent programs, named the selection dependence, synchronisation dependence and communication dependence.  ... 
doi:10.1145/2678015.2682533 dblp:conf/pepm/LiT15 fatcat:jswfb3temjc5bpddfgwcfgbhay

The next mainstream programming language

Tim Sweeney
2006 Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL'06  
Concurrency in Shading Conclusion: The problem of data-parallel concurrency is effectively solved(!)  ...  What we would like to write… Transform{n:nat}(Vertices:[n]Vertex, Indices:[]nat<n, m:Matrix):[]Vertex= for each(i in Indices) Transform(m,Vertices[i]) Three Kinds of Code Game Simulation Numeric  ... 
doi:10.1145/1111037.1111061 dblp:conf/popl/Sweeney06 fatcat:nfyoq4m3h5a2dj234cqpw7zh3y

thr2csp: Toward Transforming Threads into Communicating Sequential Processes

Robert Lange, Spiros Mancoridis
2009 2009 Ninth IEEE International Working Conference on Source Code Analysis and Manipulation  
Large threaded programs are known to be difficult to implement correctly, comprehend, and maintain, while concurrent programs written in process algebraic paradigms of concurrency, such as communicating  ...  Threading has become the dominant paradigm of concurrent computation in the most popular programming languages.  ...  Dependence analysis and program slicing of shared memory concurrent programs is undecidable in general [8] .  ... 
doi:10.1109/scam.2009.10 dblp:conf/scam/LangeM09 fatcat:67fb4gzykbbytcrb64kpxzx4uu

The next mainstream programming language

Tim Sweeney
2006 SIGPLAN notices  
Concurrency in Shading Conclusion: The problem of data-parallel concurrency is effectively solved(!)  ...  What we would like to write… Transform{n:nat}(Vertices:[n]Vertex, Indices:[]nat<n, m:Matrix):[]Vertex= for each(i in Indices) Transform(m,Vertices[i]) Three Kinds of Code Game Simulation Numeric  ... 
doi:10.1145/1111320.1111061 fatcat:y7befzivezcybd7tokqqdqlngu

Generating Concurrent Programs From Sequential Data Structure Knowledge [article]

Sarat Chandra Varanasi, Neeraj Mittal, Gopal Gupta
2020 arXiv   pre-print
To the best of our knowledge, our work is the first one to use commonsense reasoning to automatically transform sequential programs into concurrent code.  ...  This information is used to automatically derive concurrent code for that data structure, such as dictionary operations for linked lists and binary search trees.  ...  This approach can be taken for general concurrent programs where less semantic knowledge is available about the sequential program that is being transformed (Deshmukh et al. 2010) .  ... 
arXiv:2011.04045v1 fatcat:iqbfi7flbzecrhamh77guolhne

Correct Refactoring of Concurrent Java Code [chapter]

Max Schäfer, Julian Dolby, Manu Sridharan, Emina Torlak, Frank Tip
2010 Lecture Notes in Computer Science  
Automated refactorings as implemented in modern IDEs for Java usually make no special provisions for concurrent code. Thus, refactored programs may exhibit unexpected new concurrent behaviors.  ...  We show that a broad range of refactorings are not influenced by concurrency at all, whereas other important refactorings can be made behavior-preserving for correctly synchronized programs by using our  ...  Acknowledgements We would like to thank Danny Dig for helpful discussions regarding Concurrencer, Stephen Fink and Dave Grove for valuable pointers to related work, and the anonymous reviewers for their  ... 
doi:10.1007/978-3-642-14107-2_11 fatcat:fwh4jiienfgevem5f3iunbastu

PhD Abstracts

GRAHAM HUTTON
2018 Journal of functional programming  
Many students complete PhDs in functional programming each year.  ...  As a service to the community, the Journal of Functional Programming publishes the abstracts from PhD dissertations completed during the previous year.  ...  Distributive Interaction of Algebraic Effects While monadic effects-that is, the view of computational effects as categorical monads-are widespread in modern functional programming, the idea that effects  ... 
doi:10.1017/s0956796818000175 fatcat:lt6u6vlagfe7jgo73cm3nax4aq

Page 5106 of Mathematical Reviews Vol. , Issue 83m [page]

1983 Mathematical Reviews  
The first type is a replacement of a transformer or recognizer by another one without changing the program control graph (a program carrier).  ...  “In this paper we state some inference rules for join dependencies and embedded join dependencies.  ... 

ENFORCING CONCURRENT TEMPORAL BEHAVIORS

DORON PELED, HONGYANG QU
2006 International Journal of Foundations of Computer Science  
We describe here a program transformation that translates a program in such a way that it can be verified and then reverse transformed for testing a suspicious behavior.  ...  Since the transformation implies changes to the original code, we strive to minimize its effect on the original program.  ...  Our solution differs as it does not impose changes that restrict the concurrency of the system. Transformations for monitoring the execution of concurrent programs are suggested in [13] .  ... 
doi:10.1142/s012905410600408x fatcat:tqvunq5dkveilhfcrv6nqsuyea

Enforcing Concurrent Temporal Behaviors

Doron Peled, Hongyang Qu
2005 Electronical Notes in Theoretical Computer Science  
We describe here a program transformation that translates a program in such a way that it can be verified and then reverse transformed for testing a suspicious behavior.  ...  Since the transformation implies changes to the original code, we strive to minimize its effect on the original program.  ...  Our solution differs as it does not impose changes that restrict the concurrency of the system. Transformations for monitoring the execution of concurrent programs are suggested in [13] .  ... 
doi:10.1016/j.entcs.2004.01.034 fatcat:s4vsbb7flbfuhlhxt2mut4jaca

Tiling stencil computations to maximize parallelism

Vinayaka Bandishti, Irshad Pananilath, Uday Bondhugula
2012 2012 International Conference for High Performance Computing, Networking, Storage and Analysis  
We first provide necessary and sufficient conditions on tiling hyperplanes to enable concurrent start for programs with affine data accesses. We then provide an approach to find such hyperplanes.  ...  Most stencil computations allow tile-wise concurrent start, i.e., there always exists a face of the iteration space and a set of tiling hyperplanes such that all tiles along that face can be started concurrently  ...  Proof: From Theorem 1 we have, for the transformed space, the condition for concurrent start becomes f ′ · C ′ ≥ 1 (8) We know that in the transformed space, we approximate all inter-tile dependences by  ... 
doi:10.1109/sc.2012.107 dblp:conf/sc/BandishtiPB12 fatcat:r5j5h4subncu5nntb5xnvfaf2e

Designer-Controlled Generation of Parallel and Flexible Heterogeneous MPSoC Specification

Pramod Chandraiah, Rainer Doemer
2007 Proceedings - Design Automation Conference  
The immense potential available through MPSoC architectures depends heavily on the effectiveness of this programming.  ...  Existing automatic parallelizing techniques, though effective on shared memory architectures, are insufficient for MPSoCs, which are typically characterized by heterogeneous processing elements and memory  ...  In spite of these advanced analysis capabilities, completely automatic techniques have not been effective even for shared memory architectures.  ... 
doi:10.1109/dac.2007.375271 fatcat:4ejtfp27a5b5ll4wkv3e2yzxvm

Using Diversity to Harden Multithreaded Programs Against Exploitation

David M. Tagatac, Michalis Polychronakis, Salvatore J. Stolfo
2016 2016 IEEE 2nd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing (HPSC), and IEEE International Conference on Intelligent Data and Security (IDS)  
Multithreaded programming is here to stay, and concurrency bugs are the focus of a growing number of cyberattacks.  ...  After demonstrating the effectiveness of the method, especially when NOPs are injected before library function calls following synchronization points, methods for improving the efficiency of this defense  ...  This transformation does not appear to have an effect on exploit success rate for this bug.  ... 
doi:10.1109/bigdatasecurity-hpsc-ids.2016.24 fatcat:u6pwyjyetbdqhnx4suiqh6oo4u
« Previous Showing results 1 — 15 out of 179,348 results