نتایج جستجو برای: time verification

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

Journal: :Electronic Notes in Theoretical Computer Science 2008

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2022

Combined modeling and verification of dynamic systems the data they operate on has gained momentum in AI several application domains. We investigate expressive yet concise framework data-aware (DDS), extending it with linear arithmetic, providing following contributions. First, we introduce a new, semantic property “finite summary”, which guarantees existence faithful finite-state abstraction. ...

Journal: :Int. J. Approx. Reasoning 2008
Astride Aregui Thierry Denoeux

A new method is proposed for building a predictive belief function from statistical data in the transferable belief model framework. The starting point of this method is the assumption that, if the probability distribution PX of a random variable X is known, then the belief function quantifying our belief regarding a future realization of X should have its pignistic probability distribution equ...

Journal: :CoRR 2017
Naoki Kobayashi Takeshi Tsukada Keiichi Watanabe

There are two kinds of higher-order extensions of model checking: HORS model checking and HFL model checking. Whilst the former has been applied to automated verification of higher-order functional programs, applications of the latter have not been well studied. In the present paper, we show that various verification problems for functional programs, including may/must-reachability, trace prope...

2006
Changhan Park Myungseok Ki Jaechan Namkung Joonki Paik

In this paper, we propose a priority verification method for multimodal biometric features by using a momentum back-propagation artificial neural network (MBP-ANN). We also propose a personal verification method using both face and speech to improve the rate of single biometric verification. False acceptance rate (FAR) and false rejection rate (FRR) have been a fundamental bottleneck of real-ti...

1999
R. P. BRENT G. L. COHEN H. J. J. TE RIELE

If N is an odd perfect number, and q \\ N, q prime, k even, 2k then it is almost immediate that N > q .We prove here that, subject to certain conditions verifiable in polynomial time, in fact N > q ' . Using this and related results, we are able to extend the computations in an earlier paper to show that N > 10300 .

2016
Dilian Gurov Klaus Havelund Marieke Huisman Rosemary Monahan

Over the last years, significant progress has been made both on static and runtime program verification techniques, focusing on increasing the quality of software. Within this track, we would like to investigate how we can leverage these techniques by combining them. Questions that will be addressed are for example: what can static verification bring to runtime verification to reduce impact on ...

2012
Xinxiu Wen Huiqun Yu

The modeling and verification of real-time systems is a challenging task in the area of software engineering. This paper proposes a formal method for modeling and verification of real-time systems based on aspect-oriented timed statecharts and linear-time temporal logic. Behaviors of real-time systems are modeled by aspect-oriented timed statecharts, while key properties of systems are specifie...

2003
Wei-Tek Tsai Feng Zhu Lian Yu Raymond A. Paul Chun Fan

Test result verification is always a costly task for embedded system testing. This paper presents a systematic process to develop verification patterns and use these patterns to verify test results for state-based real-time/embedded systems. The verification patterns are organized into an object-oriented verification framework so that it can be adaptive to changes rapidly The verification patte...

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

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