438 search results - page 79 / 88 » On theorem proving in annotated logics |
154
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
125
click to vote
TACAS
2010
Springer
16 years 29 days ago
2010
Springer
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
178
click to vote
OWLED
2008
15 years 7 months ago
2008
The annotation of the GENIA corpus, a set of biomedical articles, targets the classification of biological entities based on their association with a domain-tailored taxonomy of ca...
172
click to vote
TCS
2002
15 years 5 months ago
2002
We show how formal specifications can be integrated into one of the current pragmatic object-oriented software development methods. Jacobson's "Object-Oriented Software ...
220
click to vote
CAV
1998
Springer
15 years 10 months ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...