6274 search results - page 172 / 1255 » Proofs, Programs, Processes |
174
click to vote
ACL
1989
15 years 7 months ago
1989
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
162
click to vote
ENTCS
2002
15 years 6 months ago
2002
Once you have proved your refinement correct, that is not the end. Real products, and their accompanying specifications, develop over time, with new improved versions having added...
309
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
Race detection algorithms for multi-threaded programs using the common lock-based synchronization idiom must correlate locks with the memory locations they guard. The heart of a p...
293
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
188
click to vote
ACL2
2006
ACM
16 years 11 days ago
2006
ACM
We have implemented parallelism primitives that permit an ACL2 programmer to parallelize execution of ACL2 functions. We (1) introduce logical definitions for these primitives, (...