Filters








67,688 Hits in 3.1 sec

Abstraction, refinement and concurrent reasoning

Azalea Raad, Sophia Drossopoulou, Philippa Gardner
2017
This thesis explores the challenges in abstract library specification, library refinement and reasoning about fine-grained concurrent programs.  ...  As to concurrent reasoning, this thesis introduces concurrent local subjective logic (CoLoSL) for compositional reasoning about fine-grained concurrent programs.  ...  Abstract This thesis explores the challenges in abstract library specification, library refinement and reasoning about fine-grained concurrent programs.  ... 
doi:10.25560/49218 fatcat:lmycxnei7re33o4rejylnuahcq

Towards linking correctness conditions for concurrent objects and contextual trace refinement

Brijesh Dongol, Lindsay Groves
2016 Electronic Proceedings in Theoretical Computer Science  
Correctness conditions for concurrent objects describe how atomicity of an abstract sequential object may be decomposed.  ...  This paper presents the main issues that surround this question and provides some answers by linking different correctness conditions with a form of trace refinement.  ...  We have also shown that linearizability between an abstract specification and its linearizable implementation implies contextual trace refinement. Gotsman and Yang [4] also extend Filipović et al.'  ... 
doi:10.4204/eptcs.209.8 fatcat:itxz4crrfzgqddhnfuzs3z7erq

Layered Concurrent Programs [chapter]

Bernhard Kragl, Shaz Qadeer
2018 Lecture Notes in Computer Science  
We present layered concurrent programs, a compact and expressive notation for specifying refinement proofs of concurrent programs.  ...  A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once.  ...  Henzinger, Viktor Toman, and James R. Wilcox for comments that improved this paper.  ... 
doi:10.1007/978-3-319-96145-3_5 fatcat:coe4wsx6lbc53fnbszh5333csy

Automated and Modular Refinement Reasoning for Concurrent Programs [chapter]

Chris Hawblitzel, Erez Petrank, Shaz Qadeer, Serdar Tasiran
2015 Lecture Notes in Computer Science  
We present civl, a language and verifier for concurrent programs based on automated and modular refinement reasoning. civl supports reasoning about a concurrent program at many levels of abstraction.  ...  We have used civl to refine a realistic concurrent garbage collection algorithm from a simple high-level specification down to a highly-concurrent implementation described in terms of individual memory  ...  We supply very primitive abstractions and let programmers mix and match these abstractions freely to encode the non-interference reasoning style of their choice.  ... 
doi:10.1007/978-3-319-21668-3_26 fatcat:n2eslalhbzfbtbeplhbj65pwju

Progress of Concurrent Objects

Hongjin Liang, Xinyu Feng
2020 Foundations and Trends® in Programming Languages  
The equivalence results allow us to build abstractions for linearizable objects so that safety and progress of the client code can be reasoned about at a more abstract level.  ...  The reasoning about these objects suffers from the same problems too when progress is concerned. In this tutorial, we specify and verify progress of concurrent objects with partial methods.  ... 
doi:10.1561/2500000041 fatcat:5ko7v5ggmrdoddfqnv24w62g24

Data refinement for true concurrency

Brijesh Dongol, John Derrick
2013 Electronic Proceedings in Theoretical Computer Science  
The majority of modern systems exhibit sophisticated concurrent behaviour, where several system components modify and observe the system state with fine-grained atomicity.  ...  By modifying the type of an interval, our theory may be specialised to cover data refinement of both discrete and continuous systems.  ...  Action refinement for true concurrency in a causal setting is studied in [28] , and a modal logic for reasoning about true concurrency is given in [4] .  ... 
doi:10.4204/eptcs.115.2 fatcat:2zvq4p7zxragznr3pth4w7rffa

YOGAR-CBMC: CBMC with Scheduling Constraint Based Abstraction Refinement [chapter]

Liangze Yin, Wei Dong, Wanwei Liu, Yunchou Li, Ji Wang
2018 Lecture Notes in Computer Science  
It employs a scheduling constraint based abstraction refinement method for bounded model checking of concurrent programs.  ...  To obtain effective refinement constraints, we have proposed the notion of Event Order Graph (EOG), and have devised two graph-based algorithms over EOG for counterexample validation and refinement generation  ...  If an infeasibility is determined, a constraintbased refinement generation process is performed to refine the abstraction, which obtains only one kernel reason of the infeasibility.  ... 
doi:10.1007/978-3-319-89963-3_25 fatcat:tapfxftbgvejrhdahcp547hczm

Verification of Concurrent Programs Using Trace Abstraction Refinement [chapter]

Franck Cassez, Frowin Ziegler
2015 Lecture Notes in Computer Science  
an abstract over-approximation of a program via predicate refinement.  ...  space is the Cartesian product of the control state space of the concurrent components and thus grows exponentially in the number of components.  ...  Conclusion and Ongoing Work We have proposed a new method for verifying concurrent programs based on trace abstraction refinement and partial order reduction techniques.  ... 
doi:10.1007/978-3-662-48899-7_17 fatcat:zylnorrtsjdjnpawvrpwjqdgby

Synthesis of Memory Fences via Refinement Propagation [chapter]

Yuri Meshman, Andrei Dan, Martin Vechev, Eran Yahav
2014 Lecture Notes in Computer Science  
This enables us to combine abstraction refinement over booleans with powerful numerical abstractions over the integers.  ...  (ii) synthesis with refinement propagation: to synthesize fences for a program P , we combine abstraction refinements used for successful synthesis of programs coarser than P into a new candidate abstraction  ...  Unfortunately, manually reasoning where to place fences in a concurrent program running on a relaxed architecture is a challenging task.  ... 
doi:10.1007/978-3-319-10936-7_15 fatcat:mu4y3whi2bbzhaltvsam7gthm4

Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency

Aaron Turon, Derek Dreyer, Lars Birkedal
2013 SIGPLAN notices  
components, and granularity abstraction, a key technique for hiding the intricacies of fine-grained concurrent data structures from the clients of those data structures.  ...  In this paper, we present CaReSL, the first logic to support the use of granularity abstraction for modular verification of higher-order concurrent programs.  ...  Acknowledgments We would like to thank David Swasey for his careful reading of both the paper and its appendix. This work was partially funded by the EC FET project ADVENT.  ... 
doi:10.1145/2544174.2500600 fatcat:v2zxoi27gjgvzjqavp6tg24rfm

Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency

Aaron Turon, Derek Dreyer, Lars Birkedal
2013 Proceedings of the 18th ACM SIGPLAN international conference on Functional programming - ICFP '13  
components, and granularity abstraction, a key technique for hiding the intricacies of fine-grained concurrent data structures from the clients of those data structures.  ...  In this paper, we present CaReSL, the first logic to support the use of granularity abstraction for modular verification of higher-order concurrent programs.  ...  Acknowledgments We would like to thank David Swasey for his careful reading of both the paper and its appendix. This work was partially funded by the EC FET project ADVENT.  ... 
doi:10.1145/2500365.2500600 dblp:conf/icfp/TuronDB13 fatcat:7xzlsn5qhjgljh3gt66xjq44oy

A separation logic for refining concurrent objects

Aaron Joseph Turon, Mitchell Wand
2011 Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '11  
Recent literature has made large strides in verifying these data structures, using either atomicity refinement or separation logic with rely-guarantee reasoning.  ...  The result is a logic that enables compositional reasoning about atomicity and interference, even for programs that use fine-grained synchronization and dynamic memory allocation.  ...  Acknowledgements Thanks to Dan Brown, Claudio Russo and Sam Tobin-Hochstadt for feedback and discussions. The first author was supported by a grant from Microsoft Research.  ... 
doi:10.1145/1926385.1926415 dblp:conf/popl/TuronW11 fatcat:qouw3ywoabdyfnklwbkddrp7ii

A separation logic for refining concurrent objects

Aaron Joseph Turon, Mitchell Wand
2011 SIGPLAN notices  
Recent literature has made large strides in verifying these data structures, using either atomicity refinement or separation logic with rely-guarantee reasoning.  ...  The result is a logic that enables compositional reasoning about atomicity and interference, even for programs that use fine-grained synchronization and dynamic memory allocation.  ...  Acknowledgements Thanks to Dan Brown, Claudio Russo and Sam Tobin-Hochstadt for feedback and discussions. The first author was supported by a grant from Microsoft Research.  ... 
doi:10.1145/1925844.1926415 fatcat:ruaacgd3azdvdj4bk4qq3g4oku

Verifying concurrent, crash-safe systems with Perennial

Tej Chajed, Joseph Tassarotti, M. Frans Kaashoek, Nickolai Zeldovich
2019 Proceedings of the 27th ACM Symposium on Operating Systems Principles - SOSP '19  
This research was supported by NSF awards CNS-1563763 and CCF-1836712, Google, and Oracle Labs. Tej Chajed is supported by an SOSP 2019 student scholarship from the National Science Foundation.  ...  Acknowledgments We'd like to thank Butler Lampson, Jay Lorch, the anonymous reviewers, and our shepherd, Gernot Heiser, who provided comments that helped improve this paper.  ...  Proving concurrent recovery refinement Perennial extends Iris with techniques for reasoning about crashes and provides a theorem that connects Hoare triples in Iris to concurrent recovery refinement.  ... 
doi:10.1145/3341301.3359632 dblp:conf/sosp/ChajedTKZ19 fatcat:wy6mqxzmwraxdngzxwitj6xuxa

Interval-based data refinement: A uniform approach to true concurrency in discrete and real-time systems

Brijesh Dongol, John Derrick
2015 Science of Computer Programming  
Data refinement, a correctness criterion to compare an abstract and a concrete implementation, normally admits interleaved models of execution only.  ...  In this paper, we present a method of data refinement using a framework that allows one to view a component's evolution over an interval of time, simplifying reasoning about true concurrency.  ...  We are indebted to our anonymous reviewers from this journal as well as those from REFINE 13 for their comments on the workshop version of this paper.  ... 
doi:10.1016/j.scico.2015.05.005 fatcat:7lyjg6pov5hsvhaaycax6tdm6i
« Previous Showing results 1 — 15 out of 67,688 results