1288 search results - page 138 / 258 » Visual Generalization in Programming by Example |
124
Voted
ICFP
2002
ACM
16 years 3 months ago
2002
ACM
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
122
click to vote
SIGSOFT
1996
ACM
15 years 7 months ago
1996
ACM
ing Dependencies between Software Configuration Items CARL A. GUNTER University of Pennsylvania icle studies an abstract model of dependencies between software configuration items ...
137
Voted
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
124
click to vote
JCS
2007
15 years 2 months ago
2007
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have specified an information flow ty...
130
click to vote
ICSE
2008
IEEE-ACM
16 years 3 months ago
2008
IEEE-ACM
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic invariant inference has t...