Abstract Syntax Tree

This paper introduces the Pivot, a general framework for the analysis and transformation of C++ programs. The Pivot is designed to handle the complete ISO C++, especially more advanced uses of templates and including some proposed C++0x features. It is compiler independent. The central part of the Pivot is a fully typed abstract syntax tree called IPR ("Internal Program Representation").

Program representation is a critical issue in the area of software analysis and software re-engineering. It heavily relates to the portability and effectiveness of the software analysis tools that can be developed. This paper describes an approach that focuses on source code representation schemes in the form of Abstract Syntax Trees that are encoded as XML documents. These XML source

Different techniques can be used to detect plagiarism in the source code. However, they do not always give good results, especially when the code is deliberately altered to disguise the copied parts from different sources. This paper describes an approach that uses the syntax and semantic analysis of the code to perform the necessary pre-processing steps, and then compare the obtained abstract syntax trees and intermediate language code to determine the precise amount and the locations of the plagiarized code.

SECURITY VULNERABILITIES ASSESSMENT OF THE X.509 PROTOCOL BY SYNTAX-BASED ... Yves Turcotte Oded Tal and Scott Knight Thomas Dean ... National Defence Headquarters and Royal Military College ... 7k.s paper describes a methodology for syntax-based ...

Abstract: RDF is a knowledge,representation language dedicated to the annotation of resources within the Semantic Web. Though RDF itself can be used as a query language for an RDF knowledge base (using RDF consequence), the need for added expressivity in queries has led to the definition of the SPARQL query language. SPARQL queries are defined on top of graph patterns

To develop correct models for Hybrid and Discrete control systems requires a modeling language to express all important aspects of system behavior. Enabling one modeling language to understand the models developed in other languages is a challenge in re-usability of models. In this paper we have integrated a model-checking UppAal tool (Timed Automata) with HYTECH model-checker (Hybrid Automata) by extending UppAal syntax with hybrid aspects. We also contribute to abstract syntax for the modeling language of UPPAAL tool. The integration of both tools and enhanced expressiveness allows UPPAAL to model hybrid systems and get them verified by HYTECH tool.

SGML introduced DTD idea to formally describe document syntax and structure One of its main characteristics is the fact of being purely declar ative and fully independent of the future document s processing typeset ting formatting translation transformation In this context SGML has become the international standard to be followed Sooner or later a document has to be processed In order to do that we need to associate semantics to the document s structure In a com piler context normally we separate semantics in two static and dynamic Establishing a parallelism with document processing we can think of the document s decorated tree as recognized by an SGML analyzer as rep resenting the static semantics and document s tree transformation as dy namic semantics Pursuing this idea we will present and discuss a study of the rela tionship between SGML DAST Decorated Abstract Syntax Tree and Algebraic Speci cation in order to better understand how to formally pro cess documents and how to spec...

We present a pointer analysis algorithm designed for source-to-source transformations. Existing techniques for pointer analysis apply a collection of inference rules to a dismantled intermediate form of the source program, making them difficult to apply to source-to-source tools that generally work on abstract syntax trees to preserve details of the source program. Our pointer analysis algorithm operates directly on the abstract syntax tree of a C program and uses a form of standard dataflow analysis to compute the desired ...

... Querying MOF Repositories: The Design and Implementation ofthe Query Metamodel Language (QML). Giorgos Kotopoulos', Fotis Kazasis', and Stavros Christodoulakis' Technical University ofCrete, Kounoupidiana, Chania, Greece email:{gkoto, fotis, stavros} gced.tuc.gr ...