Sciweavers

55 search results - page 10 / 11
» A Hoare Logic for the State Monad
Sort
View
ESOP
2004
Springer
13 years 10 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
JELIA
2004
Springer
13 years 10 months ago
Reasoning About Quantum Systems
Abstract. A new logic is proposed for reasoning about quantum systems. The logic embodies the postulates of quantum physics and it was designed from the semantics upwards by identi...
Paulo Mateus, Amílcar Sernadas
ASIAN
2009
Springer
308views Algorithms» more  ASIAN 2009»
13 years 6 months ago
Automated Security Proof for Symmetric Encryption Modes
Abstract. We presents a compositional Hoare logic for proving semantic security of modes of operation for symmetric key block ciphers. We propose a simple programming language to s...
Martin Gagné, Pascal Lafourcade, Yassine La...
CONCUR
2006
Springer
13 years 7 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
DLT
2008
13 years 6 months ago
Tree Automata with Global Constraints
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison