4126 search results - page 598 / 826 » Relationships with other Formalisms |
176
click to vote
PLDI
2010
ACM
15 years 10 months ago
2010
ACM
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
160
click to vote
CIE
2010
Springer
15 years 10 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
164
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
We consider interval measurement logic IML, a sublogic of Zhou and Hansen's interval logic, with measurement functions which provide real-valued measurement of some aspect of ...
201
click to vote
KBSE
2000
IEEE
15 years 10 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
189
click to vote
ICDCS
1995
IEEE
15 years 10 months ago
1995
IEEE
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...