Sciweavers

1210 search results - page 171 / 242
» Formal Techniques for Java Programs
Sort
View
SAC
2010
ACM
13 years 5 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
13 years 6 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...
CAV
2005
Springer
150views Hardware» more  CAV 2005»
14 years 1 months ago
Reasoning About Threads Communicating via Locks
Abstract. We propose a new technique for the static analysis of concurrent programs comprised of multiple threads. In general, the problem is known to be undecidable even for progr...
Vineet Kahlon, Franjo Ivancic, Aarti Gupta
CC
2005
Springer
120views System Software» more  CC 2005»
14 years 1 months ago
Data Slicing: Separating the Heap into Independent Regions
In this paper, we present a formal description of data slicing, which is a type-directed program transformation technique that separates a program’s heap into several independent...
Jeremy Condit, George C. Necula
EMSOFT
2010
Springer
13 years 5 months ago
Semantics-preserving implementation of synchronous specifications over dynamic TDMA distributed architectures
We propose a technique to automatically synthesize programs and schedules for hard real-time distributed (embedded) systems from synchronous data-flow models. Our technique connec...
Dumitru Potop-Butucaru, Akramul Azim, Sebastian Fi...