نتایج جستجو برای: time verification
تعداد نتایج: 1949637 فیلتر نتایج به سال:
in recent years, formal methods have been used as an important tool for performance evaluation and verification of a wide range of systems. in the view points of engineers and practitioners, however, there are still some major difficulties in using formal methods. in this paper, we introduce a new formal modeling language to fill the gaps between object-oriented programming languages (oopls) us...
The discussion of the relative merits of linear versus branching time frameworks goes back to early 1980s. One of the beliefs dominating this discussion has been that “while specifying is easier in LTL (linear-temporal logic), verification is easier for CTL (branching-temporal logic)”. Indeed, the restricted syntax of CTL limits its expressive power and many important behaviors (e.g., strong fa...
A major challenge in software security is preserving software integrity. Traditionally, this problem is addressed through the development of software (self-) checking techniques that verify the integrity of its code and execution. Unfortunately, no satisfactory solutions for run-time verification of software integrity have been presented. In this paper, we approach the problem of run-time softw...
Safety critical systems place additional requirements to the programming language used to implement them with respect to traditional environments. Examples of features that influence the suitability of a programming language in such environments include complexity of definitions, expressive power, bounded space and time and verifiability. Hume is a novel programming language with a design which...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید