Log in

Relevant bibliographies by topics / Formal and symbolic calculation

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Formal and symbolic calculation'

Author: Grafiati

Published: 25 May 2024

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Formal and symbolic calculation.'

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

1

Deng, Hui, and 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.

Full text

Abstract:

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 flexibi

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

Abstract:

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 ca

APA, Harvard, Vancouver, ISO, and other styles

3

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

Full text

Abstract:

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, and other styles

4

Yan, Zongshuai, Chenhua Nie, Rongsheng Dong, Xi Gao, and 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.

Full text

Abstract:

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 construc

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

Abstract:

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 int

APA, Harvard, Vancouver, ISO, and other styles

6

Selot, Florian, Bruno Robisson, Claire Vaglio-Gaudard, and 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, no. 1 (2021): 012017. http://dx.doi.org/10.1088/1755-1315/897/1/012017.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

7

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

Full text

Abstract:

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 informa

APA, Harvard, Vancouver, ISO, and other styles

8

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

Full text

Abstract:

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 nu

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

10

Zhang, Yujian, and Daifu Liu. "Toward Vulnerability Detection for Ethereum Smart Contracts Using Graph-Matching Network." Future Internet 14, no. 11 (2022): 326. http://dx.doi.org/10.3390/fi14110326.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Formal and symbolic calculation"

1

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

Full text

Abstract:

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 symbo

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

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.

Full text

Abstract:

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 th

APA, Harvard, Vancouver, ISO, and other styles

4

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

Abstract:

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). Finall

APA, Harvard, Vancouver, ISO, and other styles

6

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.

Full text

Abstract:

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’ l

APA, Harvard, Vancouver, ISO, and other styles

7

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

Full text

Abstract:

Thesis (MScEng)--Stellenbosch University, 2012.<br>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

APA, Harvard, Vancouver, ISO, and other styles

8

Klein, Joachim, Christel Baier, Philipp Chrszon, et al. "Advances in Symbolic Probabilistic Model Checking with PRISM." Springer, 2016. https://tud.qucosa.de/id/qucosa%3A74267.

Full text

Abstract:

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 fin

APA, Harvard, Vancouver, ISO, and other styles

9

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Hansen, Sonja Maria [Verfasser], Hilde [Gutachter] Haider, and 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Formal and symbolic calculation"

1

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Modern formal logic. Macmillan, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

1930-1971, Montague Richard, Mar Gary, and Fogelin Robert J, eds. Logic: Techniques of formal reasoning. 2nd ed. Wadsworth/Thomson Learning, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kalish, Donald. Logic: Techniques of formal reasoning. 2nd ed. Edited by Fogelin Robert J, Montague Richard 1930-1971, and Mar Gary. Oxford University Press, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Formal and symbolic calculation"

1

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Jamsek, Damir A. "Symbolic Trajectory Evaluation." In Advances in Formal Methods. Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-3188-0_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Huang, Shi-Yu, and Kwang-Ting Cheng. "Symbolic Verification." In Formal Equivalence Checking and Design Debugging. Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5693-0_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Formal and symbolic calculation"

1

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Aichernig, Bernhard K., Roderick Bloem, Masoud Ebrahimi, Martin Tappler, and 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Adams, Sara, Magnus Bjork, Tom Melham, and 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Adams, Sara, Magnus Bjork, Tom Melham, and 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/famcad.2007.27.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Radojicic, Carna, Thiyagarajan Purusothaman, and 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ning, Ning, Jun Zhang, Xiang-Yang Gao, and 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

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!