Sciweavers

198 search results - page 26 / 40
» Modal Proofs as Distributed Programs (Extended Abstract)
Sort
View
CONCUR
2007
Springer
14 years 2 months ago
Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures
We present a fixpoint-based algorithm for context-sensitive interprocedural kill/gen-analysis of programs with thread creation. Our algorithm is precise up to abstraction of sync...
Peter Lammich, Markus Müller-Olm
IEEEPACT
2009
IEEE
14 years 3 months ago
Interprocedural Load Elimination for Dynamic Optimization of Parallel Programs
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
Rajkishore Barik, Vivek Sarkar
ASIAN
2009
Springer
269views Algorithms» more  ASIAN 2009»
13 years 6 months ago
Noninterference with Dynamic Security Domains and Policies
Abstract. Language-based information flow analysis is used to statically examine a program for information flows between objects of different security domains, and to verify these ...
Robert Grabowski, Lennart Beringer
STTT
2010
97views more  STTT 2010»
13 years 7 months ago
Distributed dynamic partial order reduction
Abstract. Runtime (dynamic) model checking is a promising verification methodology for real-world threaded software because of its many features, the prominent ones being: (i) it ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Rob...
ICALP
2007
Springer
14 years 2 months ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...