Concept

Manual memory management

Related publications (49)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On Effect Analysis for Programs with Callbacks

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

We introduce a precise interprocedural effect analysis for programs with mutable state, dynamic object allocation, and dynamic dispatch. Our analysis is precise even in the presence of dynamic dispatch where the context-insensitive estimate on the number o ...

2012

Symmetric subgame perfect equilibria in resource allocation

Boi Faltings, Ludek Cigler

We analyze symmetric protocols to rationally coordinate on an asymmetric, efficient allocation in an infinitely repeated N-agent, C-resource allocation problems. (Bhaskar 2000) proposed one way to achieve this in 2-agent, 1-resource allocation games: Agent ...

2012

On The Power of Hardware Transactional Memory to Simplify Memory Management

Aleksandar Dragojevic

Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memory (HTM) can be used to simplify and streamline memory reclamation for such da ...

ACM2011

Memory Safety of Floating-Point Computations

Johannes Kinder

Concepts and technologies are described herein for determining memory safety of floating-point computations. The concepts and technologies described herein analyze code to determine if any floating-point computations exist in the code, and if so, if the fl ...

US Patent & Trademark Office2010

iProve: A Scalable Approach to Consumer-Verifiable Software Guarantees

George Candea, Horatiu Jula, Silviu Andrica

Formally proving complex program properties is still considered impractical for systems with over a million lines of code (MLOC). We present iProve, an approach that enables the generation and verification of proofs for interesting program properties in la ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

On the Impossibility of Strong Encryption over \aleph_{0}

Serge Vaudenay

We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second one relates to computationally secure encryption resisting adaptive chosen ciphe ...

Springer Berlin / Heidelberg2009

Dynamic Resource Allocation for Database Servers Running on Virtual Storage

Adrian Daniel Popescu, Daniel Lupei, Jin Chen

We introduce a novel multi-resource allocator to dynamically allocate resources for database servers running on virtual storage. Multi-resource allocation involves proportioning the database and storage server caches, and the storage bandwidth between appl ...

2009

Relaxed Atomic Broadcast: State-Machine Replication Using Bounded Memory

André Schiper, Sergio Mena, Omid Shahmirzadi

Atomic broadcast is a useful abstraction for implementing fault-tolerant distributed applications such as state-machine replication. Although a number of algorithms solving atomic broadcast have been published, the problem of bounding the memory used by th ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2009

Relaxed Atomic Broadcast: State-Machine Replication Using Bounded Memory

André Schiper, Sergio Mena, Omid Shahmirzadi

Atomic broadcast is a useful abstraction for implementing fault-tolerant distributed applications such as state machine replication. Although a number of algorithms solving atomic broadcast have been published, the problem of bounding the memory used by th ...

2009

Reflexes: programming abstractions for highly responsive computing in Java

Jesper Honig Spring

Achieving sub-millisecond response times in a managed language environment such as Java introduces significant implementation challenges. The Achilles' heel of Java is its reliance on automatic memory management for reclaiming dead objects. Typically, the ...

EPFL2008