592 search results - page 85 / 119 » Can Component Service-Based Systems Be Proved Correct |
103
Voted
ISW
2009
Springer
15 years 10 months ago
2009
Springer
A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream c...
125
click to vote
LICS
1989
IEEE
15 years 7 months ago
1989
IEEE
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...
98
Voted
CAV
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...
145
Voted
NIPS
1998
15 years 4 months ago
1998
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
154
click to vote
JOLLI
2008
15 years 3 months ago
2008
This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statemen...