5255 search results - page 661 / 1051 » Formal Methods for Privacy |
159
click to vote
IFIP
2005
Springer
16 years 10 days ago
2005
Springer
We present a method for trust scenarios with more than one trustee, where sets of trustees are ordered in a relation of relative trustworthiness. We show how a priority structure i...
172
click to vote
IFL
2005
Springer
16 years 10 days ago
2005
Springer
With-loops are versatile array comprehensions used in the functional array language SaC to implement universally applicable array operations. We describe the fusion of with-loops a...
145
click to vote
IFL
2005
Springer
16 years 10 days ago
2005
Springer
Abstract Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevan...
184
click to vote
CAV
2004
Springer
16 years 7 days ago
2004
Springer
The counterexamples produced by model checkers are often lengthy and difficult to understand. In practical verification, showing the existence of a (potential) bug is not enough: ...
162
Voted
CAV
2004
Springer
16 years 7 days ago
2004
Springer
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...