نتایج جستجو برای: static condition

تعداد نتایج: 419021  

2005
Joselito Medina Marín Xiaoou Li

Event-condition-action rules, in active database systems, should be performed carefully, because their firings can produce inconsistent states in database systems. In this paper, an ECA rule base simulator is described, named ECAPNSim, which uses a Conditional Colored Petri Net model to depict ECA rules. It can model ECA rules, simulate their behavior, and perform a static analysis.

Journal: :Logical Methods in Computer Science 2016
Javier Esparza Denis Kuperberg Anca Muscholl Igor Walukiewicz

Negotiations are a formalism for describing multiparty distributed cooperation. Alternatively, they can be seen as a model of concurrency with synchronized choice as communication primitive. Well-designed negotiations must be sound, meaning that, whatever its current state, the negotiation can still be completed. In earlier work, Esparza and Desel have shown that deciding soundness of a negotia...

2009
Vesal Vojdani Varmo Vene

We present Goblint, a static analyzer for detecting potential data races in the multithreaded C code. The implemented analysis is sound on a “safe” subset of C and sufficiently efficient to be used for race-detection of multithreaded programs up to about 25 thousand lines of code. It uses a global invariant approach to avoid the state space explosion problem and is both contextand path-sensitive.

2001
John McGinley

Inclusion of clouds in an initial condition has been a long-term goal of many numerical weather prediction systems. The work with the ARPS model and ADAS initialization has been a notable example (Xue, et al., 2000). Work by Crook and Sun, 1997 has taken this even into the realm of the model adjoint. What we seek in this work is an a 3-D static analysis that can provide the kind of sophisticati...

Journal: :Sci. Comput. Program. 2005
James Rose Nikhil Swamy Michael Hicks

We present an approach for automatically proving the absence of race conditions in multi-threaded Java programs, using a combination of dynamic and static analysis. The program in question is instrumented so that when executed it will gather information about locking relationships. This information is then fed to our tool, FindLocks, that generates annotations needed to type check the program u...

2004
Rahul Agarwal Scott D. Stoller

We study the type system introduced by Boyapati and Rinard in their paper “A Parameterized Type System for Race-Free Java Programs” and try to infer the type annotations (“lock types”) needed by their type checker to show that a program is free of race conditions. Boyapati and Rinard automatically generate some of these annotations using default types and static inference of lock types for loca...

Journal: :Games and Economic Behavior 2017
Daniel Krähmer Roland Strausz

We show that every sequential screening model is equivalent to a standard text book static screening model. We use this result and apply well-established techniques from static screening to obtain solutions for classes of sequential screening models for which standard sequential screening techniques are not applicable. Moreover, we identify the counterparts of well– understood features of the s...

2013
P. Pratihar

There are instruments available to measure the drape coefficient of fabric. The most widely accepted method (IS 8357:1977) is hang a circular fabric sample and measure the drape coefficient. This measurement technique gives quite a bit of fair idea about drape coefficient of a fabric in static condition. But when it’s static condition is disturbed as the case in practical application of fabric ...

Power transformers provide a vital link between the generation and distribution of produced energy. Such static equipment is subjected to abuse during operation in generation and distribution stations and leads to catastrophic failures. This paper reviewed the techniques in the field of condition monitoring of power transformers in recent years. Transformer monitoring and diagnosis are the effe...

2009
V. Vojdani

We present Goblint, a static analyzer for detecting potential data races in the multithreaded C code. The implemented analysis is sound on a “safe” subset of C and sufficiently efficient to be used for race-detection of multithreaded programs up to about 25 thousand lines of code. It uses a global invariant approach to avoid the state space explosion problem and is both contextand path-sensitive.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید