1173 search results - page 85 / 235 » Program Derivation Using Analogy |
224
click to vote
PLPV
2011
ACM
14 years 7 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
119
click to vote
CSR
2010
Springer
15 years 9 months ago
2010
Springer
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
165
click to vote
NIPS
2004
15 years 6 months ago
2004
We use unsupervised probabilistic machine learning ideas to try to explain the kinds of learning observed in real neurons, the goal being to connect abstract principles of self-or...
135
click to vote
ICTAC
2004
Springer
15 years 10 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
169
click to vote
POPL
2010
ACM
15 years 7 months ago
2010
ACM
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...