Filters








150 Hits in 3.4 sec

Predator Hunting Party (Competition Contribution) [chapter]

Petr Muller, Petr Peringer, Tomáš Vojnar
2015 Lecture Notes in Computer Science  
The main aim of Predator is sound shape analysis of sequential, non-recursive C programs that use lowlevel pointer operations for working efficiently with various kinds of linked lists.  ...  This paper introduces PredatorHP (Predator Hunting Party), a program verifier built on top of the Predator shape analyser, and discusses its participation in the SV-COMP'15 software verification competition  ...  The distribution of Predator includes models of some memory manipulating functions (like malloc, free, memset, memcpy, etc.).  ... 
doi:10.1007/978-3-662-46681-0_40 fatcat:dbrdzsfcaraajfb4e7dx44zbte

Transactional Locking II [chapter]

Dave Dice, Ori Shalev, Nir Shavit
2006 Lecture Notes in Computer Science  
TL2 improves on state-of-the-art STMs in the following ways: (1) unlike all other STMs it fits seamlessly with any systems memory life-cycle, including those using malloc/free (2) unlike all other lock-based  ...  The object's associated lock, if used properly, can offer a way around this problem, allowing memory to be recycled using standard malloc/free style operations.  ...  There is a simple solution for the per-stripe (PS) variation of TL2 (and in the the earlier TL [18] scheme) that works with any malloc/free or similar style pair of operations.  ... 
doi:10.1007/11864219_14 fatcat:xcnoqu6fmjhldpgoto3jdwyoau

Titanium: a high-performance Java dialect

Kathy Yelick, Luigi Semenzato, Geoff Pike, Carleton Miyamoto, Ben Liblit, Arvind Krishnamurthy, Paul Hilfinger, Susan Graham, David Gay, Phil Colella, Alex Aiken
1998 Concurrency Practice and Experience  
A preliminary study of this style of memory management on sequential C programs found that zones were faster than malloc/free and conservative garbage collection in most cases [2] .  ...  Sequential Performance The first set of benchmarks show the sequential performance of Titanium code.  ... 
doi:10.1002/(sici)1096-9128(199809/11)10:11/13<825::aid-cpe383>3.0.co;2-h fatcat:jg77goxeqzbyxa52tektm6vlzi

Bounded model checking of C++ programs based on the Qt cross-platform framework

Felipe R. Monteiro, Mário A. P. Garcia, Lucas C. Cordeiro, Eddie B. de Lima Filho
2017 Software testing, verification & reliability  
Indeed, the main contributions here are (i) the support for sequential and associative template-based containers, (ii) the integration of QtOM into the verification process of the state-of-the-art C++  ...  Section 4 describes a simplified representation of the Qt libraries, named as Qt Operational Model (QtOM), which also addresses pre and postconditions, while the formal implementation of sequential and  ...  One may notice further that the behaviour of the Qt libraries functions are actually represented in C/C++ programming languages, using native functions (e.g., malloc, free, assert).  ... 
doi:10.1002/stvr.1632 fatcat:cpaopac5hzch7odhtdasgnwg6a

A Practical Approach to Exploiting Coarse-Grained Pipeline Parallelism in C Programs

William Thies, Vikram Chandrasekhar, Saman Amarasinghe
2007 Microarchitecture (MICRO), Proceedings of the Annual International Symposium on  
Such source-level annotations are attractive (e.g., for malloc/free) and could be integrated with our approach.  ...  Dependences between calls to memory allocation functions (malloc/free) were also disregarded so as to allow pipeline stages to manage their local memories in parallel.  ... 
doi:10.1109/micro.2007.4408268 fatcat:vkm3i5q37beula4rhumt3m6sim

A Practical Approach to Exploiting Coarse-Grained Pipeline Parallelism in C Programs

William Thies, Vikram Chandrasekhar, Saman Amarasinghe
2007 40th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 2007)  
Such source-level annotations are attractive (e.g., for malloc/free) and could be integrated with our approach.  ...  Dependences between calls to memory allocation functions (malloc/free) were also disregarded so as to allow pipeline stages to manage their local memories in parallel.  ... 
doi:10.1109/micro.2007.38 dblp:conf/micro/ThiesCA07 fatcat:z2hjym6wuzg6fifsf3rujgl3cm

Understanding Tradeoffs in Software Transactional Memory

Dave Dice, Nir Shavit
2007 International Symposium on Code Generation and Optimization (CGO'07)  
A specialized malloc/free mechanism that works safely, even when malloc and free are called from within transactions, was suggested in [31] .  ...  As we explain, the undo set used in the Ennals' style encounter order algorithms requires type-stable memory or specialized malloc/free implementations.  ... 
doi:10.1109/cgo.2007.38 dblp:conf/cgo/DiceS07 fatcat:cqcyfuzygbe37hxj7jekcstrwq

Locality Aware Task Scheduling in Parallel Data Stream Processing [chapter]

Zbyněk Falt, Martin Kruliš, David Bednárek, Jakub Yaghob, Filip Zavoral
2015 Studies in Computational Intelligence  
For comparison, we have selected the standard malloc/free allocator implemented in the libc library, since it is widely used and thus it provides a good baseline.  ...  The local allocator provides the standard malloc/free functions (or the new/delete operators respectively) for the application code whilst it utilizes the functions of superblock allocator.  ... 
doi:10.1007/978-3-319-10422-5_35 fatcat:56g7pv2m3faybftgshjicfxbrm

An Application-Oblivious Memory Scheduling System for DNN Accelerators

Jiansong Li, Xueying Wang, Xiaobing Chen, Guangli Li, Xiao Dong, Peng Zhao, Xianzhi Yu, Yongxin Yang, Wei Cao, Lei Liu, Xiaobing Feng
2022 ACM Transactions on Architecture and Code Optimization (TACO)  
The memory access action A can be malloc, free, read or write, i.e., A ∈ {malloc, f ree, read, write}.  ...  AppObMem samples the Write, Read behaviors of DevMemBlock and Malloc, Free behaviors of DevAcc. The recorded metainformation includes device memory address, block size and timestamp.  ... 
doi:10.1145/3535355 fatcat:2o2czjndlbdqbjsuferohzhcwu

Introduction to high-level synthesis

D.D. Gajski, L. Ramachandran
1994 IEEE Design & Test of Computers  
Constructs that are not supported for synthesis include dynamic allocation (malloc, free, new, and delete), pointer arithmetic, and virtual functions.  ...  Complex subsystems are built and verified by combining modules using structural hierarchy, just as in Verilog or VHDL.  ... 
doi:10.1109/54.329454 fatcat:xob6dmmhjngvfh7d6f7jpv35ly

The MOSART Mapping Optimization for Multi-Core ARchiTectures [chapter]

Bernard Candaele, Sylvain Aguirre, Michel Sarlotte, Iraklis Anagnostopoulos, Sotirios Xydis, Alexandros Bartzas, Dimitris Bekiaris, Dimitrios Soudris, Zhonghai Lu, Xiaowen Chen, Jean-Michel Chabloz, Ahmed Hemani (+9 others)
2011 Lecture Notes in Electrical Engineering  
The 5% last percents gathered mainly memory management (malloc, free, etc.), and the filter coefficient initialisation.  ...  Once the C source was cleaned-up, the sequential code was executed on a conventional PC platform to verify that the application functionality had been preserved.  ... 
doi:10.1007/978-94-007-1488-5_11 fatcat:64p6g2afbbdrjjv5doxla5lmti

An Introduction to High-Level Synthesis

P. Coussy, D.D. Gajski, M. Meredith, A. Takach
2009 IEEE Design & Test of Computers  
Constructs that are not supported for synthesis include dynamic allocation (malloc, free, new, and delete), pointer arithmetic, and virtual functions.  ...  Complex subsystems are built and verified by combining modules using structural hierarchy, just as in Verilog or VHDL.  ... 
doi:10.1109/mdt.2009.69 fatcat:5wa4gs37krgzziwtiftffzszqe

Verification of C++ Flight Software with the MCP Model Checker

S. Thompson, G. Brat
2008 IEEE Aerospace Conference. Proceedings  
With this work we are proposing to address the issue by developing a suite of tools that can be used to verify C++ code.  ...  Its primary purpose is to intercept system calls that MCP needs to handle differently, e.g. printf, malloc, free, memset, memmove and memcpy.  ...  If one considers the example of a sequential program, this corresponds to a trace through the system.  ... 
doi:10.1109/aero.2008.4526577 fatcat:i54z3xccznanzkui3ystzqahza

Verification of safety properties for concurrent assembly code

Dachuan Yu, Zhong Shao
2004 SIGPLAN notices  
Its soundness has been verified using the Coq proof assistant.  ...  In this paper, we propose a logic-based "type" system for the static verification of concurrent assembly programs, applying the "invariance proof" technique for verifying general safety properties and  ...  Interested readers are referred to the previous work [46, 47] for a complete modeling of CAP and a certified malloc/free library whose correctness criterion involves more than type-safety.  ... 
doi:10.1145/1016848.1016875 fatcat:cvtt46mz6fen5jjekpvz6xvrri

Two decades of automatic amortized resource analysis

Jan Hoffmann, Steffen Jost
2022 Mathematical Structures in Computer Science  
Hofmann was outright displeased by the need to allow rational solutions, as this destroyed his compilation technique into malloc-free C code, since there are no pointers to fractional memory locations.  ...  In this work, he shows how general-recursive firstorder functions can be compiled into a fragment of the C programming language without dynamic memory allocation ("malloc-free C code"), thus demonstrating  ...  To derive a bound on the work, we can simply apply (sequential) AARA.  ... 
doi:10.1017/s0960129521000487 fatcat:vs74jvnsz5drnbuvmidtla7zwm
« Previous Showing results 1 — 15 out of 150 results