標題: Titlebook: Computer Aided Verification; 29th International C Rupak Majumdar,Viktor Kun?ak Conference proceedings 2017 Springer International Publishin [打印本頁] 作者: 評估 時間: 2025-3-21 17:17
書目名稱Computer Aided Verification影響因子(影響力)
書目名稱Computer Aided Verification影響因子(影響力)學科排名
書目名稱Computer Aided Verification網(wǎng)絡公開度
書目名稱Computer Aided Verification網(wǎng)絡公開度學科排名
書目名稱Computer Aided Verification被引頻次
書目名稱Computer Aided Verification被引頻次學科排名
書目名稱Computer Aided Verification年度引用
書目名稱Computer Aided Verification年度引用學科排名
書目名稱Computer Aided Verification讀者反饋
書目名稱Computer Aided Verification讀者反饋學科排名
作者: Hemodialysis 時間: 2025-3-21 20:54 作者: 閑逛 時間: 2025-3-22 01:37
SMTCoq: A Plug-In for Integrating SMT Solvers into Coq propositional logic, and the SMT solvers veriT and CVC4, for the quantifier-free fragment of the combined theory of fixed-size bit vectors, functional arrays with extensionality, linear integer arithmetic, and uninterpreted function symbols.作者: Circumscribe 時間: 2025-3-22 07:24 作者: 爭吵 時間: 2025-3-22 12:09 作者: ANNUL 時間: 2025-3-22 16:09
Cutoff Bounds for Consensus Algorithmsalgorithm-dependent .. A cutoff bound . reduces the parameterized verification of consensus to a setting with . processes. For the algorithms in our case studies, we obtain bounds of 5 or 7, enabling us to model check them efficiently. This is the first cutoff result for fault-tolerant distributed systems.作者: ANNUL 時間: 2025-3-22 19:42
Conference proceedings 2017tice of computer-aided formal analysis of hardware and software systems.?The conference covers the spectrum from theoretical results to concrete?applications, with an emphasis on practical verification tools and the algorithms?and techniques that are needed for their implementation..作者: compose 時間: 2025-3-22 23:03
0302-9743 from theoretical results to concrete?applications, with an emphasis on practical verification tools and the algorithms?and techniques that are needed for their implementation..978-3-319-63389-3978-3-319-63390-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 擴音器 時間: 2025-3-23 03:40
Large Modulus Ring-LWE , Module-LWEresent a reversible circuit compiler called ., which has been formally verified in F. and compiles circuits that operate correctly with respect to the input program. Our compiler compiles the . language [.] to combinational reversible circuits with as few ancillary bits as possible, and provably cleans temporary values.作者: 沒收 時間: 2025-3-23 06:53 作者: 弄污 時間: 2025-3-23 12:58
Yoshinori Aono,Phong Q. Nguyen,Yixin Shenor. Thus, we present sound techniques for verifying the equivalence of interesting classes of Spark programs, and show that it is complete under certain restrictions. We implemented our technique, and applied it to a few small, but intricate, test cases.作者: 厭食癥 時間: 2025-3-23 15:15
Verified Compilation of Space-Efficient Reversible Circuitsresent a reversible circuit compiler called ., which has been formally verified in F. and compiles circuits that operate correctly with respect to the input program. Our compiler compiles the . language [.] to combinational reversible circuits with as few ancillary bits as possible, and provably cleans temporary values.作者: Meditative 時間: 2025-3-23 20:13
Efficient Parallel Strategy Improvement for Parity Gameslem to computing prefix sums on a linked list. We report experimental results for these algorithms, and we find that a GPU implementation of this algorithm shows a significant speedup over single-core and multi-core CPU implementations.作者: 大看臺 時間: 2025-3-23 23:43
Verifying Equivalence of Spark Programsor. Thus, we present sound techniques for verifying the equivalence of interesting classes of Spark programs, and show that it is complete under certain restrictions. We implemented our technique, and applied it to a few small, but intricate, test cases.作者: CREST 時間: 2025-3-24 03:21
Optimal-Rate Non-Committing Encryptions both functional and nonfunctional criteria for correctness. To illustrate these aspects, we use our technique to automatically synthesize several intricate and non-obvious cryptographic constructions.作者: GRIN 時間: 2025-3-24 07:24 作者: Duodenitis 時間: 2025-3-24 11:13 作者: Campaign 時間: 2025-3-24 17:33 作者: TIGER 時間: 2025-3-24 21:31 作者: 無政府主義者 時間: 2025-3-25 02:54
Eike Kiltz,Julian Loss,Jiaxin Pandures and has the ability to exploit any known program invariants. An experimental evaluation with an implementation in the tool Pastis shows that the new analysis is competitive with state-of-the-art resource-bound tools while also creating Coq certificates.作者: Compass 時間: 2025-3-25 05:31
Optimal-Rate Non-Committing Encryption propositional logic, and the SMT solvers veriT and CVC4, for the quantifier-free fragment of the combined theory of fixed-size bit vectors, functional arrays with extensionality, linear integer arithmetic, and uninterpreted function symbols.作者: CLEFT 時間: 2025-3-25 08:32
Advances in Cryptology – ASIACRYPT 2017selin, Esparza, Ganty, Majumdar’15]. We show that verification of general regular properties of traces of executions, satisfying some stuttering condition, is .-complete for this model. We also study two interesting subcases of this problem: we show that liveness is actually .-complete, and that safety is already .-complete.作者: 實施生效 時間: 2025-3-25 13:20
Lecture Notes in Computer Scienceinimization algorithm in the deterministic finite state case. We evaluate the benefits of the proposed algorithm over real-world stream processing computations where symbolic transducers are formed as a result of repeated compositions.作者: Saline 時間: 2025-3-25 18:53
Pattern Matching on Encrypted Streamsalgorithm-dependent .. A cutoff bound . reduces the parameterized verification of consensus to a setting with . processes. For the algorithms in our case studies, we obtain bounds of 5 or 7, enabling us to model check them efficiently. This is the first cutoff result for fault-tolerant distributed systems.作者: 防水 時間: 2025-3-25 22:00 作者: 忍受 時間: 2025-3-26 02:00 作者: Coronary 時間: 2025-3-26 06:03 作者: 轉折點 時間: 2025-3-26 09:02 作者: justify 時間: 2025-3-26 12:40 作者: Outmoded 時間: 2025-3-26 18:17
Eike Kiltz,Julian Loss,Jiaxin Panstics of their programs. We introduce a method for resource-bound inference that (i) is compositional, (ii) produces machine-checkable certificates of the resource bounds obtained, and (iii) features a sound mechanism for user interaction if the inference fails. The technique handles recursive proce作者: foppish 時間: 2025-3-26 23:06
Optimal-Rate Non-Committing Encryptionly using a purely constraint-based approach, rather than exploring the space of possible programs in an enumerate-and-check loop. Our approach solves a synthesis problem by checking satisfiability of an . constraint ., whereas traditional program synthesis approaches are based on solving an . constr作者: escalate 時間: 2025-3-27 02:27 作者: glomeruli 時間: 2025-3-27 08:47 作者: 乳白光 時間: 2025-3-27 12:38
Giulio Malavolta,Dominique Schr?der iterations, experimental studies have found that a high step complexity causes them to perform poorly in practice. In this paper we seek to address this situation. Every iteration of the algorithm must compute a best response, and while the standard way of doing this uses the Bellman-Ford algorithm作者: 證實 時間: 2025-3-27 16:56
Advances in Cryptology – ASIACRYPT 2017 a behavior satisfying a given property. We focus on the case of pushdown processes communicating via shared memory. In a series of recent papers it has been shown that reachability in this model is .-complete [Hague’11], [Esparza, Ganty, Majumdar’13], and that liveness is decidable in . [Durand-Gas作者: CURL 時間: 2025-3-27 21:30
Lecture Notes in Computer Sciencereasoning over string transformations where traditional techniques do not scale. Here we develop the theory for and an algorithm for computing quotients of such transducers under indistinguishability preserving equivalence relations over states such as bisimulation. We show that the algorithm is a m作者: FADE 時間: 2025-3-28 00:41
Quantum Multicollision-Finding Algorithmu of fixed point computation, we use prime event structures to compactly represent causal dependence and interference between sequences of transformers. Our main contribution is an unfolding algorithm that uses a new notion of independence to avoid redundant transformer application, thread-local fix作者: 傲慢物 時間: 2025-3-28 04:41
Pattern Matching on Encrypted Streamsently no fully-automated methods for their verification. The main difficulty is that the algorithms are parameterized: they should work for any given number of processes. We provide an expressive language for consensus algorithms targeting the benign asynchronous setting. For this language, we give 作者: 使顯得不重要 時間: 2025-3-28 06:23 作者: 后退 時間: 2025-3-28 14:01 作者: 小蟲 時間: 2025-3-28 16:56 作者: Handedness 時間: 2025-3-28 20:56 作者: 火車車輪 時間: 2025-3-28 23:33
Towards Verifying Nonlinear Integer Arithmeticution proofs for many properties of the most widely used multiplier circuits. Such short proofs were conjectured not to exist. More precisely, we give . size regular resolution proofs for arbitrary degree 2 identities on array, diagonal, and Booth multipliers and . size proofs for these identities on Wallace tree multipliers.作者: Limousine 時間: 2025-3-29 03:57 作者: Leisureliness 時間: 2025-3-29 09:48 作者: savage 時間: 2025-3-29 15:22 作者: 枯燥 時間: 2025-3-29 17:30 作者: Apraxia 時間: 2025-3-29 23:18
Verified Compilation of Space-Efficient Reversible Circuits quantum computing. Existing tools compile and optimize reversible circuits for various metrics, such as the overall circuit size or the total amount of space required to implement a given function reversibly. However, little effort has been spent on verifying the correctness of the results, an issu作者: esthetician 時間: 2025-3-30 03:15
Ascertaining Uncertainty for Efficient Exact Cache Analysishits and which result in cache misses. Such information is valuable in optimizing compilers, worst-case execution time analysis, and side-channel attack quantification and mitigation..Cache analysis is usually performed as a combination of “must” and “may” abstract interpretations, classifying instr作者: 變色龍 時間: 2025-3-30 06:24
Non-polynomial Worst-Case Analysis of Recursive Programsound and complete for proving termination and worst-case bounds of non-recursive programs. First, we apply ranking functions to recursion, resulting in measure functions, and show that they provide a sound and complete approach to prove worst-case bounds of non-deterministic recursive programs. Our 作者: 手術刀 時間: 2025-3-30 10:55 作者: doxazosin 時間: 2025-3-30 15:03
Look for the Proof to Find the Program: Decorated-Component-Based Program Synthesisly using a purely constraint-based approach, rather than exploring the space of possible programs in an enumerate-and-check loop. Our approach solves a synthesis problem by checking satisfiability of an . constraint ., whereas traditional program synthesis approaches are based on solving an . constr作者: 水汽 時間: 2025-3-30 16:56 作者: anthesis 時間: 2025-3-30 23:51
SMTCoq: A Plug-In for Integrating SMT Solvers into Coqr proof certificates fully implemented and proved correct in Coq, SMTCoq offers facilities to check answers from external SAT and SMT solvers and to increase Coq’s automation using such solvers, all in a safe way. The current version supports proof certificates produced by the SAT solver ZChaff, for作者: neologism 時間: 2025-3-31 01:08 作者: extinguish 時間: 2025-3-31 05:23
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems a behavior satisfying a given property. We focus on the case of pushdown processes communicating via shared memory. In a series of recent papers it has been shown that reachability in this model is .-complete [Hague’11], [Esparza, Ganty, Majumdar’13], and that liveness is decidable in . [Durand-Gas作者: separate 時間: 2025-3-31 13:07
