3653 search results - page 468 / 731 » Learning of Partial Languages |
199
click to vote
FSTTCS
1999
Springer
15 years 11 months ago
1999
Springer
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
172
click to vote
ICFP
1997
ACM
15 years 11 months ago
1997
ACM
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
155
click to vote
ICALP
1994
Springer
15 years 10 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
166
click to vote
POS
1994
Springer
15 years 10 months ago
1994
Springer
During the lifetime of an application, the objects and bindings in a persistent store may require modification in order to fix bugs or incorporate changes. Two mechanisms, Octopus...
163
click to vote
FOAL
2007
ACM
15 years 10 months ago
2007
ACM
The goal of this work is to treat safety and security policies as requirements to be composed in an aspectual style with a developing application. Policies can be expressed either...