2236 search results - page 442 / 448 » Language Independence and Language Tolerance in Logic Progra... |
106
click to vote
ALT
1995
Springer
15 years 3 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
111
click to vote
JACM
2002
14 years 11 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
102
click to vote
LCTRTS
2007
Springer
15 years 5 months ago
2007
Springer
Embedded systems serve an emerging and diverse set of applications. As a result, more computational and storage capabilities are added to accommodate ever more demanding applicati...
SIGSOFT
2001
ACM
16 years 10 days ago
2001
ACM
Prior research in software environments focused on three important problems-- tool integration, artifact management, and process guidance. The context for that research, and hence...
115
click to vote
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...