2137 search results - page 81 / 428 » Proving Abstract Non-interference |
165
click to vote
BIRTHDAY
2005
Springer
15 years 11 months ago
2005
Springer
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is...
167
click to vote
FOSSACS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
152
click to vote
IFM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
160
click to vote
LPAR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
155
click to vote
MKM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In a problem solving process, a step may not result in the expected progress or may not be applicable as expected. Hence, knowledge how to overcome and react to impasses ...