4036 search results - page 350 / 808 » Formal Methods |
219
click to vote
TCS
1998
15 years 6 months ago
1998
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
117
click to vote
SIGSOFT
2003
ACM
16 years 7 months ago
2003
ACM
d Abstract) Eunyoung Lee Andrew W. Appel Department of Computer Science Princeton University {elee,appel}@cs.princeton.edu Categories and Subject Descriptors D.2.4 [Software Engine...
184
click to vote
IACR
2011
14 years 6 months ago
2011
We investigate public key encryption that allows the originator of a ciphertext to retrieve a “forgotten” plaintext from the ciphertext. This type of public key encryption wit...
155
click to vote
IJCAI
2003
15 years 8 months ago
2003
The ability to recognize when an agent abandons a plan is an open problem in the plan recognition literature and is a significant problem if these methods are to be applied in rea...
215
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Many long-lived and distributed systems must remain available yet evolve over time, due to, e.g., bugfixes, feature extensions, or changing user requirements. To facilit...