Filters








2,792 Hits in 2.8 sec

Computing SSA Form with Matrices

Quan Hoang Nguyen, Bernhard Scholz
2007 Electronical Notes in Theoretical Computer Science  
We use the Spec95 benchmark suite for our experimental evaluation.  ...  Although there exist efficient graph algorithms for these relations, the algorithms are elaborate to implement.  ...  Acknowledgement We would like to thank Bernd Burgstaller for his useful comments and for proofreading the manuscript.  ... 
doi:10.1016/j.entcs.2007.02.064 fatcat:bxk22ykviveonbtmyeope5blcq

Performance of C++ bit-vector implementations

Vreda Pieterse, Derrick G. Kourie, Loek Cleophas, Bruce W. Watson
2010 Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists on - SAICSIT '10  
This paper describes an experimental study to compare the performance of various dynamically resizable bit-vector implementations for the C++ programming language.  ...  We also compare std::vector from the STL with these because it is a dynamically resizable vector implementation that has been suggested to be an acceptable alternative for std::vector.  ...  Therefore, we decided to keep a fixed density for this benchmark. Dahlberg [5] benchmarked transitive closure algorithms with real world data.  ... 
doi:10.1145/1899503.1899530 dblp:conf/saicsit/PieterseKCW10 fatcat:mf7dp7abl5gllhiluk6em5xk7a

Giga-scale exhaustive points-to analysis for Java in under a minute

Jens Dietrich, Nicholas Hollingum, Bernhard Scholz
2015 Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications - OOPSLA 2015  
In this work, we present a novel approach for solving the field-sensitive points-to problem for Java with the means of (1) a transitive-closure data-structure, and (2) a pre-computed set of potentially  ...  Any approach must solve an underlying dynamic graph reachability problem, for which the best algorithms have near-cubic worst-case runtime complexity, and, hence, previous work does not scale to programs  ...  Related Work Transitive Closure Naive algorithms to compute the transitive closure of directed graphs have cubic time and square space complexity.  ... 
doi:10.1145/2814270.2814307 dblp:conf/oopsla/DietrichHS15 fatcat:6ntxpumdovevddwvqx6vjy552m

Optimising unicode regular expression evaluation with previews

Howard Chivers
2016 Software, Practice & Experience  
A deterministic automaton (DFA) was chosen as a general dispatching mechanism for Unicode character classes and this also provided the opportunity to use compact DFAs in various optimization strategies  ...  all the matches possible from a given point in a regular expression in a form that can be implemented as a compact DFA and can be used to further improve the performance of the standard NFA simulation algorithm  ...  {i}a{i} for increasing values of i against an input string a...a of length i. This benchmark exposes the worst-case performance of backtracking algorithms because every possibility in the prefix (a?)  ... 
doi:10.1002/spe.2436 fatcat:hs33ugpubzg7zfps5quowjngwa

TravMC2: higher-order model checking for alternating parity tree automata

Robin P. Neatherway, C.-H. Luke Ong
2014 Proceedings of the 2014 International SPIN Symposium on Model Checking of Software - SPIN 2014  
Acknowledgments We would like to thank Koichi Fujima and Naoki Kobayashi for their help benchmarking against the TRECS-APT tool, and Steven Ramsay for helpful discussions.  ...  The transitions for f and h transition to state q1 for the left child, but these branches are all finite.  ...  Timings for this optimisation are  ... 
doi:10.1145/2632362.2632381 dblp:conf/spin/NeatherwayO14 fatcat:23hdd6axrrbg5ox6qpqqvrqvgi

Multicore garbage collection with local heaps

Simon Marlow, Simon Peyton Jones
2011 SIGPLAN notices  
In a parallel, shared-memory, language with a garbage collected heap, it is desirable for each processor to perform minor garbage collections independently.  ...  Acknowledgements We would like to thank John Reppy and Mike Rainey for several useful discussions about the GC architectures of Manticore and GHC.  ...  In the case of nbody, we deliberately de-optimised the program because in its fully optimised form it does no allocation in its inner loop and hence virtually no GC, which made it a poor benchmark for  ... 
doi:10.1145/2076022.1993482 fatcat:7hyavinbzjfwfdhznkosph55dq

Multicore garbage collection with local heaps

Simon Marlow, Simon Peyton Jones
2011 Proceedings of the international symposium on Memory management - ISMM '11  
In a parallel, shared-memory, language with a garbage collected heap, it is desirable for each processor to perform minor garbage collections independently.  ...  Acknowledgements We would like to thank John Reppy and Mike Rainey for several useful discussions about the GC architectures of Manticore and GHC.  ...  In the case of nbody, we deliberately de-optimised the program because in its fully optimised form it does no allocation in its inner loop and hence virtually no GC, which made it a poor benchmark for  ... 
doi:10.1145/1993478.1993482 dblp:conf/iwmm/MarlowJ11 fatcat:btisrpzsxzfpjegvpbzszotkla

Optimised determinisation and completion of finite tree automata [article]

John P. Gallagher, Mai Ajspur, Bishoksan Kafle
2017 arXiv   pre-print
In this paper we develop an algorithm for determinisation and completion of finite tree automata, whose worst-case complexity remains unchanged, but which performs far better than existing algorithms in  ...  The critical aspect of the algorithm is that the transitions of the determinised (and possibly completed) automaton are generated in a potentially very compact form called product form, which can reduce  ...  Acknowledgements We would like to thank Kim Steen Henriksen and Gourinath Banda for discussions in the early stages of this work.  ... 
arXiv:1511.03595v2 fatcat:zoer3rq645drzp6jq4dxr5gc4a

Five Determinisation Algorithms [chapter]

Rob van Glabbeek, Bas Ploeger
2008 Lecture Notes in Computer Science  
In this paper we present several determinisation algorithms, all variants of the well-known subset construction, that aim to reduce memory usage and produce smaller output automata.  ...  We apply our algorithms to determinise automata that describe the possible sequences appearing after a fixed-length run of cellular automaton 110, and obtain a significant improvement in both memory and  ...  We would like to thank Jan Friso Groote, Tim Willemse and Sebastian Maneth for valuable ideas, discussions and/or comments.  ... 
doi:10.1007/978-3-540-70844-5_17 fatcat:e5b3u6bvrfe4biwfvmthjfpui4

The verified CakeML compiler backend

YONG KIAM TAN, MAGNUS O. MYREEN, RAMANA KUMAR, ANTHONY FOX, SCOTT OWENS, MICHAEL NORRISH
2019 Journal of functional programming  
Parts of the compiler's implementation resemble mainstream (unverified) compilers for strict functional languages, and it supports several important features and optimisations.  ...  The compiler produces machine code for five architectures: x86-64, ARMv6, ARMv8, MIPS-64, and RISC-V.  ...  We thank the anonymous reviewers for their helpful comments on drafts of this paper, and are grateful for good comments by Mike Gordon and Konrad Slind The Verified CakeML Compiler Backend 55 on the conference  ... 
doi:10.1017/s0956796818000229 fatcat:har5hbuhhvb5fj5q4ayefxzujq

Using Hindley-Milner type inference to optimise list representation

Cordelia V. Hall
1994 Proceedings of the 1994 ACM conference on LISP and functional programming - LFP '94  
Hindley-Milner type inference and partial evaluation are all that is needed to optimise this structure, yielding considerable improvements in space and time consumption for some interesting programs.  ...  This framework is applicable to many data types and their optimised representations, such as lists and parallel implementations of bags, or arrays and quadtrees.  ...  closure implements a transitive closure algorithm based on the usual inductive de nition.  ... 
doi:10.1145/182409.156781 dblp:conf/lfp/Hall94 fatcat:c5q5kym5gjevbdmzidkqchvncu

Using Hindley-Milner type inference to optimise list representation

Cordelia V. Hall
1994 ACM SIGPLAN Lisp Pointers  
Hindley-Milner type inference and partial evaluation are all that is needed to optimise this structure, yielding considerable improvements in space and time consumption for some interesting programs.  ...  This framework is applicable to many data types and their optimised representations, such as lists and parallel implementations of bags, or arrays and quadtrees.  ...  closure implements a transitive closure algorithm based on the usual inductive de nition.  ... 
doi:10.1145/182590.156781 fatcat:shrnkph6krb6bhmimgcsc4wyke

A back-end for GHC based on categorical multi-combinators

Ricardo Massa F. Lima, Rafael Dueire Lins, André L. M. Santos
2004 Proceedings of the 2004 ACM symposium on Applied computing - SAC '04  
A number of code optimisations are introduced to µΓCMC.  ...  µΓCMC is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC.  ...  The NoFib Haskell benchmark suite was used for the performance analysis.  ... 
doi:10.1145/967900.968196 dblp:conf/sac/LimaLS04 fatcat:uqxulepp4ffxxbjznu2gxa5dyy

Chaining Test Cases for Reactive System Testing (extended version) [article]

Peter Schrammel and Tom Melham and Daniel Kroening
2013 arXiv   pre-print
Our technique targets the scenario in which test goals for the requirements are given as safety properties.  ...  We report experimental results with a prototype tool for C code generated from Simulink models and compare it to state-of-the-art test suite generators.  ...  We thank Cristian Cadar for his advice regarding the comparison with Klee, and the anonymous reviewers for their invaluable comments.  ... 
arXiv:1306.3882v2 fatcat:suwlictglbak7af3jdos5yx5da

Extension table built-ins for prolog

Changguan Fan, Suzanne Wagner Dietrich
1992 Software, Practice & Experience  
Extension tables are a memo facility that the algorithm uses both to cut infinite derivation paths for complete evaluation and to optimise the evaluation of logic programs.  ...  The implementations of the ET* algorithm are compared using time and space performance on a variety of benchmark programs.  ...  Debray for comments on an earlier draft of this paper.  ... 
doi:10.1002/spe.4380220706 fatcat:kwumtenmt5fwtbviuu7cztmzym
« Previous Showing results 1 — 15 out of 2,792 results