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
.
Filters
Fine-Grained Complexity of Safety Verification
[article]
2020
arXiv
pre-print
We study the fine-grained complexity of Leader Contributor Reachability (LCR) and Bounded-Stage Reachability (BSR), two variants of the safety verification problem for shared memory concurrent programs ...
Our contributions are new verification algorithms and lower bounds. The latter are based on the Exponential Time Hypothesis (ETH), the problem Set Cover, and cross-compositions. ...
Introduction We study the fine-grained complexity of two safety verification problems [1, 17, 31] for shared memory concurrent programs. ...
arXiv:1802.05559v3
fatcat:m3pt6baayfeq5fqsmpoxndyb3a
Fine-Grained Complexity of Safety Verification
2020
Journal of automated reasoning
We study the fine-grained complexity of Leader Contributor Reachability (LCR) and Bounded-Stage Reachability (BSR), two variants of the safety verification problem for shared memory concurrent programs ...
Our contributions are new verification algorithms and lower bounds. The latter are based on the Exponential Time Hypothesis (ETH), the problem Set Cover, and crosscompositions. ...
Introduction We study the fine-grained complexity of two safety verification problems [1, 18, 32] for shared memory concurrent programs. ...
doi:10.1007/s10817-020-09572-x
fatcat:7w7iyoxfeff7zkdvmpjowqzxx4
Fine-Grained Complexity of Safety Verification
[chapter]
2018
Lecture Notes in Computer Science
We study the fine-grained complexity of Leader Contributor Reachability (LCR) and Bounded-Stage Reachability (BSR), two variants of the safety verification problem for shared-memory concurrent programs ...
We contribute new verification algorithms and lower bounds based on the Exponential Time Hypothesis (ETH) and kernels. ...
Introduction We study the fine-grained complexity of two safety verification problems [1, 16, 27] for shared-memory concurrent programs. ...
doi:10.1007/978-3-319-89963-3_2
fatcat:y57lo3wexbdvnl452sxxrfawdi
Reasoning About Concurrency in High-Assurance, High-Performance Software Systems
[chapter]
2017
Lecture Notes in Computer Science
The strength of a mathematical proof to guarantee the correctness, security and safety of programs deployed in high-assurance systems has made its way from utopia to reality, and the absence of such strong ...
A remaining grand challenge in formal software verification is concurrency reasoning, much harder than sequential reasoning because of the explosion of the number of interleaved executions that need to ...
Fine-grained locking is traditionally used for scalable multicore implementations, but comes with considerable complexity. ...
doi:10.1007/978-3-319-63046-5_1
fatcat:etyhrw4auradbptcsixj6zeq4y
Page 9262 of Mathematical Reviews Vol. , Issue 2002M
[page]
2002
Mathematical Reviews
We investigate the decidability of various verification problems, e.g., (binary, for- ward, backward) reachability, safety, and blocking. ...
The ideas of the paper may interest researchers from various fields, such as algorithmic complexity, verification, and game the- ory. ...
Preliminary design of the SAFE platform
2011
Proceedings of the 6th Workshop on Programming Languages and Operating Systems - PLOS '11
We sketch the current state of the design and discuss several of these choices. ...
Though the project is still at an early stage, we have assembled a set of basic architectural choices that we believe will yield a high-assurance system. ...
, data, and instructions, and information-flow tracking via fine-grained tagging. ...
doi:10.1145/2039239.2039245
dblp:conf/sosp/DeHonKKMMMMPPRS11
fatcat:3zbmz6v65rbm7aw3gtbvr4yukm
Complexity of Liveness in Parameterized Systems
2019
Foundations of Software Technology and Theoretical Computer Science
We investigate the fine-grained complexity of liveness verification for leader contributor systems. ...
Our results show that, even from a fine-grained point of view, the complexities differ only by a polynomial factor. Liveness verification decomposes into reachability and cycle detection. ...
Introduction We study the fine-grained complexity of liveness verification for parameterized systems formulated in the leader contributor model. ...
doi:10.4230/lipics.fsttcs.2019.37
dblp:conf/fsttcs/Chini0S19
fatcat:vpndlnv36fecjmff3ibbwxmtzy
Partial Updates of AUTOSAR Embedded Applications -- To What Extent?
2015
2015 11th European Dependable Computing Conference (EDCC)
Moreover, we make it possible to implement safety verification at a very fine-grain level, namely at a runnable level. ...
As already mentioned, the execution time of the safety mechanisms that must be placed within containers (for fine grain safety), or within pre-and post-tasks hooks (for coarse grain safety) also need to ...
doi:10.1109/edcc.2015.18
dblp:conf/edcc/MartorellFLRV15
fatcat:qstk2k6tkzfj7grzlh5p7y2iai
A Fine-Grained Privacy Preserving Protocol over Attribute Based Access Control for VANETs
2015
Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications
In this paper, we present a fine-grained privacy preserving protocol over attribute access control for VANETs which allows a service provider to offer a range of safety related services to vehicle drivers ...
In order for a vehicle to access to the authorized services, we propose a fined-grained access control mechanism based on linear secret sharing scheme. ...
To alleviate the computational cost of [4] , we propose a fined-grained privacy preserving protocol over attribute based access control for VANETs which offers multiple road safety services in VANETs. ...
doi:10.22667/jowua.2015.06.31.098
dblp:journals/jowua/NkenyereyeTPR15
fatcat:le5tzckjbvgqnp63u6aib4rxgq
Proving Opacity via Linearizability: A Sound and Complete Method
[chapter]
2017
Lecture Notes in Computer Science
The most difficult part of these verifications is dealing with the fine-grained synchronization mechanisms of a given implementation; in our method these aspects are isolated to the linearizability proof ...
Verifying opacity is complex because one must not only consider the orderings between fine-grained (and hence concurrent) transactional operations, but also between the transactions themselves. ...
Only at this point is it necessary to consider the complex interleaving and fine-grained synchronization of the actual TM implementation. ...
doi:10.1007/978-3-319-60225-7_4
fatcat:5hxst5pboja3dntwcx5xmfb6vu
Status of normative base, certification and attestation of welding consumables in Ukraine
2014
The Paton Welding Journal
Tubular cored electrodes for gas shielded and non-gas shielded
metal arc welding of non alloy and fine grain steels. ...
Rods, wires and deposits for tungsten inert gas welding of non-
alloy and fine-grain steels. Classification
EN ISO 1071
Welding consumables. ...
doi:10.15407/tpwj2014.06.35
fatcat:mecl7oqqu5d5bn52xghnaeal2y
Mycotoxin Contamination of Maize in China
2017
Comprehensive Reviews in Food Science and Food Safety
The state of mycotoxin contamination of maize in China is analyzed in this review. ...
Due to unfavorable weather and poor storage conditions, the high incidences of mycotoxin contamination of maize are of great concern to the Chinese. ...
The fine granularity of model implementation allows an easier verification, maintenance, and composition using the same interface but keeping a solid and transparent underlying modelling structure. ...
doi:10.1111/1541-4337.12286
pmid:33371610
fatcat:2ka242aiwnhujd4vt56l7lajsi
An Evaluation of Coarse-Grained Locking for Multicore Microkernels
[article]
2016
arXiv
pre-print
locks, enable formal verification, and still achieve scalability comparable to fine-grained locking. ...
Coarse-grained locking provides lower overhead under low contention, fine-grained locking provides higher scalability under contention, though at the expense of implementation complexity and re- duced ...
complexity of fine-grained locking (Section 5.2). ...
arXiv:1609.08372v2
fatcat:erghtyzjrfgwddddefwz45w7ri
NuEditor – A Tool Suite for Specification and Verification of NuSCR
[chapter]
2006
Lecture Notes in Computer Science
SCR almost exclusively depended on fine-grained tabular notations to represent not only computation-intensive functions but also timeor state-dependent operations. ...
NuEditor is a tool suite supporting specification and verification of software requirements written in NuSCR. ...
However, in the Wolsung SDS2, which was considerably simpler in complexity than KNICS RPS, the most complex SDT consisted of 16 rows and 12 columns because complex equations had to be decomposed into " ...
doi:10.1007/11668855_2
fatcat:qjvg5emonbbvtn3mmfi2lwprry
Cloud data Search and verification using Order Preserving Encryption
2020
International Journal of Emerging Trends in Engineering Research
Hierarchical attribute based Encryption (HBASE) scalable, flexible and fine-grained information scheme is properly managed in cloud computing [19] . ...
This allowing the data owner to assign the superior part of the calculation works engaged with fine grained information get to administration to untrusted in cloud servers while not uncovering the hidden ...
doi:10.30534/ijeter/2020/256892020
fatcat:gjnnwch5dnbdvkrspgkfrt6nzy
« Previous
Showing results 1 — 15 out of 11,928 results