2137 search results - page 212 / 428 » Proving Abstract Non-interference |
137
click to vote
CSL
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
119
Voted
EUROCRYPT
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We present a formalism for the analysis of key-exchange protocols that combines previous definitional approaches and results in a definition of security that enjoys som...
128
Voted
FASE
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
120
Voted
FOSSACS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four ...
119
Voted
LPAR
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...