Sciweavers

5818 search results - page 1133 / 1164
» A reasonable Semantic Web
Sort
View
SIGSOFT
2002
ACM
16 years 2 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
POPL
2009
ACM
16 years 2 months ago
A combination framework for tracking partition sizes
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv
SAS
2009
Springer
214views Formal Methods» more  SAS 2009»
16 years 2 months ago
Abstract Interpretation of FIFO Replacement
Interpretation of FIFO Replacement Daniel Grund and Jan Reineke Saarland University, Saarbr?ucken, Germany In hard real-time systems, the execution time of programs must be bounded...
Daniel Grund, Jan Reineke
POPL
2006
ACM
16 years 2 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
POPL
2004
ACM
16 years 2 months ago
Atomizer: a dynamic atomicity checker for multithreaded programs
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected interactions between concurrent threads. Much previous work has focused on det...
Cormac Flanagan, Stephen N. Freund
« Prev « First page 1133 / 1164 Last » Next »