5084 search results - page 678 / 1017 » Proving Possibility Properties |
166
click to vote
COMPSAC
1999
IEEE
15 years 11 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...
200
click to vote
IEEEPACT
1999
IEEE
15 years 11 months ago
1999
IEEE
Automatic parallelization of general-purpose programs is still not possible in general in the presence of irregular data structures and complex control-flows. One promising strate...
181
click to vote
KBSE
1999
IEEE
15 years 11 months ago
1999
IEEE
Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of...
200
click to vote
RTSS
1999
IEEE
15 years 11 months ago
1999
IEEE
Reward-based scheduling refers to the problem in which there is a reward associated with the execution of a task. In our framework, each real-time task comprises a mandatory and a...
169
click to vote
VLSID
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we address the problem of detailed FPGA routing using Boolean formulation methods. In the context of FPGA routing where routing resources are fixed, Boolean formulat...