Sciweavers

442 search results - page 7 / 89
» Proof Abstraction for Imperative Languages
Sort
View
ENTCS
2008
140views more  ENTCS 2008»
13 years 7 months ago
Higher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
Carsten Varming, Lars Birkedal
CONCUR
2010
Springer
13 years 8 months ago
Termination in Impure Concurrent Languages
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
ICTAC
2009
Springer
14 years 2 months ago
A Deadlock-Free Semantics for Shared Memory Concurrency
Abstract. We design a deadlock-free semantics for a concurrent, functional and imperative programming language where locks are implicitly and univocally associated with pointers. T...
Gérard Boudol
DAGSTUHL
1996
13 years 8 months ago
Practical Aspects of Specialization of Algol-like Programs
Abstract. A \linearized" scheme of polyvariant specialization for imperative languages is described in the paper. The scheme is intended for increasing e ciency of specializat...
Mikhail A. Bulyonkov, Dmitry V. Kochetov
APLAS
2009
ACM
14 years 2 months ago
Proving Copyless Message Passing
Handling concurrency using a shared memory and locks is tedious and error-prone. One solution is to use message passing instead. We study here a particular, contract-based flavor ...
Jules Villard, Étienne Lozes, Cristiano Cal...