Filters








119,223 Hits in 2.5 sec

Regular Combinators for String Transformations [article]

Rajeev Alur, Adam Freilich, Mukund Raghothaman
2014 arXiv   pre-print
Our main result is for the general case of non-commutative monoids, which is of particular interest for capturing regular string-to-string transformations for document processing.  ...  We prove that the following additional combinators suffice for constructing all regular functions: (1) the left-additive versions of split sum and iterated sum, which allow transformations such as string  ...  As a result, [13] justifiably dubbed this class as regular string transformations.  ... 
arXiv:1402.3021v1 fatcat:lg4iqdlyh5fnvipbxyrpsgyu5u

Regular combinators for string transformations

Rajeev Alur, Adam Freilich, Mukund Raghothaman
2014 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14  
Our main result is for the general case of non-commutative monoids, which is of particular interest for capturing regular string-to-string transformations for document processing.  ...  We prove that the following additional combinators suffice for constructing all regular functions: (1) the left-additive versions of split sum and iterated sum, which allow transformations such as string  ...  As a result, [13] justifiably dubbed this class as regular string transformations.  ... 
doi:10.1145/2603088.2603151 dblp:conf/csl/AlurFR14 fatcat:nrcdq4gmazbwzg4dyhzqchjtlu

Combining predicate transformer semantics for effects: a case study in parsing regular languages

Anne Baanen, Wouter Swierstra
2020 Electronic Proceedings in Theoretical Computer Science  
This paper describes how to verify a parser for regular expressions in a functional programming language using predicate transformer semantics for a variety of effects.  ...  Reasoning about such combinations of effects is notoriously difficult, yet our approach using predicate transformers enables the careful separation of program syntax, correctness proofs and termination  ...  At this point, we have defined a matcher for regular languages and formally proven that when it succeeds in recognizing a given string, this string is indeed in the language generated by the argument regular  ... 
doi:10.4204/eptcs.317.3 fatcat:p6sxca6b6nd6blbhpbbfwafxd4

DReX

Rajeev Alur, Loris D'Antoni, Mukund Raghothaman
2015 Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '15  
Recent research has led to a characterization of regular string transformations using a primitive set of function combinators analogous to the definition of regular languages using regular expressions.  ...  We present DReX, a declarative language that can express all regular string-to-string transformations, and can still be efficiently evaluated.  ...  Recently Alur et al [3] proposed a set of combinators that captures the class of regular string transformations.  ... 
doi:10.1145/2676726.2676981 dblp:conf/popl/AlurDR15 fatcat:t76c4golofgm7nunpfzdyhqpsy

Constraints on Structural Descriptions: Local Transformations

Aravind K. Joshi, Leon S. Levy
1977 SIAM journal on computing (Print)  
Peters and Ritchie [7] have shown that if context-sensitive rules are used only for "analysis" then the string language of the set of trees is still context-free.  ...  In this paper, we have generalized this result by considering context-free rules constrained by Boolean combinations of proper analysis predicates and domination predicates.  ...  We also want to thank Barry Soroka and Kang Yueh for their valuable comments. Barry Soroka has also implemented, in MTS-LISP, a system for local transformational analysis (M.S.  ... 
doi:10.1137/0206020 fatcat:rapylx3pobb3tkjdsmqrmhn2rq

Learning confidence transformation for handwritten Chinese text recognition

Da-Han Wang, Cheng-Lin Liu
2013 International Journal on Document Analysis and Recognition  
On comparing the performance of class-dependent and class-independent confidence transformation (CT), this paper proposes two regularized class-dependent CT methods, and particularly, a string-level confidence  ...  Handwritten text recognition systems commonly combine character classification confidence scores and context models for evaluating candidate segmentation-recognition paths, and the classification confidence  ...  We thus consider two regularized versions of class-dependent CT for alleviating the over-fitting.  ... 
doi:10.1007/s10032-013-0214-3 fatcat:ylo3v4vpw5galhr2ltdniujdcq

Modular Descriptions of Regular Functions [chapter]

Paul Gastin
2019 Lecture Notes in Computer Science  
We discuss various formalisms to describe string-to-string transformations.  ...  of regular operations.  ...  To conclude, we have seen various formalisms for describing string to string transformations.  ... 
doi:10.1007/978-3-030-21363-3_1 fatcat:22x5jjgjzncvhmlk7ud7osqata

Regular Transformations of Infinite Strings

Rajeev Alur, Emmanuel Filiot, Ashutosh Trivedi
2012 2012 27th Annual IEEE Symposium on Logic in Computer Science  
In this paper, we initiate a study of transformations of infinite strings. The MSO-based definition for regular string transformations generalizes naturally to infinite strings.  ...  The theory of regular transformations of finite strings is quite mature with appealing properties.  ...  However, to implement the same transformation using 2WST sans -regular look-ahead capability, it needs to first scan the string for #, a procedure that will not terminate for a #-free input string.  ... 
doi:10.1109/lics.2012.18 dblp:conf/lics/AlurFT12 fatcat:c4uu62eylfhhha2vb4qjsskfsm

From Monadic Second-Order Definable String Transformations to Transducers

Rajeev Alur, Antoine Durand-Gasselin, Ashutosh Trivedi
2013 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science  
Transducers, on the other hand, are executable machine models to define transformations, and are typically studied in the context of string-to-string transformations.  ...  Using such streaming string-to-tree transducers we show the decidability of functional equivalence for MSO-definable infinite-string-to-tree transducers.  ...  For instance, registers y and z are never combined in Figure 2 . We extend the theory of regular transformations to infinite string-to-tree transformations by showing the following result.  ... 
doi:10.1109/lics.2013.52 dblp:conf/lics/AlurDT13 fatcat:7be3uea3gfbdxdrl5ipozye6z4

Synthesizing bijective lenses

Anders Miltner, Kathleen Fisher, Benjamin C. Pierce, David Walker, Steve Zdancewic
2017 Proceedings of the ACM on Programming Languages  
Specifically, we present Optician, a tool for type-directed synthesis of bijective string transformers.  ...  string transformations in spreadsheets, and Augeas, a tool for bidirectional processing of Linux system configuration files.  ...  We thank Solomon Maina and Nate Foster for their extensive assistance in integrating Optician into Boomerang.  ... 
doi:10.1145/3158089 dblp:journals/pacmpl/MiltnerFPWZ18 fatcat:e2t44uwnrrbrldgewtulwvlyre

Transforming spreadsheet data types using examples

Rishabh Singh, Sumit Gulwani
2016 Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2016  
Data types such as date, time, name, and units are ubiquitous in spreadsheets, and cleaning transformations on these data types involve parsing and pretty printing their string representations.  ...  Spreadsheet systems and Programming Languages provide some UI-based and programmatic solutions for this problem but they are either insufficient for the user's needs or are beyond their expertise.  ...  A data type string s is defined to be a regular data type string if there exists a regular format descriptor π for interpreting the string s.  ... 
doi:10.1145/2837614.2837668 dblp:conf/popl/SinghG16 fatcat:ogfv3gef6vgvhhap3hzj3tdbeq

Transforming spreadsheet data types using examples

Rishabh Singh, Sumit Gulwani
2016 SIGPLAN notices  
Data types such as date, time, name, and units are ubiquitous in spreadsheets, and cleaning transformations on these data types involve parsing and pretty printing their string representations.  ...  Spreadsheet systems and Programming Languages provide some UI-based and programmatic solutions for this problem but they are either insufficient for the user's needs or are beyond their expertise.  ...  A data type string s is defined to be a regular data type string if there exists a regular format descriptor π for interpreting the string s.  ... 
doi:10.1145/2914770.2837668 fatcat:synkakbftnbspk3d42sc2lrl7u

Undecidable Control Conditions in Graph Transformation Units

Karsten Hölscher, Renate Klempien-Hinrichs, Peter Knirsch
2008 Electronical Notes in Theoretical Computer Science  
for programming with graph transformation units.  ...  This transformation process has to obey a so-called control condition, i.e. the device to select how rules or imported transformation units are to be combined in the transformation process executed by  ...  Each regular expression over ID denotes a regular language of strings over ID, and intuitively each of these strings describes a possible sequence of rule applications interleaved with calls of imported  ... 
doi:10.1016/j.entcs.2007.08.028 fatcat:gtqyxfwixfgwrp2nwsjo7ahk7y

Boomerang

Aaron Bohannon, J. Nathan Foster, Benjamin C. Pierce, Alexandre Pilkiewicz, Alan Schmitt
2008 Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '08  
We first propose a collection of bidirectional string lens combinators, based on familiar operations on regular transducers (union, concatenation, Kleene-star) and with a type system based on regular expressions  ...  We have used Boomerang to build transformers for complex real-world data formats including the SwissProt genomic database.  ...  discussions, and to Michael Greenberg for helpful comments on an earlier draft of the paper.  ... 
doi:10.1145/1328438.1328487 dblp:conf/popl/BohannonFPPS08 fatcat:7b7yautw2jhjzberboynpyanta

Boomerang

Aaron Bohannon, J. Nathan Foster, Benjamin C. Pierce, Alexandre Pilkiewicz, Alan Schmitt
2008 SIGPLAN notices  
We first propose a collection of bidirectional string lens combinators, based on familiar operations on regular transducers (union, concatenation, Kleene-star) and with a type system based on regular expressions  ...  We have used Boomerang to build transformers for complex real-world data formats including the SwissProt genomic database.  ...  discussions, and to Michael Greenberg for helpful comments on an earlier draft of the paper.  ... 
doi:10.1145/1328897.1328487 fatcat:oz4kl32scnfajgenf7p3tysgwa
« Previous Showing results 1 — 15 out of 119,223 results