Sciweavers

443 search results - page 13 / 89
» Relations in Concurrency
Sort
View
TPHOL
2007
IEEE
14 years 3 months ago
Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
This paper concerns the formal semantics of programming languages, and the specification and verification of software. We are interested in the verification of real programs, wr...
Tom Ridge
KBSE
1997
IEEE
14 years 1 months ago
Modular Flow Analysis for Concurrent Software
Modern software systems are designed and implemented in a modular fashion by composing individual components. Early validation of individual module designs and implementations off...
Matthew B. Dwyer
CONCUR
2010
Springer
13 years 10 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...
ICFEM
2000
Springer
14 years 11 days ago
Fragmented Retrenchment, Concurrency and Fairness
Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and brie...
Richard Banach, Michael Poppleton
SIGMOD
2010
ACM
221views Database» more  SIGMOD 2010»
14 years 1 months ago
Low overhead concurrency control for partitioned main memory databases
Database partitioning is a technique for improving the performance of distributed OLTP databases, since “single partition” transactions that access data on one partition do no...
Evan P. C. Jones, Daniel J. Abadi, Samuel Madden