Sciweavers

ESOP
2009
Springer
14 years 2 months ago
Minimization Algorithm for Symbolic Bisimilarity
The operational semantics of interactive systems is usually d by labeled transition systems. Abstract semantics is defined in terms of bisimilarity that, in the finite case, can ...
Filippo Bonchi, Ugo Montanari
ESOP
2009
Springer
14 years 2 months ago
A Basis for Verifying Multi-threaded Programs
Abstract. Advanced multi-threaded programs apply concurrency concepts in sophisticated ways. For instance, they use fine-grained locking to increase parallelism and change locking...
K. Rustan M. Leino, Peter Müller
ESOP
2009
Springer
14 years 2 months ago
Modular Monad Transformers
Abstract. During the last two decades, monads have become an indispensable tool for structuring functional programs with computational effects. In this setting, the mathematical n...
Mauro Jaskelioff
ESOP
2009
Springer
14 years 2 months ago
Abstract Processes in Orchestration Languages
Maria Grazia Buscemi, Hernán C. Melgratti
ESOP
2009
Springer
14 years 2 months ago
Deny-Guarantee Reasoning
Abstract. Rely-guarantee is a well-established approach to reasoning about concurrent programs that use parallel composition. However, parallel composition is not how concurrency i...
Mike Dodds, Xinyu Feng, Matthew J. Parkinson, Vikt...
ESOP
2009
Springer
14 years 2 months ago
Abstraction for Concurrent Objects
ion for Concurrent Objects Ivana Filipovi´c, Peter O’Hearn, Noam Rinetzky, and Hongseok Yang Queen Mary University of London, UK Concurrent data structures are usually designed ...
Ivana Filipovic, Peter W. O'Hearn, Noam Rinetzky, ...
ESOP
2009
Springer
14 years 2 months ago
An Interval-Based Inference of Variant Parametric Types
Abstract. Variant parametric types (VPT) represent the successful result of combining subtype polymorphism with parametric polymorphism to support a more flexible subtyping for Ja...
Florin Craciun, Wei-Ngan Chin, Guanhua He, Shengch...
ESOP
2009
Springer
14 years 2 months ago
Conversation Types
We present a type theory for analyzing concurrent multiparty interactions as found in service-oriented computing. Our theory introduces a novel and flexible type structure, able t...
Luís Caires, Hugo Torres Vieira
ESOP
2009
Springer
14 years 2 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell