Thematische Bibliographien / Formal and symbolic calculation

Auswahl der wissenschaftlichen Literatur zum Thema „Formal and symbolic calculation“

Autor: Grafiati

Veröffentlicht am 25. Mai 2024

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 "Formal and symbolic calculation" 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 "Formal and symbolic calculation"

Deng, Hui, und Jinzhao Wu. „Approximate Bisimulation and Optimization of Software Programs Based on Symbolic-Numeric Computation“. Mathematical Problems in Engineering 2013 (2013): 1–19. http://dx.doi.org/10.1155/2013/421926.

Der volle Inhalt der Quelle

Annotation:

To achieve behavior and structure optimization for a type of software program whose data exchange processes are represented by nonlinear polynomial systems, this paper establishes a novel formal description called a nonlinear polynomial transition system to represent the behavior and structure of the software program. Then, the notion of bisimulation for software programs is proposed based on the equivalence relation of corresponding nonlinear polynomial systems in their nonlinear polynomial transition systems. However, the exact equivalence is too strict in application. To enhance the flexibility of the relation among the different software systems, the notion of approximate bisimulation within a controllable error range and the calculation algorithm of approximate bisimulation based on symbolic-numeric computation are given. In this calculation, an approximate relation is represented as a MAX function that is resolved with the full filled method. At the same time, the actual error is calculable. An example on a multithreading program indicates that the approximate bisimulation relation is feasible and effective in behavior and structure optimization.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Plaskura, Paweł. „DERIVWWW - WEB-BASED SYMBOLIC DIFFERENTIATION SYSTEM“. Information Technologies and Learning Tools 60, Nr. 4 (30.09.2017): 254. http://dx.doi.org/10.33407/itlt.v60i4.1578.

Der volle Inhalt der Quelle

Annotation:

The article presents an online system for symbolic differentiation. It shows how derivatives are calculated. The trees are used for internal representation of formulas. Derivatives are generated by tree transformations. Presented algorithms are part of the microsystems simulator Dero. They are required by the calculation algorithms such as Newton-Raphson. They can be used to generate derivatives in model description languages and for automatic derivative calculation. DerivWWW can be used in didactics. The system can serve as a tool for students to count function derivatives at the point. It can also be used in teaching on the technical fields of study. Symbolic derivatives are saved in the Tex format, allowing easy integration with other software. The developed and implemented algorithms are discussed. Examples of use are given.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Constantine, Gregory M., und Marius G. Buliga. „Determinantal generating functions of colored spanning forests“. International Journal of Mathematics and Mathematical Sciences 2004, Nr. 6 (2004): 273–83. http://dx.doi.org/10.1155/s0161171204302206.

Der volle Inhalt der Quelle

Annotation:

The color type of a spanning forest of a graph with colored edges is defined and, subsequently, it is proved that the generating function of such spanning forests is obtained as the formal expansion of a certain determinant. An analogous determinantal expansion yields the generating function of all spanning forests of a given color type that contain a specific subforest. Algorithms are described for obtaining a list of all colored spanning trees and spanning forests of any graph with colored edges based on symbolic calculation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yan, Zongshuai, Chenhua Nie, Rongsheng Dong, Xi Gao und Jianming Liu. „A Novel OBDD-Based Reliability Evaluation Algorithm for Wireless Sensor Networks on the Multicast Model“. Mathematical Problems in Engineering 2015 (2015): 1–14. http://dx.doi.org/10.1155/2015/269781.

Der volle Inhalt der Quelle

Annotation:

The two-terminal reliability calculation for wireless sensor networks (WSNs) is a #P-hard problem. The reliability calculation of WSNs on the multicast model provides an even worse combinatorial explosion of node states with respect to the calculation of WSNs on the unicast model; many real WSNs require the multicast model to deliver information. This research first provides a formal definition for the WSN on the multicast model. Next, a symbolic OBDD_Multicast algorithm is proposed to evaluate the reliability of WSNs on the multicast model. Furthermore, our research on OBDD_Multicast construction avoids the problem of invalid expansion, which reduces the number of subnetworks by identifying the redundant paths of two adjacent nodes ands-tunconnected paths. Experiments show that the OBDD_Multicast both reduces the complexity of the WSN reliability analysis and has a lower running time than Xing’s OBDD- (ordered binary decision diagram-) based algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

CERVESATO, ILIANO. „NEXCEL, a deductive spreadsheet“. Knowledge Engineering Review 22, Nr. 3 (September 2007): 221–36. http://dx.doi.org/10.1017/s0269888907001142.

Der volle Inhalt der Quelle

Annotation:

AbstractUsability and usefulness have made the spreadsheet one of the most successful computing applications of all times: millions rely on it every day for anything from typing grocery lists to developing multimillion-dollar budgets. One thing spreadsheets are not very good at is manipulating the symbolic data and helping users make decisions based on them. By tapping into recent research in Logic Programming, Databases and Cognitive Psychology, we propose a deductive extension to the spreadsheet paradigm that precisely addresses this issue. The accompanying tool, which we call NEXCEL, is intended as an automated assistant for the daily reasoning and decision-making needs of computer users, in the same way as a spreadsheet application such as Microsoft Excel assists them every day with simple and complex calculations. Users without formal training in Logic or even Computer Science can interactively define logical rules in the same simple way as they define formulas in Excel. NEXCEL immediately evaluates these rules, thereby returning lists of values that satisfy them, again just like with numerical formulas. The deductive component is seamlessly integrated into the traditional spreadsheet so that a user not only still has access to the usual functionalities but is also able to use them as part of the logical inference and, dually, to embed deductive steps in a numerical calculation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Selot, Florian, Bruno Robisson, Claire Vaglio-Gaudard und Javier Gil-Quijano. „Formal modelling of the electricity markets: the example of the load reduction of electricity mechanism “NEBEF”“. IOP Conference Series: Earth and Environmental Science 897, Nr. 1 (01.11.2021): 012017. http://dx.doi.org/10.1088/1755-1315/897/1/012017.

Der volle Inhalt der Quelle

Annotation:

Abstract The liberalisation of the electricity market initiated at the beginning of the 21st century has opened it to new parties. To ensure the growth of participants’ number will support the system’s balance, the EU regulation 2019/943 confirms that “all market participants should be financially responsible of the imbalances they cause”. In their respective area, the transmission system operators develops the regulation in compliance with this condition. However, as the regulation takes into account the new realities of the market such as renewables, the interactions between the participants become more complex. One of the risks is that the imbalance of an actor may not be due to its own actions, not complying with the EU regulation then. To analyse this kind of implicit condition, we propose a formal approach to model the exchanges of energy. Using the French regulation as a base, we model the participants and their interactions in the form of symbolic equations using the energy-related terms as variables. In this paper, to illustrate the model we will use to analyse the entire electricity market, we apply it to the NEBEF mechanism only. This mechanism is dedicated to the selling of demand response in France and introduces a third party between the final producer and the final consumer: the demand response operator. We model the mechanism and analyse how the mechanism complies with the balancing responsibility. Our results demonstrate that the mechanism complies with the regulation but there are some limits due to the calculation method of the reference consumption.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Røyrvik, Ola. „Teaching Electrical Engineering Using Maple“. International Journal of Electrical Engineering & Education 39, Nr. 4 (Oktober 2002): 297–309. http://dx.doi.org/10.7227/ijeee.39.4.1.

Der volle Inhalt der Quelle

Annotation:

Many electrical engineering (EE) students have difficulty in learning technical subjects because they lack sufficient competence in mathematical modeling and in algebra. Maple is a powerful program for doing symbolic algebra, numerical calculation, and plotting of graphs, so using this program allows students to spend more time on modeling and interpreting results. Maple also has a text editor, which makes it feasible to require students to explain their results in writing. The design of Maple documents suitable for EE teaching is discussed; a standard format, including bibliographical information, is recommended for easier use.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Noël, Marie-Pascale, und Xavier Seron. „Notational Constraints and Number Processing: A Reappraisal of the Gonzalez and Kolers (1982) Study“. Quarterly Journal of Experimental Psychology Section A 45, Nr. 3 (September 1992): 451–78. http://dx.doi.org/10.1080/02724989208250623.

Der volle Inhalt der Quelle

Annotation:

In a verification task of simple additions composed of Arabic or Roman numerals, Gonzalez and Kolers (1982) reported data that were interpreted as supporting the idea that cognitive operations are not independent of the symbols that instigate them. We propose an alternative interpretation of these results and argue that the effects reported may have been produced by a peculiarity of the Roman code for which the encoding time would not be constant for all numerals. We hypothesize that three different “structures” can be distinguished in the Roman code, and that the time necessary to encode a numeral would vary according to its structure, with the analogical (numerals I, II, and HI) and the symbolic (V, X) structures being processed faster than the complex structures (IV, VI, VII, VIII, IX, XI,…). This structure effect is tested in two experiments: a verification of transcoded forms and a parity judgement. Data repeatedly showed support for this hypothesis. Moreover, a verification task for additions showed that the presentation format of the addends played a role in the encoding stage but did not interact with variables relative to the size of the addition problems. These data could thus sustain the hypothesis of a “translation model”, according to which numerals would be translated into a specific code to which the calculation process would be applied.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Topilnytskyy, Volodymyr, Yaroslav Kusyi und Dariya Rebot. „RESEARCH OF VIBRATION MACHINES DYNAMICS FOR PRODUCT SURFACES PROCESSING BY MATHEMATICAL MODELING“. Vibrations in engineering and technology, Nr. 1(96) (27.08.2020): 35–43. http://dx.doi.org/10.37128/2306-8744-2020-1-4.

Der volle Inhalt der Quelle

Annotation:

The article describes the methodology for the study of the dynamics of vibrating machines for surface processing of products by mathematical modeling, which is presented in four main stages. The first stage: analysis of classes of vibrating machines for surface treatment of products, choice of basic for solving the technological problem, project of a unified calculation scheme of the machine. The second stage: development of a nonlinear mathematical model for describing the dynamics of the vibration machine working body and its filling, development of elements of automated calculations of the machine. The third stage: the study of the influence of the parameters of the vibrating machine, product sets and tools (with their various combinations) on the factors of the intensity of products surface processing. The fourth stage: recommendations for choosing vibrating machine parameters and machining bodies that will maximize the processing performance of products with the selected intensity criterion. A mathematical model for describing the motion of a vibrating machine for surface treatment of articles by a set of unrelated bodies of small size is created. It has two unbalance units that generate oscillations of its working body and a spring suspension-mounting of the working chamber (container). The model is parametric and nonlinear, incorporating key dynamic, kinematic and geometric parameters of the vibrating machine in symbolic format. It is constructed by: descriptions of the plane-parallel movement of the mechanical system, the rotational motion of the material point and the body; second-order Lagrange equation; asymptotic (approximate) methods of nonlinear mechanics. With the help of the model it is possible: to describe the oscillatory movement of the working chamber (container) of the vibrating machine; to study the influence of the machine parameters on the efficiency of performance of the set technological task, the conditions of occurrence of non-stationary modes of operation of the vibrating machine and the ways of their regulation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhang, Yujian, und Daifu Liu. „Toward Vulnerability Detection for Ethereum Smart Contracts Using Graph-Matching Network“. Future Internet 14, Nr. 11 (11.11.2022): 326. http://dx.doi.org/10.3390/fi14110326.

Der volle Inhalt der Quelle

Annotation:

With the blooming of blockchain-based smart contracts in decentralized applications, the security problem of smart contracts has become a critical issue, as vulnerable contracts have resulted in severe financial losses. Existing research works have explored vulnerability detection methods based on fuzzing, symbolic execution, formal verification, and static analysis. In this paper, we propose two static analysis approaches called ASGVulDetector and BASGVulDetector for detecting vulnerabilities in Ethereum smart contacts from source-code and bytecode perspectives, respectively. First, we design a novel intermediate representation called abstract semantic graph (ASG) to capture both syntactic and semantic features from the program. ASG is based on syntax information but enriched by code structures, such as control flow and data flow. Then, we apply two different training models, i.e., graph neural network (GNN) and graph matching network (GMN), to learn the embedding of ASG and measure the similarity of the contract pairs. In this way, vulnerable smart contracts can be identified by calculating the similarity to labeled ones. We conduct extensive experiments to evaluate the superiority of our approaches to state-of-the-art competitors. Specifically, ASGVulDetector improves the best of three source-code-only static analysis tools (i.e., SmartCheck, Slither, and DR-GCN) regarding the F1 score by 12.6% on average, while BASGVulDetector improves that of the three detection tools supporting bytecode (i.e., ContractFuzzer, Oyente, and Securify) regarding the F1 score by 25.6% on average. We also investigate the effectiveness and advantages of the GMN model for detecting vulnerabilities in smart contracts.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Formal and symbolic calculation"

Vu, Thi Xuan. „Homotopy algorithms for solving structured determinantal systems“. Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS478.

Der volle Inhalt der Quelle

Annotation:

Les systèmes polynomiaux multivariés apparaissant dans de nombreuses applications ont des structures spéciales et les systèmes invariants apparaissent dans un large éventail d'applications telles que dans l’optimisation polynomiale et des questions connexes en géométrie algébrique réelle. Le but de cette thèse est de fournir des algorithmes efficaces pour résoudre de tels systèmes structurés. Afin de résoudre le premier type de systèmes, nous concevons des algorithmes efficaces en utilisant les techniques d’homotopie symbolique. Alors que les méthodes d'homotopie, à la fois numériques et symboliques, sont bien comprises et largement utilisées dans la résolution de systèmes polynomiaux pour les systèmes carrés, l'utilisation de ces méthodes pour résoudre des systèmes surdéterminés n'est pas si claire. Hors, les systèmes déterminants sont surdéterminés avec plus d'équations que d'inconnues. Nous fournissons des algorithmes d'homotopie probabilistes qui tirent parti de la structure déterminantielle pour calculer des points isolés dans les ensembles des zéros de tels systèmes. Les temps d'exécution de nos algorithmes sont polynomiaux dans la somme des multiplicités des points isolés et du degré de la courbe d'homotopie. Nous donnons également des bornes sur le nombre de points isolés que nous devons calculer dans trois contextes: toutes les termes de l'entrée sont dans des anneaux polynomiaux classiques, tous ces polynômes sont creux, et ce sont des polynômes à degrés pondérés. Dans la seconde moitié de la thèse, nous abordons le problème de la recherche de points critiques d'une application polynomiale symétrique sur un ensemble algébrique invariant. Nous exploitons les propriétés d'invariance de l'entrée pour diviser l'espace de solution en fonction des orbites du groupe symétrique. Cela nous permet de concevoir un algorithme qui donne une description triangulaire de l'espace des solutions et qui s'exécute en temps polynomial dans le nombre de points que nous devons calculer. Nos résultats sont illustrés par des applications à l'étude d'ensembles algébriques réels définis par des systèmes polynomiaux invariants au moyen de la méthode des points critiques
Multivariate polynomial systems arising in numerous applications have special structures. In particular, determinantal structures and invariant systems appear in a wide range of applications such as in polynomial optimization and related questions in real algebraic geometry. The goal of this thesis is to provide efficient algorithms to solve such structured systems. In order to solve the first kind of systems, we design efficient algorithms by using the symbolic homotopy continuation techniques. While the homotopy methods, in both numeric and symbolic, are well-understood and widely used in polynomial system solving for square systems, the use of these methods to solve over-detemined systems is not so clear. Meanwhile, determinantal systems are over-determined with more equations than unknowns. We provide probabilistic homotopy algorithms which take advantage of the determinantal structure to compute isolated points in the zero-sets of determinantal systems. The runtimes of our algorithms are polynomial in the sum of the multiplicities of isolated points and the degree of the homotopy curve. We also give the bounds on the number of isolated points that we have to compute in three contexts: all entries of the input are in classical polynomial rings, all these polynomials are sparse, and they are weighted polynomials. In the second half of the thesis, we deal with the problem of finding critical points of a symmetric polynomial map on an invariant algebraic set. We exploit the invariance properties of the input to split the solution space according to the orbits of the symmetric group. This allows us to design an algorithm which gives a triangular description of the solution space and which runs in time polynomial in the number of points that we have to compute. Our results are illustrated by applications in studying real algebraic sets defined by invariant polynomial systems by the means of the critical point method

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Krandick, Werner. „Symbolic methods for polynomial complex root calculation /“. The Ohio State University, 1992. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487776210796097.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Qian, Kairong Computer Science &amp Engineering Faculty of Engineering UNSW. „Formal symbolic verification using heuristic search and abstraction techniques“. Awarded by:University of New South Wales. School of Computer Science and Engineering, 2006. http://handle.unsw.edu.au/1959.4/25703.

Der volle Inhalt der Quelle

Annotation:

Computing devices are pervading our everyday life and imposing challenges for designers that have the responsibility of producing reliable hardware and software systems. As systems grow in size and complexity, it becomes increasingly difficult to verify whether a design works as intended. Conventional verification methods, such as simulation and testing, exercise only parts of the system and from these parts, draw conclusions about the correctness of the total design. For complex designs, the parts of the system that can be verified are relatively small. Formal verification aims to overcome this problem. Instead of exercising the system, formal verification builds mathematical models of designs and proves whether properties hold in these models. In doing so, it at least aims to cover the complete design. Model checking is a formal verification method that automatically verifies a model of a design, or generates diagnostic information if the model cannot be verified. It is because of this usability and level of automation that model checking has gained a high degree of success in verifying circuit designs. The major disadvantage of model checking is its poor scalability. This is due to its algorithmic nature: namely, every state of the model needs to be enumerated. In practice, properties of interest may not need the exhaustive enumeration of the model state space. Many properties can be verified (or falsified) by examining a small number of states. In such cases, exhaustive algorithms can be replaced with search algorithms that are directed by heuristics. Methods based on heuristics generally scale well. This thesis investigates non-exhaustive model checking algorithms and focuses on error detection in system verification. The approach is based on a novel integration of symbolic model checking, heuristic search and abstraction techniques to produce a framework that we call abstractiondirected model checking. There are 3 main components in this framework. First, binary decision diagrams (BDDs) and heuristic search are combined to develop a symbolic heuristic search algorithm. This algorithm is used to detect errors. Second, abstraction techniques are applied in an iterative way. In the initial phase, the model is abstracted, and this model is verified using exhaustive algorithms. If a definitive verification result cannot be obtained, the same abstraction is re-used to generate a search heuristic. The heuristic in turn is used to direct a search algorithm that searches for error states in the concrete model. Third, a model transformation mechanism converts an arbitrary branching-time property to a reachability property. Essentially, this component allows this framework to be applied to a more general class of temporal property. By amalgamating these three components, the framework offers a new verification methodology that speeds up error detection in formal verification. The current implementation of this framework indicates that it can outperform existing standard techniques both in run-time and memory consumption, and scales much better than conventional model checking.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ritter, Gerd. „Formal sequential equivalence checking of digital systems by symbolic simulation“. Phd thesis, [S.l.] : [s.n.], 2001. http://elib.tu-darmstadt.de/diss/000113/thesis.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kavish, Daniel Ryan. „Interactionist Labeling: Formal and Informal Labeling's Effects on Juvenile Delinquency“. OpenSIUC, 2012. https://opensiuc.lib.siu.edu/theses/883.

Der volle Inhalt der Quelle

Annotation:

This thesis critically reviews prior labeling theory research concerning juvenile delinquency and crime; it adds to current work by using contemporary data. Labeling events are described in detail to provide an overall understanding of where labels originate, who is casting the label, and what research suggests concerning different types of labels. An interactionist labeling model is tested to explain levels of juvenile delinquency among a nationally representative sample of American adolescents: the first three waves of the National Longitudinal Study of Adolescent Health (Add Health). Finally, negative binomial regression models are estimated in order to better explain the dynamic relationship between labels and delinquency.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kavish, Daniel Ryan. „Interactionist Labeling: A Structural Equation Model of Formal Labeling, Juvenile Delinquency, and Adult Criminality“. OpenSIUC, 2016. https://opensiuc.lib.siu.edu/dissertations/1311.

Der volle Inhalt der Quelle

Annotation:

This dissertation critically reviews prior labeling theory research concerning juvenile delinquency and adult criminality, and presents a structural equation model utilizing the National Longitudinal Study of Adolescent Health (Add Health). The labeling perspective is outlined as it was originally presented, and the theoretical elaborations that have taken place since are highlighted. Distinctions are made between formally applied criminal justice labels and the informal labels that are applied by significant others and parents. An interactionist labeling model that incorporates respondents’ levels of self-control is presented to explain formal labeling, levels of juvenile delinquency, and future criminality among a nationally representative sample of American adolescents: three waves of Add Health. The findings show that formal labeling was the strongest significant predictor of subsequent criminal involvement and that it mediated the effect of prior delinquency on subsequent criminal involvement.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Morrison, George Campbell. „Automated coverage calculation and test case generation“. Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/20041.

Der volle Inhalt der Quelle

Annotation:

Thesis (MScEng)--Stellenbosch University, 2012.
ENGLISH ABSTRACT: This research combines symbolic execution, a formal method of static analysis, with various test adequacy criteria, to explore the e ectiveness of using symbolic execution for calculating code coverage on a program's existing JUnit test suites. Code coverage is measured with a number of test adequacy criteria, including statement coverage, branch coverage, condition coverage, method coverage, class coverage, and loop coverage. The results of the code coverage calculation is then used to automatically generate JUnit test cases for areas of a program that are not su ciently covered. The level of redundancy of each test case is also calculated during coverage calculation, thereby identifying fully redundant, and partially redundant, test cases. The combination of symbolic execution and code coverage calculation is extended to perform coverage calculation during a manual execution of a program, allowing testers to measure the e ectiveness of manual testing. This is implemented as an Eclipse plug-in, named ATCO, which attempts to take advantage of the Eclipse workspace and extensible user interface environment to improve usability of the tool by minimizing the user interaction required to use the tool. The code coverage calculation process uses constraint solving to determine method parameter values to reach speci c areas in the program. Constraint solving is an expensive computation, so the tool was parallellised using Java's Concurrency package, to reduce the overall execution time of the tool.
AFRIKAANSE OPSOMMING: Hierdie navorsing kombineer simboliese uitvoering, 'n formele metode van statiese analise, met verskeie toets genoegsaamheid kriteria, om die e ektiwiteit van die gebruik van simboliese uitvoer te ondersoek vir die berekening van kode dekking op 'n program se bestaande JUnit toets stelle. Kode dekking word gemeet deur verskeie toets genoegsaamheid kriteria, insluited stelling dekking, tak dekking, kondisie dekking, metode dekking, klas dekking, en lus dekking. Die resultate van die kode dekking berekeninge word dan gebruik om outomaties JUnit toets voorbeelde te genereer vir areas van 'n program wat nie doeltre end ondersoek word nie. Die vlak van oortolligheid van elke toets voorbeeld word ook bereken gedurende die dekkingsberekening, en daardeur word volledig oortollige, en gedeeltelik oortollige, toets voorbeelde identi seer. Die kombinasie van simboliese uitvoer en kode dekking berekening is uitgebrei deur die uitvoer van dekking berekeninge van 'n gebruiker-beheerde uitvoer, om sodoende kode dekking van 'n gebruiker-beheerde uitvoer van 'n program te meet. Dit laat toetsers toe om die e ektiwiteit van hulle beheerde uitvoer te meet. Bogenoemde word ge mplimenteer as 'n Eclipse aanvoegsel, genaamd ATCO, wat poog om voordeel te trek vanuit die Eclipse werkspasie, en die uitbreibare gebruiker oordrag omgewing, om die bruikbaarheid van ATCO te verbeter, deur die vermindering van die gebruiker interaksie wat benodig word om ATCO te gebruik. Die kode dekking berekeningsproses gebruik beperking oplossing om metode invoer waardes te bereken, om spesi eke areas in die program te bereik. Beperking oplossing is 'n duur berekening, so ATCO is geparalleliseer, met behulp van Java se Concurrency pakket, om die algehele uitvoer tyd van die program te verminder.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Klein, Joachim, Christel Baier, Philipp Chrszon, Marcus Daum, Clemens Dubslaff, Sascha Klüppelholz, Steffen Märcker und David Müller. „Advances in Symbolic Probabilistic Model Checking with PRISM“. Springer, 2016. https://tud.qucosa.de/id/qucosa%3A74267.

Der volle Inhalt der Quelle

Annotation:

For modeling and reasoning about complex systems, symbolic methods provide a prominent way to tackle the state explosion problem. It is well known that for symbolic approaches based on binary decision diagrams (BDD), the ordering of BDD variables plays a crucial role for compact representations and efficient computations. We have extended the popular probabilistic model checker PRISM with support for automatic variable reordering in its multi-terminal-BDD-based engines and report on benchmark results. Our extensions additionally allow the user to manually control the variable ordering at a finer-grained level. Furthermore, we present our implementation of the symbolic computation of quantiles and support for multi-reward-bounded properties, automata specifications and accepting end component computations for Streett conditions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhao, Hong. „Automatic generation and reduction of the semi-fuzzy knowledge base in symbolic processing and numerical calculation“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1995. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/NQ27811.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hansen, Sonja Maria [Verfasser], Hilde [Gutachter] Haider und Robert [Gutachter] Gaschler. „The potential of symbolic approximation. Disentangling the effects of approximation vs. calculation demands in nonsymbolic and symbolic representations. / Sonja Maria Hansen ; Gutachter: Hilde Haider, Robert Gaschler“. Köln : Universitäts- und Stadtbibliothek Köln, 2016. http://d-nb.info/1121745261/34.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Formal and symbolic calculation"

Meixner, Uwe. Axiomatic formal ontology. Dordrecht: Kluwer Academic Publishers, 1997.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Guerrero, Luis Ignacio. Logica: El razonamiento deductiuo formal. Ciudad de Mexico: Universidad Panamericana, 1992.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Modern formal logic. New York: Macmillan, 1989.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jones, Robert B. Symbolic Simulation Methods for Industrial Formal Verification. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4615-1101-4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

B, Jones Robert. Symbolic Simulation Methods for Industrial Formal Verification. Boston, MA: Springer US, 2002.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jones, Robert B. Symbolic simulation methods for industrial formal verification. Boston: Kluwer Academic Publishers, 2002.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jago, Mark. Formal logic. Penrith: Humanities-Ebooks, 2007.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

1930-1971, Montague Richard, Mar Gary und Fogelin Robert J, Hrsg. Logic: Techniques of formal reasoning. 2. Aufl. Australia: Wadsworth/Thomson Learning, 2002.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kalish, Donald. Logic: Techniques of formal reasoning. Herausgegeben von Fogelin Robert J, Montague Richard 1930-1971 und Mar Gary. 2. Aufl. New York: Oxford University Press, 1992.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Simple formal logic: With common-sense symbolic techniques. New York: Routledge, 2009.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Formal and symbolic calculation"

Hazelhurst, Scott, und Carl-Johan H. Seger. „Symbolic trajectory evaluation“. In Formal Hardware Verification, 3–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63475-4_1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jamsek, Damir A. „Symbolic Trajectory Evaluation“. In Advances in Formal Methods, 185–99. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-3188-0_12.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Huang, Shi-Yu, und Kwang-Ting Cheng. „Symbolic Verification“. In Formal Equivalence Checking and Design Debugging, 17–37. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5693-0_2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Khanna, Dhriti, Subodh Sharma, César Rodríguez und Rahul Purandare. „Dynamic Symbolic Verification of MPI Programs“. In Formal Methods, 466–84. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-95582-7_28.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kovács, Laura. „Symbolic Computation in Automated Program Reasoning“. In Formal Methods, 3–9. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-27481-7_1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Veanes, Margus, Pavel Grigorenko, Peli de Halleux und Nikolai Tillmann. „Symbolic Query Exploration“. In Formal Methods and Software Engineering, 49–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10373-5_3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bauer-Marquart, Fabian, Stefan Leue und Christian Schilling. „symQV: Automated Symbolic Verification of Quantum Programs“. In Formal Methods, 181–98. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-27481-7_12.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Makridis, Odysseus. „Formal Predicate Logic (also called First-Order Logic) ∏“. In Symbolic Logic, 289–329. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-67396-3_5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Singh, Shikhar, und Sarfraz Khurshid. „Parallel Chopped Symbolic Execution“. In Formal Methods and Software Engineering, 107–25. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-63406-3_7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Milushev, Dimiter, Wim Beck und Dave Clarke. „Noninterference via Symbolic Execution“. In Formal Techniques for Distributed Systems, 152–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30793-5_10.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Formal and symbolic calculation"

Błądek, Iwo, und Krzysztof Krawiec. „Solving symbolic regression problems with formal constraints“. In GECCO '19: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3321707.3321743.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Aichernig, Bernhard K., Roderick Bloem, Masoud Ebrahimi, Martin Tappler und Johannes Winter. „Automata Learning for Symbolic Execution“. In 2018 Formal Methods in Computer Aided Design (FMCAD). IEEE, 2018. http://dx.doi.org/10.23919/fmcad.2018.8602991.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kinder, Johannes. „Efficient symbolic execution for software testing“. In 2014 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2014. http://dx.doi.org/10.1109/fmcad.2014.6987585.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Adams, Sara, Magnus Bjork, Tom Melham und Carl-Johan Seger. „Automatic Abstraction in Symbolic Trajectory Evaluation“. In Formal Methods in Computer Aided Design (FMCAD'07). IEEE, 2007. http://dx.doi.org/10.1109/fmcad.2007.4401991.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Robertz, Daniel. „Formal Algorithmic Elimination for PDEs“. In ISSAC '16: International Symposium on Symbolic and Algebraic Computation. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2930889.2930941.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Radojicic, Carna, Thiyagarajan Purusothaman und Christoph Grimm. „Towards formal validation: Symbolic simulation of SystemC models“. In 2015 10th International Conference on Design & Technology of Integrated Systems in Nanoscale Era (DTIS). IEEE, 2015. http://dx.doi.org/10.1109/dtis.2015.7127376.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ning, Ning, Jun Zhang, Xiang-Yang Gao und Jing Xue. „Formal Verification of SDG via Symbolic Model Checking“. In 2009 Second International Conference on Intelligent Computation Technology and Automation. IEEE, 2009. http://dx.doi.org/10.1109/icicta.2009.840.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bryant, Randal E., Derek L. Beatty und Carl-Johan H. Seger. „Formal hardware verification by symbolic ternary trajectory evaluation“. In the 28th conference. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/127601.127701.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Farkas, Klaudia. „Perception of Formal and Symbolic Aesthetics of Photovoltaics“. In ISES Solar World Congress 2011. Freiburg, Germany: International Solar Energy Society, 2011. http://dx.doi.org/10.18086/swc.2011.17.10.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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!