6274 search results - page 89 / 1255 » Proofs, Programs, Processes |
106
click to vote
ENTCS
2007
14 years 12 months ago
2007
The interpretative approach to compilation allows compiling programs by partially evaluating an interpreter w.r.t. a source program. This approach, though very attractive in princ...
188
click to vote
POPL
2008
ACM
16 years 6 days ago
2008
ACM
Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a s...
DDECS
2009
IEEE
15 years 6 months ago
2009
IEEE
—Automatic Test Pattern Generation (ATPG) based on Boolean satisfiability (SAT) has been shown to be a beneficial complement to traditional ATPG techniques. Boolean solvers wor...
ICML
1995
IEEE
16 years 21 days ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
158
click to vote
PLPV
2011
ACM
14 years 2 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...