Sciweavers

1023 search results - page 111 / 205
» A Formal Method for Program Slicing
Sort
View
SIGSOFT
2003
ACM
16 years 2 months ago
Policy-enforced linking of untrusted components
d Abstract) Eunyoung Lee Andrew W. Appel Department of Computer Science Princeton University {elee,appel}@cs.princeton.edu Categories and Subject Descriptors D.2.4 [Software Engine...
Eunyoung Lee, Andrew W. Appel
CAV
2009
Springer
105views Hardware» more  CAV 2009»
16 years 2 months ago
Transactional Memory: Glimmer of a Theory
Transactional memory (TM) is a promising paradigm for concurrent programming. This paper is an overview of our recent theoretical work on defining a theory of TM. We first recall s...
Rachid Guerraoui, Michal Kapalka
VMCAI
2010
Springer
15 years 8 months ago
An Analysis of Permutations in Arrays
This paper is concerned with the synthesis of invariants in programs with arrays. More specifically, we consider properties concerning array contents up to a permutation. For inst...
Valentin Perrelle, Nicolas Halbwachs
IFIP
2004
Springer
15 years 7 months ago
Safety assessment with AltaRica
: AIRBUS and ONERA used the AltaRica formal language and associated tools to perform safety assessments. Lessons learnt during the study of an electrical and hydraulic system are p...
Pierre Bieber, Christian Bougnol, Charles Castel, ...
POPL
2009
ACM
16 years 2 months ago
A calculus of atomic actions
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
Tayfun Elmas, Shaz Qadeer, Serdar Tasiran