A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Filters
Thread Quantification for Concurrent Shape Analysis
[chapter]
Lecture Notes in Computer Science
Preserved Fulltext
In this paper we address the problem of shape analysis for concurrent programs. ...
Thus, our technique lifts existing abstractions by wrapping universal quantification around elements of the base abstract domain. ...
One of the novel contributions of our work is the use of such quantification for concurrent shape analysis by using suitable shape analysis abstractions such as Canonical Abstraction [24] and Boolean ...
doi:10.1007/978-3-540-70545-1_37
fatcat:4esplzndzrcjdbsfpknxprospe
Verifying safety properties of concurrent heap-manipulating programs
2010
ACM Transactions on Programming Languages and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
The framework also provides a precise shape-analysis algorithm for concurrent programs. In contrast to most existing verification techniques, we do not put a bound on the number of allocated objects. ...
We provide a parametric framework for verifying safety properties of concurrent heap-manipulating programs. ...
We thank Noam Rinetzky for comments on an earlier version of this manuscript. ...
doi:10.1145/1745312.1745315
fatcat:734wqj2zdnfwzctwr6ote7dixe
Relational Interprocedural Verification of Concurrent Programs
2009
2009 Seventh IEEE International Conference on Software Engineering and Formal Methods
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We propose a general analysis method for recursive, concurrent programs that tracks effectively procedure calls and returns in a concurrent context, even in the presence of unbounded recursion and infinite-state ...
This method generalizes the relational interprocedural analysis of sequential programs to the concurrent case. ...
It is all the more interesting that the global store is likely to be more complex than the local store (for instance when it includes a model of the memory as in shape analysis [15] ). ...
doi:10.1109/sefm.2009.29
dblp:conf/sefm/Jeannet09
fatcat:mhfta5q7w5brhf4pz3bwz3ibjy
Verified Software Toolchain
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
A runtime system (or operating system, or concurrency library) that serves as the runtime context for external function calls of the machinelanguage program. ...
For both of these reasons, the interfaces between ...
My undergraduate student William Mansky conducted one successful experiment in this vein [26] : he reimplemented in Gallina the concurrent-separation-logic-based shape analysis by Gotsman et al. ...
doi:10.1007/978-3-642-28891-3_2
fatcat:bf4ew3z27fc53ncdxxoryf7fjy
Verified Software Toolchain
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
A runtime system (or operating system, or concurrency library) that serves as the runtime context for external function calls of the machinelanguage program. ...
For both of these reasons, the interfaces between ...
My undergraduate student William Mansky conducted one successful experiment in this vein [26] : he reimplemented in Gallina the concurrent-separation-logic-based shape analysis by Gotsman et al. ...
doi:10.1007/978-3-642-19718-5_1
fatcat:4cxtdmcdfjbbfkhm7y376zkbu4
Compositional Model Extraction for Higher-Order Concurrent Programs
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The reason is that functions of type com → com can use their argument in any number of concurrently running threads, which is powerful enough for encoding the halting problem for counter machines as an ...
In general the moves will have the shape m c 1 ,... ...
Liveness The game model for SCC is derived from an angelic notion of termination which corresponds to trace equivalence. This does not account for deadlock or live-lock. ...
doi:10.1007/11691372_20
fatcat:neghmxinu5bbbgjxsjzgmd4hgi
Parametrized invariance for infinite state processes
2015
Acta Informatica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Our practical motivation is to build a general framework for the temporal verification of concurrent datatypes. ...
several concurrent datatypes, including fine-grained and non-blocking concurrent lists and queues. ...
Other approaches are based on shape analysis, but in general they are limited to a fixed number of threads [4] or limited to fixed data structures or shapes, like simple linked-list data structures ...
doi:10.1007/s00236-015-0222-5
fatcat:gc64hif6qvbgzgtqlalblzlcza
A massively parallel implementation of the Optimal Transportation Meshfree method for explicit solid dynamics
2014
International Journal for Numerical Methods in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
., 2010 for explicit solid dynamics. ...
Its implementation is based on a two-level scheme using Message Passing Interface between compute servers and threaded parallelism on the multi-core processors within each server. ...
(a) static decomposition (b) dynamic decomposition
Figure 16 . 16 Thread concurrency analysis of the simulations of terminal ballistics using eight threads by Intel(R) VTune(TM) Amplifier XE for the ...
doi:10.1002/nme.4710
fatcat:5zvxpteatvhu7j5ywkifnokcte
Use of GPU Computing for Uncertainty Quantification in Computational Mechanics: A Case Study
2011
Scientific Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Five types of analysis procedures that are frequently utilized for uncertainty quantification of mechanical and dynamical systems have been considered and their GPU implementations have been developed. ...
This study explores the use of GPUs for uncertainty quantification in computational mechanics. ...
The complex scalar by which each matrix element is to be multiplied is stored in the constant memory space which allows for fast concurrent access of this constant by all the threads and also saves two ...
doi:10.1155/2011/730213
fatcat:qkk5cz3gzbarnebo6zt2p3nkyq
Tuning the Level of Concurrency in Software Transactional Memory: An Overview of Recent Analytical, Machine Learning and Mixed Approaches
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A means to address run-time efficiency consists in dynamically determining the best-suited level of concurrency (number of threads) to be employed for running the application (or specific application phases ...
For too low levels of concurrency, parallelism can be hampered. ...
via regression analysis. ...
doi:10.1007/978-3-319-14720-8_18
fatcat:mtq4zhjw7fdbrc5x4ejxtwlgha
Application performance analysis and efficient execution on systems with multi-core CPUs, GPUs and MICs: a case study with microscopy image analysis
2016
The international journal of high performance computing applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
GPUs are more efficient than MICs for operations that access data irregularly, because of the lower bandwidth of the MIC for random data accesses. ...
We carry out a comparative performance study of multi-core CPUs, GPUs and Intel Xeon Phi (Many Integrated Core-MIC) with a microscopy image analysis application. ...
Each image is partitioned into 4K×4K tiles, which can be processed concurrently for image analysis. ...
doi:10.1177/1094342015594519
pmid:28239253
pmcid:PMC5319667
fatcat:tchtmfozwfc57hosfna43behoy
Single-Incision vs. Multiport Robotic Sacrocolpopexy: 126 Consecutive Cases at a Single Institution
2021
Journal of Clinical Medicine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We analyzed 126 patients who underwent RSC for POP quantification (all stage III to IV) between March 2019 and May 2021 at Seoul Asan Medical Center. ...
The mean total OT was significantly shorter for MP-RSC than for SI-RSC (105.43 ± 24.03 vs. 121.10 ± 26.28 min). The OT difference was 15.67 min (95% confidence interval, 3.90–25.85, p = 0.009). ...
Statistical analysis was performed using SPSS for Windows (version 20; IBM Corp., Armonk, NY, USA). ...
doi:10.3390/jcm10194457
pmid:34640475
fatcat:bulrntkkofcu5mdhcu5k7n2y6e
Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
2013
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming - ICFP '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Modular programming and modular verification go hand in hand, but most existing logics for concurrency ignore two crucial forms of modularity: higher-order functions, which are essential for building reusable ...
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
Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
2013
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Modular programming and modular verification go hand in hand, but most existing logics for concurrency ignore two crucial forms of modularity: higher-order functions, which are essential for building reusable ...
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
Subjective auxiliary state for coarse-grained concurrency
2013
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
From Owicki-Gries' Resource Invariants and Jones' Rely/Guarantee to modern variants based on Separation Logic, axiomatic logics for concurrency require auxiliary state to explicitly relate the effect of ...
The logic yields simple, compositional proofs of coarse-grained concurrent programs that use auxiliary state, and scales to support higher-order recursive procedures that can themselves fork new threads ...
For example, if k threads concurrently call incr(1), we should be able to deduce that the overall effect is for x to increment by k. ...
doi:10.1145/2429069.2429134
dblp:conf/popl/Ley-WildN13
fatcat:vbmnfkniurd5fdnkgohv2u4aj4
« Previous
Showing results 1 — 15 out of 3,902 results