Filters








9 Hits in 4.7 sec

Data structure synthesis

Calvin Loncaric
2016 Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering - FSE 2016  
By re-framing the incremental computation task as a data structure specification we can produce efficient incremental versions in more situations than previous work.  ...  Many programs require custom application-specific data structures more complicated than those found in standard libraries.  ...  Static Incrementalization Static techniques take a batch-style program as input and produce an incremental version as output. Our approach is a static technique.  ... 
doi:10.1145/2950290.2983946 dblp:conf/sigsoft/Loncaric16 fatcat:w7gg5eewwvgn3nsnumnsqfddmq

Verifying Monadic Second Order Graph Properties with Tree Automata

Bruno Courcelle, Irène Durand
2010 European Lisp Symposium  
As in previous years, we will aim to build on the symposium by proposing a journal special issue, to whi we will invite new contributions as well as extended versions of the accepted papers in these proceedings  ...  thoughts naturally turn towards the next milestone, one year at a time; as demonstrated at the first two events in this series, in Bordeaux in 2008 and Milan last year, and again this year, the ability  ...  The author is grateful to the anonymous reviewers for their help in improving this work.  ... 
dblp:conf/els/CourcelleD10 fatcat:gsptru7iergwncgeq7rdaa5nji

The Leonardo System and Software Individuals

Erik Sandewall
2013 European Lisp Symposium  
In 2010 he joined Google's team in Aarhus (Denmark) where he worked on V8 and later Dart. Being part of the Dart team Florian has helped specifying the language, which was presented in late 2011.  ...  He wrote a Scheme-to-JavaScript compiler during his thesis, and then completed a JavaScript-to-Scheme compiler in his spare time.  ...  We are also grateful to the Nix community, and in particular to Eelco Dolstra for his inspiring PhD work that led to Nix.  ... 
dblp:conf/els/Sandewall13 fatcat:zmmqeakaj5bfxdovmfe24v4ikq

Compilation-assisted performance acceleration for data analytics

Craig Mustard
2020
Cross program memoization (CPM) is a technique to re-use results of prior computations across programs and users.  ...  queries, either submitted by the same or different users.  ...  Related Work Memoization Early work on memoization investigated how caching can help single programs [131] and what kinds of programs are suitable for caching [132] .  ... 
doi:10.14288/1.0394560 fatcat:nqwrotqwm5arle7wdzyofu7n6e

Speculative computation in multilisp

Randy B. Osborne
1990 Proceedings of the 1990 ACM conference on LISP and functional programming - LFP '90  
To handle two or more pi with the same value, we can transform our linear program into an equivalent one in which no two pi' are the same by applying the following procedure (repeatedly as necessary):  ...  transfer any priority.  ...  Appendix C ParVis ParVis is a program visualization tool for Multilisp developed by Bagnall IBagnall] which is invaluable for understanding the performance of Multilisp programs.  ... 
doi:10.1145/91556.91644 dblp:conf/lfp/Osborne90 fatcat:6mu4zcbzrvgq3ghnuftl7mjcjq

Design and implementation of an optimizing type-centric compiler for a high-level language

Dmytro Petrashko
2017
Third, we present "MiniPhases", a novel way to organize transformation passes in a compiler.  ...  Our discussions on design constraints of the Java programming language have broadened my views on both the long-term evolution of programming languages and the needs of industry.  ...  Having you as role models in my life served me well and made me who I am today.  ... 
doi:10.5075/epfl-thesis-7979 fatcat:o73flgdolrcvho47dzhxaa2xim

Schedule data, not code

Micah J Best
2020
We construct a model for parallelism, Data not Code (DnC), by starting with the observation that a majority of performance and problems in parallel programming are rooted in the manipulation of data, and  ...  These concepts are already embraced by many programming models and languages, such as map/reduce, GraphLab and SQL.  ...  We have hand picked 3 examples to compare against, both in terms of raw performance and in programming style.  ... 
doi:10.14288/1.0394747 fatcat:ic7tqdlmnbbjvlfe3ux7iswgu4

Scalable and Declarative Information Extraction in a Parallel Data Analytics System [article]

Astrid Rheinländer, Humboldt-Universität Zu Berlin, Humboldt-Universität Zu Berlin
2017
Hereby, we systematically evaluate scalability and robustness of the employed methods and tools in order to pinpoint the most critical challenges in building an IE system for very large data sets.  ...  Although numerous IE algorithms exist, their seamless and extensible combination in a scalable system still is a major challenge.  ...  Hellerstein and Naughton [1996] combine memoization and sorting in a hybrid caching scheme and show that this approach yields significant improvements over memoization and sorting in most cases.  ... 
doi:10.18452/17996 fatcat:5bjjxw4uibg4hj2jjbpgbznzvm

Speculative computation in multilisp [chapter]

Randy B. Osborne
Lecture Notes in Computer Science  
To handle two or more pi with the same value, we can transform our linear program into an equivalent one in which no two pi' are the same by applying the following procedure (repeatedly as necessary):  ...  transfer any priority.  ...  Appendix C ParVis ParVis is a program visualization tool for Multilisp developed by Bagnall IBagnall] which is invaluable for understanding the performance of Multilisp programs.  ... 
doi:10.1007/bfb0024152 dblp:conf/plisp/Osborne89 fatcat:x7seoz4v75bifhby7gwjpnqdsq