Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Software analysis and verification.

Zeitschriftenartikel zum Thema „Software analysis and verification“

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Software analysis and verification" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

V. Gayetri Devi, S., C. Nalini und N. Kumar. „An efficient software verification using multi-layered software verification tool“. International Journal of Engineering & Technology 7, Nr. 2.21 (20.04.2018): 454. http://dx.doi.org/10.14419/ijet.v7i2.21.12465.

Der volle Inhalt der Quelle
Annotation:
Rapid advancements in Software Verification and Validation have been critical in the wide development of tools and techniques to identify potential Concurrent bugs and hence verify the software correctness. A concurrent program has multiple processes and shared objects. Each process is a sequential program and they use the shared objects for communication for completion of a task. The primary objective of this survey is retrospective review of different tools and methods used for the verification of real-time concurrent software. This paper describes the proposed tool ‘F-JAVA’ for multithreaded Java codebases in contrast with existing ‘FRAMA-C’ platform, which is dedicated to real-time concurrent C software analysis. The proposed system is comprised of three layers, namely Programming rules generation stage, Verification stage with Particle Swarm Optimization (PSO) algorithm, and Performance measurement stage. It aims to address some of the challenges in the verification process such as larger programs, long execution times, and false alarms or bugs, and platform independent code verification
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Chaki, Sagar, Edmund Clarke, Natasha Sharygina und Nishant Sinha. „Verification of evolving software via component substitutability analysis“. Formal Methods in System Design 32, Nr. 3 (02.05.2008): 235–66. http://dx.doi.org/10.1007/s10703-008-0053-x.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Chun, Seung Su. „Effective Extraction of State Invariant for Software Verification“. Applied Mechanics and Materials 752-753 (April 2015): 1097–104. http://dx.doi.org/10.4028/www.scientific.net/amm.752-753.1097.

Der volle Inhalt der Quelle
Annotation:
In software design of complex systems, more time and effort are spent on verification than on constructions. Model checking for software verification techniques offer a large potential to obtain and early integration of verification in the design process. This paper describes how to easily specify and the software properties and to understand the software generating automatically invariant. In this paper deal with issue that state invariant is a property that holds in every reachable state. Not only can be used in understanding and analysis of complex software systems. In addition, it can be used for system verifications such as checking safety, consistency, and completeness. For these reasons, there are many vital researches for deriving state invariant from finite state machine models. In this research was to be considered to extract state invariant. Thus it is likely to be too complex for the user to understand. This paper let the user focus on some interested parts (called scopes) rather than a whole state space in a model. Computation Tree Logic (CTL) is used to specify scopes in which he/she is interested. Given a scope in CTL, forward reachability analysis is used to find out a set of states inside it. Obviously, a set of states calculated in this way is a subset of every reachable state. Keywords: Software verification, Invariant, Scopes, Model Checking
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Cao, Zongyu, Wanyou Lv, Yanhong Huang, Jianqi Shi und Qin Li. „Formal Analysis and Verification of Airborne Software Based on DO-333“. Electronics 9, Nr. 2 (14.02.2020): 327. http://dx.doi.org/10.3390/electronics9020327.

Der volle Inhalt der Quelle
Annotation:
With rapid technological advances in airborne control systems, it has become imperative to ensure the reliability, robustness, and adaptability of airborne software since failure of these software could result in catastrophic loss of property and life. DO-333 is a supplement to the DO-178C standard, which is dedicated to guiding the application of formal methods in the review and analysis of airborne software development processes. However, DO-333 lacks theoretical guidance on how to choose appropriate formal methods and tools to achieve verification objectives at each stage of the verification process, thereby limiting their practical application. This paper is intended to illustrate the formal methods and tools available in the verification process to lay down a general guide for the formal development and verification of airborne software. We utilized the Air Data Computer (ADC) software as the research object and applied different formal methods to verify software lifecycle artifacts. This example explains how to apply formal methods in practical applications and proves the effectiveness of formal methods in the verification of airborne software.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Sa'd, M. Al, J. Graham und G. P. Liney. „A software tool for 3D dose verification and analysis“. Journal of Physics: Conference Series 444 (26.06.2013): 012087. http://dx.doi.org/10.1088/1742-6596/444/1/012087.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Liu, Hua Xiao, Peng Zhang, Li Wen Mu, Ying Jin und Xue Hang Chi. „A Verification Method of Software Acceptability“. Applied Mechanics and Materials 411-414 (September 2013): 436–39. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.436.

Der volle Inhalt der Quelle
Annotation:
Software requirements validation is one of the hot problems of software engineering field, for the formal verification of software acceptability, this paper presents a formal verification software acceptability method. This method uses the 4-variable model to character the software system requirements and the software behavior, and gives a formal description of the 4-variable model based on the generic model of Tabular expression, and converts the Tabular expression into predicate logic knowledge base to verify the software acceptability. The analysis shows that the proposed method is effective, and the software acceptability can be verified.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Charlton, Nathaniel. „Program verification with interacting analysis plugins“. Formal Aspects of Computing 19, Nr. 3 (05.04.2007): 375–99. http://dx.doi.org/10.1007/s00165-007-0029-4.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Bertrane, Julien, Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné und Xavier Rival. „Static Analysis and Verification of Aerospace Software by Abstract Interpretation“. Foundations and Trends® in Programming Languages 2, Nr. 2-3 (2015): 71–190. http://dx.doi.org/10.1561/2500000002.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Kornecki, Andrew, und Mingye Liu. „Fault Tree Analysis for Safety/Security Verification in Aviation Software“. Electronics 2, Nr. 4 (31.01.2013): 41–56. http://dx.doi.org/10.3390/electronics2010041.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Venet, Arnaud. „A practical approach to formal software verification by static analysis“. ACM SIGAda Ada Letters XXVIII, Nr. 1 (April 2008): 92–95. http://dx.doi.org/10.1145/1387830.1387836.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
11

Yu, Huafeng, Yue Ma, Thierry Gautier, Loïc Besnard, Paul Le Guernic und Jean-Pierre Talpin. „Polychronous modeling, analysis, verification and simulation for timed software architectures“. Journal of Systems Architecture 59, Nr. 10 (November 2013): 1157–70. http://dx.doi.org/10.1016/j.sysarc.2013.08.004.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
12

Harrison, Michael D., Paolo Masci und Jose C. Campos. „Verification Templates for the Analysis of User Interface Software Design“. IEEE Transactions on Software Engineering 45, Nr. 8 (01.08.2019): 802–22. http://dx.doi.org/10.1109/tse.2018.2804939.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
13

Hunt, Warren A., Matt Kaufmann, J. Strother Moore und Anna Slobodova. „Industrial hardware and software verification with ACL2“. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 375, Nr. 2104 (04.09.2017): 20150399. http://dx.doi.org/10.1098/rsta.2015.0399.

Der volle Inhalt der Quelle
Annotation:
The ACL2 theorem prover has seen sustained industrial use since the mid-1990s. Companies that have used ACL2 regularly include AMD, Centaur Technology, IBM, Intel, Kestrel Institute, Motorola/Freescale, Oracle and Rockwell Collins. This paper introduces ACL2 and focuses on how and why ACL2 is used in industry. ACL2 is well-suited to its industrial application to numerous software and hardware systems, because it is an integrated programming/proof environment supporting a subset of the ANSI standard Common Lisp programming language. As a programming language ACL2 permits the coding of efficient and robust programs; as a prover ACL2 can be fully automatic but provides many features permitting domain-specific human-supplied guidance at various levels of abstraction. ACL2 specifications and models often serve as efficient execution engines for the modelled artefacts while permitting formal analysis and proof of properties. Crucially, ACL2 also provides support for the development and verification of other formal analysis tools. However, ACL2 did not find its way into industrial use merely because of its technical features. The core ACL2 user/development community has a shared vision of making mechanized verification routine when appropriate and has been committed to this vision for the quarter century since the Computational Logic, Inc., Verified Stack. The community has focused on demonstrating the viability of the tool by taking on industrial projects (often at the expense of not being able to publish much). This article is part of the themed issue ‘Verified trustworthy software systems’.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
14

HU, Jun. „Formal Analysis and Verification of Resource Adaptability for Internetware“. Journal of Software 19, Nr. 5 (21.10.2008): 1186–200. http://dx.doi.org/10.3724/sp.j.1001.2008.01186.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
15

ZHANG, Jing-Zhou, Hong-Min REN, Yu-Wei ZONG, Le-Qiu QIAN und San-Yuan ZHU. „Component Substitutability Analysis and Verification Based on Behavior Automata“. Journal of Software 21, Nr. 11 (28.01.2011): 2768–81. http://dx.doi.org/10.3724/sp.j.1001.2010.03780.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
16

Cacciagrano, Diletta Romana, Flavio Corradini, Rosario Culmone, Nikos Gorogiannis, Leonardo Mostarda, Franco Raimondi und Claudia Vannucchi. „Analysis and verification of ECA rules in intelligent environments“. Journal of Ambient Intelligence and Smart Environments 10, Nr. 3 (21.06.2018): 261–73. http://dx.doi.org/10.3233/ais-180487.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
17

Cha, Byung-Rae, Nam-Ho Kim, Seong-Ho Lee, Yoo-Kang Ji und Jong-Won Kim. „Integrated Verification of Hadoop Cluster Prototypes and Analysis Software for SMB“. Journal of Korea Navigation Institute 18, Nr. 2 (30.04.2014): 191–99. http://dx.doi.org/10.12673/jant.2014.18.2.191.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
18

WANG, Yuan. „A Method of Time Constraint Workflow Model Analysis and Verification“. Journal of Software 18, Nr. 9 (2007): 2153. http://dx.doi.org/10.1360/jos182153.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
19

LI, Xian-Tong. „A Method of Time Constraint Workflow Model Analysis and Verification“. Journal of Software 18, Nr. 10 (2007): 2469. http://dx.doi.org/10.1360/jos182469.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
20

SONG, Wei. „Timing Constraint Petri Nets and Their Schedulability Analysis and Verification“. Journal of Software 18, Nr. 1 (2007): 11. http://dx.doi.org/10.1360/jos180011.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
21

Diekmann, Cornelius, Lars Hupel, Julius Michaelis, Maximilian Haslbeck und Georg Carle. „Verified iptables Firewall Analysis and Verification“. Journal of Automated Reasoning 61, Nr. 1-4 (03.01.2018): 191–242. http://dx.doi.org/10.1007/s10817-017-9445-1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
22

Sánchez, César, Gerardo Schneider, Wolfgang Ahrendt, Ezio Bartocci, Domenico Bianculli, Christian Colombo, Yliès Falcone et al. „A survey of challenges for runtime verification from advanced application domains (beyond software)“. Formal Methods in System Design 54, Nr. 3 (November 2019): 279–335. http://dx.doi.org/10.1007/s10703-019-00337-w.

Der volle Inhalt der Quelle
Annotation:
Abstract Runtime verification is an area of formal methods that studies the dynamic analysis of execution traces against formal specifications. Typically, the two main activities in runtime verification efforts are the process of creating monitors from specifications, and the algorithms for the evaluation of traces against the generated monitors. Other activities involve the instrumentation of the system to generate the trace and the communication between the system under analysis and the monitor. Most of the applications in runtime verification have been focused on the dynamic analysis of software, even though there are many more potential applications to other computational devices and target systems. In this paper we present a collection of challenges for runtime verification extracted from concrete application domains, focusing on the difficulties that must be overcome to tackle these specific challenges. The computational models that characterize these domains require to devise new techniques beyond the current state of the art in runtime verification.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
23

Cuervo Parrino, Bruno, Juan Pablo Galeotti, Diego Garbervetsky und Marcelo F. Frias. „TacoFlow: optimizing SAT program verification using dataflow analysis“. Software & Systems Modeling 14, Nr. 1 (25.02.2014): 45–63. http://dx.doi.org/10.1007/s10270-014-0401-9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
24

Маурчев, Евгений, Evgeniy Maurchev, Юрий Балабин und Yuriy Balabin. „RUSCOSMIC — the new software toolbox for detailed analysis of cosmic ray interactions with matter“. Solar-Terrestrial Physics 2, Nr. 4 (02.02.2017): 3–10. http://dx.doi.org/10.12737/24269.

Der volle Inhalt der Quelle
Annotation:
At present, cosmic ray (CR) physics uses a considerable variety of methods for studying CR characteristics of both primary and secondary fluxes. Experimental methods make the main contribution, using various types of detectors, but numerical methods increasingly complement it due to the active development in computer technology. This approach provides researchers with the most extensive information about details of the process or phenomenon and allows us to make the most competent conclusions. This paper presents a concept of the RUSCOSMIC © software package based on the GEANT4 toolkit and representing a range of different numerical models for studying CR propagation through medium of different systems (radiation detectors, Earth’s atmosphere). The obtained results represent response functions of the main radiation detectors as well as some typical characteristics of secondary CR fluxes. Comparative results also show the operation of the module verification of calculations with experimental data.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
25

Popov, Dmitry. „Testing and verification of the LHCb Simulation“. EPJ Web of Conferences 214 (2019): 02043. http://dx.doi.org/10.1051/epjconf/201921402043.

Der volle Inhalt der Quelle
Annotation:
Monte-Carlo simulation is a fundamental tool for high-energy physics experiments, from the design phase to data analysis. In recent years its relevance has increased due to the ever growing measurements precision. Accuracy and reliability are essential features in simulation and particularly important in the current phase of the LHCb experiment, where physics analysis and preparation for data taking with the upgraded detector need to be performed at the same time. In this paper we will give an overview of the full chain of tests and procedures implemented for the LHCb Simulation software stack to ensure the quality of its results. The tests comprise simple checks to validate new software contributions in a nightlies system as well as more elaborate checks to probe simple physics and software quantities for performance and regression verifications. Commissioning of a new major version of the simulation software for production implies also validating its impact using a few physics anlayses. A new system for Simulation Data Quality (SimDQ) that is being put in place to help in the first phase of commissioning and for fast verification of all samples produced is also discussed.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
26

Chang, Qiu Xiang. „A Type of Bomb Falling Analysis and Reliability Verification“. Applied Mechanics and Materials 215-216 (November 2012): 771–74. http://dx.doi.org/10.4028/www.scientific.net/amm.215-216.771.

Der volle Inhalt der Quelle
Annotation:
Using UG to build a shell of the three-dimensional solid model, using the finite element software on the solid floor is analyzed, the shells fall into 8 drop, respectively, to various forms of stress and strain were compared, and the shells of the reliability analysis.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
27

HU, NA, BIN CONG, TAO GAO, YU CHEN, JUNYI SHEN, SHUJIN LI und CHUNLING MA. „Application of mixsep software package: Performance verification of male-mixed DNA analysis“. Molecular Medicine Reports 12, Nr. 2 (30.04.2015): 2431–42. http://dx.doi.org/10.3892/mmr.2015.3710.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
28

Salaün, Gwen, Xiang Fu und Sylvain Hallé. „Proceedings Fourth International Workshop on Testing, Analysis and Verification of Web Software“. Electronic Proceedings in Theoretical Computer Science 35 (17.09.2010): 1–2. http://dx.doi.org/10.4204/eptcs.35.0.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
29

Murrill, Branson W. „Integrating Software Analysis, Testing, and Verification into the Undergraduate Computer Science Curriculum“. Computer Science Education 8, Nr. 2 (August 1998): 85–99. http://dx.doi.org/10.1076/csed.8.2.85.3819.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
30

Gil, Amparo, Jean-Michel Muller und Javier Segura. „Preface to the special issue on Numerical Software: Design, Analysis and Verification“. Science of Computer Programming 90 (September 2014): 1. http://dx.doi.org/10.1016/j.scico.2014.03.002.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
31

Ripon, Shamim H., Sk Jahir Hossain und Moshiur Mahamud Piash. „Logic-Based Analysis and Verification of Software Product Line Variant Requirement Model“. International Journal of Knowledge and Systems Science 5, Nr. 4 (Oktober 2014): 52–76. http://dx.doi.org/10.4018/ijkss.2014100104.

Der volle Inhalt der Quelle
Annotation:
Software Product Line (SPL) provides the facility to systematically reuse of software improving the efficiency of software development regarding time, cost and quality. The main idea of SPL is to identify the common core functionality that can be implemented once and reused afterwards. A variant model has also to be developed to manage the variants of the SPL. Usually, a domain model consisting of the common and variant requirements is developed during domain engineering phase to alleviate the reuse opportunity. The authors present a product line model comprising of a variant part for the management of variant and a decision table to depict the customization of decision regarding each variant. Feature diagrams are widely used to model SPL variants. Both feature diagram and our variant model, which is based on tabular method, lacks logically sound formal representation and hence, not amenable to formal verification. Formal representation and verification of SPL has gained much interest in recent years. This chapter presents a logical representation of the variant model by using first order logic. With this representation, the table based variant model as well as the graphical feature diagram can now be verified logically. Besides applying first-order-logic to model the features, the authors also present an approach to model and analyze SPL model by using semantic web approach using OWL-DL. The OWL-DL representation also facilitates the search and maintenance of feature models and support knowledge sharing within a reusable engineering context. Reasoning tools are used to verify the consistency of the feature configuration for both logic-based and semantic web-based approaches.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
32

Amoiralis, Eleftherios I., Pavlos S. Georgilakis, Marina A. Tsili, Antonios G. Kladas und Athanassios T. Souflaris. „Complete Software Package for Transformer Design Optimization and Economic Evaluation Analysis“. Materials Science Forum 670 (Dezember 2010): 535–46. http://dx.doi.org/10.4028/www.scientific.net/msf.670.535.

Der volle Inhalt der Quelle
Annotation:
In the present paper, a Transformer Design Optimization (TDO) software package is developed providing a user-friendly transformer design and visualization environment. This software consists of a collection of design optimization, visualization and verification tools, able to provide transformer designers all the proper interactive capabilities required for the enhancement of the automated design process of a manufacturing industry.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
33

Ray, Sandip, Warren A. Hunt, John Matthews und J. Strother Moore. „A Mechanical Analysis of Program Verification Strategies“. Journal of Automated Reasoning 40, Nr. 4 (14.03.2008): 245–69. http://dx.doi.org/10.1007/s10817-008-9098-1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
34

Li, Shao Feng. „A Study on Network Protocol Validation Based on Timed Automata“. Applied Mechanics and Materials 543-547 (März 2014): 3386–90. http://dx.doi.org/10.4028/www.scientific.net/amm.543-547.3386.

Der volle Inhalt der Quelle
Annotation:
With the increasingly complex of computer software system, traditional software engineering methods for major software development will inevitably produce a lot of mistakes and catastrophic consequences for key industry users. Experiment with software engineering methods cannot guarantee the behavior at infinity reliability and security of the state space. All this requires formal analysis and verification to the complex system. In protocol verification based on automatic machines, the automaton is used to represent the behavior of the system, the time automaton is a formal method can be well applied to the network protocol verification.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
35

Guéguen, Hervé, Marie-Anne Lefebvre, Janan Zaytoon und Othman Nasri. „Safety verification and reachability analysis for hybrid systems“. Annual Reviews in Control 33, Nr. 1 (April 2009): 25–36. http://dx.doi.org/10.1016/j.arcontrol.2009.03.002.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
36

Sabouri, Hamideh, und Ramtin Khosravi. „Reducing the verification cost of evolving product families using static analysis techniques“. Science of Computer Programming 83 (April 2014): 35–55. http://dx.doi.org/10.1016/j.scico.2013.06.009.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
37

Herd, Benjamin, Simon Miles, Peter McBurney und Michael Luck. „Quantitative analysis of multi-agent systems through statistical verification of simulation traces“. International Journal of Agent-Oriented Software Engineering 6, Nr. 2 (2018): 156. http://dx.doi.org/10.1504/ijaose.2018.094373.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
38

Herd, Benjamin, Michael Luck, Peter McBurney und Simon Miles. „Quantitative analysis of multi-agent systems through statistical verification of simulation traces“. International Journal of Agent-Oriented Software Engineering 6, Nr. 2 (2018): 156. http://dx.doi.org/10.1504/ijaose.2018.10015554.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
39

Georg, Geri, Kyriakos Anastasakis, Behzad Bordbar, Siv Hilde Houmb, Indrakshi Ray und Manachai Toahchoodee. „Verification and Trade-Off Analysis of Security Properties in UML System Models“. IEEE Transactions on Software Engineering 36, Nr. 3 (Mai 2010): 338–56. http://dx.doi.org/10.1109/tse.2010.36.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
40

Chen, Xi, Yan Luo, Harry Hsieh, Laxmi Bhuyan und Felice Balarin. „Assertion Based Verification and Analysis of Network Processor Architectures“. Design Automation for Embedded Systems 9, Nr. 3 (September 2004): 163–76. http://dx.doi.org/10.1007/s10617-005-1193-5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
41

YAMAMOTO, JUNICHI, AKIHIKO OHSUGA und SHINICHI HONIDEN. „COOAD: A CASE TOOL FOR OBJECT-ORIENTED ANALYSIS AND DESIGN“. International Journal of Software Engineering and Knowledge Engineering 05, Nr. 03 (September 1995): 367–89. http://dx.doi.org/10.1142/s0218194095000186.

Der volle Inhalt der Quelle
Annotation:
Although many CASE tools for object-oriented methods (OO CASE tools) have been proposed, few, if any, can verify that the constructed analysis and design models actually match the requirements of the system being developed. In order to realize this kind of verification, we propose a software development method amalgamating OO CASE tools and algebraic specification techniques. We are developing an experimental system named COOAD (CASE tool for Object-Oriented Analysis and Design) in order to examine the effectiveness of our proposition. COOAD supports object-oriented analysis and design, verification of the analysis and design, and generation of code. In this paper, we propose the software development method, introduce COOAD, and illustrate the facilities of COOAD with an example.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
42

Gaggi, Ombretta, und Annalisa Bossi. „Analysis and verification of SMIL documents“. Multimedia Systems 17, Nr. 6 (19.04.2011): 487–506. http://dx.doi.org/10.1007/s00530-011-0233-1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
43

Ugarte, Iñigo, und Pablo Sanchez. „Verification of Embedded Systems Based on Interval Analysis“. International Journal of Parallel Programming 33, Nr. 6 (Dezember 2005): 697–720. http://dx.doi.org/10.1007/s10766-005-8909-9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
44

PERKUSICH, ANGELO, MARIA L. B. PERKUSICH und SHI-KUO CHANG. „OBJECT ORIENTED DESIGN, MODULAR ANALYSIS, AND FAULT-TOLERANCE OF REAL-TIME CONTROL SOFTWARE SYSTEMS“. International Journal of Software Engineering and Knowledge Engineering 06, Nr. 03 (September 1996): 447–76. http://dx.doi.org/10.1142/s0218194096000193.

Der volle Inhalt der Quelle
Annotation:
When specifying, designing and analyzing complex real-time systems, it is necessary to adopt a modular or compositional methodology. This methodology shall allow the designer the ability to verify local properties of individual modules or components in the system, and also shall allow the verification of the correct behavior of interacting components. The application of Petri nets for the modeling and verification of systems, at specification and design levels are well known. Despite the powerful structuring mechanisms available in the Petri nets theory for the construction of the model of complex systems, the designer is still likely to face the problem of state explosion, when analyzing and verifying large systems. In this work we introduce a modular analysis methodology for a kind of high level Petri nets named G-Nets.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
45

Zotkin, Sergey P., Nina S. Blokhina und Irina A. Zotkina. „About Development and Verification of Software for Finite Element Analysis of Beam Systems“. Procedia Engineering 111 (2015): 902–6. http://dx.doi.org/10.1016/j.proeng.2015.07.045.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
46

Mammen, Omana, Vijayan Nair, Satheesh Kumar und D. I. Sreenath. „Data Analysis Packages for the Verification and Validation of Launch Vehicle Flight Software“. IETE Technical Review 10, Nr. 1 (Januar 1993): 43–50. http://dx.doi.org/10.1080/02564602.1993.11437285.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
47

Morcos, Marc, Mohammad Rezaee und Akila Viswanathan. „Verification Software Based on Failure Modes and Effects Analysis for HDR Brachytherapy Plans“. Brachytherapy 17, Nr. 4 (Juli 2018): S129—S130. http://dx.doi.org/10.1016/j.brachy.2018.04.240.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
48

Güdemann, Matthias, und Leonardo Mariani. „Preface to the special issue on improving software quality through program analysis“. Software Quality Journal 29, Nr. 3 (15.06.2021): 595–96. http://dx.doi.org/10.1007/s11219-021-09563-0.

Der volle Inhalt der Quelle
Annotation:
AbstractThis special issue is dedicated to the presentation of novel results in the scope of program analysis, verification, and testing of software to improve its quality. The papers included in the special issue present approaches that successfully combine model-based test case generation, reasoning about functional equivalence, data mining, classification, and the combination of abstraction with model-checking, to address real software applications in realistic settings.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
49

Garanina, N. O., E. V. Bodin und E. A. Sidorova. „Using SPIN for verification of multiagent data analysis“. Automatic Control and Computer Sciences 49, Nr. 7 (Dezember 2015): 420–29. http://dx.doi.org/10.3103/s014641161507007x.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
50

Saleh, Mohamed, Ali Reza Arasteh, Assaad Sakha und Mourad Debbabi. „Forensic analysis of logs: Modeling and verification“. Knowledge-Based Systems 20, Nr. 7 (Oktober 2007): 671–82. http://dx.doi.org/10.1016/j.knosys.2007.05.002.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie