Relevant bibliographies by topics / Verification theorem

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Verification theorem'

Author: Grafiati
Published: 4 June 2021
Last updated: 22 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Verification theorem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Verification theorem"

1

Bensoussan, Alain, SingRu (Celine) Hoe, Joohyun Kim, and Zhongfeng Yan. "Mean field verification theorem." Communications in Information and Systems 21, no. 2 (2021): 253–67. http://dx.doi.org/10.4310/cis.2021.v21.n2.a4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

KANSO, KARIM, and ANTON SETZER. "A light-weight integration of automated and interactive theorem proving." Mathematical Structures in Computer Science 26, no. 1 (2014): 129–53. http://dx.doi.org/10.1017/s0960129514000140.

Full text
Abstract:
In this paper, aimed at dependently typed programmers, we present a novel connection between automated and interactive theorem proving paradigms. The novelty is that the connection offers a better trade-off between usability, efficiency and soundness when compared to existing techniques. This technique allows for a powerful interactive proof framework that facilitates efficient verification of finite domain theorems and guided construction of the proof of infinite domain theorems. Such situations typically occur with industrial verification. As a case study, an embedding of SAT and CTL model c
APA, Harvard, Vancouver, ISO, and other styles
3

Kim, Min-Joong. "Verification of the reciprocity theorem." Applied Optics 27, no. 13 (1988): 2645. http://dx.doi.org/10.1364/ao.27.002645.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Koai, Takayuki, and Makoto Tatsuta. "Verification of Substitution Theorem Using HOL." IPSJ Online Transactions 5 (2012): 105–13. http://dx.doi.org/10.2197/ipsjtrans.5.105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Srikanth, Akhilesh, Burak Sahin, and William R. Harris. "Complexity verification using guided theorem enumeration." ACM SIGPLAN Notices 52, no. 1 (2017): 639–52. http://dx.doi.org/10.1145/3093333.3009864.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

CRITCH, ANDREW. "A PARAMETRIC, RESOURCE-BOUNDED GENERALIZATION OF LÖB’S THEOREM, AND A ROBUST COOPERATION CRITERION FOR OPEN-SOURCE GAME THEORY." Journal of Symbolic Logic 84, no. 4 (2019): 1368–81. http://dx.doi.org/10.1017/jsl.2017.42.

Full text
Abstract:
AbstractThis article presents two theorems: (1) a generalization of Löb’s Theorem that applies to formal proof systems operating with bounded computational resources, such as formal verification software or theorem provers, and (2) a theorem on the robust cooperation of agents that employ proofs about one another’s source code as unexploitable criteria for cooperation. The latter illustrates a capacity for outperforming classical Nash equilibria and correlated equilibria, attaining mutually cooperative program equilibrium in the Prisoner’s Dilemma while remaining unexploitable, i.e., sometimes
APA, Harvard, Vancouver, ISO, and other styles
7

Küsters, Ralf, Max Tuengerthal, and Daniel Rausch. "Joint State Composition Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation." Journal of Cryptology 33, no. 4 (2020): 1585–658. http://dx.doi.org/10.1007/s00145-020-09353-0.

Full text
Abstract:
Abstract In frameworks for universal composability, complex protocols can be built from sub-protocols in a modular way using composition theorems. However, as first pointed out and studied by Canetti and Rabin, this modular approach often leads to impractical implementations. For example, when using a functionality for digital signatures within a more complex protocol, parties have to generate new verification and signing keys for every session of the protocol. This motivates to generalize composition theorems to so-called joint state (composition) theorems, where different copies of a functio
APA, Harvard, Vancouver, ISO, and other styles
8

Xiao, Da, Yue Fei Zhu, Sheng Li Liu, Dong Xia Wang, and You Qiang Luo. "Digital Hardware Design Formal Verification Based on HOL System." Applied Mechanics and Materials 716-717 (December 2014): 1382–86. http://dx.doi.org/10.4028/www.scientific.net/amm.716-717.1382.

Full text
Abstract:
This article selects HOL theorem proving systems for hardware Trojan detection and gives the symbol and meaning of theorem proving systems, and then introduces the symbol table, item and the meaning of HOL theorem proving systems. In order to solve the theorem proving the application of the system in hardware Trojan detection requirements, this article analyses basic hardware Trojan detection methods which applies for theorem proving systems and introduces the implementation methods and process of theorem proving about hardware Trojan detection.
APA, Harvard, Vancouver, ISO, and other styles
9

Zhao, Chunna, Murong Jiang, and Yaqun Huang. "Formal Verification of Fractional-Order PID Control Systems Using Higher-Order Logic." Fractal and Fractional 6, no. 9 (2022): 485. http://dx.doi.org/10.3390/fractalfract6090485.

Full text
Abstract:
Fractional-order PID control is a landmark in the development of fractional-order control theory. It can improve the control precision and accuracy of systems and achieve more robust control results. As a theorem-proving formal verification method, it can be applied to an arbitrary system represented by a mathematical model. It is the ideal verification method because it is not subject to limits on state numbers. This paper presents the higher-order logic (HOL) formal verification and modeling of fractional-order PID controller systems. Firstly, a fractional-order PID controller was designed.
APA, Harvard, Vancouver, ISO, and other styles
10

Roache, Patrick J. "Code Verification by the Method of Manufactured Solutions." Journal of Fluids Engineering 124, no. 1 (2001): 4–10. http://dx.doi.org/10.1115/1.1436090.

Full text
Abstract:
Verification of Calculations involves error estimation, whereas Verification of Codes involves error evaluation, from known benchmark solutions. The best benchmarks are exact analytical solutions with sufficiently complex solution structure; they need not be realistic since Verification is a purely mathematical exercise. The Method of Manufactured Solutions (MMS) provides a straightforward and quite general procedure for generating such solutions. For complex codes, the method utilizes Symbolic Manipulation, but here it is illustrated with simple examples. When used with systematic grid refine
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Verification theorem"

1

Wang, Xuan. "Verification of Digital Controller Verifications." BYU ScholarsArchive, 2005. https://scholarsarchive.byu.edu/etd/681.

Full text
Abstract:
This thesis presents an analysis framework to verify the stablility property of a closed-loop control system with a software controller implementation. The usual approach to verifying stability for software uses experiments which are costly and can be dangerous. More recently, mathematical models of software have been proposed which can be used to reason about the correctness of controllers. However, these mathematical models ignore computational details that may be important in verification. We propose a method to determine the instability of a closed-loop system with a software controller im
APA, Harvard, Vancouver, ISO, and other styles
2

Kirschenbaum, Jason P. "Investigations in Automating Software Verification." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1306862918.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Boehm, Peter. "Incremental modelling for verified communication architectures." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:ec6c9e06-7395-4af4-b961-b2ed837fda89.

Full text
Abstract:
Modern computer systems are advancing from multi-core to many-core designs and System-on-chips (SoC) are becoming increasingly complex while integrating a great variety of components, thus constituting complex distributed systems. Such architectures rely on extremely complex communication protocols to exchange data with required performance. Arguing formally about the correctness of communication is an acknowledged verification challenge. This thesis presents a generic framework that formalises the idea of incremental modelling and step-wise verification to tackle this challenge: to control th
APA, Harvard, Vancouver, ISO, and other styles
4

Yu, Shen-Wei. "Formal verification of concurrent programs in type theory." Thesis, Durham University, 1999. http://etheses.dur.ac.uk/4366/.

Full text
Abstract:
Interactive theorem proving provides a general approach to modeling and verification of both finite-state and infinite-state systems but requires significant human efforts to deal with many tedious proofs. On the other hand, model-checking is limited to some application domain with small finite-state space. A natural thought for this problem is to integrate these two approaches. To keep the consistency of the integration and ensure the correctness of verification, we suggest to use type theory based theorem provers (e.g. Lego) as the platform for the integration and build a model-checker to do
APA, Harvard, Vancouver, ISO, and other styles
5

Jobredeaux, Romain J. "Formal verification of control software." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/53841.

Full text
Abstract:
In a context of heightened requirements for safety-critical embedded systems and ever-increasing costs of verification and validation, this research proposes to advance the state of formal analysis for control software. Formal methods are a field of computer science that uses mathematical techniques and formalisms to rigorously analyze the behavior of programs. This research develops a framework and tools to express and prove high level properties of control law implementations. One goal is to bridge the gap between control theory and computer science. An annotation language is extended with s
APA, Harvard, Vancouver, ISO, and other styles
6

Quarfot, Orrevall Sara. "Implementation and Verification of Sorting Algorithms with the Interactive Theorem Prover HOL." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-424295.

Full text
Abstract:
As the world becomes increasingly reliant on technology and the technology becomes increasingly complex, ensuring software correctness is becoming both increasingly important and difficult. Methods like software testing are rarely enough to guarantee that a program will always work as intended. Formal methods offer attractive alternatives. Using formal methods, properties about software can be unambiguously proven for all possible input. In this project we use the interactive theorem prover HOL to define and formally verify a simplified version of the popular sorting algorithm Timsort. We also
APA, Harvard, Vancouver, ISO, and other styles
7

Haziza, Frédéric. "Few is Just Enough! : Small Model Theorem for Parameterized Verification and Shape Analysis." Doctoral thesis, Uppsala universitet, Avdelningen för datorteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-264171.

Full text
Abstract:
This doctoral thesis considers the automatic verification of parameterized systems, i.e. systems with an arbitrary number of communicating components, such as mutual exclusion protocols, cache coherence protocols or heap manipulating programs. The components may be organized in various topologies such as words, multisets, rings, or trees. The task is to show correctness regardless of the size of the system and we consider two methods to prove safety:(i) a backward reachability analysis, using the well-quasi ordered framework and monotonic abstraction, and (ii) a forward analysis which only ne
APA, Harvard, Vancouver, ISO, and other styles
8

DeCloss, Daniel P. "An analysis of Specware and its usefulness in the verification of high assurance systems." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2006. http://library.nps.navy.mil/uhtbin/hyperion/06Jun%5FDeCloss.pdf.

Full text
Abstract:
Thesis (M.S. in Computer Science)--Naval Postgraduate School, June 2006.<br>Thesis Advisor(s): Timothy Levin and Cynthia Irvine. "June 2006." Includes bibliographical references (p. 87-89). Also available in print.
APA, Harvard, Vancouver, ISO, and other styles
9

Trefler, Richard Jay. "Expressive and efficient model checking /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Roberts, Brian Glenn. "Modular Detection of Feature Interactions Through Theorem Proving: A Case Study." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0821103-122029.

Full text
Abstract:
Thesis (M.S.)--Worcester Polytechnic Institute.<br>Keywords: theorem proving; modular verification; software verification; feature-oriented programming; feature interaction. Includes bibliographical references (p. 131-136).
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Verification theorem"

1

W, Mayr Ernst, Prömel H. J, and Steger Angelika, eds. Lectures on proof verification and approximation algorithms. Springer, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

M, Birtwistle G., and Subrahmanyam P. A, eds. Current trends in hardware verification and automated theorem proving. Springer-Verlag, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Birtwistle, Graham, and P. A. Subrahmanyam, eds. Current Trends in Hardware Verification and Automated Theorem Proving. Springer New York, 1989. http://dx.doi.org/10.1007/978-1-4612-3658-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Birtwistle, G. M. Current Trends in Hardware Verification and Automated Theorem Proving. Springer New York, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kaplan, Simon M. Verification of recursive programs: A temporal proof approach. Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Srivas, Mandayam. Verification of the FtCayuga fault-tolerant microprocessor system. Volume I: A case study in theorem prover-based verification. Langley Research Center, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bradfield, J. C. Verifying temporal properties of systems. Birkhäuser, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

S, Namjoshi Kedar, ed. Automated technology for verification and analysis: 5th international symposium, ATVA 2007 Tokyo, Japan, October 22-25, 2007 : proceedings. Springer, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

ATVA 2011 (2011 Taipei, Taiwan). Automated technology for verification and analysis: 9th international symposium, ATVA 2011, Taipei, Taiwan, October 11-14, 2011 : proceedings. Springer, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

ATVA 2004 (2004 Taipei, Taiwan). Automated technology for verification and analysis: Second International Conference, ATVA 2004, Taipei, Taiwan, ROC, October 31-November 3, 2004 : proceedings. Springer, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Verification theorem"

1

Roe, Kenneth. "The Heuristic Theorem Prover: Yet Another SMT Modulo Theorem Prover." In Computer Aided Verification. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11817963_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rushby, John. "Theorem Proving for Verification." In Modeling and Verification of Parallel Processes. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45510-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kundu, Sudipta, Sorin Lerner, and Rajesh K. Gupta. "Verification Using Automated Theorem Provers." In High-Level Verification. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4419-9359-5_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Graf, Susanne, and Hassen Saïdi. "Verifying invariants using theorem proving." In Computer Aided Verification. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61474-5_69.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Flanagan, Cormac, Rajeev Joshi, Xinming Ou, and James B. Saxe. "Theorem Proving Using Lazy Proof Explication." In Computer Aided Verification. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45069-6_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kovács, Laura, and Andrei Voronkov. "First-Order Theorem Proving and Vampire." In Computer Aided Verification. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39799-8_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Davis, Jared, Anna Slobodova, and Sol Swords. "Microcode Verification – Another Piece of the Microprocessor Verification Puzzle." In Interactive Theorem Proving. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08970-6_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Manolios, Panagiotis. "Refinement and Theorem Proving." In Formal Methods for Hardware Verification. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11757283_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Maler, Oded. "On the Krohn-Rhodes Cascaded Decomposition Theorem." In Time for Verification. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13754-9_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cook, Byron, Daniel Kroening, and Natasha Sharygina. "Cogent: Accurate Theorem Proving for Program Verification." In Computer Aided Verification. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11513988_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Verification theorem"

1

Sugai, Kenta, Hiroshi Hosobe, and Shaoying Liu. "SMT-Based Theorem Verification for Testing-Based Formal Verification." In ICSCA 2021: 2021 10th International Conference on Software and Computer Applications. ACM, 2021. http://dx.doi.org/10.1145/3457784.3457823.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Srikanth, Akhilesh, Burak Sahin, and William R. Harris. "Complexity verification using guided theorem enumeration." In POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages. ACM, 2017. http://dx.doi.org/10.1145/3009837.3009864.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Moore, J. Strother. "Theorem Proving for Verification: The Early Days." In 2010 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010). IEEE, 2010. http://dx.doi.org/10.1109/lics.2010.55.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Shaikh, M. Shahid, and Peter E. Caines. "A verification theorem for hybrid optimal control problem." In 2009 IEEE 13th International Multitopic Conference (INMIC). IEEE, 2009. http://dx.doi.org/10.1109/inmic.2009.5383147.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Song, Jiamei. "Low-pass filter design and sampling theorem verification." In MATERIALS SCIENCE, ENERGY TECHNOLOGY AND POWER ENGINEERING II (MEP2018). Author(s), 2018. http://dx.doi.org/10.1063/1.5041159.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Prathiba, M. K., and L. Basavaraj. "Online Handwritten Signature Verification System Based OnBayes’ Theorem." In Third International Conference on Current Trends in Engineering Science and Technology ICCTEST-2017. Grenze Scientific Society, 2017. http://dx.doi.org/10.21647/icctest/2017/49104.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hasan, Osman, Sofiène Tahar, Theodore E. Simos, George Psihoyios, and Ch Tsitouras. "Verification of Tail Distribution Bounds in a Theorem Prover." In Numerical Analysis and Applied Mathematics. AIP, 2007. http://dx.doi.org/10.1063/1.2790124.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jasim, Omar A., and Sandor M. Veres. "Formal Verification of Quadcopter Flight Envelop Using Theorem Prover." In 2018 IEEE Conference on Control Technology and Applications (CCTA). IEEE, 2018. http://dx.doi.org/10.1109/ccta.2018.8511595.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Araiza-Illan, Dejanira, Kerstin Eder, and Arthur Richards. "Formal verification of control systems' properties with theorem proving." In 2014 UKACC International Conference on Control (CONTROL). IEEE, 2014. http://dx.doi.org/10.1109/control.2014.6915147.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kaufmann, Matt, Jacob Kornerup, and Mark Reitblatt. "Formal verification of LabVIEW programs using the ACL2 Theorem Prover." In the Eighth International Workshop. ACM Press, 2009. http://dx.doi.org/10.1145/1637837.1637851.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Verification theorem"

1

Zarrieß, Benjamin, and Jens Claßen. Decidable Verification of Golog Programs over Non-Local Effect Actions. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.224.

Full text
Abstract:
The Golog action programming language is a powerful means to express high-level behaviours in terms of programs over actions defined in a Situation Calculus theory. In particular for physical systems, verifying that the program satisfies certain desired temporal properties is often crucial, but undecidable in general, the latter being due to the language’s high expressiveness in terms of first-order quantification and program constructs. So far, approaches to achieve decidability involved restrictions where action effects either had to be contextfree (i.e. not depend on the current state), loc
APA, Harvard, Vancouver, ISO, and other styles
2

Zarrieß, Benjamin, and Jens Claßen. On the Decidability of Verifying LTL Properties of Golog Programs. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.200.

Full text
Abstract:
Golog is a high-level action programming language for controlling autonomous agents such as mobile robots. It is defined on top of a logic-based action theory expressed in the Situation Calculus. Before a program is deployed onto an actual robot and executed in the physical world, it is desirable, if not crucial, to verify that it meets certain requirements (typically expressed through temporal formulas) and thus indeed exhibits the desired behaviour. However, due to the high (first-order) expressiveness of the language, the corresponding verification problem is in general undecidable. In this
APA, Harvard, Vancouver, ISO, and other styles
3

Zarrieß, Benjamin, and 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.

Full text
Abstract:
Golog programs allow to model complex behaviour of agents by combining primitive actions defined in a Situation Calculus theory using imperative and non-deterministic programming language constructs. In general, verifying temporal properties of Golog programs is undecidable. One way to establish decidability is to restrict the logic used by the program to a Description Logic (DL), for which recently some complexity upper bounds for verification problem have been established. However, so far it was open whether these results are tight, and lightweight DLs such as EL have not been studied at all
APA, Harvard, Vancouver, ISO, and other styles
4

Le, T. T. Verification, validation, and benchmarking report for GILDA: An infinite lattice diffusion theory calculation. Office of Scientific and Technical Information (OSTI), 1991. http://dx.doi.org/10.2172/10108323.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Xia, Yidong, David Andrs, and Richard Charles Martineau. BIGHORN Computational Fluid Dynamics Theory, Methodology, and Code Verification & Validation Benchmark Problems. Office of Scientific and Technical Information (OSTI), 2016. http://dx.doi.org/10.2172/1364471.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Le, T. T. Verification, validation, and benchmarking report for GILDA: An infinite lattice diffusion theory calculation. Office of Scientific and Technical Information (OSTI), 1991. http://dx.doi.org/10.2172/6851093.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Le, T. T. Verification, validation, and benchmarking report for TRIMHX: A three dimensional hexagonal transient diffusion theory code. Office of Scientific and Technical Information (OSTI), 1992. http://dx.doi.org/10.2172/10157236.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Le, T. L. Verification, validation, and benchmarking report for TRIMHX: A three dimensional hexagonal transient diffusion theory code. Office of Scientific and Technical Information (OSTI), 1992. http://dx.doi.org/10.2172/6800670.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

RamaRao, B. S., and M. Reeves. Theory and verification for the GRASP II code for adjoint-sensitivity analysis of steady-state and transient ground-water flow. Office of Scientific and Technical Information (OSTI), 1990. http://dx.doi.org/10.2172/6293179.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography