39 citations · 101 across the 6 of their papers we have counts for
7 papers
Tenderbake -- A Solution to Dynamic Repeated Consensus for Blockchains
Lăcrămioara Aştefanoaei, Pierre Chambart, Antonella Del Pozzo +3
First-generation blockchains provide probabilistic finality: a block can be revoked, albeit the probability decreases as the block sinks deeper into the chain. Recent proposals rev…
Runtime Verification over Out-of-order Streams
David Basin, Felix Klaedtke, Eugen Zalinescu
We present an approach for verifying systems at runtime. Our approach targets distributed systems whose components communicate with monitors over unreliable channels, where message…
Enforcing Programming Guidelines with Region Types and Effects
Serdar Erbatur, Martin Hofmann, Eugen Zalinescu
We present in this paper a new type and effect system for Java which can be used to ensure adherence to guidelines for secure web programming. The system is based on the region and…
Verifying Security Policies in Multi-agent Workflows with Loops
Bernd Finkbeiner, Christian Müller, Helmut Seidl +1
We consider the automatic verification of information flow security policies of web-based workflows, such as conference submission systems like EasyChair. Our workflow description…
Runtime Verification of Temporal Properties over Out-of-order Data Streams
David Basin, Felix Klaedtke, Eugen Zălinescu
We present a monitoring approach for verifying systems at runtime. Our approach targets systems whose components communicate with the monitors over unreliable channels, where messa…
Deciding security properties for cryptographic protocols. Application to key cycles
Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu
There is a large amount of work dedicated to the formal verification of security protocols. In this paper, we revisit and extend the NP-complete decision procedure for a bounded nu…
Relating two standard notions of secrecy
Veronique Cortier, Michael Rusinovitch, Eugen Zalinescu
Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s should never…