Sciweavers

899 search results - page 131 / 180
» A CTL-Based Logic for Program Abstractions
Sort
View
SIGSOFT
2004
ACM
16 years 1 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
ICFEM
2004
Springer
15 years 5 months ago
Memory-Model-Sensitive Data Race Analysis
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom
93
Voted
FM
2003
Springer
108views Formal Methods» more  FM 2003»
15 years 5 months ago
Correctness of Source-Level Safety Policies
Abstract. Program certification techniques formally show that programs satisfy certain safety policies. They rely on the correctness of the safety policy which has to be establish...
Ewen Denney, Bernd Fischer 0002
156
Voted
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
15 years 9 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
153
Voted
IDA
2005
Springer
15 years 6 months ago
Combining Bayesian Networks with Higher-Order Data Representations
Abstract. This paper introduces Higher-Order Bayesian Networks, a probabilistic reasoning formalism which combines the efficient reasoning mechanisms of Bayesian Networks with the...
Elias Gyftodimos, Peter A. Flach