HomeEPiC SeriesKalpa PublicationsPreprintsFor AuthorsFor Editors
Volume •Abstracts •Preface •Authors •Keywords •BibTex Entries

PSPL 2010: Volume Information

PSPL 2010. International Workshop on Proof Systems for Program Logics

Editors: Alex Simpson
EPiC Series in Computing•Volume 12
6 articles•24 pages•Published: March 24, 2013

Papers

A simple proof system for lock-free concurrency
Luís Caires, Carla Ferreira and António Ravara
1-3
A Developer-oriented Hoare Logic
Holger Gast
4-7
A Proof System for Reasoning about Probabilistic Concurrent Processes
Matteo Mio
8-11
Towards a Cut-free Sequent Calculus for Boolean BI
Sungwoo Park and Jonghyun Park
12-16
A Multi-Modal Dependent Type Theory for Representing Data Accessibility in a Network
Giuseppe Primiero
17-22
Tableau-Like Automata-Based Axiomatization for Propositional Linear Temporal Logic
Nikolay V. Shilov
23-24

Keyphrases

automata-theoretic decision technique, Boolean BI, cut elimination, data accessibility, Distributed and Staged Computing, Hoare logic, Hoare-style Logic, Imperative core calculus, lightweight separation, lock-free algorithms, Modal Type Theory, model checking, mu-calculus2, Probabilistic concurrent processes, Propositional Linear Temporal Logic, separation logic, sequent calculus, understandable verification conditions.

Copyright © 2012-2025 easychair.org. All rights reserved.