1410 search results - page 151 / 282 » Proving theorems by reuse |
200
Voted
MKM
2004
Springer
15 years 11 months ago
2004
Springer
As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, ...
140
click to vote
SAT
2004
Springer
15 years 11 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
158
click to vote
OOPSLA
2001
Springer
15 years 10 months ago
2001
Springer
Checking pre- and post-conditions of procedures and methods at runtime helps improve software reliability. In the procedural world, pre- and post-conditions have a straightforward...
166
click to vote
RTSS
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
157
click to vote
COMPSAC
1999
IEEE
15 years 10 months ago
1999
IEEE
The use of formal methods has been growing steadily and there have been a number of successful applications of formal methods in a range of application areas. It seems agreed that...