Littérature scientifique sur le sujet « Model and Program Verification »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Model and Program Verification ».
À 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.
Articles de revues sur le sujet "Model and Program Verification"
Yim, Joon-Seo, Chang-Jae Park, In-Cheol Park et Chong-Min Kyung. « Design Verification of Complex Microprocessors ». Journal of Circuits, Systems and Computers 07, no 04 (août 1997) : 301–18. http://dx.doi.org/10.1142/s021812669700022x.
Texte intégralHe, Pei, Achun Hu, Dongqing Xie et Zhiping Fan. « Component-Based Verification Model of Sequential Programs ». Journal of Software 10, no 11 (novembre 2015) : 1319–26. http://dx.doi.org/10.17706//jsw.10.11.1319-132.
Texte intégralZelkowitz, M. V. « A functional correctness model of program verification ». Computer 23, no 11 (novembre 1990) : 30–39. http://dx.doi.org/10.1109/2.60878.
Texte intégralGregorics, Tibor, et Zsolt Borsi. « A unified approach of program verification ». Acta Universitatis Sapientiae, Informatica 9, no 1 (26 juillet 2017) : 65–82. http://dx.doi.org/10.1515/ausi-2017-0005.
Texte intégralDE ANGELIS, EMANUELE, FABIO FIORAVANTI, ALBERTO PETTOROSSI et MAURIZIO PROIETTI. « Predicate Pairing for program verification ». Theory and Practice of Logic Programming 18, no 2 (4 décembre 2017) : 126–66. http://dx.doi.org/10.1017/s1471068417000497.
Texte intégralLuo, Min. « Model Extraction and Reliability Verification on SOCKET Program ». Advanced Materials Research 616-618 (décembre 2012) : 2055–59. http://dx.doi.org/10.4028/www.scientific.net/amr.616-618.2055.
Texte intégralYamane, Satoshi. « Deductive Verification Method of Real-Time Safety Properties for Embedded Assembly Programs ». Electronics 8, no 10 (14 octobre 2019) : 1163. http://dx.doi.org/10.3390/electronics8101163.
Texte intégralNeyzov, Maxim V., et Egor V. Kuzmin. « LTL-specification for development and verification of control programs ». Modeling and Analysis of Information Systems 30, no 4 (11 décembre 2023) : 308–39. http://dx.doi.org/10.18255/1818-1015-2023-4-308-339.
Texte intégralZUO, Zhengkang, Ying HU, Qing HUANG, Yuan WANG et Changjing WANG. « Automatic Algorithm Programming Model Based on the Improved Morgan's Refinement Calculus ». Wuhan University Journal of Natural Sciences 27, no 5 (octobre 2022) : 405–14. http://dx.doi.org/10.1051/wujns/2022275405.
Texte intégralKuzmin, E. V., et V. A. Sokolov. « On Construction and Verification of PLC-Programs ». Modeling and Analysis of Information Systems 19, no 4 (28 février 2015) : 25–36. http://dx.doi.org/10.18255/1818-1015-2012-4-25-36.
Texte intégralThèses sur le sujet "Model and Program Verification"
Beyene, Tewodros Awgichew. « Constraint-based verification of imperative programs ». Master's thesis, Faculdade de Ciências e Tecnologia, 2011. http://hdl.handle.net/10362/7965.
Texte intégralThe continuous reduction in the cost of computing ever since the first days of computers has resulted in the ubiquity of computing systems today; there is no any sphere of life in the daily routine of human beings that is not directly or indirectly influenced by computer systems anymore. But this high reliance on computers has not come without a risk to the society or a challenge to computer scientists. As many computer systems of today are safety critical, it is crucial for computer scientists to make sure that computer systems, both the hardware and software components, behave correctly under all circumstances. In this study, we are interested in techniques of program verification that are aimed at ensuring the correctness of the software component. In this work, constraint programming techniques are used to device a program verification framework where constraint solvers play the role of typical verification tools. The programs considered are written in some subset of Java, and their specifications are written in some subset of Java Modeling Language(JML). In our framework, the program verification process has two principal steps: constraint generation and constraint solving. A program together with its specification is first parsed into a system of constraints. And then, the system of constraints is processed using constraint solvers so that the correctness of the original program is proved to hold, or not, based on the outcome of the constraint solving. The performance of our framework is compared with other well-known program verification tools using standard benchmarks, and our framework has performed quite well for most of the cases.
Kaiser, Alexander. « Monotonicity in shared-memory program verification ». Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:1d16b4b5-524a-40db-b7bf-062374f8679c.
Texte intégralBezuidenhout, Johannes Abraham. « Automated program generation : bridging the gap between model and implementation ». Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/19584.
Texte intégralENGLISH ABSTRACT: The general goal of this thesis is the investigation of a technique that allows model checking to be directly integrated into the software development process, preserving the benefits of model checking while addressing some of its limitations. A technique was developed that allows a complete executable implementation to be generated from an enhanced model specification. This included the development of a program, the Generator, that completely automates the generation process. In addition, it is illustrated how structuring the specification as a transitions system formally separates the control flow from the details of manipulating data. This simplifies the verification process which is focused on checking control flow in detail. By combining this structuring approach with automated implementation generation we ensure that the verified system behaviour is preserved in the actual implementation. An additional benefit is that data manipulation, which is generally not suited to model checking, is restricted to separate, independent code fragments that can be verified using verification techniques for sequential programs. These data manipulation code segments can also be optimised for the implementation without affecting the verification of the control structure. This technique was used to develop a reactive system, an FTP server, and this experiment illustrated that efficient code can be automatically generated while preserving the benefits of model checking.
AFRIKAANSE OPSOMMING: Hierdie tesis ondersoek ’n tegniek wat modeltoetsing laat deel uitmaak van die sagtewareontwikkelingsproses, en sodoende betroubaarheid verbeter terwyl sekere tekorkominge van die tradisionele modeltoetsing proses aangespreek word. Die tegniek wat ontwikkel is maak dit moontlik om ’n volledige uitvoerbare implementasie vanaf ’n gespesialiseerde model spesifikasie te genereer. Om die implementasie-generasie stap ten volle te outomatiseer is ’n program, die Generator, ontwikkel. Daarby word dit ook gewys hoe die kontrolevloei op ’n formele manier geskei kan word van data-manipulasie deur gebruik te maak van ’n staatoorgangsstelsel struktureringsbenadering. Dit vereenvoudig die verifikasie proses, wat fokus op kontrolevloei. Deur di´e struktureringsbenadering te kombineer met outomatiese implementasie-generasie, word verseker dat die geverifieerde stelsel se gedrag behou word in die finale implementasie. ’n Bykomende voordeel is dat data-manipulasie, wat gewoonlik nie geskik is vir modeltoetsing nie, beperk word tot aparte, onafhanklike kode segmente wat geverifieer kan word deur gebruik te maak van verifikasie tegnieke vir sekwensi¨eele programme. Hierdie data-manipulasie kode segmente kan ook geoptimeer word vir die implementasie sonder om die verifikasie van die kontrole struktuur te be¨ınvloed. Hierdie tegniek word gebruik om ’n reaktiewe stelsel, ’n FTP bediener, te ontwikkel, en di´e eksperiment wys dat doeltreffende kode outomaties gegenereer kan word terwyl die voordele van modeltoetsing behou word.
Wardana, Awang Noor Indra. « Development of automatic program verification for continuous function chart based on model checking / ». Kassel : Kassel Univ. Press, 2009. http://d-nb.info/998980234/04.
Texte intégralde, Carvalho Gomes Pedro. « Automatic Extraction of Program Models for Formal Software Verification ». Doctoral thesis, KTH, Teoretisk datalogi, TCS, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-176286.
Texte intégralDen här avhandlingen studerar automatisk konstruktion av abstrakta modeller för formell verifikation av program skrivna i verkliga programmeringsspråk. Avhandlingen består av tre delar som involverar olika typer av program, programmeringsspråk, verifikationsscenarier, programmodeller och egenskaper.Del ett presenterar en algoritm för generation av flödesgrafer från sekventiella program i Java bytekod. Graferna är skräddarsydda för en kompositionell teknik för verifikationen av temporala kontrollflödens säkerhetsegenskaper. Vi visar att de extraherade modellerna sunt överapproximerar programbeteenden med avseende på sekvenser av metodanrop och -undantag. Således gäller egenskaperna som kan fastställas genom kompositionstekniken över kontrollflöden även för programmen. Vi implementerar dessutom algoritmen i form av verktyget ConFlEx och utvärderar verktyget på ett antal testfall.Del två presenterar en teknik för att generera modeller av ofullständiga program. Det vill säga, program där implementationen av åtminstone en komponent inte är tillgänglig. Vi definierar ett ramverk för att representera ofullständiga Java bytekodsprogram och utökar algoritmen från del ett till att hantera ofullständig kod. Därefter presenterar vi raffineringsregler - villkor för att instansiera den saknade koden - och bevisar att reglerna bevarar relevanta egenskaper av kontrollflödesgrafer. Vi har dessutom utökat ConFlEx till att stödja de nya definitionerna och har omvärderat verktyget på testfall av ofullständiga program.Del tre angriper verifikation av multitrådade program. Vi presenterar en teknik för att bevisa följande egenskap för synkronisering med vilkorsvariabler: "Om varje trådsynkronisering under samma villkor så småningom stiger in i sitt synkroniseringsblock så kommer varje tråd också till slut lämna synkroniseringen". För att stödja verifikationen så introducerar vi först SyncTask - ett enkelt mellanliggande språk för att specificera synkronisering av parallella beräkningar. Därefter presenterar vi ett annoteringsspråk för Java som tillåter automatisk extrahering av SyncTask-program och visar att egenskapen gäller om och endast om motsvarande SyncTask-program terminerar. Vi reducerar termineringsproblemet till ett nåbarhetsproblem på färgade Petrinät samt definierar en algoritm som skapar Petrinät från SyncTask-program där programmet terminerar om och endast om nätet alltid når en särskild mängd av döda konfigurationer. Extraktionen av SyncTask-program och deras motsvarande Petrinät är implementerade i form av verktyget STaVe. Slutligen utvärderar vi verktyget genom att mata annoterade.
QC 20151101
He, Nannan. « Exploring Abstraction Techniques for Scalable Bit-Precise Verification of Embedded Software ». Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/27683.
Texte intégralPh. D.
Mahtab, Tazeen 1981. « Automated verification of model-based programs under uncertainty ». Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28453.
Texte intégralIncludes bibliographical references (p. 89-91).
Highly robust embedded systems have been enabled through software executives that have the ability to reason about their environment. Those that employ the model-based autonomy paradigm automatically diagnose and plan future actions, based on models of themselves and their environment. This includes autonomous systems that must operate in harsh and dynamic environments, like, deep space. Such systems must be robust to a large space of possible failure scenarios. This large state space poses difficulties for traditional scenario-based testing, leading to a need for new approaches to verification and validation. We propose a novel verification approach that generates an analysis of the most likely failure scenarios for a model-based program. By finding only the lost likely failures, we increase the relevance and reduce the quantity of information the developer must examine. First, we provide the ability to verify a stochastic system that encodes both off-nominal and nominal scenarios. We incorporate uncertainty into the verification process by acknowledging that all such programs may fail, but in different ways, with different likelihoods. The verification process is one of finding the most likely executions that fail the specification. Second, we provide a capability for verifying executable specifications that are fault-aware. We generalize offline plant model verification to the verification of model-based programs, which consist of both a plant model that captures the physical plant's nominal and off-nominal states and a control program that specifies its desired behavior. Third, we verify these specifications through execution of the RMPL executive itself. We therefore circumvent the difficulty of formalizing the behavior of complex
(cont.) software executives. We present the RMPL Verifier, a tool for verification of model-based programs written in the Reactive Model-based Programming Language (RMPL) for the Titan execution kernel. Using greedy forward-directed search, this tool finds as counterexamples to the program's goal specification the most likely executions that do not achieve the goal within a given time bound.
by Tazeen Mahtab.
M.Eng.and S.B.
Newcomb, Tom C. « Model checking data-independent systems with arrays ». Thesis, University of Oxford, 2003. http://ora.ox.ac.uk/objects/uuid:7fc75da9-e653-4578-b061-8a1cc30ba609.
Texte intégralRezine, Othmane. « Verification of networks of communicating processes : Reachability problems and decidability issues ». Doctoral thesis, Uppsala universitet, Avdelningen för datorteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-334788.
Texte intégralde, Carvalho Gomes Pedro. « Sound Modular Extraction of Control Flow Graphs from Java Bytecode ». Licentiate thesis, KTH, Teoretisk datalogi, TCS, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-105275.
Texte intégralQC 20121122
Livres sur le sujet "Model and Program Verification"
Dampier, David A. A model for merging software prototypes. Monterey, Calif : Naval Postgraduate School, 1992.
Trouver le texte intégralGeorge, Sabolish, et United States. National Aeronautics and Space Administration., dir. A process improvement model for software verification and validation. [Morgantown, West Va.] : West Virginia University, 1994.
Trouver le texte intégralLarsen, Gunner C. Verification of Design Basis Program 2 : A coupled aeroelastic wind turbine model. Roskilde, Denmark : Risø National Laboratory, 1994.
Trouver le texte intégralU.S. Nuclear Regulatory Commission. Office of Nuclear Regulatory Research, dir. The development and verification of TRACE model for IIST experiments. Washington, DC : Office of Nuclear Regulatory Research, U.S. Nuclear Regulatory Commission, 2011.
Trouver le texte intégralVMCAI 2004 (Conference) (2004 Venice, Italy). Verification, model checking, and abstract interpretation : 5th International Conference, VMCAI 2004, Venice, Italy, January 11-13, 2004 : proceedings. Berlin : Springer, 2004.
Trouver le texte intégralFrancesco, Logozzo, Peled Doron 1962- et Zuck Lenore D. 1958-, dir. Verification, model checking, and abstract interpretation : 9th international conference, VMCAI 2008, San Francisco, USA, January 7-9, 2008 : proceedings. Berlin : Springer, 2008.
Trouver le texte intégralCenter, Langley Research, dir. A verification procedure for MSC/NASTRAN finite element models. Hampton, Va : National Aeronautics and Space Administration, Langley Research Center, 1995.
Trouver le texte intégralVMCAI 2002 (2002 Venice, Italy). Verification, model checking, and abstract interpretation : Third international workshop, VMCAI 2002, Venice, Italy, January 21-22, 2002 : revised papers. Berlin : Springer, 2002.
Trouver le texte intégralRoever, W. P. de. Data refinement : Model-oriented proof methods and their comparison. Cambridge : Cambridge University Press, 2009.
Trouver le texte intégralVMCAI 2005 (2005 Paris, France). Verification, model checking, and abstract interpretation : 6th international conference, VMCAI 2005, Paris, France, January 17-19, 2005 : proceedings. Berlin : Springer, 2005.
Trouver le texte intégralChapitres de livres sur le sujet "Model and Program Verification"
Iosif, Radu. « Program Verification with Separation Logic ». Dans Model Checking Software, 48–62. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94111-0_3.
Texte intégralJhala, Ranjit, Andreas Podelski et Andrey Rybalchenko. « Predicate Abstraction for Program Verification ». Dans Handbook of Model Checking, 447–91. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-10575-8_15.
Texte intégralWu, Wenhao, Jan Hückelheim, Paul D. Hovland, Ziqing Luo et Stephen F. Siegel. « Model Checking Race-Freedom When “Sequential Consistency for Data-Race-Free Programs” is Guaranteed ». Dans Computer Aided Verification, 265–87. Cham : Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37703-7_13.
Texte intégralChatterjee, Prantik, Jaydeepsinh Meda, Akash Lal et Subhajit Roy. « Proof-Guided Underapproximation Widening for Bounded Model Checking ». Dans Computer Aided Verification, 304–24. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13185-1_15.
Texte intégralGurfinkel, Arie. « Program Verification with Constrained Horn Clauses (Invited Paper) ». Dans Computer Aided Verification, 19–29. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13185-1_2.
Texte intégralAndriushchenko, Roman, Milan Češka, Sebastian Junges, Joost-Pieter Katoen et Šimon Stupinský. « PAYNT : A Tool for Inductive Synthesis of Probabilistic Programs ». Dans Computer Aided Verification, 856–69. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_40.
Texte intégralAmilon, Jesper, Zafer Esen, Dilian Gurov, Christian Lidström et Philipp Rümmer. « Automatic Program Instrumentation for Automatic Verification ». Dans Computer Aided Verification, 281–304. Cham : Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37709-9_14.
Texte intégralChien, Po-Chun, et Nian-Ze Lee. « CPV : A Circuit-Based Program Verifier ». Dans Tools and Algorithms for the Construction and Analysis of Systems, 365–70. Cham : Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57256-2_22.
Texte intégralShankar, N. « Machine-Assisted Verification Using Theorem Proving and Model Checking ». Dans Mathematical Methods in Program Development, 499–528. Berlin, Heidelberg : Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-60858-2_26.
Texte intégralHuisman, Marieke, Irem Aktug et Dilian Gurov. « Program Models for Compositional Verification ». Dans Formal Methods and Software Engineering, 147–66. Berlin, Heidelberg : Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-88194-0_11.
Texte intégralActes de conférences sur le sujet "Model and Program Verification"
Lathouwers, Sophie, et Vadim Zaytsev. « Modelling program verification tools for software engineers ». Dans MODELS '22 : ACM/IEEE 25th International Conference on Model Driven Engineering Languages and Systems. New York, NY, USA : ACM, 2022. http://dx.doi.org/10.1145/3550355.3552426.
Texte intégral« Program Committee ». Dans 2010 Workshop on Model-Driven Engineering, Verification, and Validation (MoDeVVa). IEEE, 2010. http://dx.doi.org/10.1109/modevva.2010.8.
Texte intégralOwe, Olaf, Jia-Chun Lin et Elahe Fazeldehkordi. « A Flexible Framework for Program Evolution and Verification ». Dans 7th International Conference on Model-Driven Engineering and Software Development. SCITEPRESS - Science and Technology Publications, 2019. http://dx.doi.org/10.5220/0007690301770189.
Texte intégralOwe, Olaf, Jia-Chun Lin et Elahe Fazeldehkordi. « A Flexible Framework for Program Evolution and Verification ». Dans 7th International Conference on Model-Driven Engineering and Software Development. SCITEPRESS - Science and Technology Publications, 2019. http://dx.doi.org/10.5220/0007690301790191.
Texte intégralSun, Liang, Bailin Lu, Liangze Yin, Zhe Bu et Wenjing Jin. « OpenMP Program Verification Based on Bounded Model Checking ». Dans 2023 IEEE 23rd International Conference on Software Quality, Reliability, and Security Companion (QRS-C). IEEE, 2023. http://dx.doi.org/10.1109/qrs-c60940.2023.00107.
Texte intégralEven-Mendoza, Karine, Antti E. J. Hyvärinen, Hana Chockler et Natasha Sharygina. « Lattice-based SMT for program verification ». Dans MEMOCODE '19 : 17th ACM-IEEE International Conference on Formal Methods and Models for System Design. New York, NY, USA : ACM, 2019. http://dx.doi.org/10.1145/3359986.3361214.
Texte intégralKamkin, Alexander, Eugene Kornykhin et Dmitry Vorobyev. « Reconfigurable Model-Based Test Program Generator for Microprocessors ». Dans 2011 IEEE Fourth International Conference on Software Testing, Verification and Validation Workshops (ICSTW). IEEE, 2011. http://dx.doi.org/10.1109/icstw.2011.35.
Texte intégralLiu, Haihao, Shuangquan Chen, Jianxin Wei et Xiang-Yang Li. « Experimental verification of frequency-dependent characteristics in a physical model with horizontal fractures ». Dans SEG Technical Program Expanded Abstracts 2017. Society of Exploration Geophysicists, 2017. http://dx.doi.org/10.1190/segam2017-17731876.1.
Texte intégralWardana, Awang N. I., Jens Folmer et Birgit Vogel-Heuser. « Automatic program verification of continuous function chart based on model checking ». Dans IECON 2009 - 35th Annual Conference of IEEE Industrial Electronics (IECON). IEEE, 2009. http://dx.doi.org/10.1109/iecon.2009.5415231.
Texte intégralEshraghi, Shaun, Michael Carolan, Benjamin Perlman et Francisco González. « Comparison of Methodologies for Finite Element Model Validation of Railroad Tank Car Side Impact Tests ». Dans ASME 2020 Verification and Validation Symposium. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/vvs2020-8822.
Texte intégralRapports d'organisations sur le sujet "Model and Program Verification"
Baader, Franz, et Benjamin Zarrieß. Verification of Golog Programs over Description Logic Actions. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.198.
Texte intégralWeber, Scott, Nathan E. Bixler et Katherine Letizia McFadden. SecPop Version 4 : Sector Population Land Fraction and Economic Estimation Program : Users ? Guide Model Manual and Verification Report. Office of Scientific and Technical Information (OSTI), avril 2018. http://dx.doi.org/10.2172/1436067.
Texte intégralKoopmann, Patrick. Actions with Conjunctive Queries : Projection, Conflict Detection and Verification. Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.243.
Texte intégralZarrieß, Benjamin, et Patrick Koopmann. On the Complexity of Verifying Timed Golog Programs over Description Logic Actions (Extended Version). Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.241.
Texte intégralKrabill, Eleanor, Vivienne Zhang, Eric Lepowsky, Christoph Wirz, Alexander Glaser, Jaewoo Shin, Veronika Bedenko et Pavel Podvig. Menzingen Verification Experiment - Verifying the Absence of Nuclear Weapons in the Field. Sous la direction de Pavel Podvig. The United Nations Institute for Disarmament Research, juillet 2023. http://dx.doi.org/10.37559/wmd/23/mve.
Texte intégralSchroeder, J. E. Hydraulic fracture model and diagnostics verification at GRI/DOE multi-site projects and tight gas sand program support. Final report, July 28, 1993--February 28, 1997. Office of Scientific and Technical Information (OSTI), décembre 1997. http://dx.doi.org/10.2172/639755.
Texte intégralPalkovic, Steven, Yasamin Salamat, Brendon Willey et Simon Bellemare. PR-610-183867-R01 Fracture Toughness via In-ditch Non-destructive Testing - Validation. Chantilly, Virginia : Pipeline Research Council International, Inc. (PRCI), septembre 2020. http://dx.doi.org/10.55274/r0011802.
Texte intégralMyers, Rodney S., et Geetha Mandava. Retention Model Verification. Fort Belvoir, VA : Defense Technical Information Center, mars 2004. http://dx.doi.org/10.21236/ada421782.
Texte intégralMarzban, Caren, David W. Jones et Scott A. Sandgathe. Verification-Based Model Tuning. Fort Belvoir, VA : Defense Technical Information Center, septembre 2012. http://dx.doi.org/10.21236/ada574125.
Texte intégralMarzban, Caren, David W. Jones et Scott A. Sandgathe. Verification-Based Model Tuning. Fort Belvoir, VA : Defense Technical Information Center, septembre 2013. http://dx.doi.org/10.21236/ada598028.
Texte intégral