Sciweavers

2111 search results - page 242 / 423
» How to Program Pervasive Systems
Sort
View
131
Voted
TSE
2010
125views more  TSE 2010»
15 years 1 months ago
Engineering a Sound Assertion Semantics for the Verifying Compiler
—The Verifying Compiler (VC) project is a core component of the Dependable Systems Evolution Grand Challenge. The VC offers the promise of automatically proving that a program or...
Patrice Chalin
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
15 years 10 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
CSFW
2007
IEEE
15 years 10 months ago
Creating Vulnerability Signatures Using Weakest Preconditions
Signature-based tools such as network intrusion detection systems are widely used to protect critical systems. Automatic signature generation techniques are needed to enable these...
David Brumley, Hao Wang, Somesh Jha, Dawn Xiaodong...
124
Voted
ICTAC
2004
Springer
15 years 9 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
238
Voted
POPL
2005
ACM
16 years 3 months ago
Context logic and tree update
Spatial logics have been used to describe properties of treelike structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separatio...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty