Gotowa bibliografia na temat „Formal and symbolic calculation”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Formal and symbolic calculation”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Formal and symbolic calculation"
Deng, Hui, i 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.
Pełny tekst źródłaPlaskura, 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.
Pełny tekst źródłaConstantine, Gregory M., i 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.
Pełny tekst źródłaYan, Zongshuai, Chenhua Nie, Rongsheng Dong, Xi Gao i 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.
Pełny tekst źródłaCERVESATO, ILIANO. "NEXCEL, a deductive spreadsheet". Knowledge Engineering Review 22, nr 3 (wrzesień 2007): 221–36. http://dx.doi.org/10.1017/s0269888907001142.
Pełny tekst źródłaSelot, Florian, Bruno Robisson, Claire Vaglio-Gaudard i 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 (1.11.2021): 012017. http://dx.doi.org/10.1088/1755-1315/897/1/012017.
Pełny tekst źródłaRøyrvik, Ola. "Teaching Electrical Engineering Using Maple". International Journal of Electrical Engineering & Education 39, nr 4 (październik 2002): 297–309. http://dx.doi.org/10.7227/ijeee.39.4.1.
Pełny tekst źródłaNoël, Marie-Pascale, i 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 (wrzesień 1992): 451–78. http://dx.doi.org/10.1080/02724989208250623.
Pełny tekst źródłaTopilnytskyy, Volodymyr, Yaroslav Kusyi i 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.
Pełny tekst źródłaZhang, Yujian, i 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.
Pełny tekst źródłaRozprawy doktorskie na temat "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.
Pełny tekst źródłaMultivariate 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
Krandick, Werner. "Symbolic methods for polynomial complex root calculation /". The Ohio State University, 1992. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487776210796097.
Pełny tekst źródłaQian, Kairong Computer Science & 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.
Pełny tekst źródłaRitter, 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.
Pełny tekst źródłaKavish, Daniel Ryan. "Interactionist Labeling: Formal and Informal Labeling's Effects on Juvenile Delinquency". OpenSIUC, 2012. https://opensiuc.lib.siu.edu/theses/883.
Pełny tekst źródłaKavish, 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.
Pełny tekst źródłaMorrison, George Campbell. "Automated coverage calculation and test case generation". Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/20041.
Pełny tekst źródłaENGLISH 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.
Klein, Joachim, Christel Baier, Philipp Chrszon, Marcus Daum, Clemens Dubslaff, Sascha Klüppelholz, Steffen Märcker i David Müller. "Advances in Symbolic Probabilistic Model Checking with PRISM". Springer, 2016. https://tud.qucosa.de/id/qucosa%3A74267.
Pełny tekst źródłaZhao, 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.
Pełny tekst źródłaHansen, Sonja Maria [Verfasser], Hilde [Gutachter] Haider i 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.
Pełny tekst źródłaKsiążki na temat "Formal and symbolic calculation"
Meixner, Uwe. Axiomatic formal ontology. Dordrecht: Kluwer Academic Publishers, 1997.
Znajdź pełny tekst źródłaGuerrero, Luis Ignacio. Logica: El razonamiento deductiuo formal. Ciudad de Mexico: Universidad Panamericana, 1992.
Znajdź pełny tekst źródłaModern formal logic. New York: Macmillan, 1989.
Znajdź pełny tekst źródłaJones, 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.
Pełny tekst źródłaB, Jones Robert. Symbolic Simulation Methods for Industrial Formal Verification. Boston, MA: Springer US, 2002.
Znajdź pełny tekst źródłaJones, Robert B. Symbolic simulation methods for industrial formal verification. Boston: Kluwer Academic Publishers, 2002.
Znajdź pełny tekst źródłaJago, Mark. Formal logic. Penrith: Humanities-Ebooks, 2007.
Znajdź pełny tekst źródła1930-1971, Montague Richard, Mar Gary i Fogelin Robert J, red. Logic: Techniques of formal reasoning. Wyd. 2. Australia: Wadsworth/Thomson Learning, 2002.
Znajdź pełny tekst źródłaKalish, Donald. Logic: Techniques of formal reasoning. Redaktorzy Fogelin Robert J, Montague Richard 1930-1971 i Mar Gary. Wyd. 2. New York: Oxford University Press, 1992.
Znajdź pełny tekst źródłaSimple formal logic: With common-sense symbolic techniques. New York: Routledge, 2009.
Znajdź pełny tekst źródłaCzęści książek na temat "Formal and symbolic calculation"
Hazelhurst, Scott, i Carl-Johan H. Seger. "Symbolic trajectory evaluation". W Formal Hardware Verification, 3–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63475-4_1.
Pełny tekst źródłaJamsek, Damir A. "Symbolic Trajectory Evaluation". W Advances in Formal Methods, 185–99. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-3188-0_12.
Pełny tekst źródłaHuang, Shi-Yu, i Kwang-Ting Cheng. "Symbolic Verification". W 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.
Pełny tekst źródłaKhanna, Dhriti, Subodh Sharma, César Rodríguez i Rahul Purandare. "Dynamic Symbolic Verification of MPI Programs". W Formal Methods, 466–84. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-95582-7_28.
Pełny tekst źródłaKovács, Laura. "Symbolic Computation in Automated Program Reasoning". W Formal Methods, 3–9. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-27481-7_1.
Pełny tekst źródłaVeanes, Margus, Pavel Grigorenko, Peli de Halleux i Nikolai Tillmann. "Symbolic Query Exploration". W 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.
Pełny tekst źródłaBauer-Marquart, Fabian, Stefan Leue i Christian Schilling. "symQV: Automated Symbolic Verification of Quantum Programs". W Formal Methods, 181–98. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-27481-7_12.
Pełny tekst źródłaMakridis, Odysseus. "Formal Predicate Logic (also called First-Order Logic) ∏". W Symbolic Logic, 289–329. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-67396-3_5.
Pełny tekst źródłaSingh, Shikhar, i Sarfraz Khurshid. "Parallel Chopped Symbolic Execution". W Formal Methods and Software Engineering, 107–25. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-63406-3_7.
Pełny tekst źródłaMilushev, Dimiter, Wim Beck i Dave Clarke. "Noninterference via Symbolic Execution". W 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.
Pełny tekst źródłaStreszczenia konferencji na temat "Formal and symbolic calculation"
Błądek, Iwo, i Krzysztof Krawiec. "Solving symbolic regression problems with formal constraints". W GECCO '19: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3321707.3321743.
Pełny tekst źródłaAichernig, Bernhard K., Roderick Bloem, Masoud Ebrahimi, Martin Tappler i Johannes Winter. "Automata Learning for Symbolic Execution". W 2018 Formal Methods in Computer Aided Design (FMCAD). IEEE, 2018. http://dx.doi.org/10.23919/fmcad.2018.8602991.
Pełny tekst źródłaKinder, Johannes. "Efficient symbolic execution for software testing". W 2014 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2014. http://dx.doi.org/10.1109/fmcad.2014.6987585.
Pełny tekst źródłaAdams, Sara, Magnus Bjork, Tom Melham i Carl-Johan Seger. "Automatic Abstraction in Symbolic Trajectory Evaluation". W Formal Methods in Computer Aided Design (FMCAD'07). IEEE, 2007. http://dx.doi.org/10.1109/fmcad.2007.4401991.
Pełny tekst źródłaAdams, Sara, Magnus Bjork, Tom Melham i Carl-Johan Seger. "Automatic Abstraction in Symbolic Trajectory Evaluation". W Formal Methods in Computer Aided Design (FMCAD'07). IEEE, 2007. http://dx.doi.org/10.1109/famcad.2007.27.
Pełny tekst źródłaRobertz, Daniel. "Formal Algorithmic Elimination for PDEs". W ISSAC '16: International Symposium on Symbolic and Algebraic Computation. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2930889.2930941.
Pełny tekst źródłaRadojicic, Carna, Thiyagarajan Purusothaman i Christoph Grimm. "Towards formal validation: Symbolic simulation of SystemC models". W 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.
Pełny tekst źródłaNing, Ning, Jun Zhang, Xiang-Yang Gao i Jing Xue. "Formal Verification of SDG via Symbolic Model Checking". W 2009 Second International Conference on Intelligent Computation Technology and Automation. IEEE, 2009. http://dx.doi.org/10.1109/icicta.2009.840.
Pełny tekst źródłaBryant, Randal E., Derek L. Beatty i Carl-Johan H. Seger. "Formal hardware verification by symbolic ternary trajectory evaluation". W the 28th conference. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/127601.127701.
Pełny tekst źródłaFarkas, Klaudia. "Perception of Formal and Symbolic Aesthetics of Photovoltaics". W ISES Solar World Congress 2011. Freiburg, Germany: International Solar Energy Society, 2011. http://dx.doi.org/10.18086/swc.2011.17.10.
Pełny tekst źródła