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

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

2006
Adam Antonik Nathaniel Charlton Michael Huth

We propose a pattern for designing algorithms that are in P by construction and under-approximate the winning regions of both players in parity games. This approximation is achieved by the interaction of finitely many aspects, each performing an efficient static analysis. We present several such aspects and illustrate their relative precision and interaction.

2008
Christian Schulte Peter J. Stuckey

Constraint propagation solvers interleave propagation (removing impossible values from variable domains) with search. Previously, Schulte and Stuckey introduced the use of static analysis to determine where in a constraint program domain propagators can be replaced by more efficient bounds propagators and still ensure that the same search space is traversed. This paper introduces a dynamic yet ...

1993
Wei Ye Rolf Ernst Thomas Benner Jörg Henkel

At the current time, an iterative approach seems to be be -rt suited for iwrdwardsojlware partitioning in hardware/sofhuare CO-synthesis with time constraints. To check the timing constraints the iteration loop contains a timing analysis. Only computation time intensive KT-level simulation provides suflcient timing precision fiir complex processor architectures. We present il hardwure/sofrware ...

1999
Iain Bate Alan Burns

This paper describes an approach that has been developed over a number of years for the task of scheduling systems and providing evidence that the timing requirements are met. The approach has been targeted at the safetycritical systems domain, and more specifically the development of jet engine control systems. The work has resulted in a computational model that supports the reuse of legacy sy...

2010
Chang Hwan Peter Kim Don Batory Sarfraz Khurshid

A Software Product Line (SPL) is a family of programs. Testing an SPL is a challenge because the number of programs to examine may be exponential in the number of features. However, there are features whose absence or presence has no bearing on the outcome of a test. We can ignore such irrelevant features and consider combinations of only the remaining features, thereby eliminating unnecessary ...

Journal: :Journal of Pharmaceutical Sciences 2021

The intestinal epithelium acts as a selective barrier for the absorption of water, nutrients and orally administered drugs. To evaluate gastrointestinal permeability candidate molecule, scientists drug developers have multitude cell culture models at their disposal. Static transwell cultures constitute most extensively characterized in vitro system can accurately categorize molecules into low, ...

Journal: :CoRR 2012
Julien Henry David Monniaux Matthieu Moy

Abstract interpretation techniques can be made more precise by distinguishing paths inside loops, at the expense of possibly exponential complexity. SMT-solving techniques and sparse representations of paths and sets of paths avoid this pitfall. We improve previously proposed techniques for guided static analysis and the generation of disjunctive invariants by combining them with techniques for...

Journal: :Haditechnika 2021

The article discusses the results of research in field critical infrastructure protection. resilience is aimed at creating a framework for assessment static resilience. complexity solution should be given by framework, which derives from pillars safety. aim to create technical prerequisites possible dynamic facilities.

2012
Wen Chen Asif Iqbal Akbar Abdrakhmanov Jay Parlar Chris George Mark Lawford T. S. E. Maibaum Alan Wassyng

This work is concerned with analysing the potential impact of direct changes to largescale enterprise systems, and, in particular, how to minimise testing efforts on such changes. A typical enterprise system may consist of hundreds of thousands of classes and millions of methods. Thus, it is extremely costly and difficult to apply conventional testing techniques to such a system. Retesting ever...

1995
John P. Gallagher Dmitri Boulanger Hüseyin Saglam

The declarative semantics of de nite logic programs is the basis of an elegant and practical framework for their static analysis. We de ne a core semantics parameterised by a preinterpretation of the language underlying the program. The concrete semantics is given by an extended Herbrand interpretation, capturing the correct answers of a program. The semantics is computed as the least xed point...

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

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