Filters








67 Hits in 9.7 sec

TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs [article]

Emanuele D'Osualdo, Azadeh Farzan, Philippa Gardner, Julian Sutherland
2019 arXiv   pre-print
We introduce TaDA Live, a separation logic for reasoning compositionally about the termination of blocking fine-grained concurrent programs.  ...  The logic contributes several innovations to obtain modular rely/guarantee style reasoning for liveness properties and to blend them with logical atomicity.  ...  ACKNOWLEDGMENTS We would like to thank Hongjin Liang, Xinyu Feng, Shale Xiong and Petar Maksimovic, for the helpful discussions and feedback.  ... 
arXiv:1901.05750v2 fatcat:ncz7cjhq6nd2xhf6or5o2brpg4

A Separation Logic to Verify Termination of Busy-Waiting for Abrupt Program Exit [article]

Tobias Reinhard, Amin Timany, Bart Jacobs
2020 arXiv   pre-print
Programs for multiprocessor machines commonly perform busy-waiting for synchronisation. In this paper, we make a first step towards proving termination of such programs.  ...  We propose a separation logic for modularly verifying termination (under fair scheduling) of programs where some threads eventually abruptly terminate the program, and other threads busy-wait for this  ...  This logic allows to modularly reason about fine-grained concurrent programs and blocking operations that are implemented in terms of busy-waiting and non-blocking primitives.  ... 
arXiv:2010.07800v2 fatcat:rba7vzqoifgqdb3petp6wxj45a

Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity [article]

Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee
2014 arXiv   pre-print
We present a lightweight approach to Hoare-style specifications for fine-grained concurrency, based on a notion of time-stamped histories that abstractly capture atomic changes in the program state.  ...  , making them equally convenient for client-side reasoning.  ...  One can make use of a refined, fine-grained, implementation for efficiency in programming, but then soundly replace it with a more abstract coarse-grained implementation, to simplify the reasoning about  ... 
arXiv:1410.0306v1 fatcat:ikct3rfxnje6laj33pdo5nsfyy

Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity [chapter]

Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee
2015 Lecture Notes in Computer Science  
We present a lightweight approach to Hoare-style specifications for fine-grained concurrency, based on a notion of time-stamped histories that abstractly capture atomic changes in the program state.  ...  , making them equally convenient for client-side reasoning.  ...  One can make use of a refined, fine-grained, implementation for efficiency in programming, but then soundly replace it with a more abstract coarse-grained implementation, to simplify the reasoning about  ... 
doi:10.1007/978-3-662-46669-8_14 fatcat:j5e3z724xnb4piqttzumdnoali

Iron: managing obligations in higher-order concurrent separation logic

Aleš Bizjak, Daniel Gratzer, Robbert Krebbers, Lars Birkedal
2019 Proceedings of the ACM on Programming Languages (PACMPL)  
We present Iron, a novel higher-order concurrent separation logic that allows for precise reasoning about resources that are transferable among dynamically allocated threads.  ...  We show soundness of Iron by means of a model of Iron, defined on top of the Iris base logic, and we use this model to prove that memory resources are accounted for precisely and not leaked.  ...  This research was supported by the ModuRes Sapere Aude Advanced Grant from The Danish Council for Independent Research for the Natural Sciences (FNU).  ... 
doi:10.1145/3290378 fatcat:6zwu54msfzdvjddsoi256gvnfy

An Abstraction Technique for Verifying Shared-Memory Concurrency

Wytse Oortwijn, Dilian Gurov, Marieke Huisman
2020 Applied Sciences  
This paper contributes a technique for verifying behavioural properties of concurrent and distributed programs that balances expressivity and usability.  ...  To be able to reason about realistic programs, these techniques must be modular and compositional as well as practical by being supported by automated tools.  ...  We are currently further investigating the use of mCRL2 to reason algorithmically about program abstractions, e.g., [73] .  ... 
doi:10.3390/app10113928 fatcat:r2t25evrhfc5hjho7g5lxd3hj4

Report from Dagstuhl Seminar 15191 Compositional Verification Methods for Next-Generation Concurrency 1 Executive Summary

Lars Birkedal, Derek Dreyer, Philippa Gardner, Zhong Shao, Lars Birkedal, Derek Dreyer, Philippa Gardner, Zhong Shao, Lars Birkedal, Derek Dreyer, Philippa Gardner, Zhong Shao
unpublished
The seminar was successful and facilitated a stimulating interchange between the theory and practice of concurrent programming, and thereby laid the ground for the development of compositional verification  ...  This report documents the program and the outcomes of Dagstuhl Seminar 15191 "Composi-tional Verification Methods for Next-Generation Concurrency".  ...  How can we adapt existing and develop new compositional techniques for reasoning about liveness properties of concurrent programs?  ... 
fatcat:m4g3ki2k4vaj3eun3re3vmjoca

Iris from the ground up: A modular foundation for higher-order concurrent separation logic

RALF JUNG, ROBBERT KREBBERS, JACQUES-HENRI JOURDAN, ALEŠ BIZJAK, LARS BIRKEDAL, DEREK DREYER
2018 Journal of functional programming  
Iris is a framework for higher-order concurrent separation logic, which has been implemented in the Coq proof assistant and deployed very effectively in a wide variety of verification projects.  ...  Here, we attempt to fill this gap, presenting a reasonably complete picture of the latest version of Iris (version 3.1), from first principles and in one coherent narrative.  ...  We also give many thanks to all those who have contributed to the development, implementation, and applications of the Iris framework.  ... 
doi:10.1017/s0956796818000151 fatcat:dqloex3225b7xcq3ij5lpveqim

Towards Runtime Adaptation of Actor Systems [article]

Ian Cassar
2017 arXiv   pre-print
In this dissertation we focus on providing effective adaptations that can be localised and applied to specific concurrent actors, thereby only causing a temporary disruption to the parts of the system  ...  Based on this dynamically checked model of our RA framework, we prove type soundness for our static type system.  ...  Following this in Sec. 3.2, we explore techniques for reducing the level of synchrony to a more fine-grained level, while still being able to achieve timely detections.  ... 
arXiv:1709.02346v1 fatcat:j47vh2ufszhzrfoamilko7fph4

Reasoning with time and data abstractions

Pedro Da Rocha Pinto, Engineering And Physical Sciences Research Council, Philippa Gardner
2017
In this thesis, we address the problem of verifying the functional correctness of concurrent programs, with emphasis on fine-grained concurrent data structures.  ...  We also present Total-TaDA, a sound extension of TaDA with which we can verify total correctness of concurrent programs, i.e. that such programs both produce the correct result and terminate.  ...  In this chapter, we extend TaDA with well-founded termination reasoning. With the resulting logic, Total-TaDA, we can prove total correctness of fine-grained concurrent programs.  ... 
doi:10.25560/47923 fatcat:aj5iy764zfhibno4ukctvyvi5i

Proton and calcium pumping P-type ATPases and their regulation of plant responses to the environment

Anja T Fuglsang, Michael Palmgren
2021 Plant Physiology  
A common paradigm for both types of pumps is the presence of terminal regulatory (R) domains that function as autoinhibitors that can be neutralized by multiple means, including phosphorylation.  ...  Plant plasma membrane H+-ATPases and Ca2+-ATPases maintain low cytoplasmic concentrations of H+ and Ca2+, respectively, and are essential for plant growth and development.  ...  In this case it may be reasonable to assume that isoform diversity is merely a means 505 for controlling the tissue-specific distribution of ACAs within the cellular space and over time.  ... 
doi:10.1093/plphys/kiab330 fatcat:mmustrcg3nhyhivd33zyxm2adq

Reasoning about POSIX file systems

Gian Ntzik, Philippa Gardner
2017
We provide a formal concurrent specification of POSIX file systems and demonstrate scalable reasoning for clients.  ...  We use concurrent separation logic as an instance of the framework to illustrate our reasoning, and explore programs using write-ahead logging, s [...]  ...  In section 3.4 we discuss the development of program logics for fine-grained concurrency and in section 3.5 we expand our discussion on fine-grained concurrency to cover reasoning about atomicity.  ... 
doi:10.25560/48487 fatcat:wzuyddrlzbhmle6kwthn2qpg7e

Abstracts of the 7th Baltic Genetic Congress

2018 Environmental and Experimental Biology  
of their productivity "of R&D Program of the Natl.  ...  Acknowledgements The study was conducted with the financial support of GPNI Fundamentals of Biotechnology for 2016-2018 in the Genomics 2.13 program.  ...  Several reasons are known for this phenomenon. One of these could be the "risk" genotype.  ... 
doi:10.22364/eeb.16.18 fatcat:7ynirmvghzfifdhpzwnesji2oa

Frontiers in Electronics and Photonics

2018 The Electrochemical Society Interface  
(NRL), Stephen Pearton (University of Florida), and Fan Ren (University of Florida) for proofreading drafts of this article. Research  ...  Acknowledgments The author is grateful to the NRL Ga 2 O 3 enthusiasts group for numerous collaborative efforts and insightful discussions, many external academic and industrial collaborators, as well  ...  ECS is probably one of the best examples on this topic-for a variety of reasons.  ... 
doi:10.1149/2.20184if fatcat:fpurz3p5b5f57pwcxdhibn674y

Editors' Preface

Wout Dillen, Elli Bleeker, Laura Esteban-Segura, Stefano Rosignoli
2021 Variants  
The fine-grained data of keystroke logging therefore allows for a new type of what can be called "nanogenetic" research. 10 Central to a work's nanogenesis would be the author's movement through the  ...  Overall, then, the General Analysis provides information about what was written where and when, and therefore provides all the details needed for a fine-grained reconstruction of the writing process.  ...  Elli Bleeker is a researcher at the Huygens Institute for the History of the Netherlands.  ... 
doi:10.4000/variants.1239 fatcat:ka26dx266nfhxdbjxcqbfmsala
« Previous Showing results 1 — 15 out of 67 results