Log in

Relevant bibliographies by topics / Computer programs – Verification

Academic literature on the topic 'Computer programs – Verification'

Author: Grafiati

Published: 4 June 2021

Last updated: 7 September 2023

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

Select a source type:

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

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

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 "Computer programs – Verification"

1

Krauskopf, R., and F. Rash. "Independent verification and validation (computer programs)." IEEE Potentials 9, no. 2 (April 1990): 12–14. http://dx.doi.org/10.1109/45.52994.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Hamilton, G. W. "Distilling Programs for Verification." Electronic Notes in Theoretical Computer Science 190, no. 4 (November 2007): 17–32. http://dx.doi.org/10.1016/j.entcs.2007.09.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Feng, Yuan, Sanjiang Li, and Mingsheng Ying. "Verification of Distributed Quantum Programs." ACM Transactions on Computational Logic 23, no. 3 (July 31, 2022): 1–40. http://dx.doi.org/10.1145/3517145.

Full text

Abstract:

Distributed quantum systems and especially the Quantum Internet have the ever-increasing potential to fully demonstrate the power of quantum computation. This is particularly true given that developing a general-purpose quantum computer is much more difficult than connecting many small quantum devices. One major challenge of implementing distributed quantum systems is programming them and verifying their correctness. In this paper, we propose a CSP-like distributed programming language to facilitate the specification and verification of such systems. After presenting its operational and denotational semantics, we develop a Hoare-style logic for distributed quantum programs and establish its soundness and (relative) completeness with respect to both partial and total correctness. The effectiveness of the logic is demonstrated by its applications in the verification of quantum teleportation and local implementation of non-local CNOT gates, two important algorithms widely used in distributed quantum systems.

APA, Harvard, Vancouver, ISO, and other styles

4

Flanagan, Cormac, Stephen N. Freund, Shaz Qadeer, and Sanjit A. Seshia. "Modular verification of multithreaded programs." Theoretical Computer Science 338, no. 1-3 (June 2005): 153–83. http://dx.doi.org/10.1016/j.tcs.2004.12.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Andrei, Oana, and Hélène Kirchner. "Runtime Verification for Biochemical Programs." Electronic Notes in Theoretical Computer Science 297 (December 2013): 27–46. http://dx.doi.org/10.1016/j.entcs.2013.12.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Drobushevich, G. A., and K. A. Zubovich. "Automatic verification of functional programs." Cybernetics 26, no. 4 (1991): 491–502. http://dx.doi.org/10.1007/bf01068190.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Saman, MD Yazid, and David J. Evans. "Verification of parallel programs." International Journal of Computer Mathematics 56, no. 1-2 (January 1995): 23–37. http://dx.doi.org/10.1080/00207169508804385.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Stolz, Volker, and Frank Huch. "Runtime Verification of Concurrent Haskell Programs." Electronic Notes in Theoretical Computer Science 113 (January 2005): 201–16. http://dx.doi.org/10.1016/j.entcs.2004.01.026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Hoare, Tony. "Verification of Fine-grain Concurrent Programs." Electronic Notes in Theoretical Computer Science 209 (April 2008): 165–71. http://dx.doi.org/10.1016/j.entcs.2008.04.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Vo, Anh, Sarvani Vakkalanka, Michael DeLisi, Ganesh Gopalakrishnan, Robert M. Kirby, and Rajeev Thakur. "Formal verification of practical MPI programs." ACM SIGPLAN Notices 44, no. 4 (February 14, 2009): 261–70. http://dx.doi.org/10.1145/1594835.1504214.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Computer programs – Verification"

1

Koskinen, Eric John. "Thermal verification of programs." Thesis, University of Cambridge, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.607698.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Duracz, Jan Andrzej. "Verification of floating point programs." Thesis, Aston University, 2010. http://publications.aston.ac.uk/15778/.

Full text

Abstract:

In this thesis we present an approach to automated verification of floating point programs. Existing techniques for automated generation of correctness theorems are extended to produce proof obligations for accuracy guarantees and absence of floating point exceptions. A prototype automated real number theorem prover is presented, demonstrating a novel application of function interval arithmetic in the context of subdivision-based numerical theorem proving. The prototype is tested on correctness theorems for two simple yet nontrivial programs, proving exception freedom and tight accuracy guarantees automatically. The prover demonstrates a novel application of function interval arithmetic in the context of subdivision-based numerical theorem proving. The experiments show how function intervals can be used to combat the information loss problems that limit the applicability of traditional interval arithmetic in the context of hard real number theorem proving.

APA, Harvard, Vancouver, ISO, and other styles

3

Wickerson, John Peter. "Concurrent verification for sequential programs." Thesis, University of Cambridge, 2013. https://www.repository.cam.ac.uk/handle/1810/265613.

Full text

Abstract:

This dissertation makes two contributions to the field of software verification. The first explains how verification techniques originally developed for concurrency can be usefully applied to sequential programs. The second describes how sequential programs can be verified using diagrams that have a parallel nature. The first contribution involves a new treatment of stability in verification methods based on rely-guarantee. When an assertion made in one thread of a concurrent system cannot be invalidated by the actions of other threads, that assertion is said to be 'stable'. Stability is normally enforced through side-conditions on rely-guarantee proof rules. This dissertation proposes instead to encode stability information into the syntactic form of the assertion. This approach, which we call explicit stabilisation, brings several benefits. First, we empower rely-guarantee with the ability to reason about library code for the first time. Second, when the rely-guarantee method is redepleyed in a sequential setting, explicit stabilisation allows more details of a module's implementation to be hidden when verifying clients. Third, explicit stabilisation brings a more nuanced understanding of the important issue of stability in concurrent and sequential verification; such an understanding grows ever more important as verification techniques grow ever more complex. The second contribution is a new method of presenting program proofs conducted in separation logic. Building on work by Jules Bean, the ribbon proof is a diagrammatic alternative to the standard 'proof outline'. By emphasising the structure of a proof, ribbon proofs are intelligible and hence useful pedagogically. Because they contain less redundancy than proof outlines, and allow each proof step to be checked locally, they are highly scalable; this we illustrate with a ribbon proof of the Version 7 Unix memory manager. Where proof outlines are cumbersome to modify, ribbon proofs can be visually manoeuvred to yield proofs of variant programs. We describe the ribbon proof system, prove its soundness and completeness, and outline a prototype tool for mechanically checking the diagrams it produ1res.

APA, Harvard, Vancouver, ISO, and other styles

4

Lang, Matthew. "Maximality modular verification and implementability /." Columbus, Ohio : Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1243962353.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sobel, Ann E. Kelley. "Modular verification of concurrent systems /." The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487267546983528.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Nagarajan, R. "Typed concurrent programs : specification and verification." Thesis, Imperial College London, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.369244.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Ponzio, Stephen J. (Stephen John). "Restricted branching programs and hardware verification." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/35042.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
Includes bibliographical references (p. 71-77).
by Stephen John Ponzio.
Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

8

Simic, Stella. "Bit-precise Verification of Numerical Properties in Fixed-point Programs." Thesis, IMT Alti Studi Lucca, 2022. http://e-theses.imtlucca.it/365/1/Simic_phdthesis.pdf.

Full text

Abstract:

Numerical software is prone to inaccuracies due to the finite representation of numbers. These inaccuracies propagate, possibly non-linearly, throughout the statements of a program, making it hard to predict the accumulated errors. Moreover, in programs that contain control structures, numerical errors can affect the control flow. As a result of these inaccuracies, reachability, and thus safety, may be altered with respect to the intended infinite-precision computation. This thesis considers programs that use fixed-point arithmetic to compute over non-integer quantities in finite precision. We first define a semantics of fixed-point operations in terms of operations over bit-vectors. The proposed semantics generalizes current attempts to a standardization of fixedpoint arithmetic. We then consider the problem of bit-precise numerical accuracy certification of fixed-point programs with control structures and arithmetic over variables of arbitrary, mixed precision and possibly non-deterministic value. By applying a set of parametrized transformation rules based on computable expressions for the errors incurred by single program statements, we reduce the problem of assessing whether a fixed-point program can exceed a given error bound to a reachability problem in a bit-vector program. We present an experimental evaluation of the certification technique, implemented in a prototype analyzer in a bounded model checking-based verification workflow. Our experiments on a set of fixed-point arithmetic routines commonly used in the industry show that the proposed technique can successfully certify numerical errors and can do so bitprecisely, making it the only such verification technique.

APA, Harvard, Vancouver, ISO, and other styles

9

Mahtab, Tazeen 1981. "Automated verification of model-based programs under uncertainty." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28453.

Full text

Abstract:

Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes 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.

APA, Harvard, Vancouver, ISO, and other styles

10

Hanna, Ziyad. "A symbolic execution framework for algorithm-level modelling and verification of computer microarchitecture." Thesis, University of Oxford, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.560923.

Full text

Abstract:

This dissertation addresses the challenge of modelling and functional verification for com- plex computer micro-architecture designs. It is evident that the emerging span and com- plexity of new computer architectures outstrip existing design modelling and verification methods. Several attempts in industry and academia, including High Level Modelling, still do not scale to address this problem. Typically they lack precise and clear language semantics for formal analysis, and do not have native support for concurrency, or the design language and methodology do not fit. Therefore, the gap between what current solutions provide and what industry needs is increasing. In this research we aim to leap ahead of the common incremental research in this area, and develop a new framework for algorithm level modelling and verification. We introduce a high level and executable Architectural Specification Language (ASL) for modelling the functional behaviour of the architectural algorithms. The semantics of our models is based on the theory of Abstract State Machines with synchronous parallel execution and finite choice, which we find naturally suitable for hardware modelling. Our framework is also powered by native symbolic execution algorithms for enabling high- level verification, design explorations and refinement checks of the high level models down to the design implementation. We developed a new framework that implements our ideas through ASL and supports symbolic execution. We demonstrate the utility of our language and symbolic execu- tion on examples and case studies in various modelling domains, and show a promising framework and methodology. We believe our approach will make it easier to explore micro-architectural algorithm behavior and easier to validate this using dynamic or formal techniques, thus yielding a promising attack on the modelling and verification problem, and enabling more productive convergence to high quality implementations.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Computer programs – Verification"

1

Program verification. Wokingham, Eng: Addison-Wesley Pub. Co., 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Apt, Krzysztof R. Verification of sequential and concurrent programs. New York: Springer-Verlag, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

-R, Olderog E., ed. Verification of sequential and concurrent programs. 2nd ed. New York: Springer-Verlag, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Apt, Krzysztof R. Verification of sequential and concurrent programs. 3rd ed. Dordrecht: Springer, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Apt, Krzysztof R. Verification of Sequential and Concurrent Programs. New York, NY: Springer New York, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Apt, Krzysztof R. Verification of Sequential and Concurrent Programs. New York, NY: Springer New York, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

A survey of verification techniques for parallel programs. Berlin: Springer-Verlag, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Kurt, Sieber, and Stansifer Ryan D, eds. The foundations of program verification. 2nd ed. Stuttgart: B.G. Teubner, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Richard, Lai. Communication protocol specification and verification. Boston: Kluwer Academic, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

An introduction to formal program verification. New York: Van Nostrand Reinhold Co., 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Computer programs – Verification"

1

Kragl, Bernhard, and Shaz Qadeer. "Layered Concurrent Programs." In Computer Aided Verification, 79–102. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96145-3_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Andriushchenko, Roman, Milan Češka, Sebastian Junges, Joost-Pieter Katoen, and Šimon Stupinský. "PAYNT: A Tool for Inductive Synthesis of Probabilistic Programs." In Computer Aided Verification, 856–69. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_40.

Full text

Abstract:

AbstractThis paper presents PAYNT, a tool to automatically synthesise probabilistic programs. PAYNT enables the synthesis of finite-state probabilistic programs from a program sketch representing a finite family of program candidates. A tight interaction between inductive oracle-guided methods with state-of-the-art probabilistic model checking is at the heart of PAYNT. These oracle-guided methods effectively reason about all possible candidates and synthesise programs that meet a given specification formulated as a conjunction of temporal logic constraints and possibly including an optimising objective. We demonstrate the performance and usefulness of PAYNT using several case studies from different application domains; e.g., we find the optimal randomized protocol for network stabilisation among 3M potential programs within minutes, whereas alternative approaches would need days to do so.

APA, Harvard, Vancouver, ISO, and other styles

3

Tiwari, Ashish. "Termination of Linear Programs." In Computer Aided Verification, 70–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27813-9_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Christakis, Maria, Hasan Ferit Eniser, Holger Hermanns, Jörg Hoffmann, Yugesh Kothari, Jianlin Li, Jorge A. Navas, and Valentin Wüstholz. "Automated Safety Verification of Programs Invoking Neural Networks." In Computer Aided Verification, 201–24. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_9.

Full text

Abstract:

AbstractState-of-the-art program-analysis techniques are not yet able to effectively verify safety properties of heterogeneous systems, that is, systems with components implemented using diverse technologies. This shortcoming is pinpointed by programs invoking neural networks despite their acclaimed role as innovation drivers across many application areas. In this paper, we embark on the verification of system-level properties for systems characterized by interaction between programs and neural networks. Our technique provides a tight two-way integration of a program and a neural-network analysis and is formalized in a general framework based on abstract interpretation. We evaluate its effectiveness on 26 variants of a widely used, restricted autonomous-driving benchmark.

APA, Harvard, Vancouver, ISO, and other styles

5

Chakraborty, Supratik, Ashutosh Gupta, and Divyesh Unadkat. "Diffy: Inductive Reasoning of Array Programs Using Difference Invariants." In Computer Aided Verification, 911–35. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_42.

Full text

Abstract:

AbstractWe present a novel verification technique to prove properties of a class of array programs with a symbolic parameter N denoting the size of arrays. The technique relies on constructing two slightly different versions of the same program. It infers difference relations between the corresponding variables at key control points of the joint control-flow graph of the two program versions. The desired post-condition is then proved by inducting on the program parameter N, wherein the difference invariants are crucially used in the inductive step. This contrasts with classical techniques that rely on finding potentially complex loop invaraints for each loop in the program. Our synergistic combination of inductive reasoning and finding simple difference invariants helps prove properties of programs that cannot be proved even by the winner of Arrays sub-category in SV-COMP 2021. We have implemented a prototype tool called Diffy to demonstrate these ideas. We present results comparing the performance of Diffy with that of state-of-the-art tools.

APA, Harvard, Vancouver, ISO, and other styles

6

Dohrau, Jérôme, Alexander J. Summers, Caterina Urban, Severin Münger, and Peter Müller. "Permission Inference for Array Programs." In Computer Aided Verification, 55–74. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96142-2_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Le, Quang Loc, Jun Sun, and Wei-Ngan Chin. "Satisfiability Modulo Heap-Based Programs." In Computer Aided Verification, 382–404. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-41528-4_21.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Halbwachs, Nicolas. "Delay analysis in synchronous programs." In Computer Aided Verification, 333–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-56922-7_28.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Bodik, Rastislav, and Emina Torlak. "Synthesizing Programs with Constraint Solvers." In Computer Aided Verification, 3. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31424-7_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Braverman, Mark. "Termination of Integer Linear Programs." In Computer Aided Verification, 372–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11817963_34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Computer programs – Verification"

1

Ganjei, Zeinab, Ahmed Rezine, Petru Eles, and Zebo Peng. "Safety verification of phaser programs." In 2017 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2017. http://dx.doi.org/10.23919/fmcad.2017.8102243.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Foster, Nate, Arjun Guha, Mark Reitblatt, and Cole Schlesinger. "Tutorial: Practical verification of network programs." In 2013 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2013. http://dx.doi.org/10.1109/fmcad.2013.7035518.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Boldo, Sylvie, and Jean-Christophe Filliatre. "Formal Verification of Floating-Point Programs." In 18th IEEE Symposium on Computer Arithmetic (ARITH '07). IEEE, 2007. http://dx.doi.org/10.1109/arith.2007.20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Han, Seokhyun. "Verification of Java programs in Coq." In 2010 2nd Computer Science and Electronic Engineering Conference (CEEC). IEEE, 2010. http://dx.doi.org/10.1109/ceec.2010.5606499.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Malik, Viktor, Martin Hruska, Peter Schrammel, and Tomas Vojnar. "Template-Based Verification of Heap-Manipulating Programs." In 2018 Formal Methods in Computer Aided Design (FMCAD). IEEE, 2018. http://dx.doi.org/10.23919/fmcad.2018.8603009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Popeea, Corneliu, Andrey Rybalchenko, and Andreas Wilhelm. "Reduction for compositional verification of multi-threaded programs." In 2014 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2014. http://dx.doi.org/10.1109/fmcad.2014.6987612.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bennett, D., and J. Loman. "Methodology review for Space Station human-computer interface development, verification and validation." In Space Programs and Technologies Conference and Exhibit. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1993. http://dx.doi.org/10.2514/6.1993-4196.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Vardi, Moshe Y. "Automatic verification of probabilistic concurrent finite state programs." In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). IEEE, 1985. http://dx.doi.org/10.1109/sfcs.1985.12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kusters, Ralf, Tomasz Truderung, and Jurgen Graf. "A Framework for the Cryptographic Verification of Java-Like Programs." In 2012 IEEE 25th Computer Security Foundations Symposium (CSF). IEEE, 2012. http://dx.doi.org/10.1109/csf.2012.9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Chaki, Sagar, Arie Gurfinkel, and Nishant Sinha. "Efficient verification of periodic programs using sequential consistency and snapshots." In 2014 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2014. http://dx.doi.org/10.1109/fmcad.2014.6987595.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Computer programs – Verification"

1

Braeuer, E., and W. Thomlinson. Experimental verification of ''photon'': A computer program for use in x-ray shielding calculations. Office of Scientific and Technical Information (OSTI), March 1987. http://dx.doi.org/10.2172/6874284.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Computer program NCALC user's manual; verification of Manning's roughness coefficient in channels. US Geological Survey, 1985. http://dx.doi.org/10.3133/wri854317.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Description, instructions, and verification for Basinsoft, a computer program to quantify drainage- basin characteristics. US Geological Survey, 1996. http://dx.doi.org/10.3133/wri954287.

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!