27 Search Results for "da Cruz, Daniela"

Volume

OASIcs, Volume 21

1st Symposium on Languages, Applications and Technologies

SLATE 2012, June 21-22, 2012, Braga, Portugal

Editors: Alberto Simões, Ricardo Queirós, and Daniela da Cruz

Document
DOI: 10.4230/OASIcs.SLATE.2022.16
Determining Programming Languages Complexity and Its Impact on Processing

Authors: Gonçalo Rodrigues Pinto, Pedro Rangel Henriques, Daniela da Cruz, and João Cruz

Published in: OASIcs, Volume 104, 11th Symposium on Languages, Applications and Technologies (SLATE 2022)

Abstract
Tools for Programming Languages processing, like Static Analysers (for instance, a Static Application Security Testing (SAST) tool), must be adapted to cope with a different input when the source programming language changes. Complexity of the programming language is one of the key factors that deeply impact the time of giving support to it. This paper aims at proposing an approach for assessing language complexity, measuring, at a first stage, the complexity of its underlying context-free grammar (CFG). From the analysis of concrete case studies, factors have been identified that make the support process more time-consuming, in particular in the stages of language recognition and in the transformation to an abstract syntax tree (AST). In this sense, at a second stage, a set of language characteristics is analysed in order to take into account the referred factors that also impact on the language processing. The principal goal of the project here reported is to help development teams to improve the estimation of time and effort needed to cope with a new programming language. In the paper a tool is proposed, and its prototype is presented, that allows the evaluation of the complexity of a language based on a set of metrics to classify the complexity of its grammar, along with a set of properties. The tool compares the new language complexity so far determined with previously supported languages, to predict the effort to process the new language.
Cite as

Gonçalo Rodrigues Pinto, Pedro Rangel Henriques, Daniela da Cruz, and João Cruz. Determining Programming Languages Complexity and Its Impact on Processing. In 11th Symposium on Languages, Applications and Technologies (SLATE 2022). Open Access Series in Informatics (OASIcs), Volume 104, pp. 16:1-16:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{pinto_et_al:OASIcs.SLATE.2022.16,
  author =	{Pinto, Gon\c{c}alo Rodrigues and Henriques, Pedro Rangel and da Cruz, Daniela and Cruz, Jo\~{a}o},
  title =	{{Determining Programming Languages Complexity and Its Impact on Processing}},
  booktitle =	{11th Symposium on Languages, Applications and Technologies (SLATE 2022)},
  pages =	{16:1--16:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-245-7},
  ISSN =	{2190-6807},
  year =	{2022},
  volume =	{104},
  editor =	{Cordeiro, Jo\~{a}o and Pereira, Maria Jo\~{a}o and Rodrigues, Nuno F. and Pais, Sebasti\~{a}o},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2022.16},
  URN =		{urn:nbn:de:0030-drops-167620},
  doi =		{10.4230/OASIcs.SLATE.2022.16},
  annote =	{Keywords: Complexity, Grammar, Language-based-Tool, Programming Language, Static code analysis}
}
Document
DOI: 10.4230/OASIcs.SLATE.2014.143
Plagiarism Detection: A Tool Survey and Comparison

Authors: Vítor T. Martins, Daniela Fonte, Pedro Rangel Henriques, and Daniela da Cruz

Published in: OASIcs, Volume 38, 3rd Symposium on Languages, Applications and Technologies (2014)

Abstract
We illustrate the state of the art in software plagiarism detection tools by comparing their features and testing them against a wide range of source codes. The source codes were edited according to several types of plagiarism to show the tools accuracy at detecting each type. The decision to focus our research on plagiarism of programming languages is two fold: on one hand, it is a challenging case-study since programming languages impose a structured writing style; on the other hand, we are looking for the integration of such a tool in an Automatic-Grading System (AGS) developed to support teachers in the context of Programming courses. Besides the systematic characterisation of the underlying problem domain, the tools were surveyed with the objective of identifying the most successful approach in order to design the aimed plugin for our AGS.
Cite as

Vítor T. Martins, Daniela Fonte, Pedro Rangel Henriques, and Daniela da Cruz. Plagiarism Detection: A Tool Survey and Comparison. In 3rd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 38, pp. 143-158, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@InProceedings{martins_et_al:OASIcs.SLATE.2014.143,
  author =	{Martins, V{\'\i}tor T. and Fonte, Daniela and Henriques, Pedro Rangel and da Cruz, Daniela},
  title =	{{Plagiarism Detection: A Tool Survey and Comparison}},
  booktitle =	{3rd Symposium on Languages, Applications and Technologies},
  pages =	{143--158},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-68-2},
  ISSN =	{2190-6807},
  year =	{2014},
  volume =	{38},
  editor =	{Pereira, Maria Jo\~{a}o Varanda and Leal, Jos\'{e} Paulo and Sim\~{o}es, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2014.143},
  URN =		{urn:nbn:de:0030-drops-45667},
  doi =		{10.4230/OASIcs.SLATE.2014.143},
  annote =	{Keywords: software, plagiarism, detection, comparison, test}
}
Document
DOI: 10.4230/OASIcs.SLATE.2013.129
A Flexible Dynamic System for Automatic Grading of Programming Exercises

Authors: Daniela Fonte, Daniela da Cruz, Alda Lopes Gançarski, and Pedro Rangel Henriques

Published in: OASIcs, Volume 29, 2nd Symposium on Languages, Applications and Technologies (2013)

Abstract
The research on programs capable to automatically grade source code has been a subject of great interest to many researchers. Automatic Grading Systems (AGS) were born to support programming courses and gained popularity due to their ability to assess, evaluate, grade and manage the students' programming exercises, saving teachers from this manual task. This paper discusses semantic analysis techniques, and how they can be applied to improve the validation and assessment process of an AGS. We believe that the more flexible is the results assessment, the more precise is the source code grading, and better feedback is provided (improving the students learning process). In this paper, we introduce a generic model to obtain a more flexible and fair grading process, closer to a manual one. More specifically, an extension of the traditional Dynamic Analysis concept, by performing a comparison of the output produced by a program under assessment with the expected output at a semantic level. To implement our model, we propose a Flexible Dynamic Analyzer, able to perform a semantic-similarity analysis based on our Output Semantic-Similarity Language (OSSL) that, besides specifying the output structure, allows to define how to mark partially correct answers. Our proposal is compliant with the Learning Objects standard.
Cite as

Daniela Fonte, Daniela da Cruz, Alda Lopes Gançarski, and Pedro Rangel Henriques. A Flexible Dynamic System for Automatic Grading of Programming Exercises. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 129-144, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{fonte_et_al:OASIcs.SLATE.2013.129,
  author =	{Fonte, Daniela and Cruz, Daniela da and Gan\c{c}arski, Alda Lopes and Henriques, Pedro Rangel},
  title =	{{A Flexible Dynamic System for Automatic Grading of Programming Exercises}},
  booktitle =	{2nd Symposium on Languages, Applications and Technologies},
  pages =	{129--144},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-52-1},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{29},
  editor =	{Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.129},
  URN =		{urn:nbn:de:0030-drops-40343},
  doi =		{10.4230/OASIcs.SLATE.2013.129},
  annote =	{Keywords: Automatic Grading Systems, Domain Specific Languages, DSL, Dynamic Analysis}
}
Document
DOI: 10.4230/OASIcs.SLATE.2013.155
Choosing Grammars to Support Language Processing Courses

Authors: Maria João Varanda Pereira, Nuno Oliveira, Daniela da Cruz, and Pedro Rangel Henriques

Published in: OASIcs, Volume 29, 2nd Symposium on Languages, Applications and Technologies (2013)

Abstract
Teaching Language Processing courses is a hard task. The level of abstraction inherent to some of the basic concepts in the area and the technical skills required to implement efficient processors are responsible for the number of students that do not learn the subject and do not succeed to finish the course. In this paper we intend to list the main concepts involved in Language Processing subject, and identify the skills required to learn them. In this context, it is feasible to identify the difficulties that lead students to fail. This enables us to suggest some pragmatic ways to overcome those troubles. We will focus on the grammars suitable to motivate students and help them to learn easily the basic concepts. After identifying the characteristics of such grammars, some examples are presented to make concrete and clear our proposal. The contribution of this paper is the systematic way we approach the process of teaching Language Processing courses towards a successful learning activity.
Cite as

Maria João Varanda Pereira, Nuno Oliveira, Daniela da Cruz, and Pedro Rangel Henriques. Choosing Grammars to Support Language Processing Courses. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 155-168, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{pereira_et_al:OASIcs.SLATE.2013.155,
  author =	{Pereira, Maria Jo\~{a}o Varanda and Oliveira, Nuno and Cruz, Daniela da and Henriques, Pedro Rangel},
  title =	{{Choosing Grammars to Support Language Processing Courses}},
  booktitle =	{2nd Symposium on Languages, Applications and Technologies},
  pages =	{155--168},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-52-1},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{29},
  editor =	{Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.155},
  URN =		{urn:nbn:de:0030-drops-40369},
  doi =		{10.4230/OASIcs.SLATE.2013.155},
  annote =	{Keywords: Teaching Language Processing, Domain Specific Languages, Grammars}
}
Document
Complete Volume
DOI: 10.4230/OASIcs.SLATE.2012
OASIcs, Volume 21, SLATE'12, Complete Volume

Authors: Alberto Simões, Ricardo Queirós, and Daniela da Cruz

Published in: OASIcs, Volume 21, 1st Symposium on Languages, Applications and Technologies (2012)

Abstract
OASIcs, Volume 21, SLATE'12, Complete Volume
Cite as

1st Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@Proceedings{simoes_et_al:OASIcs.SLATE.2012,
  title =	{{OASIcs, Volume 21, SLATE'12, Complete Volume}},
  booktitle =	{1st Symposium on Languages, Applications and Technologies},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-40-8},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{21},
  editor =	{Sim\~{o}es, Alberto and Queir\'{o}s, Ricardo and da Cruz, Daniela},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2012},
  URN =		{urn:nbn:de:0030-drops-35839},
  doi =		{10.4230/OASIcs.SLATE.2012},
  annote =	{Keywords: Interoperability, Programming Languages, Natural Language Processing}
}
Document
Front Matter
DOI: 10.4230/OASIcs.SLATE.2012.i
Frontmatter, Table of Contents, Preface, Committees, List of Authors

Authors: Alberto Simões, Ricardo Queirós, and Daniela da Cruz

Published in: OASIcs, Volume 21, 1st Symposium on Languages, Applications and Technologies (2012)

Abstract
Frontmatter, Table of Contents, Preface, Committees, List of Authors
Cite as

1st Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 21, pp. i-xvii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{simoes_et_al:OASIcs.SLATE.2012.i,
  author =	{Sim\~{o}es, Alberto and Queir\'{o}s, Ricardo and da Cruz, Daniela},
  title =	{{Frontmatter, Table of Contents, Preface, Committees, List of Authors}},
  booktitle =	{1st Symposium on Languages, Applications and Technologies},
  pages =	{i--xvii},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-40-8},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{21},
  editor =	{Sim\~{o}es, Alberto and Queir\'{o}s, Ricardo and da Cruz, Daniela},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2012.i},
  URN =		{urn:nbn:de:0030-drops-35085},
  doi =		{10.4230/OASIcs.SLATE.2012.i},
  annote =	{Keywords: Frontmatter, Table of Contents, Preface, Committees, List of Authors}
}
Document
Keynote
DOI: 10.4230/OASIcs.SLATE.2012.3
The New Generation of Algorithmic Debuggers (Keynote)

Authors: Josep Silva Galiana

Published in: OASIcs, Volume 21, 1st Symposium on Languages, Applications and Technologies (2012)

Abstract
Algorithmic debugging is a debugging technique that has been extended to practically all programming paradigms. Roughly speaking, the technique constructs an internal representation of all (sub)computations performed during the execution of a buggy program; and then, it asks the programmer about the correctness of such computations. The answers of the programmer guide the search for the bug until it is isolated by discarding correct parts of the program. After twenty years of research in algorithmic debugging many different techniques have appeared to improve the original proposal. Recent advances in the internal architecture of algorithmic debuggers face the problem of scalability with great improvements in the performance thanks to the use of static transformations of the internal data structures used. The talk will present a detailed comparison of the last algorithmic debugging techniques analyzing their differences, their costs, and how can they be integrated into a real algorithmic debugger.
Cite as

Josep Silva Galiana. The New Generation of Algorithmic Debuggers (Keynote). In 1st Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 21, p. 3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{silvagaliana:OASIcs.SLATE.2012.3,
  author =	{Silva Galiana, Josep},
  title =	{{The New Generation of Algorithmic Debuggers}},
  booktitle =	{1st Symposium on Languages, Applications and Technologies},
  pages =	{3--3},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-40-8},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{21},
  editor =	{Sim\~{o}es, Alberto and Queir\'{o}s, Ricardo and da Cruz, Daniela},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2012.3},
  URN =		{urn:nbn:de:0030-drops-35097},
  doi =		{10.4230/OASIcs.SLATE.2012.3},
  annote =	{Keywords: Debugging, Programming, Program Correction}
}
Document
Keynote
DOI: 10.4230/OASIcs.SLATE.2012.5
From Program Execution to Automatic Reasoning: Integrating Ontologies into Programming Languages (Keynote)

Authors: Alexander Paar

Published in: OASIcs, Volume 21, 1st Symposium on Languages, Applications and Technologies (2012)

Abstract
Since their standardizations by the W3C, the Extensible Markup Language (XML) and XML Schema Definition (XSD) have been widely adopted as a format to describe data and to define programming language agnostic data types and content models. Several other W3C standards such as the Resource Description Framework (RDF) and the Web Ontology Language (OWL) are based on XML and XSD. At the same time, statically typed object-oriented programming languages such as Java and C# are most widely used for software development. This talk will delineate the conceptual bases of XML Schema Definition and the Web Ontology Language and how they differ from Java or C#. It will be shown how XSD facilitates the definition of data types based on value space constraints and how OWL ontologies are amenable to automatic reasoning. The superior modeling features of XSD and OWL will be elucidated based on exemplary comparisons with frame logic-based models. A significant shortcoming will become obvious: the deficient integration of XSD and OWL with the type systems of object-oriented programming languages. Eventually, the Zhi# approach will be presented that integrates XSD and OWL into the C# programming language. In Zhi#, value space-based data types and ontological concept descriptions are first-class citizens; compile time and runtime support is readily available for XSD and OWL. Thus, the execution of Zhi# programs is directly controlled by the artificial intelligence inherent in ontological models: Zhi# programs don't just execute, they reason.
Cite as

Alexander Paar. From Program Execution to Automatic Reasoning: Integrating Ontologies into Programming Languages (Keynote). In 1st Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 21, p. 5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{paar:OASIcs.SLATE.2012.5,
  author =	{Paar, Alexander},
  title =	{{From Program Execution to Automatic Reasoning: Integrating Ontologies into Programming Languages}},
  booktitle =	{1st Symposium on Languages, Applications and Technologies},
  pages =	{5--5},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-40-8},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{21},
  editor =	{Sim\~{o}es, Alberto and Queir\'{o}s, Ricardo and da Cruz, Daniela},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2012.5},
  URN =		{urn:nbn:de:0030-drops-35103},
  doi =		{10.4230/OASIcs.SLATE.2012.5},
  annote =	{Keywords: Ontologies, OO programming languages, Automatic reasoning}
}
Document
DOI: 10.4230/OASIcs.SLATE.2012.9
On Extending a Linear Tabling Framework to Support Batched Scheduling

Authors: Miguel Areias and Ricardo Rocha

Published in: OASIcs, Volume 21, 1st Symposium on Languages, Applications and Technologies (2012)

Abstract
Tabled evaluation is a recognized and powerful technique that overcomes some limitations of traditional Prolog systems in dealing with recursion and redundant sub-computations. During tabled execution, several decisions have to be made. These are determined by the scheduling strategy. Whereas a strategy can achieve very good performance for certain applications, for others it might add overheads and even lead to unacceptable inefficiency. The two most successful tabling scheduling strategies are local scheduling and batched scheduling. In previous work, we have developed a framework, on top of the Yap system, that supports the combination of different linear tabling strategies for local scheduling. In this work, we propose the extension of our framework, to support batched scheduling. In particular, we are interested in the two most successful linear tabling strategies, the DRA and DRE strategies. To the best of our knowledge, no single tabling Prolog system supports both strategies simultaneously for batched scheduling.
Cite as

Miguel Areias and Ricardo Rocha. On Extending a Linear Tabling Framework to Support Batched Scheduling. In 1st Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 21, pp. 9-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{areias_et_al:OASIcs.SLATE.2012.9,
  author =	{Areias, Miguel and Rocha, Ricardo},
  title =	{{On Extending a Linear Tabling Framework to Support Batched Scheduling}},
  booktitle =	{1st Symposium on Languages, Applications and Technologies},
  pages =	{9--24},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-40-8},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{21},
  editor =	{Sim\~{o}es, Alberto and Queir\'{o}s, Ricardo and da Cruz, Daniela},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2012.9},
  URN =		{urn:nbn:de:0030-drops-35113},
  doi =		{10.4230/OASIcs.SLATE.2012.9},
  annote =	{Keywords: Linear Tabling, Scheduling, Implementation}
}
Document
DOI: 10.4230/OASIcs.SLATE.2012.25
Mode-Directed Tabling and Applications in the YapTab System

Authors: João Santos and Ricardo Rocha

Published in: OASIcs, Volume 21, 1st Symposium on Languages, Applications and Technologies (2012)

Abstract
Tabling is an implementation technique that solves some limitations of Prolog's operational semantics in dealing with recursion and redundant sub-computations. Tabling works by memorizing generated answers and then by reusing them on similar calls that appear during the resolution process. In a traditional tabling system, all the arguments of a tabled subgoal call are considered when storing answers into the table space. Traditional tabling systems are thus very good for problems that require finding all answers. Mode-directed tabling is an extension to the tabling technique that supports the definition of selective criteria for specifying how answers are inserted into the table space. Implementations of mode-directed tabling are already available in systems like ALS-Prolog, B-Prolog and XSB. In this paper, we propose a more general approach to the declaration and use of mode-directed tabling, implemented on top of the YapTab tabling system, and we show applications of our approach to problems involving Justification, Preferences and Answer Subsumption.
Cite as

João Santos and Ricardo Rocha. Mode-Directed Tabling and Applications in the YapTab System. In 1st Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 21, pp. 25-40, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{santos_et_al:OASIcs.SLATE.2012.25,
  author =	{Santos, Jo\~{a}o and Rocha, Ricardo},
  title =	{{Mode-Directed Tabling and Applications in the YapTab System}},
  booktitle =	{1st Symposium on Languages, Applications and Technologies},
  pages =	{25--40},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-40-8},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{21},
  editor =	{Sim\~{o}es, Alberto and Queir\'{o}s, Ricardo and da Cruz, Daniela},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2012.25},
  URN =		{urn:nbn:de:0030-drops-35123},
  doi =		{10.4230/OASIcs.SLATE.2012.25},
  annote =	{Keywords: Tabling, Mode Operators, Applications}
}
Document
DOI: 10.4230/OASIcs.SLATE.2012.41
Generating flex Lexical Scanners for Perl Parse::Yapp

Authors: Alberto Simões, Nuno Ramos Carvalho, and José João Almeida

Published in: OASIcs, Volume 21, 1st Symposium on Languages, Applications and Technologies (2012)

Abstract
Perl is known for its versatile regular expressions. Nevertheless, using Perl regular expressions for creating fast lexical analyzer is not easy. As an alternative, the authors defend the automated generation of the lexical analyzer in a well known fast application (flex) based on a simple Perl definition in the syntactic analyzer. In this paper we extend the syntax used by Parse::Yapp, one of the most used parser generators for Perl, making the automatic generation of flex lexical scanners possible. We explain how this is performed and conclude with some benchmarks that show the relevance of the approach.
Cite as

Alberto Simões, Nuno Ramos Carvalho, and José João Almeida. Generating flex Lexical Scanners for Perl Parse::Yapp. In 1st Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 21, pp. 41-50, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{simoes_et_al:OASIcs.SLATE.2012.41,
  author =	{Sim\~{o}es, Alberto and Carvalho, Nuno Ramos and Almeida, Jos\'{e} Jo\~{a}o},
  title =	{{Generating flex Lexical Scanners for Perl Parse::Yapp}},
  booktitle =	{1st Symposium on Languages, Applications and Technologies},
  pages =	{41--50},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-40-8},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{21},
  editor =	{Sim\~{o}es, Alberto and Queir\'{o}s, Ricardo and da Cruz, Daniela},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2012.41},
  URN =		{urn:nbn:de:0030-drops-35133},
  doi =		{10.4230/OASIcs.SLATE.2012.41},
  annote =	{Keywords: flex, Perl, yapp, lexical analyzer}
}
Document
DOI: 10.4230/OASIcs.SLATE.2012.51
A Purely Functional Combinator Language for Software Quality Assessment

Authors: Pedro Martins, João Paulo Fernandes, and João Saraiva

Published in: OASIcs, Volume 21, 1st Symposium on Languages, Applications and Technologies (2012)

Abstract
Quality assessment of open source software is becoming an important and active research area. One of the reasons for this recent interest is the consequence of Internet popularity. Nowadays, programming also involves looking for the large set of open source libraries and tools that may be reused when developing our software applications. In order to reuse such open source software artifacts, programmers not only need the guarantee that the reused artifact is certified, but also that independently developed artifacts can be easily combined into a coherent piece of software. In this paper we describe a domain specific language that allows programmers to describe in an abstract level how software artifacts can be combined into powerful software certification processes. This domain specific language is the building block of a web-based, open-source software certification portal. This paper introduces the embedding of such domain specific language as combinator library written in the Haskell programming language. The semantics of this language is expressed via attribute grammars that are embedded in Haskell, which provide a modular and incremental setting to define the combination of software artifacts.
Cite as

Pedro Martins, João Paulo Fernandes, and João Saraiva. A Purely Functional Combinator Language for Software Quality Assessment. In 1st Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 21, pp. 51-69, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{martins_et_al:OASIcs.SLATE.2012.51,
  author =	{Martins, Pedro and Fernandes, Jo\~{a}o Paulo and Saraiva, Jo\~{a}o},
  title =	{{A Purely Functional Combinator Language for Software Quality Assessment}},
  booktitle =	{1st Symposium on Languages, Applications and Technologies},
  pages =	{51--69},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-40-8},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{21},
  editor =	{Sim\~{o}es, Alberto and Queir\'{o}s, Ricardo and da Cruz, Daniela},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2012.51},
  URN =		{urn:nbn:de:0030-drops-35149},
  doi =		{10.4230/OASIcs.SLATE.2012.51},
  annote =	{Keywords: Process Management, Combinators, Attribute Grammars, Functional Programming}
}
Document
DOI: 10.4230/OASIcs.SLATE.2012.71
PH-Helper - a Syntax-Directed Editor for Hoshimi Programming Language, HL

Authors: Mariano Luzza, Mario Marcelo Beron, and Pedro Rangel Henriques

Published in: OASIcs, Volume 21, 1st Symposium on Languages, Applications and Technologies (2012)

Abstract
It is well known that students face many difficulties when they have to learn programming. Generally, these difficulties arise from two main reasons: i) the kind of exercises proposed by the teacher, and ii) the programming language used for solving those problems. The first problem is overcome by selecting an interesting application domain for the students. The second problem is tackled by using programming languages specialized for teaching. Nowadays, there are many programming languages aimed at simplifying the learning process. However, many of them still have the same drawbacks of traditional programming languages: the language used to write the statements is different from the programmers' native language; and the syntactic rules impose many tricky restrictions not easy to follow. This paper presents an approach for solving the problems previously mentioned. The approach consists of using: an application domain motivating for the student, the Project Hoshimi (PH); and a programming environment, PH-Helper that is a simple and user-friendly syntax-directed editor and compiler for Hoshimi Language (HL), the actual PH programming language.
Cite as

Mariano Luzza, Mario Marcelo Beron, and Pedro Rangel Henriques. PH-Helper - a Syntax-Directed Editor for Hoshimi Programming Language, HL. In 1st Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 21, pp. 71-89, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{luzza_et_al:OASIcs.SLATE.2012.71,
  author =	{Luzza, Mariano and Beron, Mario Marcelo and Henriques, Pedro Rangel},
  title =	{{PH-Helper - a Syntax-Directed Editor for Hoshimi Programming Language, HL}},
  booktitle =	{1st Symposium on Languages, Applications and Technologies},
  pages =	{71--89},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-40-8},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{21},
  editor =	{Sim\~{o}es, Alberto and Queir\'{o}s, Ricardo and da Cruz, Daniela},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2012.71},
  URN =		{urn:nbn:de:0030-drops-35153},
  doi =		{10.4230/OASIcs.SLATE.2012.71},
  annote =	{Keywords: Syntax-directed Editors, Visual Programming Enviroments, DSL}
}
Document
DOI: 10.4230/OASIcs.SLATE.2012.91
Problem Domain Oriented Approach for Program Comprehension

Authors: Maria João Varanda Pereira, Mario Marcelo Beron, Daniela da Cruz, Nuno Oliveira, and Pedro Rangel Henriques

Published in: OASIcs, Volume 21, 1st Symposium on Languages, Applications and Technologies (2012)

Abstract
This paper is concerned with an ontology driven approach for Program Comprehension that starts picking up concepts from the problem domain ontology, analyzing source code and, after locating problem concepts in the code, goes up and links them to the programming language ontology. Different location techniques are used to search for concepts embedded in comments, in the code (identifier names and execution traces), and in string-literals associated with I/O statements. The expected result is a mapping between problem domain concepts and code slices. This mapping can be visualized using graph-based approaches like, for instance, navigation facilities through a System Dependency Graph. The paper also describes a PCTool suite, Quixote, that implements the approach proposed.
Cite as

Maria João Varanda Pereira, Mario Marcelo Beron, Daniela da Cruz, Nuno Oliveira, and Pedro Rangel Henriques. Problem Domain Oriented Approach for Program Comprehension. In 1st Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 21, pp. 91-105, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{varandapereira_et_al:OASIcs.SLATE.2012.91,
  author =	{Varanda Pereira, Maria Jo\~{a}o and Beron, Mario Marcelo and da Cruz, Daniela and Oliveira, Nuno and Henriques, Pedro Rangel},
  title =	{{Problem Domain Oriented Approach for Program Comprehension}},
  booktitle =	{1st Symposium on Languages, Applications and Technologies},
  pages =	{91--105},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-40-8},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{21},
  editor =	{Sim\~{o}es, Alberto and Queir\'{o}s, Ricardo and da Cruz, Daniela},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2012.91},
  URN =		{urn:nbn:de:0030-drops-35161},
  doi =		{10.4230/OASIcs.SLATE.2012.91},
  annote =	{Keywords: Program Comprehension, Ontology-based SW development, Problem and Program domain mapping, Code Analysis. Software Visualization}
}
  • Refine by Author
  • 9 Henriques, Pedro Rangel
  • 6 da Cruz, Daniela
  • 3 Almeida, José João
  • 3 Oliveira, Nuno
  • 3 Queirós, Ricardo
  • Show More...

  • Refine by Classification
  • 1 Software and its engineering → General programming languages

  • Refine by Keyword
  • 2 DSL
  • 2 Domain Specific Languages
  • 1 Applications
  • 1 Attribute Grammars
  • 1 Automatic Grading Systems
  • Show More...

  • Refine by Type
  • 26 document
  • 1 volume

  • Refine by Publication Year
  • 23 2012
  • 2 2013
  • 1 2014
  • 1 2022

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact