9521 search results - page 1728 / 1905 » Compiling with continuations, continued |
169
click to vote
RTSS
1998
IEEE
15 years 10 months ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
204
click to vote
AGENTS
1998
Springer
15 years 10 months ago
1998
Springer
Physical domains are notoriously hard to model completely and correctly, especially to capture the dynamics of the environment. Moreover, since environments change, it is even mor...
151
click to vote
IUI
1998
ACM
15 years 10 months ago
1998
ACM
Eliciting user-task models is a thorny problem in modelbased user interface design, and communicating domainspecific knowledge from an expert to a knowledge engineer is a continui...
213
click to vote
CADE
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
223
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...