Sciweavers

2514 search results - page 305 / 503
» The use of industrial-strength formal methods
Sort
View
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
16 years 3 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
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
16 years 3 days ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
DIS
2001
Springer
15 years 11 months ago
Computational Discovery of Communicable Knowledge: Symposium Report
Abstract. The Symposium on Computational Discovery of Communicable Knowledge was held from March 24 to 25, 2001, at Stanford University. Fifteen speakers reviewed recent advances i...
Saso Dzeroski, Pat Langley
JMLR
2010
165views more  JMLR 2010»
15 years 1 months ago
Causal Inference
: This review presents empirical researchers with recent advances in causal inference, and stresses the paradigmatic shifts that must be undertaken in moving from traditional stati...
Judea Pearl
CAV
2007
Springer
173views Hardware» more  CAV 2007»
16 years 22 days ago
Array Abstractions from Proofs
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
Ranjit Jhala, Kenneth L. McMillan