Gotowa bibliografia na temat „Rewriting techniques”
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 „Rewriting techniques”.
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 "Rewriting techniques"
GIESL, JÜRGEN, i AART MIDDELDORP. "Transformation techniques for context-sensitive rewrite systems". Journal of Functional Programming 14, nr 4 (7.06.2004): 379–427. http://dx.doi.org/10.1017/s0956796803004945.
Pełny tekst źródłaCarral, David, Larry González i Patrick Koopmann. "From Horn-SRIQ to Datalog: A Data-Independent Transformation That Preserves Assertion Entailment". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17.07.2019): 2736–43. http://dx.doi.org/10.1609/aaai.v33i01.33012736.
Pełny tekst źródłaKirchner, Hélène, i Pierre Lescanne. "Rewriting techniques and applications, RTA'91". ACM SIGACT News 22, nr 3 (czerwiec 1991): 24–30. http://dx.doi.org/10.1145/126537.126539.
Pełny tekst źródłaMillen, Jonathan. "Rewriting Techniques in the Constraint Solver". Electronic Notes in Theoretical Computer Science 234 (marzec 2009): 77–91. http://dx.doi.org/10.1016/j.entcs.2009.02.073.
Pełny tekst źródłaRoşu, Grigore, i Klaus Havelund. "Rewriting-Based Techniques for Runtime Verification". Automated Software Engineering 12, nr 2 (kwiecień 2005): 151–97. http://dx.doi.org/10.1007/s10515-005-6205-y.
Pełny tekst źródłaGazeau, Ivan, Dale Miller i Catuscia Palamidessi. "Non-local Robustness Analysis via Rewriting Techniques". Electronic Proceedings in Theoretical Computer Science 103 (14.12.2012): 65. http://dx.doi.org/10.4204/eptcs.103.8.
Pełny tekst źródłaVenetis, Tassos, Giorgos Stoilos i Vasilis Vassalos. "Rewriting Minimizations for Efficient Query Answering over Ontologies". International Journal on Artificial Intelligence Tools 26, nr 05 (październik 2017): 1760024. http://dx.doi.org/10.1142/s0218213017600247.
Pełny tekst źródłaAmbite, J. L., i C. A. Knoblock. "Planning by Rewriting". Journal of Artificial Intelligence Research 15 (1.09.2001): 207–61. http://dx.doi.org/10.1613/jair.754.
Pełny tekst źródłaDe Sutter, Bjorn, Bruno De Bus i Koen De Bosschere. "Link-time binary rewriting techniques for program compaction". ACM Transactions on Programming Languages and Systems 27, nr 5 (wrzesień 2005): 882–945. http://dx.doi.org/10.1145/1086642.1086645.
Pełny tekst źródłaGreco, Sergio, Francesca Spezzano i Irina Trubitsyna. "Checking Chase Termination: Cyclicity Analysis and Rewriting Techniques". IEEE Transactions on Knowledge and Data Engineering 27, nr 3 (1.03.2015): 621–35. http://dx.doi.org/10.1109/tkde.2014.2339816.
Pełny tekst źródłaRozprawy doktorskie na temat "Rewriting techniques"
Sapiña, Sanchis Julia. "Rewriting Logic Techniques for Program Analysis and Optimization". Doctoral thesis, Universitat Politècnica de València, 2018. http://hdl.handle.net/10251/94044.
Pełny tekst źródłaThis thesis proposes a dynamic analysis methodology for improving the diagnosis of erroneous Maude programs. The key idea is to combine runtime assertion checking and dynamic trace slicing for automatically catching errors at runtime while reducing the size and complexity of the erroneous traces to be analyzed (i.e., those leading to states that fail to satisfy the assertions). In the event of an assertion violation, the slicing criterion is automatically inferred, which facilitates the user to rapidly pinpoint the source of the error. First, a technique is formalized that aims at automatically detecting anomalous deviations of the intended program behavior (error symptoms) by using assertions that are checked at runtime. This technique supports two types of user-defined assertions: functional assertions (which constrain deterministic function calls) and system assertions (which specify system state invariants). The proposed dynamic checking is provably sound in the sense that all errors flagged definitely signal a violation of the specifications. Then, upon eventual assertion violations, accurate trace slices (i.e., simplified yet precise execution traces) are generated automatically, which help identify the cause of the error. Moreover, the technique also suggests a possible repair for the rules involved in the generation of the erroneous states. The proposed methodology is based on (i) a logical notation for specifying assertions that are imposed on execution runs; (ii) a runtime checking technique that dynamically tests the assertions; and (iii) a mechanism based on (equational) least general generalization that automatically derives accurate criteria for slicing from falsified assertions. Finally, an implementation of the proposed technique is presented in the assertion-based, dynamic analyzer ABETS, which shows how the forward and backward tracking of asserted program properties leads to a thorough trace analysis algorithm that can be used for program diagnosis and debugging.
Esta tesi proposa una metodologia d'anàlisi dinàmica que millora el diagnòstic de programes erronis escrits en el llenguatge Maude. La idea clau és combinar tècniques de verificació d'assercions en temps d'execució amb la fragmentació dinàmica de traces d'execució per a detectar automàticament errors en temps d'execució, alhora que es reduïx la grandària i la complexitat de les traces a analitzar. En el cas de violar-se una asserció, s'inferix automàticament el criteri de fragmentació, la qual cosa facilita a l'usuari identificar ràpidament la font de l'error. En primer lloc, la tesi formalitza una tècnica destinada a detectar automàticament eventuals desviacions del comportament desitjat del programa (símptomes d'error). Esta tècnica suporta dos tipus d'assercions definides per l'usuari: assercions funcionals (que restringixen crides a funcions deterministes) i assercions de sistema (que especifiquen els invariants d'estat del sistema). La tècnica de verificació dinàmica proposta és demostrablement correcta en el sentit que tots els errors assenyalats definitivament delaten la violació de les assercions. Davant eventuals violacions d'assercions, es generen automàticament traces fragmentades (és a dir, traces simplificades però igualment precises) que ajuden a identificar la causa de l'error. A més, la tècnica també suggerix una possible reparació de les regles implicades en la generació dels estats erronis. La metodologia proposada es basa en (i) una notació lògica per a especificar les assercions que s'imposen a l'execució; (ii) una tècnica de verificació aplicable en temps d'execució que comprova dinàmicament les assercions; i (iii) un mecanisme basat en la generalització (ecuacional) menys general que automàticament obté criteris precisos per a fragmentar traces d'execució a partir d'assercions falsificades. Finalment, es presenta una implementació de la tècnica proposta en la ferramenta d'anàlisi dinàmica basat en assercions ABETS, que mostra com és possible combinar el traçat cap avant i cap arrere de les propietats assertades del programa per a obtindre un algoritme precís d'anàlisi de traces que resulta útil per al diagnòstic i la depuració de programes.
Sapiña Sanchis, J. (2017). Rewriting Logic Techniques for Program Analysis and Optimization [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/94044
TESIS
Papadopoulos, George Angelos. "Parallel implementation of concurrent logic languages using graph rewriting techniques". Thesis, University of East Anglia, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.329340.
Pełny tekst źródłaButh, Karl-Heinz [Verfasser]. "Techniques for Modelling Structured Operational and Denotational Semantics Definitions with Term Rewriting Systems / Karl Heinz Buth". Kiel : Universitätsbibliothek Kiel, 1994. http://d-nb.info/1080332669/34.
Pełny tekst źródłaFeliú, Gabaldón Marco Antonio. "Logic-based techniques for program analysis and specification synthesis". Doctoral thesis, Universitat Politècnica de València, 2013. http://hdl.handle.net/10251/33747.
Pełny tekst źródłaFeliú Gabaldón, MA. (2013). Logic-based techniques for program analysis and specification synthesis [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/33747
TESIS
Rusinowitch, Michaël. "Démonstration automatique par des techniques de réécritures". Nancy 1, 1987. http://www.theses.fr/1987NAN10358.
Pełny tekst źródłaKamat, Niranjan Ganesh. "Sampling-based Techniques for Interactive Exploration of Large Datasets". The Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1523552932728325.
Pełny tekst źródłaKaranasos, Konstantinos. "View-Based techniques for the efficient management of web data". Phd thesis, Université Paris Sud - Paris XI, 2012. http://tel.archives-ouvertes.fr/tel-00755328.
Pełny tekst źródłaBeveraggi, Marc. "Problemes combinatoires en codage algebrique". Paris 6, 1987. http://www.theses.fr/1987PA066265.
Pełny tekst źródłaFerey, Gaspard. "Higher-Order Confluence and Universe Embedding in the Logical Framework". Electronic Thesis or Diss., université Paris-Saclay, 2021. http://www.theses.fr/2021UPASG032.
Pełny tekst źródłaIn the context of the multiplicity of formal systems, it has become a growing need to express formal proofs into a common logical framework.This thesis focuses on the use of higher-order term rewriting to embed complex formal systems in the simple and well-studied lambda-Pi calculus modulo.This system, commonly used as a logical framework, features dependent types and is extended with higher-order term rewriting.We study, in a first part, criterias for the confluence properties of higher-order rewrite systems considered together with the usual beta reduction.In the case of left-linear systems, confluence can be reduced to the study of critical pairs which must be provided a decreasing diagram with relation to some rule labeling.We show that in the presence of non-linear rules, it is still possible to achieve confluence if the set of considered terms is layered.We then focus, in a second part, on the encoding of higher-order logics based on complex universe structures. The embeding of cumulativity, a limited form of subtyping, is handled with new rewriting techniques relying on private symbols and allowing some form of proof irrelevance.We then describe how algebraic universe expressions containing level variables can be represented, even in presence of universe constraints.Eventually we introduce an embeding of universe polymorphism as defined in the core logic of the Coq system and prove the correctness of the defined translation mechanism.These results, along with other more practical techniques, allowed the implementation of a translator to Dedukti which was used to translate several sizeable Coq developments
Zighem, Ismail. "Etude d'invariants de graphes planaires". Université Joseph Fourier (Grenoble), 1998. http://www.theses.fr/1998GRE10211.
Pełny tekst źródłaKsiążki na temat "Rewriting techniques"
Bronstein, Manuel, Volker Weispfenning i Johannes Grabmeier, red. Symbolic Rewriting Techniques. Basel: Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4.
Pełny tekst źródłaBronstein, Manuel. Symbolic Rewriting Techniques. Basel: Birkhäuser Basel, 1998.
Znajdź pełny tekst źródłaKirchner, Claude, red. Rewriting Techniques and Applications. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-662-21551-7.
Pełny tekst źródłaNieuwenhuis, Robert, red. Rewriting Techniques and Applications. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44881-0.
Pełny tekst źródłaVoronkov, Andrei, red. Rewriting Techniques and Applications. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-70590-1.
Pełny tekst źródłaComon, Hubert, red. Rewriting Techniques and Applications. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62950-5.
Pełny tekst źródłaNipkow, Tobias, red. Rewriting Techniques and Applications. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0052355.
Pełny tekst źródłaJouannaud, Jean-Pierre, red. Rewriting Techniques and Applications. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15976-2.
Pełny tekst źródłaLescanne, Pierre, red. Rewriting Techniques and Applications. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-17220-3.
Pełny tekst źródłaDershowitz, Nachum, red. Rewriting Techniques and Applications. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51081-8.
Pełny tekst źródłaCzęści książek na temat "Rewriting techniques"
Zhang, Hantao, i Jean-Luc Remy. "Contextual rewriting". W Rewriting Techniques and Applications, 46–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15976-2_2.
Pełny tekst źródłaGranicz, Adam, Daniel M. Zimmerman i Jason Hickey. "Rewriting UNITY". W Rewriting Techniques and Applications, 138–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44881-0_11.
Pełny tekst źródłaLucas, Salvador. "Transfinite Rewriting Semantics for Term Rewriting Systems". W Rewriting Techniques and Applications, 216–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45127-7_17.
Pełny tekst źródłaAmrhein, Beatrice, Reinhard Bündgen i Wolfgang Küchlin. "Parallel Completion Techniques". W Symbolic Rewriting Techniques, 1–34. Basel: Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4_1.
Pełny tekst źródłaMartin, Ursula. "New Directions for Syntactic Termination Orderings". W Symbolic Rewriting Techniques, 209–24. Basel: Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4_10.
Pełny tekst źródłaPesch, Michael. "Two-sided Gröbner Bases in Iterated Ore Extensions". W Symbolic Rewriting Techniques, 225–43. Basel: Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4_11.
Pełny tekst źródłaPethö, Attila, Joachim Stein, Thomas Weis i Horst G. Zimmer. "Computing the Torsion Group of Elliptic Curves by the Method of Gröbner Bases". W Symbolic Rewriting Techniques, 245–65. Basel: Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4_12.
Pełny tekst źródłaStrogova, Polina. "Finding a Finite Group Presentation Using Rewriting". W Symbolic Rewriting Techniques, 267–76. Basel: Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4_13.
Pełny tekst źródłaWidiger, Alfred. "Deciding Degree-Four-Identities for Alternative Rings by Rewriting". W Symbolic Rewriting Techniques, 277–88. Basel: Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4_14.
Pełny tekst źródłaApel, Joachim. "The Computation of Gröbner Bases Using an Alternative Algorithm". W Symbolic Rewriting Techniques, 35–45. Basel: Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8800-4_2.
Pełny tekst źródłaStreszczenia konferencji na temat "Rewriting techniques"
Nagaraj, Vaivaswatha, i R. Govindarajan. "Parallel flow-sensitive pointer analysis by graph-rewriting". W 22nd International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE, 2013. http://dx.doi.org/10.1109/pact.2013.6618793.
Pełny tekst źródłaRizvi, Shariq, Alberto Mendelzon, S. Sudarshan i Prasan Roy. "Extending query rewriting techniques for fine-grained access control". W the 2004 ACM SIGMOD international conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1007568.1007631.
Pełny tekst źródłaChandrasekhar, M. S., J. P. Privitera i K. W. Conradt. "Application of term rewriting techniques to hardware design verification". W 24th ACM/IEEE conference proceedings. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/37888.37930.
Pełny tekst źródłaChristy, D. K. Sheena, P. John Paul i D. G. Thomas. "H-array system on picture languages with array rewriting rules". W 1ST INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2020. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0025583.
Pełny tekst źródłaSweety, F., K. Sasikala, T. Kalyani i D. G. Thomas. "Partial array-rewriting P systems and basic puzzle partial array grammars". W 1ST INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2020. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0027078.
Pełny tekst źródłaOlszewski, Marek, Jeremy Cutler i J. Gregory Steffan. "JudoSTM: A Dynamic Binary-Rewriting Approach to Software Transactional Memory". W 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007). IEEE, 2007. http://dx.doi.org/10.1109/pact.2007.4336226.
Pełny tekst źródłaArias, Jaime, Kyungmin Bae, Carlos Olarte, Peter Csaba Ölveczky, Laure Petrucci i Fredrik Rømming. "Rewriting Logic Semantics and Symbolic Analysis for Parametric Timed Automata". W FTSCS '22: 8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3563822.3569923.
Pełny tekst źródłaAvenhaus, J., i D. Wi:Gbmann. "Using rewriting techniques to solve the generalized word problem in polycyclic groups". W the ACM-SIGSAM 1989 international symposium. New York, New York, USA: ACM Press, 1989. http://dx.doi.org/10.1145/74540.74579.
Pełny tekst źródłaLee, Jaeseo, Sangki Kim i Kyungmin Bae. "Bounded Model Checking of PLC ST Programs using Rewriting Modulo SMT". W FTSCS '22: 8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3563822.3568016.
Pełny tekst źródłaGheerbrant, Amélie, i Cristina Sirangelo. "Best Answers over Incomplete Data : Complexity and First-Order Rewritings". W Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/236.
Pełny tekst źródłaRaporty organizacyjne na temat "Rewriting techniques"
Borgwardt, Stefan, Marcel Lippmann i Veronika Thost. Temporal Query Answering w.r.t. DL-Lite-Ontologies. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.195.
Pełny tekst źródła