Sciweavers

1356 search results - page 120 / 272
» The ideal of verified software
Sort
View
POPL
2008
ACM
16 years 6 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
BMCBI
2007
148views more  BMCBI 2007»
15 years 6 months ago
Toward the automated generation of genome-scale metabolic networks in the SEED
Background: Current methods for the automated generation of genome-scale metabolic networks focus on genome annotation and preliminary biochemical reaction network assembly, but d...
Matthew DeJongh, Kevin Formsma, Paul Boillot, John...
SAS
2009
Springer
119views Formal Methods» more  SAS 2009»
16 years 7 months ago
Abstraction Refinement for Quantified Array Assertions
ion Refinement for Quantified Array Assertions Mohamed Nassim Seghir1, , Andreas Podelski1 , and Thomas Wies1,2 1 University of Freiburg, Germany 2 EPFL, Switzerland Abstract. We p...
Mohamed Nassim Seghir, Andreas Podelski, Thomas Wi...
ICSE
2007
IEEE-ACM
16 years 6 months ago
On Accurate Automatic Verification of Publish-Subscribe Architectures
The paper presents a novel approach based on Bogor for the accurate verification of applications based on PublishSubscribe infrastructures. Previous efforts adopted standard model...
Luciano Baresi, Carlo Ghezzi, Luca Mottola
ESOP
2010
Springer
16 years 3 months ago
Enforcing Stateful Authorization and Information Flow Policies in Fine
Proving software free of security bugs is hard. Languages that ensure that programs correctly enforce their security policies would help, but, to date, no security-typed language h...
Nikhil Swamy, Juan Chen and Ravi Chugh