13383 search results - page 334 / 2677 » Abstractions from proofs |
171
click to vote
CHARME
2003
Springer
16 years 6 hour ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
189
click to vote
DBPL
1995
Springer
15 years 10 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
201
click to vote
ISTCS
1992
Springer
15 years 10 months ago
1992
Springer
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
219
click to vote
CCS
2003
ACM
16 years 6 hour ago
2003
ACM
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...
209
click to vote
AMAI
1998
Springer
15 years 6 months ago
1998
Springer
Overgeneralization is a major issue in the identification of grammars for formal languages from positive data. Different formulations of generalization and specialization strate...