Bibliographies thématiques / Hardware Model Checking / Articles de revues

Articles de revues sur le sujet « Hardware Model Checking »

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Hardware Model Checking.
Auteur : Grafiati
Publié le 14 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Hardware Model Checking ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

Pixley, Carl, et Vigyan Singhal. « Model checking : a hardware design perspective ». International Journal on Software Tools for Technology Transfer (STTT) 2, no 3 (1 novembre 1999) : 288–306. http://dx.doi.org/10.1007/s100090050036.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Gong, Wei, et Jun Wei Jia. « Comparison of Model Checking Tools ». Advanced Materials Research 659 (janvier 2013) : 181–85. http://dx.doi.org/10.4028/www.scientific.net/amr.659.181.

Texte intégral
Résumé :
Model Checking is a method for verification. The model will be checked until the specification of it is proved or disproved. With the rising complexity of big models, there are non-checkable cases, in which cases the problem can be analyzed by some models, for example, bounded Model Checking means to analyze the model until a defined time or depth. The verification happens automatically. The programs for doing this are called Model Checking Tools or Model Checker. Model Checking are used in both software and hardware verification. It is an inherent part of hardware verification, whereas it is less used in the software verification.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Vasudevan, Shobha, E. Allen Emerson et Jacob A. Abraham. « Efficient Model Checking of Hardware Using Conditioned Slicing ». Electronic Notes in Theoretical Computer Science 128, no 6 (mai 2005) : 279–94. http://dx.doi.org/10.1016/j.entcs.2005.04.017.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Moiseenko, Evgenii, Michalis Kokologiannakis et Viktor Vafeiadis. « Model checking for a multi-execution memory model ». Proceedings of the ACM on Programming Languages 6, OOPSLA2 (31 octobre 2022) : 758–85. http://dx.doi.org/10.1145/3563315.

Texte intégral
Résumé :
Multi-execution memory models, such as Promising and Weakestmo, are an advanced class of weak memory consistency models that justify certain outcomes of a concurrent program by considering multiple candidate executions collectively. While this key characteristic allows them to support effective compilation to hardware models and a wide range of compiler optimizations, it makes reasoning about them substantially more difficult. In particular, we observe that Promising and Weakestmo inhibit effective model checking because they allow some suprisingly weak behaviors that cannot be generated by examining one execution at a time. We therefore introduce Weakestmo2, a strengthening of Weakestmo by constraining its multi-execution nature, while preserving the important properties of Weakestmo: DRF theorems, compilation to hardware models, and correctness of local program transformations. Our strengthening rules out a class of surprisingly weak program behaviors, which we attempt to characterize with the help of two novel properties: load buffering race freedom and certification locality. In addition, we develop WMC, a model checker for Weakestmo2 with performance close to that of the best tools for per-execution models.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Li, Dejian, Qizhi Zhang, Dongyan Zhao, Lei Li, Jiaji He, Yidong Yuan et Yiqiang Zhao. « Hardware Trojan Detection Using Effective Property-Checking Method ». Electronics 11, no 17 (24 août 2022) : 2649. http://dx.doi.org/10.3390/electronics11172649.

Texte intégral
Résumé :
Hardware Trojans refer to additional logic maliciously implanted by attackers in integrated circuits (ICs). Because of the potential security threat of hardware Trojans, they have attracted extensive attention to security issues. As a formal verification method, property checking has been proved to be a powerful solution for hardware Trojan detection. However, existing property-checking methods are limited by the unity of security properties and the model explosion problem of formal models. The limitations above hinder the practical applications of these methods. To alleviate these challenges, we propose an effective property-checking method for hardware Trojan detection. Specifically, we establish the formal model based on the principle of finite state machine (FSM), and the method can alleviate the model explosion problem. For property writing, we extract the core behavior characteristics of hardware Trojans and then generate properties for the verification of certain types of hardware Trojans. Experimental results demonstrate that our approach is applicable to detect information leakage and denial of service (DoS) hardware Trojans by verifying security properties.
Styles APA, Harvard, Vancouver, ISO, etc.
6

McMillan, K. L. « A methodology for hardware verification using compositional model checking ». Science of Computer Programming 37, no 1-3 (mai 2000) : 279–309. http://dx.doi.org/10.1016/s0167-6423(99)00030-1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Bjesse, Per. « Word level bitwidth reduction for unbounded hardware model checking ». Formal Methods in System Design 35, no 1 (7 juillet 2009) : 56–72. http://dx.doi.org/10.1007/s10703-009-0080-2.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Zhang, Jie, Jian Qi et Yong Guan. « Research on Hardware Design Verification Methods ». Advanced Materials Research 588-589 (novembre 2012) : 1208–13. http://dx.doi.org/10.4028/www.scientific.net/amr.588-589.1208.

Texte intégral
Résumé :
This paper first summarizes the existing basic theories and methods of hardware design verification. Then it analyzes and compares the simulation-based verification and formal methods-based verification, and discusses Equivalence Checking, Model Checking and Theorem Proving in detail. Finally, it points out the existing problems and the future directions in the field.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Cooke, John. « Symbolic Model Checking ». Microprocessors and Microsystems 18, no 5 (juin 1994) : 297. http://dx.doi.org/10.1016/0141-9331(94)90007-8.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Ben-David, Shoham, Cindy Eisner, Daniel Geist et Yaron Wolfsthal. « Model Checking at IBM ». Formal Methods in System Design 22, no 2 (mars 2003) : 101–8. http://dx.doi.org/10.1023/a:1022905120346.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
11

Emerson, E. Allen, et A. Prasad Sistla. « Symmetry and model checking ». Formal Methods in System Design 9, no 1-2 (août 1996) : 105–31. http://dx.doi.org/10.1007/bf00625970.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
12

Zakharov, V. « Review : Model Checking ». Journal of Logic and Computation 11, no 6 (1 décembre 2001) : 962–64. http://dx.doi.org/10.1093/logcom/11.6.962.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
13

Lukács, Dániel, Gergely Pongrácz et Máté Tejfel. « Model Checking-Based Performance Prediction for P4 ». Electronics 11, no 14 (6 juillet 2022) : 2117. http://dx.doi.org/10.3390/electronics11142117.

Texte intégral
Résumé :
Next-generation networks focus on scale and scope at the price of increasing complexity, leading to difficulties in network design and planning. As a result, anticipating all hardware- and software-related factors of network performance requires time-consuming and expensive benchmarking. This work presents a framework and software tool for automatically inferring the performance of P4 programmable network switches based on the P4 source code and probabilistic models of the execution environment with the hope of eliminating the requirement of the costly set-up of networked hardware and conducting benchmarks. We designed the framework using a top-down approach. First, we transform high-level P4 programs into a representation that can be refined incrementally by adding probabilistic environment models of increasing levels of complexity in order to improve the estimation precision. Then, we use the PRISM probabilistic model checker to perform the heavy weight calculations involved in static performance prediction. We present a formalization of the performance estimation problem, detail our solution, and illustrate its usage and validation through a case study conducted using a small P4 program and the P4C-BM reference switch. We show that the framework is already capable of performing estimation, and it can be extended with more concrete information to yield better estimates.
Styles APA, Harvard, Vancouver, ISO, etc.
14

Cho, Shenghsun, Mrunal Patel, Michael Ferdman et Peter Milder. « Practical Model Checking on FPGAs ». ACM Transactions on Reconfigurable Technology and Systems 14, no 2 (8 juillet 2021) : 1–18. http://dx.doi.org/10.1145/3448272.

Texte intégral
Résumé :
Software verification is an important stage of the software development process, particularly for mission-critical systems. As the traditional methodology of using unit tests falls short of verifying complex software, developers are increasingly relying on formal verification methods, such as explicit state model checking, to automatically verify that the software functions properly. However, due to the ever-increasing complexity of software designs, model checking cannot be performed in a reasonable amount of time when running on general-purpose cores, leading to the exploration of hardware-accelerated model checking. FPGAs have been demonstrated to be promising verification accelerators, exhibiting nearly three orders of magnitude speedup over software. Unfortunately, the “FPGA programmability wall,” particularly the long synthesis and place-and-route times, block the general adoption of FPGAs for model checking. To address this problem, we designed a runtime-programmable pipeline specifically for model checkers on FPGAs to minimize the “preparation time” before a model can be checked. Our design of the successor state generator and the state validator modules enables FPGA-acceleration of model checking without incurring the time-consuming FPGA implementation stages, reducing the preparation time before checking a model from hours to less than a minute, while incurring only a 26% execution time overhead compared to model-specific implementations.
Styles APA, Harvard, Vancouver, ISO, etc.
15

Ziller, Roberto, et Klaus Schneider. « Combining supervisor synthesis and model checking ». ACM Transactions on Embedded Computing Systems 4, no 2 (1 mai 2005) : 331–62. http://dx.doi.org/10.1145/1067915.1067920.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
16

Schlich, Bastian. « Model checking of software for microcontrollers ». ACM Transactions on Embedded Computing Systems 9, no 4 (mars 2010) : 1–27. http://dx.doi.org/10.1145/1721695.1721702.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
17

Kumar, Sanjeev, et Kai Li. « Using model checking to debug device firmware ». ACM SIGOPS Operating Systems Review 36, SI (31 décembre 2002) : 61–74. http://dx.doi.org/10.1145/844128.844135.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
18

Kesten, Yonit, Amir Pnueli, Li-On Raviv et Elad Shahar. « Model Checking with Strong Fairness ». Formal Methods in System Design 28, no 1 (janvier 2006) : 57–84. http://dx.doi.org/10.1007/s10703-006-4342-y.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
19

Sebastiani, Roberto, Eli Singerman, Stefano Tonetta et Moshe Y. Vardi. « GSTE is partitioned model checking ». Formal Methods in System Design 31, no 2 (26 mai 2007) : 177–96. http://dx.doi.org/10.1007/s10703-007-0036-3.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
20

Benerecetti, M. « Model checking multiagent systems ». Journal of Logic and Computation 8, no 3 (1 juin 1998) : 401–23. http://dx.doi.org/10.1093/logcom/8.3.401.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
21

Baier, Christel, Boudewijn R. Haverkort, Holger Hermanns et Joost-Pieter Katoen. « Model checking meets performance evaluation ». ACM SIGMETRICS Performance Evaluation Review 32, no 4 (mars 2005) : 10–15. http://dx.doi.org/10.1145/1059816.1059819.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
22

Kwiatkowska, Marta, Gethin Norman et David Parker. « Probabilistic model checking in practice ». ACM SIGMETRICS Performance Evaluation Review 32, no 4 (mars 2005) : 16–21. http://dx.doi.org/10.1145/1059816.1059820.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
23

Kumar, Jayanand Asok, Seyed Nematollah Ahmadyan et Shobha Vasudevan. « Efficient Statistical Model Checking of Hardware Circuits With Multiple Failure Regions ». IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33, no 6 (juin 2014) : 945–58. http://dx.doi.org/10.1109/tcad.2014.2299957.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
24

Griggio, Alberto, et Marco Roveri. « Comparing Different Variants of the ic3 Algorithm for Hardware Model Checking ». IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 35, no 6 (juin 2016) : 1026–39. http://dx.doi.org/10.1109/tcad.2015.2481869.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
25

Malik, Avinash, et David Gregg. « Orchestrating stream graphs using model checking ». ACM Transactions on Architecture and Code Optimization 10, no 3 (16 septembre 2013) : 1–25. http://dx.doi.org/10.1145/2512435.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
26

Henderson, Peter B. « Abstraction, model checking and software correctness ». ACM SIGCSE Bulletin 40, no 2 (juin 2008) : 23–24. http://dx.doi.org/10.1145/1383602.1383624.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
27

Leuschel, Michael, Andreas Podelski, C. R. Ramakrishnan et Ulrich Ultes-Nitsche. « Call for Papers Verification and Computational Logic Special Issue of Theory and Practice of Logic Programming ». Theory and Practice of Logic Programming 1, no 5 (septembre 2001) : 631–32. http://dx.doi.org/10.1017/s1471068401001089.

Texte intégral
Résumé :
Submission deadline: January 10, 2002The past decade has seen dramatic growth in the application of model checking techniques to the validation and verification of correctness properties of hardware, and more recently software systems. One of the methods is to model a hardware or software system as a finite, labelled transition system which is then exhaustively explored to decide whether a given temporal specification holds. Recently, there has been increasing interest in applying logic programming techniques to model checking in particular and verification in general. For example, table-based logic programming can be used as an efficient means of performing explicit model checking. Other research has successfully exploited set-based logic program analysis, constraint logic programming, and logic program transformation techniques.The aim of this special issue is to attract high-quality research papers on the interplay between verification techniques (e.g. model checking, reduction and abstraction) and logic programming techniques (e.g. constraints, abstract interpretation, program transformation).
Styles APA, Harvard, Vancouver, ISO, etc.
28

Fantechi, Alessandro, Stefania Gnesi et Gioia Ristori. « Model checking for action-based logics ». Formal Methods in System Design 4, no 2 (février 1994) : 187–203. http://dx.doi.org/10.1007/bf01384084.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
29

Naik, Kshirasagar, et Behcet Sarikaya. « Test case verification by model checking ». Formal Methods in System Design 2, no 3 (juin 1993) : 277–321. http://dx.doi.org/10.1007/bf01384135.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
30

Godefroid, Patrice. « Software Model Checking : The VeriSoft Approach ». Formal Methods in System Design 26, no 2 (mars 2005) : 77–101. http://dx.doi.org/10.1007/s10703-005-1489-x.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
31

Norman, Gethin, David Parker et Jeremy Sproston. « Model checking for probabilistic timed automata ». Formal Methods in System Design 43, no 2 (12 octobre 2012) : 164–90. http://dx.doi.org/10.1007/s10703-012-0177-x.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
32

Li, Yi, Jin Song Dong, Jing Sun, Yang Liu et Jun Sun. « Model checking approach to automated planning ». Formal Methods in System Design 44, no 2 (26 octobre 2013) : 176–202. http://dx.doi.org/10.1007/s10703-013-0197-1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
33

Abdulla, Parosh Aziz, Mohamed Faouzi Atig, Othmane Rezine et Jari Stenman. « Budget-bounded model-checking pushdown systems ». Formal Methods in System Design 45, no 2 (25 avril 2014) : 273–301. http://dx.doi.org/10.1007/s10703-014-0207-y.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
34

Cabodi, Gianpiero, Carmelo Loiacono, Marco Palena, Paolo Pasini, Denis Patti, Stefano Quer, Danilo Vendraminetto, Armin Biere et Keijo Heljanko. « Hardware Model Checking Competition 2014 : An Analysis and Comparison of Model Checkers and Benchmarks ». Journal on Satisfiability, Boolean Modeling and Computation 9, no 1 (1 janvier 2016) : 135–72. http://dx.doi.org/10.3233/sat190106.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
35

Baier, Christel, Lucia Cloth, Boudewijn R. Haverkort, Holger Hermanns et Joost-Pieter Katoen. « Performability assessment by model checking of Markov reward models ». Formal Methods in System Design 36, no 1 (février 2010) : 1–36. http://dx.doi.org/10.1007/s10703-009-0088-7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
36

Lin, Shang-Wei, et Pao-Ann Hsiung. « Model Checking Prioritized Timed Systems ». IEEE Transactions on Computers 61, no 6 (juin 2012) : 843–56. http://dx.doi.org/10.1109/tc.2011.99.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
37

Trindade, Alessandro Bezerra, Renato De Faria Degelo, Edilson Galvao Dos Santos Junior, Hussama Ibrahim Ismail, Helder Cruz Da Silva et Lucas Carvalho Cordeiro. « Multi-core model checking and maximum satisfiability applied to hardware-software partitioning ». International Journal of Embedded Systems 9, no 6 (2017) : 570. http://dx.doi.org/10.1504/ijes.2017.088044.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
38

Cordeiro, Lucas Carvalho, Helder Cruz Da Silva, Hussama Ibrahim Ismail, Renato De Faria Degelo, Edilson Galvao Dos Santos Junior et Alessandro Bezerra Trindade. « Multi-core model checking and maximum satisfiability applied to hardware-software partitioning ». International Journal of Embedded Systems 9, no 6 (2017) : 570. http://dx.doi.org/10.1504/ijes.2017.10008947.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
39

XU, X., S. KIMURA, K. HORIKAWA et T. TSUCHIYA. « Coverage Estimation Using Transition Perturbation for Symbolic Model Checking in Hardware Verification ». IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E89-A, no 12 (1 décembre 2006) : 3451–57. http://dx.doi.org/10.1093/ietfec/e89-a.12.3451.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
40

Kobayashi, Naoki. « Model Checking Higher-Order Programs ». Journal of the ACM 60, no 3 (juin 2013) : 1–62. http://dx.doi.org/10.1145/2487241.2487246.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
41

Ben-David, S., R. Trefler et G. Weddell. « Model Checking Using Description Logic ». Journal of Logic and Computation 20, no 1 (13 novembre 2008) : 111–31. http://dx.doi.org/10.1093/logcom/exn062.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
42

BOZZANO, MARCO, GIORGIO DELZANNO et MAURIZIO MARTELLI. « Model checking linear logic specifications ». Theory and Practice of Logic Programming 4, no 5-6 (12 août 2004) : 573–619. http://dx.doi.org/10.1017/s1471068404002066.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
43

Jiang, Jiulei, Panqing Zhang et Zhanyou Ma. « The μ-Calculus Model-Checking Algorithm for Generalized Possibilistic Decision Process ». Applied Sciences 10, no 7 (9 avril 2020) : 2594. http://dx.doi.org/10.3390/app10072594.

Texte intégral
Résumé :
Model checking is a formal automatic verification technology for complex concurrent systems. It is used widely in the verification and analysis of computer software and hardware systems, communication protocols, security protocols, etc. The generalized possibilistic μ-calculus model-checking algorithm for decision processes is studied to solve the formal verification problem of concurrent systems with nondeterministic information and incomplete information on the basis of possibility theory. Firstly, the generalized possibilistic decision process is introduced as the system model. Then, the classical proposition μ-calculus is improved and extended, and the concept of generalized possibilistic μ-calculus (GPoμ) is given to describe the attribute characteristics of nondeterministic systems. Then, the GPoμ model-checking algorithm is proposed, and the model-checking problem is simplified to fuzzy matrix operations. Finally, a specific example and a case study are analyzed and verified. Compared with the classical μ-calculus, the generalized possibilistic μ-calculus has a stronger expressive power and can better characterize the attributes of nondeterministic systems. The model-checking algorithm can give the possibility that the system satisfies the attributes. The research work provides a new idea and method for model checking nondeterministic systems.
Styles APA, Harvard, Vancouver, ISO, etc.
44

Tao, Zhi-Hong, Hans Kleine Büning et Li-Fu Wang. « Direct Model Checking Matrix Algorithm ». Journal of Computer Science and Technology 21, no 6 (novembre 2006) : 944–49. http://dx.doi.org/10.1007/s11390-006-0944-5.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
45

Tao, Zhi-Hong, Cong-Hua Zhou, Zhong Chen et Li-Fu Wang. « Bounded Model Checking of CTL ». Journal of Computer Science and Technology 22, no 1 (janvier 2007) : 39–43. http://dx.doi.org/10.1007/s11390-007-9004-z.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
46

Rus, Teodor, et Eric van Wyk. « Using Model Checking in a Parallelizing Compiler ». Parallel Processing Letters 08, no 04 (décembre 1998) : 459–71. http://dx.doi.org/10.1142/s0129626498000468.

Texte intégral
Résumé :
In this paper we describe the usage of temporal logic model checking in a parallelizing compiler to analyze the structure of a source program and locate opportunities for optimization and parallelization. The source program is represented as a process graph in which the nodes are sequential processes and the edges are control and data dependence relationships between the computations at the nodes. By labeling the nodes and edges with descriptive atomic propositions and by specifying the conditions necessary for optimizations and parallelizations as temporal logic formulas, we can use a model checker to locate nodes of the process graph where particular optimizations can be made. To discover opportunities for new optimizations or modify existing ones in this parallelizing compiler, we need only specify their conditions as temporal logic formulas; we do not need to add to or modify the code of the compiler. This greatly simplifies the process of locating optimization and parallelization opportunities in the source program and makes it easier to experiment with complex optimizations. Hence, this methodology provides a convenient, concise, and formal framework in which to carry out program optimizations by compilers.
Styles APA, Harvard, Vancouver, ISO, etc.
47

Strichman, Ofer. « Accelerating Bounded Model Checking of Safety Properties ». Formal Methods in System Design 24, no 1 (janvier 2004) : 5–24. http://dx.doi.org/10.1023/b:form.0000004785.67232.f8.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
48

Grumberg, Orna, Tamir Heyman et Assaf Schuster. « Distributed Symbolic Model Checking for μ-Calculus ». Formal Methods in System Design 26, no 2 (mars 2005) : 197–219. http://dx.doi.org/10.1007/s10703-005-1493-1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
49

Barnat, Jiří, et Ivana Černá. « Distributed breadth-first search LTL model checking ». Formal Methods in System Design 29, no 2 (8 juillet 2006) : 117–34. http://dx.doi.org/10.1007/s10703-006-0009-y.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
50

Schuele, Tobias, et Klaus Schneider. « Bounded model checking of infinite state systems ». Formal Methods in System Design 30, no 1 (31 août 2006) : 51–81. http://dx.doi.org/10.1007/s10703-006-0019-9.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Hardware Model Checking » pour d’autres types de sources :
Thèses
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie