標題: Titlebook: Static Analysis; 21st International S Markus Müller-Olm,Helmut Seidl Conference proceedings 2014 Springer International Publishing Switzerl [打印本頁] 作者: 傳家寶 時間: 2025-3-21 16:26
書目名稱Static Analysis影響因子(影響力)
書目名稱Static Analysis影響因子(影響力)學(xué)科排名
書目名稱Static Analysis網(wǎng)絡(luò)公開度
書目名稱Static Analysis網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Static Analysis被引頻次
書目名稱Static Analysis被引頻次學(xué)科排名
書目名稱Static Analysis年度引用
書目名稱Static Analysis年度引用學(xué)科排名
書目名稱Static Analysis讀者反饋
書目名稱Static Analysis讀者反饋學(xué)科排名
作者: Tractable 時間: 2025-3-21 22:47 作者: neolith 時間: 2025-3-22 04:24
Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations,s. The procedure is based on a necessary and sufficient condition that characterizes invariant conjunctions of polynomial equalities. We contrast this approach to an alternative one which combines fast and sufficient (but not necessary) conditions using differential cuts for soundly restricting the system evolution domain.作者: yohimbine 時間: 2025-3-22 04:45
Conference proceedings 2014 aspects of static analysis, including abstract interpretation, abstract testing, bug detection, data flow analysis, model checking, program transformation, program verification, security analysis, and type checking.作者: 內(nèi)閣 時間: 2025-3-22 11:09
0302-9743 ddress all aspects of static analysis, including abstract interpretation, abstract testing, bug detection, data flow analysis, model checking, program transformation, program verification, security analysis, and type checking.978-3-319-10935-0978-3-319-10936-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: emission 時間: 2025-3-22 13:22
Peak Cost Analysis of Distributed Systems,tion is the novel notion of . which captures the worst-case cost of the tasks that may be simultaneously pending to execute at each location along the execution. A prototype implementation demonstrates the accuracy and feasibility of the proposed peak cost analysis.作者: JUST 時間: 2025-3-22 20:05
Expectation Invariants for Probabilistic Program Loops as Fixed Points,ent an iterative analysis that synthesizes expectation invariants for probabilistic program loops. We show how the standard polyhedral abstract domain can be used to synthesize expectation invariants for probabilistic programs, and demonstrate the usefulness of our approach on some examples of probabilistic program loops.作者: 施加 時間: 2025-3-22 22:45 作者: 語言學(xué) 時間: 2025-3-23 01:52 作者: ANA 時間: 2025-3-23 08:02
Synthesis of Memory Fences via Refinement Propagation,reduces the time required to discover a proof for ...We implemented our technique and successfully applied it to several challenging concurrent algorithms, including state of the art concurrent work-stealing queues.作者: Apoptosis 時間: 2025-3-23 13:23 作者: 整體 時間: 2025-3-23 15:25
Cost-Aware Automatic Program Repair,oes not exceed a given repair budget. As part of our predicate abstractionbased solution framework, we present a sound and complete algorithm for repair of Boolean programs. We have developed a prototype tool based on SMT solving and used it successfully to repair diverse errors in benchmark C programs.作者: 上腭 時間: 2025-3-23 21:31
A Decision Tree Abstract Domain for Proving Conditional Termination,g conditional termination of programs written in (a subset of) . and, using experimental evidence, we show that it performs well on a wide variety of benchmarks, it is competitive with the state of the art and is able to analyze programs that are out of the reach of existing methods.作者: 膠狀 時間: 2025-3-23 22:21
Block Me If You Can!,w experimentally the efficiency of the method, on various examples, including a fine-grained model of Szymanski’s mutual exclusion protocol, whose correctness, to the best of our knowledge, has not been proven automatically by any other existing methods.作者: absolve 時間: 2025-3-24 04:46
Cyclic Abduction of Inductively Defined Safety and Termination Preconditions,uite of heuristically guided tactics. It is often able to automatically infer preconditions describing lists, trees, cyclic and composite structures which, in other tools, previously had to be supplied by hand.作者: 為敵 時間: 2025-3-24 10:18
Verifying Recursive Programs Using Intraprocedural Analyzers,underlying program analyzer. Such function summaries enable our algorithm to check recursive programs. We implement a prototype using the recursion-free program analyzer . and compare it with other program analyzers on the benchmarks in the 2014 Competition on Software Verification.作者: Mammal 時間: 2025-3-24 13:48
Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction,mating logical subtraction operation. Unlike general complementation, subtraction more easily allows for increased precision in case its arguments are related. The approach is not restricted to a specific abstract domain and we use it to analyze programs using the abstract domains of intervals and of 3-valued structures作者: 有惡臭 時間: 2025-3-24 17:00 作者: Aviary 時間: 2025-3-24 19:03 作者: 沒有準備 時間: 2025-3-25 01:03
An Abstract Domain Combinator for Separately Conjoining Memory Abstractions,s approach eases the design of the analysis as memory abstract domains can be re-used by applying our separating conjunction domain combinator. And more importantly, this combinator enables an analysis designer to easily create a combined domain that applies computationally-expensive abstract domains only where it is required.作者: 挖掘 時間: 2025-3-25 07:11
Conference proceedings 2014n September 2014. The 20 revised full papers were selected from 53 submissions and are presented together with 3 invited talks. The papers address all aspects of static analysis, including abstract interpretation, abstract testing, bug detection, data flow analysis, model checking, program transform作者: mediocrity 時間: 2025-3-25 10:48 作者: 生命 時間: 2025-3-25 15:25 作者: 遺棄 時間: 2025-3-25 17:29
Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction,ation of a greatest fixed point, or complementation of a least fixed point, are often difficult to apply successfully. Our approach relies on a different decomposition of the weakest precondition of loops. We exchange the greatest fixed point for the computation of a least fixed point above a recurr作者: Bucket 時間: 2025-3-25 20:02 作者: 大溝 時間: 2025-3-26 04:11
Cyclic Abduction of Inductively Defined Safety and Termination Preconditions,definitions in separation logic. Cyclic abduction essentially works by searching for a . of the desired property, abducing definitional clauses of the precondition as necessary in order to advance the proof search process..We provide an implementation, ., of our cyclic abduction method, based on a s作者: SSRIS 時間: 2025-3-26 06:28
Expectation Invariants for Probabilistic Program Loops as Fixed Points,erators. Whereas, traditional program analysis uses Floyd-Hoare style invariants to over-approximate the set of reachable states, our approach synthesizes invariant inequalities involving the expected values of program expressions at the loop head. We first define the notion of expectation invariant作者: commute 時間: 2025-3-26 08:55
An Abstract Domain to Infer Octagonal Constraints with Absolute Value,gram, is one of the most commonly used numerical abstractions in practice, due to its quadratic memory complexity and cubic time complexity. However, the octagon domain itself is restricted to express convex sets and has limitations in handling non-convex properties which are sometimes required for 作者: Gratuitous 時間: 2025-3-26 13:46 作者: 怒目而視 時間: 2025-3-26 18:20 作者: COLON 時間: 2025-3-27 00:41 作者: enumaerate 時間: 2025-3-27 04:22 作者: deciduous 時間: 2025-3-27 05:25
A Progress Bar for Static Analyzers,tic analysis has progressed so far to its completion. Because static analysis’ progress depends on the semantic complexity, not on the code size, of the target software, devising an accurate progress-indicator is not obvious. Our technique first combines a semantic-based pre-analysis and a statistic作者: 分貝 時間: 2025-3-27 13:20
Sparse Dataflow Analysis with Pointers and Reachability,variations are described in the literature, no existing technique is suitable for analyzing JavaScript code. In this paper, we point out the need for a sparse analysis framework that supports pointers and reachability.We present such a framework, which uses static single assignment form for heap add作者: cajole 時間: 2025-3-27 17:38 作者: CLAM 時間: 2025-3-27 20:23 作者: Maximizer 時間: 2025-3-27 22:05
Speeding Up Logico-Numerical Strategy Iteration,side a program by one polyhedron per control location, with . fixed directions for the faces. The strongest inductive invariant in such an abstract domain may be computed by a combination of strategy iteration and SMT solving. Unfortunately, the above approaches lead to unacceptable space and time c作者: CERE 時間: 2025-3-28 03:25
Cost-Aware Automatic Program Repair,ons; the framework can generate repaired programs by modifying the original erroneous program in multiple program locations, and can ensure the readability of the repaired program using user-defined expression templates; the framework also generates a set of inductive assertions that serve as a proo作者: judiciousness 時間: 2025-3-28 08:52
An Abstract Domain Combinator for Separately Conjoining Memory Abstractions,hile supporting a wide range of complex data structures in a generic way remains a long-standing challenge. In this paper, we propose a way to side-step this issue by defining a generic abstract domain combinator for combining memory abstractions on disjoint regions. In essence, our abstract domain 作者: 跟隨 時間: 2025-3-28 13:08 作者: curriculum 時間: 2025-3-28 15:51
James Brotherston,Nikos Gorogianniszung, dass die Bundesrepublik im Feld der Vergangenheitsbew?ltigung im Wesentlichen ihrer Verantwortung nachgekommen sei und überdies selbst jene mit diesem Gegenstand befasste Forschung, welche qua definitionem ihrem Gegenstand kritisch gegenüber stehen muss, affirmativ konstatierte, dass die Ausei作者: 大約冬季 時間: 2025-3-28 22:31 作者: Overdose 時間: 2025-3-29 01:50 作者: 宴會 時間: 2025-3-29 04:16 作者: Coronation 時間: 2025-3-29 09:39
Guillaume Iooss,Christophe Alias,Sanjay Rajopadhye作者: Arctic 時間: 2025-3-29 11:55 作者: 紅腫 時間: 2025-3-29 18:43
Reactivity of Cooperative Systems, our analysis with respect to the big-step semantics of the language: a well-typed program with reactive effects is reactive. The analysis is easy to implement and generic enough to be applicable to other models of concurrency such as coroutines.作者: Infusion 時間: 2025-3-29 21:40
James Brotherston,Nikos Gorogiannis?ten in den sozialen Netzwerken führte, jedoch nicht über fundamentale ideologische Gr?ben in gro?en Teilen der W?hlerschaft hinwegt?uschen konnte, sondern vielmehr jene offenkundige Polarisierung der politischen Debatte als zentrale Herausforderungen des politischen Diskurses der Gegenwart sichtbar作者: 盡責 時間: 2025-3-30 03:24
Aleksandar Chakarov,Sriram Sankaranarayanan?ten in den sozialen Netzwerken führte, jedoch nicht über fundamentale ideologische Gr?ben in gro?en Teilen der W?hlerschaft hinwegt?uschen konnte, sondern vielmehr jene offenkundige Polarisierung der politischen Debatte als zentrale Herausforderungen des politischen Diskurses der Gegenwart sichtbar作者: EXCEL 時間: 2025-3-30 06:00 作者: 共同時代 時間: 2025-3-30 09:52
https://doi.org/10.1007/978-3-319-10936-7formal methods; model checking; program analysis; program reasoning; software engineering; software funct作者: 使困惑 時間: 2025-3-30 16:24
978-3-319-10935-0Springer International Publishing Switzerland 2014作者: Optimum 時間: 2025-3-30 19:37 作者: Junction 時間: 2025-3-30 23:36
Traces, Spaces and Archives, Intersecting with Memories, Liberation Histories and Storytelling: The Apartheid Museum and Nelson Mandela House Museum,work. It explores this subject by teasing out the intersections of archive, place, memory, history, exhibition development and storytelling in the making of two heritage sites in the area of Johannesburg, South Africa: the Apartheid Museum and the Mandela Museum in Soweto. In reflecting on these pro作者: 粗糙 時間: 2025-3-31 02:49
,Medienrealit?t, Medienwandel und Medienwirkung — Facetten politischer Kommunikation. Ein Beitrag zuon, ihre verschiedenen Ebenen und ihre unterschiedlichen Erscheinungsformen stehen im Zentrum der wissenschaftlichen Arbeit von Winfried Schulz. Dabei ragen nach unserer Auffassung drei Themengebiete hervor:作者: Omnipotent 時間: 2025-3-31 08:49
Monitoring and Prediction of Land-Use and Land-Cover (LULC) Change, to establish transition probability matrices between land-cover categories for the time periods represented. The use of cellular automata in this work enables neighbourhood interactions to be accounted for. After an initial calibration run, the combined method is then used to predict land use and land cover in 2022 and 2033.作者: 排斥 時間: 2025-3-31 11:47
Landschafts?kologieen Studie mit dem Titel: ?Exaktwissenschaftliches, philosophisches und künstlerisches Welterkennen und Weltbegreifen,“ soll die Wesensverwandschaft des exaktwissenschaftlichen und künstlerischen Erfassens und Erlebens der Landschafter?rtert werden.作者: Melatonin 時間: 2025-3-31 15:34 作者: 用肘 時間: 2025-3-31 20:40 作者: 序曲 時間: 2025-3-31 22:45 作者: 支架 時間: 2025-4-1 03:31
Machine-specific Approach for Automatic Classification of Cutting Process Efficiency,ta to compute the efficiency of the cutting process. The established algorithm is able to identify the process efficiency without using additional machine-specific parameters..The validation results are presented as confusion matrices for each data set and the case-specific population of the generat作者: auxiliary 時間: 2025-4-1 09:06 作者: 編輯才信任 時間: 2025-4-1 11:54 作者: Osteoarthritis 時間: 2025-4-1 14:23
Prolonging of Life Cycle and Its Implications,nander verschiedene aufeinander abgestimmte Verfahrens- schritte ab. Nach dem jeweils beabsichtigten Grundvorgang kann ma- unabh?ngig von den verarbeiteten Substanzen - mechanische, thermi- sche, chemische, elektrochemische, biologische und andere Verfahrens- schritte unterscheiden. Die mechanische 作者: 斜坡 時間: 2025-4-1 20:09
