Thematische Bibliographien / Programs analysis

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Bücher
  4. Buchteile
  5. Konferenzberichte
  6. Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Programs analysis“

Autor: Grafiati
Veröffentlicht am 28. Juni 2021
Zuletzt aktualisiert am 1. Februar 2022

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

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Programs analysis" bekannt.

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

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

Zeitschriftenartikel zum Thema "Programs analysis"

1

Harris, William R., Sriram Sankaranarayanan, Franjo Ivančić und Aarti Gupta. „Program analysis via satisfiability modulo path programs“. ACM SIGPLAN Notices 45, Nr. 1 (02.01.2010): 71–82. http://dx.doi.org/10.1145/1707801.1706309.

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

Schwarzer, Ralf. „Meta-analysis programs“. Behavior Research Methods, Instruments, & Computers 20, Nr. 3 (Mai 1988): 338. http://dx.doi.org/10.3758/bf03203853.

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

Kaziliūnas, Adolfas. „The Knowledge Management Process for Implementing Quality Improvement Programs“. Informacijos mokslai 62 (01.01.2012): 97–108. http://dx.doi.org/10.15388/im.2012.0.1580.

Der volle Inhalt der Quelle
Annotation:
The importance of quality to any and all organizations is well known, and it is necessary to teach employees quality discipline. However, the analysis of literature indicates that many of quality improvement programs are ineffective. This article discusses knowledge management processes for the organizational learning mechanisms that can help to plan and implement quality management programs more successfully. The processes are implemented in sequence for the development of knowledge management in an organization in which user needs and expectations are recognized as an input. The processes are controlled by knowledge management strategy planning, knowledge process, customer and knowledge supplier relationships. The mechanisms are led by a knowledge management leader, knowledge management personnel, and knowledge management system infrastructure. The input is transformed into knowledge management results in terms of users’ needs and expectations of knowledge management outcomes, knowledge management strategy and planning outcomes, knowledge management delivery outcomes. By using the knowledge management process organizations can increase the effectiveness of quality management training.Keywords: quality management, knowledge management, ISO 9000 standards, quality programsŽinių vadybos procesas kokybės gerinimo programoms įgyvendinti Adolfas Kaziliūnas Santrauka Daugelis organizacijų, siekdamos konkurencinio pranašumo, įtraukia kokybės gerinimą į savo stra­teginius tikslus, tačiau literatūros analizė rodo, kad dažnai kokybės gerinimo programos nepasiekia numatytų savo tikslų. Tai dažniausiai atsitinka dėl netikslaus kokybės programų pritaikymo organiza­cijos reikmėms ir netinkamai vykdomo mokymosi proceso. Šio tyrimo tikslas – rasti būdų efektyviau įgyvendinti kokybės gerinimo programas. Tyrimai parodė, kad pasitelkdamos žinių vadybos patirtį organizacijos gali padidinti kokybės gerinimo pro­gramų efektyvumą. Žinių vadybos procesai padeda organizacijai geriau analizuoti, parengti ir įsisavin­ti aktualią organizacijos darbuotojams informaciją. Straipsnyje pateikiamas literatūros analizės pagrin­du parengtas septynių fazių žinių vadybos procesas. Procese nuosekliai išdėstytos veiklos, kurias reikia atlikti rengiant ir įgyvendinant kokybės gerinimo programą. Prieš rengiant šią programą būtina išana­ lizuoti organizacijos darbuotojų mokymosi poreikius ir pagal tai suformuluoti mokymų strategiją. Organi­zacijos vadovai turėtų asmeniškai dalyvauti planuo­jant programą ir pageidautina – mokant darbuotojus. Kokybės gerinimo programos tikslai ir jų pasiekimo planai turi būti aiškiai apibrėžti. Į planavimo proce­są būtina įtraukti vidurinės grandies vadybininkus, nes jie geriausiai pastebi darbuotojų žinių trūkumus. Būtina rimtai vertinti dalies darbuotojų skeptišką požiūrį į mokymų programą ir reaguoti į jų pasta­bas. Labai svarbu mokymosi rezultatų matavimas ir analizė bei nuolatinis grįžtamojo ryšio su programos dalyviais palaikymas. Rezultatų matavimas ir anali­zė turi būti atliekama po kiekvienos esminės proceso fazės: vartotojų poreikių nustatymo, mokymosi stra­tegijos suformulavimo ir planavimo, mokymo planų įgyvendinimo. Reikšminiai žodžiai: kokybės vadyba, žinių va­dyba, kokybės programos, ISO 9000 standartai.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Psarris, Kleanthis. „Program analysis techniques for transforming programs for parallel execution“. Parallel Computing 28, Nr. 3 (März 2002): 455–69. http://dx.doi.org/10.1016/s0167-8191(01)00132-6.

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

Sun, Kwangwon, und Sukyoung Ryu. „Analysis of JavaScript Programs“. ACM Computing Surveys 50, Nr. 4 (08.11.2017): 1–34. http://dx.doi.org/10.1145/3106741.

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

Chaudhuri, Swarat, Sumit Gulwani und Roberto Lublinerman. „Continuity analysis of programs“. ACM SIGPLAN Notices 45, Nr. 1 (02.01.2010): 57–70. http://dx.doi.org/10.1145/1707801.1706308.

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

Bakar, Normi Sham Awang Abu. „The Analysis of Object-Oriented Metrics in C++ Programs“. Lecture Notes on Software Engineering 4, Nr. 1 (2016): 48–52. http://dx.doi.org/10.7763/lnse.2016.v4.222.

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

Iwamoto, Seiichi. „Associative Dynamic Programs“. Journal of Mathematical Analysis and Applications 201, Nr. 1 (Juli 1996): 195–211. http://dx.doi.org/10.1006/jmaa.1996.0250.

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

Hui, Deng, Liu Hui, Guo Ying und Zhang Baofeng. „Memory Allocation Vulnerability Analysis and Analysis Optimization for C Programs Based on Formal Methods“. Journal of Software 10, Nr. 9 (September 2015): 1079–85. http://dx.doi.org/10.17706//jsw.10.9.1079-1085.

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

Pérez-Bóveda, Astrid, und Concepción Yániz Álvarez de Eulate. „Programas de formación parental. Análisis comparativo // Parenting programs. Comparative analysis“. REOP - Revista Española de Orientación y Psicopedagogía 26, Nr. 2 (07.09.2015): 104. http://dx.doi.org/10.5944/reop.vol.26.num.2.2015.15231.

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

Dissertationen zum Thema "Programs analysis"

1

Nagulakonda, Vikram. „Assertion seeding development of program instrumentation through iterative formal analysis /“. Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=1080.

Der volle Inhalt der Quelle
Annotation:
Thesis (M.S.)--West Virginia University, 1999.
Title from document title page. Document formatted into pages; contains v, 80 p. : ill. Includes abstract. Includes bibliographical references (p. 33-35).
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Jakobsson, Filip. „Static Analysis for BSPlib Programs“. Thesis, Orléans, 2019. http://www.theses.fr/2019ORLE2005.

Der volle Inhalt der Quelle
Annotation:
La programmation parallèle consiste à utiliser des architectures à multiples unités de traitement, de manière à ce que le temps de calcul soit inversement proportionnel au nombre d’unités matérielles. Le modèle de BSP (Bulk Synchronous Parallel) permet de rendre le temps de calcul prévisible. BSPlib est une bibliothèque pour la programmation BSP en langage C. En BSPlib on entrelace des instructions de contrôle de la structure parallèle globale, et des instructions locales pour chaque unité de traitement. Cela permet des optimisations fines de la synchronisation, mais permet aussi l’écriture de programmes dont les calculs locaux divergent et masquent ainsi l’évolution globale du calcul BSP. Toutefois, les programmes BSPlib réalistes sont syntaxiquement alignés, une propriété qui garantit la convergence du flot de contrôle parallèle. Dans ce mémoire nous étudions les trois dimensions principales des programmes BSPlib du point de vue de l’alignement syntaxique : la synchronisation, le temps de calcul et la communication. D’abord nous présentons une analyse statique qui identifie les instructions syntaxiquement alignées et les utilise pour vérifier la sûreté de la synchronisation globale. Cette analyse a été implémentée en Frama-C et certifiée en Coq. Ensuite nous utilisons l’alignement syntaxique comme base d’une analyse statique du temps de calcul. Elle est fondée sur une analyse classique du coût pour les programmes séquentiels. Enfin nous définissons une condition suffisante pour la sûreté de l’enregistrement des variables. L’enregistrement en BSPlib permet la communication par accès aléatoire à la mémoire distante (DRMA) mais est sujet à des erreurs de programmation. Notre développement technique est la base d’une future analyse statique de ce mécanisme
The goal of scalable parallel programming is to program computer architectures composed of multiple processing units so that increasing the number of processing units leads to an increase in performance. Bulk Synchronous Parallel (BSP) is a widely used model for scalable parallel programming with predictable performance. BSPlib is a library for BSP programming in C. In BSPlib, parallel algorithms are expressed by intermingling instructions that control the global parallel structure, and instructions that express the local computation of each processing unit. This lets the programmer fine-tune synchronization, but also implement programs whose diverging parallel control flow obscures the underlying BSP structure. In practice however, the majority of BSPlib program are textually aligned, a property that ensures parallel control flow convergence. We examine three core aspects of BSPlib programs through the lens of textual alignment: synchronization, performanceandcommunication.First,wepresentastaticanalysisthatidentifiestextuallyalignedstatements and use it to verify safe synchronization. This analysis has been implemented in Frama-C and certified in Coq. Second, we exploit textual alignment to develop a static performance analysis for BSPlib programs, based on classic cost analysis for sequential programs. Third, we develop a textual alignment-based sufficient condition for safe registration. Registration in BSPlib enables communication by Direct Remote Memory Access but is error prone. This development forms the basis for a future static analysis of registration
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Armstrong, Alasdair. „Formal analysis of concurrent programs“. Thesis, University of Sheffield, 2015. http://etheses.whiterose.ac.uk/13089/.

Der volle Inhalt der Quelle
Annotation:
In this thesis, extensions of Kleene algebras are used to develop algebras for rely-guarantee style reasoning about concurrent programs. In addition to these algebras, detailed denotational models are implemented in the interactive theorem prover Isabelle/HOL. Formal soundness proofs link the algebras to their models. This follows a general algebraic approach for developing correct by construction verification tools within Isabelle. In this approach, algebras provide inference rules and abstract principles for reasoning about the control flow of programs, while the concrete models provide laws for reasoning about data flow. This yields a rapid, lightweight approach for the construction of verification and refinement tools. These tools are used to construct a popular example from the literature, via refinement, within the context of a general-purpose interactive theorem proving environment.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Kim, Minjang. „Dynamic program analysis algorithms to assist parallelization“. Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45758.

Der volle Inhalt der Quelle
Annotation:
All market-leading processor vendors have started to pursue multicore processors as an alternative to high-frequency single-core processors for better energy and power efficiency. This transition to multicore processors no longer provides the free performance gain enabled by increased clock frequency for programmers. Parallelization of existing serial programs has become the most powerful approach to improving application performance. Not surprisingly, parallel programming is still extremely difficult for many programmers mainly because thinking in parallel is simply beyond the human perception. However, we believe that software tools based on advanced analyses can significantly reduce this parallelization burden. Much active research and many tools exist for already parallelized programs such as finding concurrency bugs. Instead we focus on program analysis algorithms that assist the actual parallelization steps: (1) finding parallelization candidates, (2) understanding the parallelizability and profits of the candidates, and (3) writing parallel code. A few commercial tools are introduced for these steps. A number of researchers have proposed various methodologies and techniques to assist parallelization. However, many weaknesses and limitations still exist. In order to assist the parallelization steps more effectively and efficiently, this dissertation proposes Prospector, which consists of several new and enhanced program analysis algorithms. First, an efficient loop profiling algorithm is implemented. Frequently executed loop can be candidates for profitable parallelization targets. The detailed execution profiling for loops provides a guide for selecting initial parallelization targets. Second, an efficient and rich data-dependence profiling algorithm is presented. Data dependence is the most essential factor that determines parallelizability. Prospector exploits dynamic data-dependence profiling, which is an alternative and complementary approach to traditional static-only analyses. However, even state-of-the-art dynamic dependence analysis algorithms can only successfully profile a program with a small memory footprint. Prospector introduces an efficient data-dependence profiling algorithm to support large programs and inputs as well as provides highly detailed profiling information. Third, a new speedup prediction algorithm is proposed. Although the loop profiling can give a qualitative estimate of the expected profit, obtaining accurate speedup estimates needs more sophisticated analysis. Prospector introduces a new dynamic emulation method to predict parallel speedups from annotated serial code. Prospector also provides a memory performance model to predict speedup saturation due to increased memory traffic. Compared to the latest related work, Prospector significantly improves both prediction accuracy and coverage. Finally, Prospector provides algorithms that extract hidden parallelism and advice on writing parallel code. We present a number of case studies how Prospector assists manual parallelization in particular cases including privatization, reduction, mutex, and pipelining.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Zhang, Connie. „Static Conflict Analysis of Transaction Programs“. Thesis, University of Waterloo, 2000. http://hdl.handle.net/10012/1052.

Der volle Inhalt der Quelle
Annotation:
Transaction programs are comprised of read and write operations issued against the database. In a shared database system, one transaction program conflicts with another if it reads or writes data that another transaction program has written. This thesis presents a semi-automatic technique for pairwise static conflict analysis of embedded transaction programs. The analysis predicts whether a given pair of programs will conflict when executed against the database. There are several potential applications of this technique, the most obvious being transaction concurrency control in systems where it is not necessary to support arbitrary, dynamic queries and updates. By analyzing transactions in such systems before the transactions are run, it is possible to reduce or eliminate the need for locking or other dynamic concurrency control schemes.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Xu, HaiYing. „Dynamic purity analysis for Java programs“. Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=18481.

Der volle Inhalt der Quelle
Annotation:
The pure methods in a program are those that exhibit functional or side effect free behaviour, a useful property of methods or code in the context of program optimization as well as program understanding. However, gathering purity data is not a trivial task, and existing purity investigations present primarily static results based on a compile-time analysis of program code. We perform a detailed examination of dynamic method purity in Java programs using a Java Virtual Machine (JVM) based analysis. We evaluate multiple purity definitions that range from strong to weak, consider purity forms specific to dynamic execution, and accommodate constraints imposed by an example consumer application of purity data, memoization. We show that while dynamic method purity is actually fairly consistent between programs, examining pure invocation counts and the percentage of the bytecode instruction stream contained within some pure method reveals great variation. We also show that while weakening purity definitions exposes considerable dynamic purity, consumer requirements can limit the actual utility of this information. A good understanding of which methods are "pure" and in what sense is an important contribution to understanding when, how, and what optimizations or properties a program may exhibit.
Les fonctions purs dans un programme sont ceux qui démontre un comportement sans fonctionnalité ou effet secondaire. Ceci s'avère une propriété utile pour une fonction ou du code dans le contexte d'optimisation et de compréhension du programme. Cependant, récolter de l'information de pureté n'est pas une tâche facile, et les techniques existantes pour les analyses de pureté ne fournissent que des résultats statiques basés sur une analyses de la compilation du programme. Nous avons exécuter une analyse détaillée de la pureté dynamique des fonctions dans des applications Java en utilisant une approche basés sur un Java Virtual Machine (JVM). Nous avons évalué multiples définitions de pureté, forte et faible, et considéré les formats de pureté spécifiques à l'exécution, tout en considérant les contraintes qui nous sont imposées par un application "consommateur" d'information de pureté et de mémorisation. Nous démontrons que malgré la consistance de la pureté dynamique des fonctions parmi certains applications, l'examen du nombre d'invocation pure et le pourcentage de chaîne d'instruction "bytecode" trouvé dans les fonctions purs nous dévoile l'existante de grande variation. Nous montrons aussi que malgré l'affaiblissement de la définition de la pureté expose considérablement la pureté dynamique, les pré-requis des consommateurs peuvent actuellement limiter l'utilité de cet information. Une bonne compréhension de ce qu'est une fonction "pure" et dans quel sens, est une important contribution à comprendre quand, où, et quelles optimisations ou propriétés une application peut dévoilée.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Lin, Nai-Wei. „Automatic complexity analysis of logic programs“. Diss., The University of Arizona, 1993. http://hdl.handle.net/10150/186287.

Der volle Inhalt der Quelle
Annotation:
This dissertation describes research toward automatic complexity analysis of logic programs and its applications. Automatic complexity analysis of programs concerns the inference of the amount of computational resources consumed during program execution, and has been studied primarily in the context of imperative and functional languages. This dissertation extends these techniques to logic programs so that they can handle nondeterminism, namely, the generation of multiple solutions via backtracking. We describe the design and implementation of a (semi)-automatic worst-case complexity analysis system for logic programs. This system can conduct the worst-case analysis for several complexity measures, such as argument size, number of solutions, and execution time. This dissertation also describes an application of such analyses, namely, a runtime mechanism for controlling task granularity in parallel logic programming systems. The performance of parallel systems often starts to degrade when the concurrent tasks in the systems become too fine-grained. Our approach to granularity control is based on time complexity information. With this information, we can compare the execution cost of a procedure with the average process creation overhead of the underlying system to determine at runtime if we should spawn a procedure call as a new concurrent task or just execute it sequentially. Through experimental measurements, we show that this mechanism can substantially improve the performance of parallel systems in many cases. This dissertation also presents several source-level program transformation techniques for optimizing the evaluation of logic programs containing finite-domain constraints. These techniques are based on number-of-solutions complexity information. The techniques include planning the evaluation order of subgoals, reducing the domain of variables, and planning the instantiation order of variable values. This application allows us to solve a problem by starting with a more declarative but less efficient program, and then automatically transforming it into a more efficient program. Through experimental measurements we show that these program transformation techniques can significantly improve the efficiency of the class of programs containing finite-domain constraints in most cases.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Mitchell, Neil. „Transformation and analysis of functional programs“. Thesis, University of York, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.495901.

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

Abu, Hashish Nabil. „Mutation analysis of dynamically typed programs“. Thesis, University of Hull, 2013. http://hydra.hull.ac.uk/resources/hull:8444.

Der volle Inhalt der Quelle
Annotation:
The increasing use of dynamically typed programming languages brings a new challenge to software testing. In these languages, types are not checked at compile-time. Type errors must be found by testing and in general, programs written in these languages require additional testing compared to statically typed languages. Mutation analysis (or mutation testing) has been shown to be effective in testing statically (or strongly) typed programs. In statically typed programs, the type information is essential to ensure only type-correct mutants are generated. Mutation analysis has not so far been fully used for dynamically typed programs. In dynamically typed programs, at compile-time, the types of the values held in variables are not known. Therefore, it is not clear if a variable should be mutated with number, Boolean, string, or object mutation operators. This thesis investigates and introduces new approaches for the mutation analysis of dynamically typed programs. The first approach is a static approach that employs the static type context of variables to determine, if possible, type information and generate mutants in the manner of traditional mutation analysis. With static mutation there is the danger that the type context does not allow the precise type to be determined and so type-mutations are produced. In a type-mutation, the original and mutant expressions have a different type. These mutants may be too easily killed and if they are then they represent incompetent mutants that do not force the tester to improve the test set. The second approach is designed to avoid type-mutations. This approach requires that the types of variables are discovered. The types of variables are discovered at run-time. Using type information, it is possible to generate only type-correct mutants. This dynamic approach, although more expensive computationally, is more likely to produce high quality, difficult to kill, mutants.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Benton, Peter Nicholas. „Strictness analysis of lazy functional programs“. Thesis, University of Cambridge, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.281891.

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

Bücher zum Thema "Programs analysis"

1

Lewis, Gordon H. Income transfer analysis. Washington, D.C: Urban Institute Press, 1989.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

1933-, Rosenthal Robert, Hrsg. BASIC meta-analysis: Procedures and programs. Hillsdale, N.J: L. Earlbaum Associates, 1985.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Zahn, John J. FORTRAN programs for reliability analysis. Madison, WI (One Gifford Pinchot Dr., Madison 53705-2398): U.S. Dept. of Agriculture, Forest Service, Forest Products Laboratory, 1992.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Colt, Stephen. Childcare assistance programs: Caseload analysis. [Alaska]: State of Alaska, Dept. of Community and Regional Affairs, Division of Community and Rural Development, Child Care Programs, 1994.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Economic analysis of farm programs. New York: McGraw-Hill, 1991.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Massacutee, Robert P. KEY analysis system. Golden, Colo: U.S. Dept. of the Interior, U.S. Geological Survey, National Earthquake Information Center ; [Denver, Colo., 1994.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Masse, Robert P. KEY analysis system. Golden, Colo: U.S. Dept. of the Interior, U.S. Geological Survey, National Earthquake Information Center ; [Denver, Colo., 1994.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Massé, Robert P. KEY analysis system. Golden, Colo: U.S. Dept. of the Interior, U.S. Geological Survey, National Earthquake Information Center ; [Denver, Colo., 1994.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Dependence analysis. Boston: Kluwer Academic Publishers, 1997.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

BASIC programs for electrical circuit analysis. Reston, Va: Reston Pub. Co., 1985.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Buchteile zum Thema "Programs analysis"

1

Gayed, Ramez, und Amin Ghali. „Computer programs“. In Structural Analysis Fundamentals, 589–96. Boca Raton: CRC Press, 2021. http://dx.doi.org/10.1201/9780429286858-20.

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

Bodik, Rastislav. „Algorithmic Program Synthesis with Partial Programs and Decision Procedures“. In Static Analysis, 1. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03237-0_1.

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

Peralta, Julio C., John P. Gallagher und Hüseyin Sağlam. „Analysis of Imperative Programs through Analysis of Constraint Logic Programs“. In Static Analysis, 246–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-49727-7_15.

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

Rinard, Martin. „Analysis of Multithreaded Programs“. In Static Analysis, 1–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-47764-0_1.

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

Bouajjani, Ahmed, Michael Emmi und Gennaro Parlato. „On Sequentializing Concurrent Programs“. In Static Analysis, 129–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23702-7_13.

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

Suter, Philippe, Ali Sinan Köksal und Viktor Kuncak. „Satisfiability Modulo Recursive Programs“. In Static Analysis, 298–315. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23702-7_23.

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

Andersen, Erling B. „Computer Programs“. In The Statistical Analysis of Categorical Data, 495–503. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/978-3-642-78817-8_13.

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

Andersen, Erling B. „Computer programs“. In The Statistical Analysis of Categorical Data, 495–503. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-97353-6_13.

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

Laski, Janusz, und William Stanley. „How to Prove a Program Correct: Iterative Programs“. In Software Verification and Analysis, 63–79. London: Springer London, 2009. http://dx.doi.org/10.1007/978-1-84882-240-5_3.

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

Hückelheim, Jan, Ziqing Luo, Sri Hari Krishna Narayanan, Stephen Siegel und Paul D. Hovland. „Verifying Properties of Differentiable Programs“. In Static Analysis, 205–22. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99725-4_14.

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

Konferenzberichte zum Thema "Programs analysis"

1

Harris, William R., Sriram Sankaranarayanan, Franjo Ivančić und Aarti Gupta. „Program analysis via satisfiability modulo path programs“. In the 37th annual ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1706299.1706309.

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

van Tonder, Rijnard, und Claire Le Goues. „Tailoring programs for static analysis via program transformation“. In ICSE '20: 42nd International Conference on Software Engineering. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3377811.3380343.

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

Lu, Pingjing, Bao Li, Zhengbin Pang, Ying Zhang und Shaogang Wang. „Combining Program Analysis and Empirical Search to Optimize Programs“. In 2013 IEEE International Conference on High Performance Computing and Communications (HPCC) & 2013 IEEE International Conference on Embedded and Ubiquitous Computing (EUC). IEEE, 2013. http://dx.doi.org/10.1109/hpcc.and.euc.2013.272.

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

Chaudhuri, Swarat, Sumit Gulwani und Roberto Lublinerman. „Continuity analysis of programs“. In the 37th annual ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1706299.1706308.

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

Giffhorn, Dennis. „Chopping Concurrent Programs“. In 2009 Ninth IEEE International Working Conference on Source Code Analysis and Manipulation. IEEE, 2009. http://dx.doi.org/10.1109/scam.2009.11.

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

Tiedemann, K. „Using statistical analysis to mitigate risk in environmental programs“. In RISK ANALYSIS 2008. Southampton, UK: WIT Press, 2008. http://dx.doi.org/10.2495/risk080261.

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

Bauer, Kerstin, und Klaus Schneider. „Transferring Causality Analysis from Synchronous Programs to Hybrid Programs“. In The 8th International Modelica Conference, Technical Univeristy, Dresden, Germany. Linköping University Electronic Press, 2011. http://dx.doi.org/10.3384/ecp11063207.

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

Rahman, Ashiqur, und James R. Cordy. „Pattern Analysis of TXL Programs“. In 2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER). IEEE, 2016. http://dx.doi.org/10.1109/saner.2016.110.

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

Sankaranarayanan, Sriram, Aleksandar Chakarov und Sumit Gulwani. „Static analysis for probabilistic programs“. In the 34th ACM SIGPLAN conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2491956.2462179.

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

Kuchcinski, Krzysztof, und Bogdan Wiszniewski. „Path analysis of distributed programs“. In the 1988 ACM sixteenth annual conference. New York, New York, USA: ACM Press, 1988. http://dx.doi.org/10.1145/322609.322661.

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

Berichte der Organisationen zum Thema "Programs analysis"

1

DEPARTMENT OF THE ARMY WASHINGTON DC. Army Programs: The Cost and Economic Analysis Program. Fort Belvoir, VA: Defense Technical Information Center, Januar 1995. http://dx.doi.org/10.21236/ada402035.

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

Zahn, John J. Fortran programs for reliability analysis. Madison, WI: U.S. Department of Agriculture, Forest Service, Forest Products Laboratory, 1992. http://dx.doi.org/10.2737/fpl-gtr-72.

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

Wiser, R., S. Olson, L. Bird und B. Swezey. Utility Green Pricing Programs: A Statistical Analysis of Program Effectiveness. Office of Scientific and Technical Information (OSTI), Februar 2004. http://dx.doi.org/10.2172/15006909.

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

Wiser, Ryan, Scott Olson, Lori Bird und Blair Swezey. Utility green pricing programs: A statistical analysis of program effectiveness. Office of Scientific and Technical Information (OSTI), Februar 2004. http://dx.doi.org/10.2172/821338.

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

Heintze, Nevin. Set Based Analysis of ML Programs. Fort Belvoir, VA: Defense Technical Information Center, Juli 1993. http://dx.doi.org/10.21236/ada270597.

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

Rozhkov, M., und K. Nakanishi. Computer programs for analysis of geophysical data. Office of Scientific and Technical Information (OSTI), Juni 1994. http://dx.doi.org/10.2172/10193091.

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

Cummings, J. P., und D. P. Weygand. The new BNL partial wave analysis programs. Office of Scientific and Technical Information (OSTI), Juli 1997. http://dx.doi.org/10.2172/525028.

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

Whitten, Timothy C., Eric K. Green, William C. Rankin und Joan P. Brannick. Impact Analysis for Research and Development Programs. Fort Belvoir, VA: Defense Technical Information Center, August 1988. http://dx.doi.org/10.21236/ada203885.

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

Maddux, Gary A. Systems Engineering Analysis of AMCOM Programs(s). Fort Belvoir, VA: Defense Technical Information Center, Oktober 1999. http://dx.doi.org/10.21236/ada374425.

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

Thiessen, R. Users guide Geologic Spatial Analysis (GSA) programs remote geologic analysis project. Office of Scientific and Technical Information (OSTI), August 1990. http://dx.doi.org/10.2172/6389903.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "Programs analysis" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel Dissertationen Bücher
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie