Concept

Manual memory management

Publications associées (18)

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 ...

Springer Berlin Heidelberg2013

Execution Synthesis: A Technique for Automating the Debugging of Software

Cristian Zamfir

Debugging real systems is hard, requires deep knowledge of the target code, and is time-consuming. Bug reports rarely provide sufficient information for debugging, thus forcing developers to turn into detectives searching for an explanation of how the prog ...

EPFL2013

Why Nothing Matters: The Impact of Zeroing

Jennifer Bedke Sartor, Xi Yang

Memory safety defends against inadvertent and malicious misuse of memory that may compromise program correctness and security. A critical element of memory safety is zero initialization. The direct cost of zero initialization is surprisingly high: up to 12 ...

2011

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

Execution Synthesis: A Technique for Automated Software Debugging

George Candea, Cristian Zamfir

Debugging real systems is hard, requires deep knowledge of the code, and is time-consuming. Bug reports rarely provide sufficient information, thus forcing developers to turn into detectives searching for an explanation of how the program could have arrive ...

2010

On the Impossibility of Strong Encryption over ℵ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

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

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