作者: Evacuate 時(shí)間: 2025-3-21 23:44 作者: CHART 時(shí)間: 2025-3-22 01:23
Wilhelm Sturtzel,Kurt Helm,Hans Heuserto make ., that is, where she observes the running time of the program for the same secret value combined with different public input values. Existing mitigation approaches do not give confidentiality or performance guarantees for this threat model. We evaluate our tool . on a number of micro-benchm作者: 花爭吵 時(shí)間: 2025-3-22 08:34 作者: lanugo 時(shí)間: 2025-3-22 09:47
https://doi.org/10.1007/978-3-662-10197-1trate applicability of the DAG-based synthesis framework on a case study of a human-on-the-loop unmanned-aerial vehicle system under stealthy attacks, where the proposed framework is used to formally model, analyze and synthesize security-aware strategies for the system.作者: 悶熱 時(shí)間: 2025-3-22 14:04 作者: 悶熱 時(shí)間: 2025-3-22 20:31 作者: Tailor 時(shí)間: 2025-3-22 22:41
Verifying Hyperlivenesss paper, we study the more difficult case of hyperliveness properties expressed as HyperLTL formulas with quantifier alternation. We reduce existential quantification to strategic choice and show that synthesis algorithms can be used to eliminate the existential quantifiers automatically. We further作者: 開頭 時(shí)間: 2025-3-23 05:06
Quantitative Mitigation of Timing Side Channelsto make ., that is, where she observes the running time of the program for the same secret value combined with different public input values. Existing mitigation approaches do not give confidentiality or performance guarantees for this threat model. We evaluate our tool . on a number of micro-benchm作者: 偽造 時(shí)間: 2025-3-23 07:17 作者: 刀鋒 時(shí)間: 2025-3-23 12:01 作者: FIR 時(shí)間: 2025-3-23 16:59
Membership-Based Synthesis of Linear Hybrid Automataonstructs an initial automaton and then iteratively extends the automaton based on processing new data. Therefore the algorithm is well-suited for online and synthesis-in-the-loop applications. The core of the algorithm is a membership query that checks whether, within the specified tolerance, a giv作者: craven 時(shí)間: 2025-3-23 21:28
Computer Aided Verification978-3-030-25540-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 烤架 時(shí)間: 2025-3-24 01:31 作者: 失誤 時(shí)間: 2025-3-24 03:11
,Der GSLP – Schritt für Schritt zum Ziel, zones by restricting the set of clock constraints that can be used to define them, while the refinement procedure computes the set of constraints that must be taken into consideration in the abstraction so as to exclude a given spurious counterexample. We?implement this idea in two?ways: an?enumera作者: GRIPE 時(shí)間: 2025-3-24 06:41 作者: 消散 時(shí)間: 2025-3-24 14:16
Systematische Probleml?sung in Unternehmenhe mode of aggregation for the quantitative dimension is discounted-sum aggregation. ., or . in short, are Büchi automata that read two infinite sequences of weights synchronously and relate their discounted-sum. Recent empirical investigations have shown that while DS-comparators enable competitive作者: probate 時(shí)間: 2025-3-24 17:28 作者: 步兵 時(shí)間: 2025-3-24 19:48 作者: ACRID 時(shí)間: 2025-3-25 02:25
Wilhelm Sturtzel,Kurt Helm,Hans Heuseration traces. HyperLTL can express information flow policies as well as properties like symmetry in mutual exclusion algorithms or Hamming distances in error-resistant transmission protocols. Previous work on HyperLTL model checking has focussed on the alternation-free fragment of HyperLTL, where ve作者: 頭腦冷靜 時(shí)間: 2025-3-25 05:00 作者: 尖牙 時(shí)間: 2025-3-25 10:12
Exemplarische Anwendung des Modells,s by .. In this approach, the problem of checking .-safety over the original program is reduced to checking an “ordinary” safety property over a program that executes . copies of the original program in some order. The way in which the copies are composed determines how complicated it is to verify t作者: 皺痕 時(shí)間: 2025-3-25 15:18 作者: 易改變 時(shí)間: 2025-3-25 19:49
https://doi.org/10.1007/978-3-658-32441-4a program. The key observation is that constructing a proof for a small representative set of the runs of the product program (i.e. the product of the several copies of the program by itself), called a ., is sufficient to formally prove the hypersafety property about the program. We propose an algor作者: 有發(fā)明天才 時(shí)間: 2025-3-25 22:48 作者: custody 時(shí)間: 2025-3-26 01:41
https://doi.org/10.1007/978-3-663-05114-5algorithms for synthesis in bounded environments, where the environment can only generate input sequences that are ultimately periodic words (lassos) with finite representations of bounded size. We provide automata-theoretic and symbolic approaches for solving this synthesis problem, and also study 作者: 柳樹；枯黃 時(shí)間: 2025-3-26 07:25
https://doi.org/10.1007/978-3-663-04937-1points. Such properties are formally specified by universally quantified formulas, which are difficult to find, and difficult to prove inductive. In this paper, we propose an algorithm based on an enumerative search that discovers quantified invariants in stages. First, by exploiting the program syn作者: 凌辱 時(shí)間: 2025-3-26 11:21
https://doi.org/10.1007/978-3-663-04937-1igm of . (.), which iteratively calls a synthesizer on finite sample sets from a given distribution. We make theoretical and algorithmic contributions: (.)?We prove the surprising result that . only requires a polynomial number of synthesizer calls in the size of the sample set, despite its ostensib作者: 敘述 時(shí)間: 2025-3-26 14:58
Wilhelm Sturtzel,Werner Graff,Helmut Binekwithout a template and generate an automaton with nondeterministic guards and invariants, and with an arbitrary number and topology of modes. They thus construct a succinct model from the data and provide formal guarantees. In particular, (1)?the generated automaton can reproduce the data up?to a sp作者: 使人入神 時(shí)間: 2025-3-26 18:24
https://doi.org/10.1007/978-3-030-25540-4artificial intelligence; authentication; data security; formal logic; formal methods; model checker; model作者: Tempor 時(shí)間: 2025-3-26 23:58
978-3-030-25539-8The Editor(s) (if applicable) and The Author(s) 2019作者: 啞劇 時(shí)間: 2025-3-27 01:53 作者: Intractable 時(shí)間: 2025-3-27 05:55 作者: SLING 時(shí)間: 2025-3-27 12:36
Abstraction Refinement Algorithms for Timed Automata zones by restricting the set of clock constraints that can be used to define them, while the refinement procedure computes the set of constraints that must be taken into consideration in the abstraction so as to exclude a given spurious counterexample. We?implement this idea in two?ways: an?enumera作者: 無法解釋 時(shí)間: 2025-3-27 13:39
Fast Algorithms for Handling Diagonal Constraints in Timed Automatation of zones does not terminate. Various termination mechanisms have been studied over the years. Coming up with efficient termination mechanisms has been remarkably more challenging when the automaton has diagonal constraints in guards..In this paper, we propose a new termination mechanism for tim作者: CLAP 時(shí)間: 2025-3-27 18:33 作者: headway 時(shí)間: 2025-3-28 01:03 作者: Efflorescent 時(shí)間: 2025-3-28 05:55 作者: 追蹤 時(shí)間: 2025-3-28 09:14 作者: 厚顏無恥 時(shí)間: 2025-3-28 10:33
Quantitative Mitigation of Timing Side Channelsreasing the strength of the side channels as measured by entropy-based objectives, such as min-guess entropy. Our goal is to minimize the information leaks while guaranteeing a user-specified maximal acceptable performance overhead. We dub the decision version of this problem ., and consider two var作者: 凹槽 時(shí)間: 2025-3-28 15:16 作者: 可耕種 時(shí)間: 2025-3-28 20:26 作者: infinite 時(shí)間: 2025-3-28 23:57 作者: 有偏見 時(shí)間: 2025-3-29 05:59
Automated Synthesis of Secure Platform Mappingsisions, however, may introduce undesirable behavior into the resulting implementation, possibly leading to a violation of a desired property that has already been established at the design level. In this paper, we introduce the problem of .: synthesize a set of implementation decisions ensuring that作者: 不容置疑 時(shí)間: 2025-3-29 08:35 作者: 憤怒事實(shí) 時(shí)間: 2025-3-29 13:20
Quantified Invariants via Syntax-Guided Synthesispoints. Such properties are formally specified by universally quantified formulas, which are difficult to find, and difficult to prove inductive. In this paper, we propose an algorithm based on an enumerative search that discovers quantified invariants in stages. First, by exploiting the program syn作者: 斷言 時(shí)間: 2025-3-29 17:34
Efficient Synthesis with Probabilistic Constraintsigm of . (.), which iteratively calls a synthesizer on finite sample sets from a given distribution. We make theoretical and algorithmic contributions: (.)?We prove the surprising result that . only requires a polynomial number of synthesizer calls in the size of the sample set, despite its ostensib作者: 噴出 時(shí)間: 2025-3-29 20:07
Membership-Based Synthesis of Linear Hybrid Automatawithout a template and generate an automaton with nondeterministic guards and invariants, and with an arbitrary number and topology of modes. They thus construct a succinct model from the data and provide formal guarantees. In particular, (1)?the generated automaton can reproduce the data up?to a sp作者: Exhilarate 時(shí)間: 2025-3-30 00:59
https://doi.org/10.1007/978-3-658-32441-4technique for generating a mapping based on symbolic constraint search. We describe our prototype implementation, and two real-world case studies demonstrating the applicability of our technique to the synthesis of secure mappings for the popular web authorization protocols OAuth 1.0 and 2.0.作者: NAG 時(shí)間: 2025-3-30 04:59 作者: reception 時(shí)間: 2025-3-30 09:29
Symbolic Register Automatam both symbolic and register automata, with a view on applications that were previously out of reach. We study their properties and provide algorithms for emptiness, inclusion and equivalence checking, together with experimental results.作者: Microgram 時(shí)間: 2025-3-30 15:18
Abstraction Refinement Algorithms for Timed Automatative algorithm where a lazy abstraction approach is adopted, meaning that possibly different abstract domains are assigned to each exploration node; and a?symbolic algorithm where the abstract transition system is encoded with Boolean formulas.作者: CORE 時(shí)間: 2025-3-30 20:07
Automated Hypersafety Verificationithm based on a counterexample-guided refinement loop that simultaneously searches for a reduction and a proof of the correctness for the reduction. We demonstrate that our tool .?is very effective in verifying a diverse array of hypersafety properties for a diverse class of input programs.作者: JAUNT 時(shí)間: 2025-3-31 00:41
Synthesizing Approximate Implementations for Unrealizable Specificationsthe synthesis of approximative implementations from unrealizable specifications. Such implementations may violate the specification in general, but are guaranteed to satisfy the specification on at least a specified portion of the bounded-size lassos. We evaluate the algorithms on different arbiter specifications.作者: 悄悄移動(dòng) 時(shí)間: 2025-3-31 04:23 作者: 魯莽 時(shí)間: 2025-3-31 07:21
Systematische Probleml?sung in Unternehmen been remarkably more challenging when the automaton has diagonal constraints in guards..In this paper, we propose a new termination mechanism for timed automata with diagonal constraints based on a new simulation relation between zones. Experiments with an implementation of this simulation show significant gains over existing methods.作者: 煩人 時(shí)間: 2025-3-31 10:14
