Filters








6,524 Hits in 7.7 sec

On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models

Azalea Raad, Marko Doko, Lovro Rožić, Ori Lahav, Viktor Vafeiadis
2019 Proceedings of the ACM on Programming Languages (PACMPL)  
While there has been a lot of work on verifying such libraries in a sequentially consistent (SC) environment, little is known about how to specify and verify them under weak memory consistency (WMC).  ...  We propose a general declarative framework that allows us to specify concurrent libraries declaratively, and to verify library implementations against their specifications compositionally.  ...  The first and second authors were supported in part by a European Research Council (ERC) Consolidator Grant for the project łRustBelt", under the European Union Horizon 2020 Framework Programme (grant  ... 
doi:10.1145/3290381 fatcat:pezo7j6z5rgw7ghvblqjgdcbei

CISE3: Verifying Weakly Consistent Applications with Why3 [article]

Filipe Meirim and Mário Pereira and Carla Ferreira
2020 arXiv   pre-print
Our prototype is built on top of the deductive verification platform Why3, which provides a friendly and integrated user experience.  ...  Several case studies have been successfully verified using our tool.  ...  Specifically, the approach would be to use strong consistency whenever the correction of the application is at risk, and employ weak consistency when concurrent execution is safe.  ... 
arXiv:2010.06622v1 fatcat:mvndfb2k4jfkvbbkctixem6hoi

Data Consistency in Transactional Storage Systems: A Centralised Semantics

Shale Xiong, Andrea Cerone, Azalea Raad, Philippa Gardner, Robert Hirschfeld, Tobias Pape
2020 European Conference on Object-Oriented Programming  
We explore two applications of our operational framework: 1) verifying that the COPS replicated database and the Clock-SI partitioned database satisfy their consistency models using trace refinement, and  ...  Using our abstract states, we present operational definitions of well-known consistency models in the literature, and prove them to be equivalent to their existing declarative definitions using abstract  ...  A library is robust against a (weak) consistency model M if, for all its client programs P and all kv-stores K, if K is obtained by executing P under M, then K can also be obtained under SER, i.e. library  ... 
doi:10.4230/lipics.ecoop.2020.21 dblp:conf/ecoop/XiongCRG19 fatcat:dsqhh5fykjgphjw2d7p2hkl3au

Declarative programming over eventually consistent data stores

KC Sivaramakrishnan, Gowtham Kaki, Suresh Jagannathan
2015 SIGPLAN notices  
In this paper, we present QUELEA, a declarative programming model for eventually consistent data stores (ECDS), equipped with a contract language, capable of specifying fine-grained applicationlevel consistency  ...  However, geo-distribution does not come for free; application developers have to contend with weak consistency behaviors, and the lack of abstractions to composably construct high-level replicated data  ...  This work is supported in part by the National Science Foundation under grants CCF-1216613 and CCF-1318227.  ... 
doi:10.1145/2813885.2737981 fatcat:n2uvbzmxjrhbhbkmmtke6qthmm

Declarative programming over eventually consistent data stores

KC Sivaramakrishnan, Gowtham Kaki, Suresh Jagannathan
2015 Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015  
In this paper, we present QUELEA, a declarative programming model for eventually consistent data stores (ECDS), equipped with a contract language, capable of specifying fine-grained applicationlevel consistency  ...  However, geo-distribution does not come for free; application developers have to contend with weak consistency behaviors, and the lack of abstractions to composably construct high-level replicated data  ...  This work is supported in part by the National Science Foundation under grants CCF-1216613 and CCF-1318227.  ... 
doi:10.1145/2737924.2737981 dblp:conf/pldi/Sivaramakrishnan15 fatcat:2qhjwzp2dzgh5bznrbolzutu4y

Design and evaluation of a conit-based continuous consistency model for replicated services

Haifeng Yu, Amin Vahdat
2002 ACM Transactions on Computer Systems  
This paper explores the semantic space between traditional strong and optimistic consistency models for replicated services.  ...  Thus, we develop a conit-based continuous consistency model to capture the consistency spectrum using three application-independent metrics, numerical error, order error, and staleness.  ...  Jeff Chase and Doug Terry provided a number of insightful comments on the TACT design. Special thanks to Phil Bernstein for helpful discussion on the presentation of our work and future directions.  ... 
doi:10.1145/566340.566342 fatcat:q3phn7bnhbcsflq74zmz42f3bi

Semantics, Specification, and Bounded Verification of Concurrent Libraries in Replicated Systems [chapter]

Kartik Nagar, Prasita Mukherjee, Suresh Jagannathan
2020 Lecture Notes in Computer Science  
Unfortunately, programming correct applications on top of such systems has proven to be very challenging, in large part because of the weak consistency guarantees they offer.  ...  But, identifying a suitable notion of correctness to check their validity under a weakly consistent execution model has not been well-studied, in large part because it is problematic to naïvely transplant  ...  This material is based upon work supported by the National Science Foundation under Grant No. CCF-SHF 1717741.  ... 
doi:10.1007/978-3-030-53288-8_13 fatcat:3wx2jru3wvaynhdsufpy7gl5my

Efficient Dynamic Updates of Distributed Components Through Version Consistency

Luciano Baresi, Carlo Ghezzi, Xiaoxing Ma, Valerio Panzica La Manna
2017 IEEE Transactions on Software Engineering  
The paper presents a distributed algorithm for checking version consistency efficiently, formalizes the proposed approach by means of a graph transformation system, and verifies its correctness through  ...  Version consistency ensures that distributed transactions be served as if they were operated on a single coherent version of the system despite possible concurrent updates.  ...  The work presented in this paper has been partially supported by the 973 Program of China under grant No. 2015CB352202, NSFC under grants No. 61472177 and 91318301, by project EEB-Edifici a zero consumo  ... 
doi:10.1109/tse.2016.2592913 fatcat:ixlhvddz5ngltj3uobshduik5i

Semantics, Specification, and Bounded Verification of Concurrent Libraries in Replicated Systems [article]

Kartik Nagar, Prasita Mukherjee, Suresh Jagannathan
2020 arXiv   pre-print
Unfortunately, programming correct applications on top of such systems has proven to be very challenging, in large part because of the weak consistency guarantees they offer.  ...  But, identifying a suitable notion of correctness to check their validity under a weakly consistent execution model has not been well-studied, in large part because it is problematic to naively transplant  ...  There has also been recent interest in specifying and verifying library implementations in the context of weak memory models [14, 31] .  ... 
arXiv:2004.10158v1 fatcat:mon343fb6fff5gubcqvoy2qyvy

Data Consistency in Transactional Storage Systems: a Centralised Approach [article]

Shale Xiong, Andrea Cerone, Azalea Raad, Philippa Gardner
2019 arXiv   pre-print
against a weak consistency model.  ...  We provide operational definitions of consistency models for our key-value stores which are shown to be equivalent to the well-known declarative definitions of consistency model for execution graphs.  ...  Nagar and Jagannathan [2018] propose an operational semantics for weak consistency based on abstract executions. Their semantics is parametric in the declarative definition of a consistency model.  ... 
arXiv:1901.10615v2 fatcat:vudgmqlgongppbm6a5yeonijy4

Verifying C11-Style Weak Memory Libraries via Refinement [article]

Sadegh Dalvandi, Brijesh Dongol
2021 arXiv   pre-print
Deductive verification of concurrent programs under weak memory has thus far been limited to simple programs over a monolithic state space.  ...  This paper addresses this challenge in the context of RC11 RAR, a subset of the C11 memory model that admits relaxed and release-acquire accesses, but disallows, so-called, load-buffering cycles.  ...  clients and libraries in a weak memory model.  ... 
arXiv:2108.06944v1 fatcat:lzh62akejrhhjpsykypxa62wt4

High availability, elasticity, and strong consistency for massively parallel scans over relational data

Philipp Unterbrunner, Gustavo Alonso, Donald Kossmann
2013 The VLDB journal  
Existing data stores with strong consistency guarantees are designed and optimized for small updates, key-value access, and (if supported) small range queries over a predefined key column.  ...  This paper focuses on the distribution layer of Crescando/RB, the problem and theory behind it, the rationale underlying key design decisions, and the novel multicast protocol and replication framework  ...  Some NoSQL data stores abandon strong consistency in favor of weak or eventual consistency.  ... 
doi:10.1007/s00778-013-0343-9 fatcat:byucle2e5jeavoho4qb5cjnofi

A Primer on Memory Consistency and Cache Coherence, Second Edition

Vijay Nagarajan, Daniel J. Sorin, Mark D. Hill, David A. Wood
2020 Synthesis Lectures on Computer Architecture  
weak consistency model.  ...  SPECIFYING AND VALIDATING MEMORY CONSISTENCY MODELS 11. SPECIFYING AND VALIDATING MEMORY CONSISTENCY MODELS  ...  Since data1 is now invalid in the L1 of the CPU, when Ld2 is performed by the CPU, it would get the correct value of NEW from the LLC.  ... 
doi:10.2200/s00962ed2v01y201910cac049 fatcat:diry32l6dva5xbsgzuc7fvq7ie

Weak persistency semantics from the ground up: formalising the persistency semantics of ARMv8 and transactional models

Azalea Raad, John Wickerson, Viktor Vafeiadis
2019 Proceedings of the ACM on Programming Languages (PACMPL)  
To close this gap, we present a formal declarative framework for describing concurrency models in the NVM context, and then develop the PARMv8 persistency model as an instance of our framework, formalising  ...  To facilitate correct persistent programming, we study transactions as a simple abstraction for concurrency and persistency control.  ...  We thank William Wang for his insightful feedback and helpful discussions.  ... 
doi:10.1145/3360561 fatcat:y5ugov4hnbcmjnnbkyokhxr5wy

JBMC: Bounded Model Checking for Java Bytecode [chapter]

Lucas Cordeiro, Daniel Kroening, Peter Schrammel
2019 Msphere  
JBMC is a bounded model checking tool for verifying Java bytecode. It is built on top of the CPROVER framework. JBMC processes Java bytecode together with a model of the standard Java libraries.  ...  It checks a set of desired properties, such as assertions and absence of uncaught exceptions, under given bounds on loops, recursion and data structures.  ...  In particular, JBMC consists of a frontend for parsing Java bytecode and a Java operational model (JOM), which is an exact but verification-friendly model of the standard Java libraries.  ... 
doi:10.1007/978-3-030-17502-3_17 fatcat:hpshkhaz3vg2zoki2pzigavcgy
« Previous Showing results 1 — 15 out of 6,524 results