Filters








38,129 Hits in 4.3 sec

Syntactic Program Transformations for Automatic Abstraction [chapter]

Kedar S. Namjoshi, Robert P. Kurshan
2000 Lecture Notes in Computer Science  
We present an algorithm that constructs a finite state "abstract" program from a given, possibly infinite state, "concrete" program by means of a syntactic program transformation.  ...  Syntactic abstraction has two key advantages: it can be applied to infinite state programs or programs with large data paths, and it permits the effective application of other reduction methods for model  ...  We present an algorithm that constructs a finite state "abstract" program from a given, possibly infinite state, "concrete" program by means of a syntactic program transformation.  ... 
doi:10.1007/10722167_33 fatcat:4w4ze2heufheldyinktcqwtebu

Automatic syntax analysis in machine indexing and abstracting

W. D. Climenson, N. H. Hardwick, S. N. Jacobson
1961 American Documentation  
done in the automatic syntax analysis program is only the first step in the systematic approach to the problem of mechanizing operations on natural language for indexing and abstracting.  ...  The automatic syntax analysis program disposes a sentence in such a way that it is possible to recognize its syntactically indispensible portions.  ... 
doi:10.1002/asi.5090120303 fatcat:swomzk6m5zgnrnxgjuiagw755a

Page 182 of American Documentation Vol. 12, Issue 3 [page]

1961 American Documentation  
The automatic syntax analysis program disposes a sentence in such a way that it is possible to recognize its syntactically indispensible portions.  ...  There appear to be three methods of incorporating syntactical filtering criteria into the Auto-Abstracting program, which are described below. 1. Apply the basic statistical program using a rather |  ... 

The Spoofax language workbench

Lennart C.L. Kats, Eelco Visser
2010 Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion - SPLASH '10  
abstract syntax Static semantics ★ error checking ★ name resolution ★ type analysis parser generators meta- programming languages meta- programming libraries template engines  ...  Editor Services syntactic editor services • syntax highlighting • syntax checking • outline view • bracket matching, insertion • automatic indentation • syntax completion • ...  ...  Conclusion • Co-evolution of language and IDE • Pure and declarative syntax definition • Language definition by transformation • www.spoofax.org: papers, tour, download  ... 
doi:10.1145/1869542.1869592 dblp:conf/oopsla/KatsV10a fatcat:74jglwscsna2baxzp77dkenr3a

Finding bugs in program generators by dynamic analysis of syntactic language constraints

Sebastian Erdweg, Vlad Vergu, Mira Mezini, Eelco Visser
2014 Proceedings of the companion publication of the 13th international conference on Modularity - MODULARITY '14  
Program generators and transformations are hard to implement correctly, because the implementation needs to generically describe how to construct programs, for example, using templates or rewrite rules  ...  Our analysis focuses on syntactic language constraints and checks that generated programs are syntactically well-formed.  ...  For example, the parser will automatically produce a well-formed abstract syntax tree for the qualified name lambda.Function that contains all necessary Id tags.  ... 
doi:10.1145/2584469.2584474 dblp:conf/aosd/ErdwegVMV14 fatcat:rkxxjivayndwzgnthbbuptyz6m

Review of Syntactic Analysis Software Automatic Generation

Yuyan Xing, Yao Liu
2018 Innovative Computing Information and Control Express Letters, Part B: Applications  
Therefore, based on the trend of using syntactic analysis software and software automatically, this paper launches the research of automatic generation of syntactic analysis software.  ...  So, it is difficult to find the software tool suitable for dealing with the current resources.  ...  DOM is an application interface (API) for application development and programming of XML or HTML documents.  ... 
doi:10.24507/icicelb.09.10.1015 fatcat:tsmmpj62sbcwleb6u2hgsjehdi

Program Comprehension Engines for Automatic Parallelization: A Comparative Study [chapter]

Beniamino Di Martino, Christoph W. Keßlert
1996 IFIP Advances in Information and Communication Technology  
We compare two systems for program comprehension that are targeted towards support of automatic parallelization: the PAP recognizer currently included into the Vienna Fortran Compilation System, and the  ...  -PAT [7] uses an abstract, object-oriented representation for syntactic and semantic concepts composing the program.  ...  Automatic program comprehension systems are mainly used for two purposes: to support software maintenance, e.g. for automatic documentation of code, and to support automatically parallelizing compilers  ... 
doi:10.1007/978-0-387-34984-8_13 fatcat:4u2mu5ky2zhvdeyfbnzzd5hxwy

Page 154 of Journal of Research and Practice in Information Technology Vol. 26, Issue 4 [page]

1994 Journal of Research and Practice in Information Technology  
A predefined library provides powerful opera- tions for program development.  ...  The options are DG dodging — marking abstract tree components as invis- ible to automatic translation TR (below) DL deletion — removing abstract tree components that are irrelevant to the translation.  ... 

The spoofax language workbench

Lennart C.L. Kats, Eelco Visser
2010 Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '10  
Spoofax integrates language processing techniques for parser generation, meta-programming, and IDE development into a single environment.  ...  In this paper we describe the architecture of Spoofax and introduce idioms for high-level specifications of language semantics using rewrite rules, showing how analyses can be reused for transformations  ...  Acknowledgements This research was supported by NWO/JACQUARD projects 612.063.512, TFA: Transformations for Abstractions, and 638.001.610, MoDSE: Model-Driven Software Evolution.  ... 
doi:10.1145/1869459.1869497 dblp:conf/oopsla/KatsV10 fatcat:3ntsnoazovdh3jdbwxqmzfuimy

The translation of programming languages through the use of a graph transformation language

Peter van den Bosch
1982 SIGPLAN notices  
Abstract It is shown that the automated translation of programming An evaluation of the completed research, and an assessment of its position within concurrent developments in the discipline of programming  ...  the Library shall make it freely available for reference and study.  ...  A library of syntactic transforms for systematic program development [6,30] could be maintained : such a library could be developed in the syntactic transformation language and compiled  ... 
doi:10.1145/947912.947920 fatcat:mp7yt3rb2vh33pvdpfvprechq4

Modular specification and dynamic enforcement of syntactic language constraints when generating code

Sebastian Erdweg, Vlad Vergu, Mira Mezini, Eelco Visser
2014 Proceedings of the 13th international conference on Modularity - MODULARITY '14  
We evaluate the applicability, performance, and usefulness of typesmart constructors for syntactic constraints in a compiler for MiniJava developed with Spoofax and in various language extensions of Java  ...  A key problem in metaprogramming and specifically in generative programming is to guarantee that generated code is well-formed with respect to the context-free and context-sensitive constraints of the  ...  Acknowledgments We thank the anonymous reviewers for their helpful feedback.  ... 
doi:10.1145/2577080.2577089 dblp:conf/aosd/ErdwegVMV14a fatcat:5q34eu5ejfhfpptwvgbkaycjpu

Modular specification and dynamic enforcement of syntactic language constraints when generating code

Sebastian Erdweg, Vlad Vergu, Mira Mezini, Eelco Visser
2014 Proceedings of the 13th international conference on Modularity - MODULARITY '14  
Acknowledgments We thank the anonymous reviewers for their helpful feedback.  ...  For example, the parser will automatically produce a well-formed abstract syntax tree for the qualified name lambda.Function that contains all necessary Id tags.  ...  To this end, we devised a transformation that extracts the conditions for syntactic well-formedness from a grammar and generates corresponding typesmart constructors automatically.  ... 
doi:10.1145/2584469.2577089 fatcat:2oka2adujvcgzpe22u3ycamz3a

Symbolic Computation via Program Transformation [article]

Henrich Lauko, Petr Ročkai, Jiří Barnat
2018 arXiv   pre-print
The transformed program maintains symbolic values internally and operates directly on them hence the program can be processed by a tool without support for symbolic manipulation.  ...  The main motivation for the transformation is in symbolic verification, but there are many other possible use-cases, including test generation and concolic testing.  ...  Reflecting this structure, the program transformation therefore proceeds in two steps: the input program is (syntactically) abstracted concrete values are replaced with abstract values concrete instructions  ... 
arXiv:1806.03959v1 fatcat:s7njlqd3qnfxrl5drcgrjxzcay

Separation of concerns in language definition

Eelco Visser
2014 Proceedings of the companion publication of the 13th international conference on Modularity - MODULARITY '14  
Effectively applying linguistic abstraction to emerging domains of computation requires the ability to rapidly develop software languages.  ...  high-level declarative meta-languages specialized to the various concerns of language definition that can be used as the single source of production quality (incremental) semantic operations and as a model for  ...  From such a syntax definition, syntactic editor services such as syntax checking and syntax highlighting are automatically derived.  ... 
doi:10.1145/2584469.2584662 dblp:conf/aosd/Visser14 fatcat:tqzsnikl3raetlwokm47bzvdui

Cool: A control-flow generator for system analysis [chapter]

Volker Braun, Jens Knoop, Dirk Koschützki
1998 Lecture Notes in Computer Science  
It uniformly supports the automatic generation of transition systems and flow graphs from process algebra terms and programs of programming languages.  ...  Cool is a unifying control-flow analysis (CFA) generator for system analysis.  ...  (SOS) rules of the programming language, the construction principle becomes directly applicable to programming languages allowing the automatic transformation of programs into flow graphs as illustrated  ... 
doi:10.1007/bfb0026442 fatcat:nnuxqtmp45hrpgoiksmasbyieq
« Previous Showing results 1 — 15 out of 38,129 results