Sciweavers

28 search results - page 6 / 6
» Combining Classical and Intuitionistic Implications
Sort
View
POPL
2008
ACM
14 years 4 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
ICA3PP
2005
Springer
13 years 10 months ago
GridMD: Program Architecture for Distributed Molecular Simulation
In the present work we describe architectural concepts of the distributed molecular simulation package GridMD. The main purpose of this work is to underline the construction patter...
Ilya Valuev
PODC
2012
ACM
11 years 7 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...