Log in

Relevant bibliographies by topics / Rewriting techniques / Journal articles

To see the other types of publications on this topic, follow the link: Rewriting techniques.

Journal articles on the topic 'Rewriting techniques'

Author: Grafiati

Published: 25 May 2024

Last updated: 31 July 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Rewriting techniques.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

GIESL, JÜRGEN, and AART MIDDELDORP. "Transformation techniques for context-sensitive rewrite systems." Journal of Functional Programming 14, no. 4 (2004): 379–427. http://dx.doi.org/10.1017/s0956796803004945.

Full text

Abstract:

Context-sensitive rewriting is a computational restriction of term rewriting used to model non-strict (lazy) evaluation in functional programming. The goal of this paper is the study and development of techniques to analyze the termination behavior of context-sensitive rewrite systems. For that purpose, several methods have been proposed in the literature which transform context-sensitive rewrite systems into ordinary rewrite systems such that termination of the transformed ordinary system implies termination of the original context-sensitive system. In this way, the huge variety of existing t

APA, Harvard, Vancouver, ISO, and other styles

2

Carral, David, Larry González, and Patrick Koopmann. "From Horn-SRIQ to Datalog: A Data-Independent Transformation That Preserves Assertion Entailment." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 2736–43. http://dx.doi.org/10.1609/aaai.v33i01.33012736.

Full text

Abstract:

Ontology-based access to large data-sets has recently gained a lot of attention. To access data efficiently, one approach is to rewrite the ontology into Datalog, and then use powerful Datalog engines to compute implicit entailments. Existing rewriting techniques support Description Logics (DLs) from ELH to Horn-SHIQ. We go one step further and present one such data-independent rewriting technique for Horn-SRIQ⊓, the extension of Horn-SHIQ that supports role chain axioms, an expressive feature prominently used in many real-world ontologies. We evaluated our rewriting technique on a large known

APA, Harvard, Vancouver, ISO, and other styles

3

Kirchner, Hélène, and Pierre Lescanne. "Rewriting techniques and applications, RTA'91." ACM SIGACT News 22, no. 3 (1991): 24–30. http://dx.doi.org/10.1145/126537.126539.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Millen, Jonathan. "Rewriting Techniques in the Constraint Solver." Electronic Notes in Theoretical Computer Science 234 (March 2009): 77–91. http://dx.doi.org/10.1016/j.entcs.2009.02.073.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Roşu, Grigore, and Klaus Havelund. "Rewriting-Based Techniques for Runtime Verification." Automated Software Engineering 12, no. 2 (2005): 151–97. http://dx.doi.org/10.1007/s10515-005-6205-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Gazeau, Ivan, Dale Miller, and Catuscia Palamidessi. "Non-local Robustness Analysis via Rewriting Techniques." Electronic Proceedings in Theoretical Computer Science 103 (December 14, 2012): 65. http://dx.doi.org/10.4204/eptcs.103.8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Venetis, Tassos, Giorgos Stoilos, and Vasilis Vassalos. "Rewriting Minimizations for Efficient Query Answering over Ontologies." International Journal on Artificial Intelligence Tools 26, no. 05 (2017): 1760024. http://dx.doi.org/10.1142/s0218213017600247.

Full text

Abstract:

Computing a (Union of Conjunctive Queries — UCQ) rewriting ℛ for an input query and ontology and evaluating it over the given dataset is a prominent approach to query answering over ontologies. However, ℛ can be large and complex in structure hence additional techniques, like query subsumption and data constraints, need to be employed in order to minimize ℛ and lead to an efficient evaluation. Although sound in theory, how to efficiently and effectively implement many of these techniques in practice could be challenging. For example, many systems do not implement query subsumption. In the curr

APA, Harvard, Vancouver, ISO, and other styles

8

Ambite, J. L., and C. A. Knoblock. "Planning by Rewriting." Journal of Artificial Intelligence Research 15 (September 1, 2001): 207–61. http://dx.doi.org/10.1613/jair.754.

Full text

Abstract:

Domain-independent planning is a hard combinatorial problem. Taking into account plan quality makes the task even more difficult. This article introduces Planning by Rewriting (PbR), a new paradigm for efficient high-quality domain-independent planning. PbR exploits declarative plan-rewriting rules and efficient local search techniques to transform an easy-to-generate, but possibly suboptimal, initial plan into a high-quality plan. In addition to addressing the issues of planning efficiency and plan quality, this framework offers a new anytime planning algorithm. We have implemented this plann

APA, Harvard, Vancouver, ISO, and other styles

9

De Sutter, Bjorn, Bruno De Bus, and Koen De Bosschere. "Link-time binary rewriting techniques for program compaction." ACM Transactions on Programming Languages and Systems 27, no. 5 (2005): 882–945. http://dx.doi.org/10.1145/1086642.1086645.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Greco, Sergio, Francesca Spezzano, and Irina Trubitsyna. "Checking Chase Termination: Cyclicity Analysis and Rewriting Techniques." IEEE Transactions on Knowledge and Data Engineering 27, no. 3 (2015): 621–35. http://dx.doi.org/10.1109/tkde.2014.2339816.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Bunsen, Masatoshi, Hirosuke Furuta, Kuniaki Aragane, and Atsushi Okamoto. "Improved Holographic Recording Techniques for Data-Page Rewriting." Japanese Journal of Applied Physics 47, no. 7 (2008): 5977–80. http://dx.doi.org/10.1143/jjap.47.5977.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

BOULTON, RICHARD J. "Transparent optimisation of rewriting combinators." Journal of Functional Programming 9, no. 2 (1999): 113–46. http://dx.doi.org/10.1017/s0956796899003391.

Full text

Abstract:

The LCF system was the first mechanical theorem prover to be user-programmable via a metalanguage, ML, from which the functional programming language Standard ML has been developed. Paulson has demonstrated how a modular rewriting engine can be implemented in LCF. This provides both clarity and flexibility. This paper shows that the same modular approach (using higher-order functions) allows transparent optimisation of the rewriting engine; performance can be improved while few, if any, changes are required to code written using these functions. The techniques described have been implemented i

APA, Harvard, Vancouver, ISO, and other styles

13

Chalub, Fabricio, and Christiano Braga. "A Modular Rewriting Semantics for CML." JUCS - Journal of Universal Computer Science 10, no. (7) (2004): 789–807. https://doi.org/10.3217/jucs-010-07-0789.

Full text

Abstract:

This paper presents a modular rewriting semantics (MRS) specification for Reppy's Concurrent ML (CML), based on Peter Mosses' modular structural operational semantics specification for CML. A modular rewriting semantics specification for a programming language is a rewrite theory in rewriting logic written using techniques that support the modular development of the specification in the precise sense that every module extension is conservative. We show that the MRS of CML can be used to interpret CML programs using the rewrite engine of the Maude system, a high-performance implementation of re

APA, Harvard, Vancouver, ISO, and other styles

14

ECHAHED, RACHID. "Foreword: special issue on term and graph rewriting." Mathematical Structures in Computer Science 28, no. 8 (2018): 1287–89. http://dx.doi.org/10.1017/s0960129518000191.

Full text

Abstract:

Rewriting techniques constitute a foundational theory of computing science. They are being investigated for several structures, such as lambda-terms, strings, first-order terms or graphs, and have been successfully used in many areas such as programming languages, automated reasoning, program verification, security, etc. The growing interest in this research area is witnessed by the leading international events, such as ICGT (International Conference on Graph Transformation) and the recent FSCD conference (International Conference on Formal Structures for Computation and Deduction), which gath

APA, Harvard, Vancouver, ISO, and other styles

15

Gutiérrez, Raúl, Salvador Lucas, and Miguel Vítores. "Proving Confluence in the Confluence Framework with CONFident." Fundamenta Informaticae 192, no. 2 (2024): 167–217. http://dx.doi.org/10.3233/fi-242192.

Full text

Abstract:

This article describes the confluence framework, a novel framework for proving and disproving confluence using a divide-and-conquer modular strategy, and its implementation in CONFident. Using this approach, we are able to automatically prove and disprove confluence of Generalized Term Rewriting Systems, where (i) only selected arguments of function symbols can be rewritten and (ii) a rather general class of conditional rules can be used. This includes, as particular cases, several variants of rewrite systems such as (context-sensitive) term rewriting systems, string rewriting systems, and (co

APA, Harvard, Vancouver, ISO, and other styles

16

KIRCHNER, HÉLÈNE, and PIERRE-ETIENNE MOREAU. "Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories." Journal of Functional Programming 11, no. 2 (2001): 207–51. http://dx.doi.org/10.1017/s0956796800003907.

Full text

Abstract:

First-order languages based on rewrite rules share many features with functional languages, but one difference is that matching and rewriting can be made much more expressive and powerful by incorporating some built-in equational theories. To provide reasonable programming environments, compilation techniques for such languages based on rewriting have to be designed. This is the topic addressed in this paper. The proposed techniques are independent from the rewriting language, and may be useful to build a compiler for any system using rewriting modulo Associative and Commutative (AC) theories.

APA, Harvard, Vancouver, ISO, and other styles

17

Benedikt, Michael, Maxime Buron, Stefano Germano, Kevin Kappelmann, and Boris Motik. "Rewriting the infinite chase." Proceedings of the VLDB Endowment 15, no. 11 (2022): 3045–57. http://dx.doi.org/10.14778/3551793.3551851.

Full text

Abstract:

Guarded tuple-generating dependencies (GTGDs) are a natural extension of description logics and referential constraints. It has long been known that queries over GTGDs can be answered by a variant of the chase ---a quintessential technique for reasoning with dependencies. However, there has been little work on concrete algorithms and even less on implementation. To address this gap, we revisit Datalog rewriting approaches to query answering, where GTGDs are transformed to a Datalog program that entails the same base facts on each base instance. We show that the rewriting can be seen as contain

APA, Harvard, Vancouver, ISO, and other styles

18

Greco, Sergio, Francesca Spezzano, and Irina Trubitsyna. "Stratification criteria and rewriting techniques for checking chase termination." Proceedings of the VLDB Endowment 4, no. 11 (2011): 1158–68. http://dx.doi.org/10.14778/3402707.3402750.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Kanovich, Max. "Finding direct partition bijections by two-directional rewriting techniques." Discrete Mathematics 285, no. 1-3 (2004): 151–66. http://dx.doi.org/10.1016/j.disc.2004.01.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Papadopoulos, George A. "Concurrent object-oriented programming using term graph rewriting techniques." Information and Software Technology 38, no. 8 (1996): 539–47. http://dx.doi.org/10.1016/0950-5849(96)01093-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Imprialou, Martha, Giorgos Stoilos, and Bernardo Cuenca Grau. "Benchmarking Ontology-Based Query Rewriting Systems." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (2021): 779–85. http://dx.doi.org/10.1609/aaai.v26i1.8215.

Full text

Abstract:

Query rewriting is a prominent reasoning technique in ontology-based data access applications. A wide variety of query rewriting algorithms have been proposed in recent years and implemented in highly optimised reasoning systems. Query rewriting systems are complex software programs; even if based on provably correct algorithms, sophisticated optimisations make the systems more complex and errors become more likely to happen. In this paper, we present an algorithm that, given an ontology as input, synthetically generates ``relevant'' test queries. Intuitively, each of these queries can be used

APA, Harvard, Vancouver, ISO, and other styles

22

Baziotis, Stefanos, Daniel Kang, and Charith Mendis. "Dias: Dynamic Rewriting of Pandas Code." Proceedings of the ACM on Management of Data 2, no. 1 (2024): 1–27. http://dx.doi.org/10.1145/3639313.

Full text

Abstract:

In recent years, dataframe libraries, such as pandas have exploded in popularity. Due to their flexibility, they are increasingly used in ad-hoc exploratory data analysis (EDA) workloads. These workloads are diverse, including custom functions which can span libraries or be written in pure Python. The majority of systems available to accelerate EDA workloads focus on bulk-parallel workloads, which contain vastly different computational patterns, typically within a single library. As a result, they can introduce excessive overheads for ad-hoc EDA workloads due to their expensive optimization te

APA, Harvard, Vancouver, ISO, and other styles

23

Baudon, Thaïs, Carsten Fuhs, and Laure Gonnord. "On Complexity Bounds and Confluence of Parallel Term Rewriting*." Fundamenta Informaticae 192, no. 2 (2024): 121–66. http://dx.doi.org/10.3233/fi-242191.

Full text

Abstract:

We revisit parallel-innermost term rewriting as a model of parallel computation on inductive data structures and provide a corresponding notion of runtime complexity parametric in the size of the start term. We propose automatic techniques to derive both upper and lower bounds on parallel complexity of rewriting that enable a direct reuse of existing techniques for sequential complexity. Our approach to find lower bounds requires confluence of the parallel-innermost rewrite relation, thus we also provide effective sufficient criteria for proving confluence. The applicability and the precision

APA, Harvard, Vancouver, ISO, and other styles

24

Han, Soonbo, and Zachary G. Ives. "Implementing Views for Property Graphs." ACM SIGMOD Record 54, no. 1 (2025): 59–68. https://doi.org/10.1145/3733620.3733633.

Full text

Abstract:

Property graph databases are increasingly used to integrate heterogeneous data, motivating graph views to abstract, simplify, and unify the data, e.g., to capture individual-level vs. organization-level relationships. This paper considers the tasks of implementing such views using rewriting techniques — both using existing property graph DBMSs and converting to relational RDBMSs. We consider both virtual and materialized views, ways of rewriting queries, and structures for indexing data. We also note a common use case of graph views, which involves preserving a graph except minor local transfo

APA, Harvard, Vancouver, ISO, and other styles

25

Dong, Rui, Jie Liu, Yuxuan Zhu, Cong Yan, Barzan Mozafari, and Xinyu Wang. "SlabCity: Whole-Query Optimization Using Program Synthesis." Proceedings of the VLDB Endowment 16, no. 11 (2023): 3151–64. http://dx.doi.org/10.14778/3611479.3611515.

Full text

Abstract:

Query rewriting is often a prerequisite for effective query optimization, particularly for poorly-written queries. Prior work on query rewriting has relied on a set of "rules" based on syntactic pattern-matching. Whether relying on manual rules or auto-generated ones, rule-based query rewriters are inherently limited in their ability to handle new query patterns. Their success is limited by the quality and quantity of the rules provided to them. To our knowledge, we present the first synthesis-based query rewriting technique, SlabCity, capable of whole-query optimization without relying on any

APA, Harvard, Vancouver, ISO, and other styles

26

Bjeladinovic, Srdja. "Extending hybrid SQL/NoSQL database by introducing statement rewriting component." Computer Science and Information Systems, no. 00 (2025): 34. https://doi.org/10.2298/csis241024034b.

Full text

Abstract:

Contemporary organisations often include different business subdomains, for which it is neither easy nor optimal to decide on using an exclusive database type. The hybrid SQL/NoSQL databases encompass various types of databases unified into a unique logical database. At the same time, they provide the usage benefits of working with the SQL and the NoSQL databases simultaneously. Recently, there has been an increase in research that deals with the challenges of hybrid databases? query optimisation, especially query rewriting. This trend opened up possibilities for analysing the influence of app

APA, Harvard, Vancouver, ISO, and other styles

27

Kremer, Steve, and Paliath Narendran. "Foreword to the special issue on security and rewriting techniques." Information and Computation 238 (November 2014): 1. http://dx.doi.org/10.1016/j.ic.2014.07.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Göbel, Manfred. "Rewriting Techniques and Degree Bounds for Higher Order Symmetric Polynomials." Applicable Algebra in Engineering, Communication and Computing 9, no. 6 (1999): 559–73. http://dx.doi.org/10.1007/s002000050118.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Rilett Wood, Joyce. "Writing and Rewriting of Psalm 22." Studies in Religion/Sciences Religieuses 48, no. 2 (2019): 189–215. http://dx.doi.org/10.1177/0008429819830071.

Full text

Abstract:

Rewriting has converted a personal lament psalm into a complex literary work with diverse topics and themes, with distinct genres and settings, and with opposite and contradictory meanings. We can discover the original psalm by unravelling the editorial process and by observing the revision techniques of repetition, reversal and cross reference. What characterizes the second edition of the psalm is a gradual shift from individual experience to the concerns of the whole community. The reviser draws on historical tradition to transform the earlier composition into a new story with an entirely di

APA, Harvard, Vancouver, ISO, and other styles

30

COHEN, DANIEL E. "String rewriting and homology of monoids." Mathematical Structures in Computer Science 7, no. 3 (1997): 207–40. http://dx.doi.org/10.1017/s0960129596002149.

Full text

Abstract:

Results of Anick (1986), Squier (1987), Kobayashi (1990), Brown (1992b), and others, show that a monoid with a finite convergent rewriting system satisfies a homological condition known as FP∞.In this paper we give a simplified version of Brown's proof, which is conceptual, in contrast with the other proofs, which are computational.We also collect together a large number of results and examples of monoids and groups that satisfy FP∞ and others that do not. These may provide techniques for showing that various monoids do not have finite convergent rewriting systems, as well as explicit examples

APA, Harvard, Vancouver, ISO, and other styles

31

Rodriguez, Olivier, Federico Ulliana, and Marie-Laure Mugnier. "Scalable Reasoning on Document Stores via Instance-Aware Query Rewriting." Proceedings of the VLDB Endowment 16, no. 11 (2023): 2699–713. http://dx.doi.org/10.14778/3611479.3611481.

Full text

Abstract:

Data trees, typically encoded in JSON, are ubiquitous in data-driven applications. This ubiquity makes urgent the development of novel techniques for querying heterogeneous JSON data in a flexible manner. We propose a rule language for JSON, called constrained tree-rules, whose purpose is to provide a high-level unified view of heterogeneous JSON data and infer implicit information. As reasoning with constrained tree-rules is undecidable, we identify a relevant subset featuring tractable query answering, for which we design an automata-based query rewriting algorithm. Our approach consists of

APA, Harvard, Vancouver, ISO, and other styles

32

YVON, FRANÇOIS. "Rewriting the orthography of SMS messages." Natural Language Engineering 16, no. 2 (2010): 133–59. http://dx.doi.org/10.1017/s1351324909990258.

Full text

Abstract:

AbstractElectronic written texts used in computer-mediated interactions (emails, blogs, chats, and the like) contain significant deviations from the norm of the language. This paper presents the detail of a system aiming at normalizing the orthography of French SMS messages: after discussing the linguistic peculiarities of these messages and possible approaches to their automatic normalization, we present, compare, and evaluate various instanciations of a normalization device based on weighted finite-state transducers. These experiments show that using an intermediate phonemic representation a

APA, Harvard, Vancouver, ISO, and other styles

33

Elimam, Fatima. "Translation: Practicing Rewriting in Context." European Journal of Contemporary Education and E-Learning 2, no. 1 (2024): 253–56. http://dx.doi.org/10.59324/ejceel.2024.2(1).21.

Full text

Abstract:

Translation serves to provide a natural context in which a translator practices the role of a second writer. This natural writing environment accumulates the experience as well as the expertise of applying various translation and linguistic theories to tackle textual problems, being them lexical, semantic, cultural or merely grammatical. Translation is the only field in which two languages are consciously and unconsciously practiced at the whole levels throughout the translation activity. Written texts that require translation ought to be understood by translators as the starting point for the

APA, Harvard, Vancouver, ISO, and other styles

34

Elimam, Fatima. "Translation: Practicing Rewriting in Context." European Journal of Contemporary Education and E-Learning 2, no. 1 (2024): 253–56. https://doi.org/10.59324/ejceel.2024.2(1).21.

Full text

Abstract:

Translation serves to provide a natural context in which a translator practices the role of a second writer. This natural writing environment accumulates the experience as well as the expertise of applying various translation and linguistic theories to tackle textual problems, being them lexical, semantic, cultural or merely grammatical. Translation is the only field in which two languages are consciously and unconsciously practiced at the whole levels throughout the translation activity. Written texts that require translation ought to be understood by translators as the starting point for the

APA, Harvard, Vancouver, ISO, and other styles

35

Dunn, Dana S. "Lessons Learned from an Interdisciplinary Writing Course: Implications for Student Writing in Psychology." Teaching of Psychology 21, no. 4 (1994): 223–27. http://dx.doi.org/10.1207/s15328023top2104_4.

Full text

Abstract:

I discuss writing techniques and assessment methods and their use in Communication, the interdisciplinary writing course I teach. The writing techniques are freewriting, small-group work, and peer tutoring. The assessment methods include commentary on written assignments by more than one faculty evaluator, peer feedback, and optional versus mandatory rewriting. I then recommend applications for these writing techniques and assessment methods in psychology courses.

APA, Harvard, Vancouver, ISO, and other styles

36

Despeyroux, Joëlle, and Robert Harper. "Special issue on Logical Frameworks and Metalanguages http//www-sop.inria.fr/certilab/LFM00/cfp-jfp.html." Journal of Functional Programming 10, no. 1 (2000): 135–36. http://dx.doi.org/10.1017/s0956796899009892.

Full text

Abstract:

Logical frameworks and meta-languages are intended as a common substrate for representing and implementing a wide variety of logics and formal systems. Their definition and implementation have been the focus of considerable work over the last decade. At the heart of this work is a quest for generality: A logical framework provides a basis for capturing uniformities across deductive systems and support for implementing particular systems. Similarly a meta-language supports reasoning about and using languages.Logical frameworks have been based on a variety of different languages including higher

APA, Harvard, Vancouver, ISO, and other styles

37

Kœhler, Thomas, Andrés Goens, Siddharth Bhat, Tobias Grosser, Phil Trinder, and Michel Steuwer. "Guided Equality Saturation." Proceedings of the ACM on Programming Languages 8, POPL (2024): 1727–58. http://dx.doi.org/10.1145/3632900.

Full text

Abstract:

Rewriting is a principled term transformation technique with uses across theorem proving and compilation. In theorem proving, each rewrite is a proof step; in compilation, rewrites optimize a program term. While developing rewrite sequences manually is possible, this process does not scale to larger rewrite sequences. Automated rewriting techniques, like greedy simplification or equality saturation, work well without requiring human input. Yet, they do not scale to large search spaces, limiting the complexity of tasks where automated rewriting is effective, and meaning that just a small increa

APA, Harvard, Vancouver, ISO, and other styles

38

BOMANSON, JORI, and TOMI JANHUNEN. "Boosting Answer Set Optimization with Weighted Comparator Networks." Theory and Practice of Logic Programming 20, no. 4 (2020): 512–51. http://dx.doi.org/10.1017/s147106842000006x.

Full text

Abstract:

AbstractAnswer set programming (ASP) is a paradigm for modeling knowledge-intensive domains and solving challenging reasoning problems. In ASP solving, a typical strategy is to preprocess problem instances by rewriting complex rules into simpler ones. Normalization is a rewriting process that removes extended rule types altogether in favor of normal rules. Recently, such techniques led to optimization rewriting in ASP, where the goal is to boost answer set optimization by refactoring the optimization criteria of interest. In this paper, we present a novel, general, and effective technique for

APA, Harvard, Vancouver, ISO, and other styles

39

Lukhovitskiy, Lev Vsevolodovich. "Early Palaiologan Hagiography: “Old” and “New” Saints under the Shadow of Symeon Metaphrastes." Античная древность и средние века 50 (2022): 283–311. http://dx.doi.org/10.15826/adsv.2022.50.017.

Full text

Abstract:

This article focuses on the hagiographical rewriting from the Palaiologan Period. Having outlined the corpus of relevant texts, the author discusses the two paradigms that currently permeate the scholarship dealing with the Late Byzantine hagiography, the “old saints” paradigm and the “metaphrasis” paradigm. Both approaches, despite their indisputable heuristic value, do not take into consideration all aspects of hagiographical rewriting in the period in question. The first paradigm is not adequate because, first, it is virtually impossible to determine how great the chronological distance bet

APA, Harvard, Vancouver, ISO, and other styles

40

Dewi, Indah Rosalina, Akbar Al Masjid Masjid, Biya Ebi Praheto, and Trisharsiwi Trisharsiwi. "Flipbook Sebagai Media untuk Meningkatkan Keterampilan Menulis Kembali Teks Non-fiksi pada Peserta Didik Kelas 5 Sekolah Dasar." Indonesian Journal of Learning and Educational Studies 1, no. 2 (2023): 78–86. http://dx.doi.org/10.62385/ijles.v1i2.59.

Full text

Abstract:

Writing is the most complex language skill, because writing skills involve proficiency in language selection, pouring logical and structured ideas. Writing skills in grade 5A students of SD Negeri Jomblangan are still relatively low. The purpose of this study is to improve the skills of rewriting nonfiction texts using flipbook media. This research uses Classroom Action Research, which consists of two cycles and consists of four main steps, namely planning, implementation, observation and reflection. Data collection techniques in this research include interviews, observation, tests, and docume

APA, Harvard, Vancouver, ISO, and other styles

41

Guisado-Gámez, Joan, David Tamayo-Domènech, Jordi Urmeneta, and Josep Lluís Larriba-Pey. "ENRICH: A Query Rewriting Service Powered by Wikipedia Graph Structure." Proceedings of the International AAAI Conference on Web and Social Media 10, no. 2 (2021): 47–50. http://dx.doi.org/10.1609/icwsm.v10i2.14829.

Full text

Abstract:

The search for relevant information in websites can be very frustrating for users who, unintentionally, use too general or inappropriate keywords to express their requests. To overcome this situation, query rewriting techniques aim at transforming the users requests to better describe the real intent of the users. However, to the best of our knowledge, current search tools either are too generic or require resources not available for everyone such as query log processors, natural language engines, etc. To supply this need, we present ENRICH, which is a query rewriting cloud service that is aut

APA, Harvard, Vancouver, ISO, and other styles

42

Despland, Annie, Monique Mazaud, and Raymond Rakotozafy. "Using rewriting techniques to produce code generators and proving them correct." Science of Computer Programming 15, no. 1 (1990): 15–54. http://dx.doi.org/10.1016/0167-6423(90)90043-d.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Han, Soonbo, and Zachary G. Ives. "Implementation Strategies for Views over Property Graphs." Proceedings of the ACM on Management of Data 2, no. 3 (2024): 1–26. http://dx.doi.org/10.1145/3654949.

Full text

Abstract:

The need to query complex interactions and relationships has motivated interest in property graph database platforms. For some graph applications, graph views are required to abstract the data, e.g., to capture individual-level vs. organization-level relationships; or show single computational steps vs. composite workflows. Emerging efforts to standardize graph query languages have developed semantics and language constructs for graph views. This paper considers the task of implementing such views using rewriting techniques --- both using existing property graph DBMSs and converting to relatio

APA, Harvard, Vancouver, ISO, and other styles

44

Hong, Quan, Jiaqi Li, Wen Zhang, and Lidong Zhai. "DataHook: An Efficient and Lightweight System Call Hooking Technique without Instruction Modification." Proceedings of the ACM on Software Engineering 2, ISSTA (2025): 92–112. https://doi.org/10.1145/3728874.

Full text

Abstract:

System calls serve as the primary interface for interaction between user-space programs and the operating system (OS) kernel. By hooking system calls, it is possible to analyze and modify the behavior of user-space programs. This paper proposes DataHook, an efficient and lightweight system call hooking technique for 32-bit programs. Compared to existing system call hooking techniques, DataHook achieves hooking with extremely low hook overhead by modifying only a few data elements without altering any program instructions. This unique characteristic not only avoids the multithreading conflicts

APA, Harvard, Vancouver, ISO, and other styles

45

HAMILTON, CYNTHIA S. "Strange Birds: Rewriting The Maltese Falcon." Journal of American Studies 47, no. 3 (2013): 699–718. http://dx.doi.org/10.1017/s0021875812001752.

Full text

Abstract:

Hammett's formative role in establishing the conventions of the hard-boiled detective formula is widely acknowledged, but the formative influence of his masterpiece, The Maltese Falcon, on specific texts by subsequent innovators has remained largely unexplored territory. Both Sara Paretsky and Chester Himes have paid tribute to Hammett's influence, with particular reference to The Maltese Falcon. An examination of Indemnity Only and For the Love of Imabelle in relation to The Maltese Falcon offers a unique perspective on Paretsky's and Himes's stylistic choices and the social perspectives thes

APA, Harvard, Vancouver, ISO, and other styles

46

GESER, ALFONS, and SERGEI GORLATCH. "Parallelizing functional programs by generalization." Journal of Functional Programming 9, no. 6 (1999): 649–73. http://dx.doi.org/10.1017/s0956796899003536.

Full text

Abstract:

List homomorphisms are functions that are parallelizable using the divide-and-conquer paradigm. We study the problem of finding homomorphic representations of functions in the Bird–Meertens constructive theory of lists, by means of term rewriting and theorem proving techniques. A previous work proved that to each pair of leftward and rightward sequential representations of a function, based on cons- and snoc-lists, respectively, there is also a representation as a homomorphism. Our contribution is a mechanizable method to extract the homomorphism representation from a pair of sequential repres

APA, Harvard, Vancouver, ISO, and other styles

47

Zhou, Yining. "The Contemporary Transformation of Mythical Women: Helen and Penelope in Margaret Atwoods Reconstruction." Advances in Humanities Research 8, no. 1 (2024): 75–85. http://dx.doi.org/10.54254/2753-7080/8/2024101.

Full text

Abstract:

The feminist movement has driven the reinterpretation of classical texts such as Homers epics, with Margaret Atwoods works exemplifying this trend. Atwood has created poetry and novels rooted in the tradition of feminist rewriting, utilizing mythological female figures like Helen and Penelope to explore their inner worlds and unveil the long-concealed mechanisms of patriarchal power. Employing techniques such as multiple perspectives and nonlinear narratives, she disrupts the constraints of a singular authoritative discourse. By merging the ancient with the modern, Atwood highlights the shared

APA, Harvard, Vancouver, ISO, and other styles

48

Calabretta, Nicola, Hyun-Do Jung, Javier Herrera Llorente, Eduward Tangdiongga, Ton Koonen, and Harm Dorren. "All-Optical Techniques Enabling Packet Switching with Label Processing and Label Rewriting." Journal of Telecommunications and Information Technology, no. 1 (June 26, 2023): 20–28. http://dx.doi.org/10.26636/jtit.2009.1.909.

Full text

Abstract:

Scalability of packet switched cross-connects that utilize all-optical signal processing is a crucial issue that eventually determines the future role of photonic signal processing in optical networks. After reviewing several labeling techniques, we discuss label stacking and label swapping techniques and their benefits for scalable optical packet switched nodes. All-optical devices for implementing the packet switch based on the labeling techniques will be described. Finally, we present a 1×4 all-optical packet switch based on label swapping technique that utilizes a scalable and asynchronous

APA, Harvard, Vancouver, ISO, and other styles

49

Banach, Richard, J. Balázs, and George Papadopoulos. "A Translation of the Pi-Calculus Into MONSTR." JUCS - Journal of Universal Computer Science 1, no. (6) (1995): 339–98. https://doi.org/10.3217/jucs-001-06-0339.

Full text

Abstract:

A translation of the pi-calculus into the MONSTR graph rewriting language is described and proved correct. The translation illustrates the heavy cost in practice of faithfully implementing the communication primitive of the pi-calculus and similar process calculi. It also illustrates the convenience of representing an evolving network of communicating agents directly within a graph manipulation formalism, both because the necessity to use delicate notions of bound variables and of scopes is avoided, and also because the standard model of graphs in set theory automatically yields a useful seman

APA, Harvard, Vancouver, ISO, and other styles

50

Guțuleac, Emilian, Sergiu Zaporojan, Victor Moraru, and Alexei Sclifos. "PERFORMANCE MODELING OF NETWORK DEFENSE IN BREADTH SYSTEMS BY MATRIX REWRITING SRN WITH FUZZY PARAMETERS." Journal of Engineering Science XXVI (3) (September 18, 2019): 38–53. https://doi.org/10.5281/zenodo.3444051.

Full text

Abstract:

We have defined in this paper, a new kind of stochastic reward network (SRN) by introducing matrix attributes and fuzzy parameters of timed transitions and of rewriting rules, called MFRSRN, allowing the dynamic marking-dependent reconfiguration of these models. Moreover, this formalism offers a descriptive language that allows managing the compact representations the model's size through the introduction of matrix structuring and rewriting mechanisms of the compositional model's behavior. As an example of application, we show how the proposed formalism can be applied to performance mo

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!