Sciweavers

2137 search results - page 157 / 428
» Proving Abstract Non-interference
Sort
View
GRAMMARS
1998
111views more  GRAMMARS 1998»
15 years 2 months ago
Quantitative Comparison of Languages
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
András Kornai
145
Voted
ENTCS
2007
150views more  ENTCS 2007»
15 years 2 months ago
On the Expressiveness of Mobile Synchronizing Petri Nets
In recent papers we have introduced Mobile Synchronizing Petri Nets, a new model for mobility based on coloured Petri Nets. It allows the description of systems composed of a coll...
Fernando Rosa Velardo, David de Frutos-Escrig, Olg...
PADL
2009
Springer
16 years 3 months ago
Declarative Network Verification
Abstract. In this paper, we present our initial design and implementation of a declarative network verifier (DNV). DNV utilizes theorem proving, a well established verification tec...
Anduo Wang, Prithwish Basu, Boon Thau Loo, Oleg So...
111
Voted
CADE
2009
Springer
16 years 3 months ago
Complexity of Fractran and Productivity
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
Clemens Grabmayer, Dimitri Hendriks, Jörg End...
FSE
2009
Springer
125views Cryptology» more  FSE 2009»
16 years 3 months ago
On the Security of Tandem-DM
Abstract. We provide the first proof of security for Tandem-DM, one of the oldest and most wellknown constructions for turning a blockcipher with n-bit blocklength and 2n-bit keyle...
Ewan Fleischmann, Michael Gorski, Stefan Lucks