Filters








1,495 Hits in 12.3 sec

Leveraging semantic signatures for bug search in binary programs

Jannik Pewny, Felix Schuster, Lukas Bernhard, Thorsten Holz, Christian Rossow
2014 Proceedings of the 30th Annual Computer Security Applications Conference on - ACSAC '14  
To demonstrate the practical feasibility of the proposed method, we implemented a prototype of TEDEM that can find real-world security bugs across binaries and even across OS boundaries, such as in MS  ...  This allows us to find instances of the same bug in different binaries and even spotting its variants (a concept called vulnerability extrapolation).  ...  Acknowledgements This work has been supported by the German Federal Ministry of Education and Research (BMBF) under support code 16BP12302, EUREKA-Project SASER and by the German Research Foundation (DFG  ... 
doi:10.1145/2664243.2664269 dblp:conf/acsac/PewnySBHR14 fatcat:wdmssaj4cfdxvhiuyop6h4ns5q

Supporting the hypercube programming model on mesh architectures

Thomas M. Stricker
1992 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures - SPAA '92  
The bitonic merge sort, a simple hypercube algorithm, contains a fair amount of fine grain parallelism not found in standard mesh algorithms.  ...  A direct implementation of the embedding is made possible by logical channels and pathways.  ...  I am grateful to all of them particularly to Thomas Gross, H.T. Kung, Guy Blelloch and Dave O'Hallaron.  ... 
doi:10.1145/140901.140917 dblp:conf/spaa/Stricker92 fatcat:ty7dwp7qgbeafoz5cmxtrabbim

StagedSAC

Vlad Ureche, Tiark Rompf, Arvind Sujeeth, Hassan Chafi, Martin Odersky
2012 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation - PEPM '12  
Domain-specific languages (DSLs) can bridge the gap between high-level programming and efficient execution.  ...  The main language feature of both SAC and StagedSAC is a loop construction that enables high-level and concise implementations of array algorithms.  ...  We showed it is possible to augment the LMS-based compiler with complex analysis phases such as shape inference and optimized code generation.  ... 
doi:10.1145/2103746.2103762 dblp:conf/pepm/UrecheRSCO12 fatcat:3bl44uh65vgyblbj7ar4vsswb4

From dirt to shovels

Kathleen Fisher, David Walker, Kenny Q. Zhu, Peter White
2008 Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '08  
that infers the format of complex, ad hoc data sources, producing compact and accurate PADS descriptions. • We have incorporated the inference algorithm into a modular software system that uses sample  ...  The key technical contribution of the work is a multiphase algorithm that automatically infers the structure of an ad hoc data source and produces a format specification in the PADS data description language  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of DARPA or the NSF.  ... 
doi:10.1145/1328438.1328488 dblp:conf/popl/FisherWZW08 fatcat:7jbphyy435bapbf2gr7iht4oca

Quantitative release planning in extreme programming

Gert van Valkenhoef, Tommi Tervonen, Bert de Brock, Douwe Postmus
2011 Information and Software Technology  
Context: Extreme Programming (XP) is one of the most popular agile software development methodologies.  ...  The customer representative is constantly under pressure and may experience difficulties in foreseeing the adequacy of a release plan.  ...  Acknowledgements This study was partly supported by the Escher project (T6-202), which is a project of the Dutch Top Institute Pharma.  ... 
doi:10.1016/j.infsof.2011.05.007 fatcat:hea26utzhvdyflgavgqr7lkgza

Concurrent constraint programming

Vijay A. Saraswat, Martin Rinard
1990 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '90  
This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment  ...  Such a view of computation is interesting in the context of programming languages because of the ability to represent and manipulate partial information about the domain of discourse, in the context of  ...  There are too many debts that the first author owes to too many-people for him to even think of acknowledging them here, He has tried to make amends in the preface to [Sar89].  ... 
doi:10.1145/96709.96733 dblp:conf/popl/SaraswatR90 fatcat:vrf53c4wtve2xjw237fm2s7j5y

Characterizing the Effect of Microarchitecture Design Parameters on Workload Dynamic Behavior

Chang-Burm Cho, Wangyuan Zhang, Tao Li
2007 2007 IEEE 10th International Symposium on Workload Characterization  
Therefore understanding the effect of design parameters on workload dynamics at early, microarchitecture exploration stage is crucial for highperformance and complexity-efficient designs.  ...  The increasing design complexity and technology scaling make microprocessor performance and efficiency increasingly depend on runtime workload dynamics.  ...  Model Complexity We define model complexity as the number of terms included in the error-bounded regression models.  ... 
doi:10.1109/iiswc.2007.4362176 dblp:conf/iiswc/ChoZL07 fatcat:gi3ukz3tarcjlhqgqhg2blrbxi

The Reduceron reconfigured and re-evaluated

MATTHEW NAYLOR, COLIN RUNCIMAN
2012 Journal of functional programming  
A hand-reduction is a reduction that a programmer would perform in by-hand evaluation trace of a program; it includes function application and case analysis, but not machine-level reductions such as updating  ...  A precise description of the Reduceron compiler, including refinements to the Scott encoding of constructors, used for compiling case expressions and addressing various efficiency concerns.  ...  Acknowledgments This work was supported by the Engineering and Physical Sciences Research Council of the UK under grant EP/G011052/1.  ... 
doi:10.1017/s0956796812000214 fatcat:46l3zhco4jaojjhvpfnpfnv3lm

Iterative optimization in the polyhedral model

Louis-Noël Pouchet, Cédric Bastoul, Albert Cohen, John Cavazos
2008 Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation - PLDI '08  
Therefore, it is mandatory that the compiler accurately models the target architecture and the effects of complex code restructuring.  ...  We simultaneously extend the application domain -applicability and scalability to larger codes -and search space expressiveness -construction of more complex sequences of transformations. 2.  ...  Acknowledgments Uday+Ram+Saday for fruitful talks and Cornero/Rohou for the traviata board  ... 
doi:10.1145/1375581.1375594 dblp:conf/pldi/PouchetBCC08 fatcat:p6z3qjhxl5cx7jwjvlu7cabgie

Verifying Invariants of Lock-Free Data Structures with Rely-Guarantee and Refinement Types

Colin S. Gordon, Michael D. Ernst, Dan Grossman, Matthew J. Parkinson
2017 ACM Transactions on Programming Languages and Systems  
We propose a new way of proving invariants of fine-grained concurrent data structures: applying rely-guarantee reasoning to references in the concurrent setting.  ...  Second, we demonstrate the approach's broad applicability through a series of case studies, using two implementations: an axiomatic COQ domain-specific language and a library for Liquid Haskell.  ...  Fine-grained locking-guarding different parts of a larger structure with separate locks-helps in many cases but not all.  ... 
doi:10.1145/3064850 fatcat:bs2qkwegfjci7da3xq7eq5ixc4

Static and dynamic semantics of NoSQL languages

Véronique Benzaken, Giuseppe Castagna, Kim Nguyen, Jérôme Siméon
2013 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '13  
We illustrate the use of this calculus by encoding a large fragment of Jaql, including operations and iterators over JSON, embedded SQL expressions, and co-grouping, and show how the encoding directly  ...  yields a typing discipline for Jaql as it is, namely without the addition of any type definition or type annotation in the code.  ...  We considered the definition of a fine-grained rule to type expressions of the form e1. . .e2: whenever e2 is typed by a finite unions of strings, the rule would give a finite approximation of the type  ... 
doi:10.1145/2429069.2429083 dblp:conf/popl/BenzakenCNS13 fatcat:7so53pdrmneetjckvcv4ppl7we

Using thread-level speculation to simplify manual parallelization

Manohar K. Prabhu, Kunle Olukotun
2003 Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '03  
These results support the idea that manual parallelization using TLS is an efficient way to extract fine-grain thread-level parallelism.  ...  We also provide indications of the programming effort required to parallelize each benchmark.  ...  Ease of TLS Parallelization The base case illustrates the simplicity of TLS programming and the efficiency of its resultant programs, in contrast to the complexity and overheads of conventional parallelization  ... 
doi:10.1145/781498.781500 dblp:conf/ppopp/PrabhuO03 fatcat:g3xzavwifvdexmvza6eg4p5rwy

Using thread-level speculation to simplify manual parallelization

Manohar K. Prabhu, Kunle Olukotun
2003 Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '03  
These results support the idea that manual parallelization using TLS is an efficient way to extract fine-grain thread-level parallelism.  ...  We also provide indications of the programming effort required to parallelize each benchmark.  ...  Ease of TLS Parallelization The base case illustrates the simplicity of TLS programming and the efficiency of its resultant programs, in contrast to the complexity and overheads of conventional parallelization  ... 
doi:10.1145/781499.781500 fatcat:l3oetas36zg4tfkui5vm5rgnaq

Simultaneous multithreading

Dean M. Tullsen, Susan J. Eggers, Henry M. Levy
1995 Proceedings of the 22nd annual international symposium on Computer architecture - ISCA '95  
Simultaneous multithreading has the potential to achieve 4 times the throughput of a superscalar, and double that of fine-grain multithreading.  ...  We examine many of these complexities and evaluate alternative organizations in the design space.  ...  Acknowledgments We would like to thank John O'Donnell from Equator Technologies, Inc. and Tryggve Fossum of Digital Equipment Corporation for access to the source for the Alpha AXP version of the Multiflow  ... 
doi:10.1145/223982.224449 dblp:conf/isca/TullsenEL95 fatcat:rj3illxasbalhkiz4ygcsjsvdi

Simultaneous multithreading

Dean M. Tullsen, Susan J. Eggers, Henry M. Levy
1995 SIGARCH Computer Architecture News  
Simultaneous multithreading has the potential to achieve 4 times the throughput of a superscalar, and double that of fine-grain multithreading.  ...  We examine many of these complexities and evaluate alternative organizations in the design space.  ...  Acknowledgments We would like to thank John O'Donnell from Equator Technologies, Inc. and Tryggve Fossum of Digital Equipment Corporation for access to the source for the Alpha AXP version of the Multiflow  ... 
doi:10.1145/225830.224449 fatcat:gtheubj4tbcqxokcmbrfoihxym
« Previous Showing results 1 — 15 out of 1,495 results