2011
Authors
Fernandes, JM; Lämmel, R; Saraiva, J; Visser, J;
Publication
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract
2012
Authors
Martins, P; Fernandes, JP; Saraiva, J;
Publication
Information Technology and Open Source: Applications for Education, Innovation, and Sustainability - SEFM 2012 Satellite Events, InSuEdu, MoKMaDS, and OpenCert, Thessaloniki, Greece, October 1-2, 2012, Revised Selected Papers
Abstract
This paper presents a web portal for the certification of open source software. The portal aims at helping programmers in the internet age, when there are (too) many open source reusable libraries and tools available. Our portal offers programmers a web-based and easy setting to analyze and certify open source software, which is a crucial step to help programmers choosing among many available alternatives, and to get some guarantees before using one piece of software. The paper presents our first prototype of such web portal. It also describes in detail a domain specific language that allows programmers to describe with a high degree of abstraction specific open source software certifications. The design and implementation of this language is the core of the web portal. © Springer-Verlag Berlin Heidelberg 2014.
2003
Authors
Saraiva, J; Schneider, S;
Publication
36th Hawaii International Conference on System Sciences (HICSS-36 2003), CD-ROM / Abstracts Proceedings, January 6-9, 2003, Big Island, HI, USA
Abstract
This paper presents techniques for the design and implementation of domain specific languages. Our techniques are based on higher-order attribute grammars. Formal languages are specified in the classical attribute formalism and domain specific languages are embedded in the specification via higher-order attributes. We present a domain specific language for pretty-printing and we show how such language can be easily embedded in the specification of a powerful spreadsheet-like tool. From such specification an incremental implementation is automatically derived and the first results are presented. © 2003 IEEE.
2003
Authors
Bryant, B; Saraiva, J;
Publication
Electronic Notes in Theoretical Computer Science
Abstract
2011
Authors
Fernandes, JM; Lämmel, R; Visser, J; Saraiva, J;
Publication
GTTSE
Abstract
2008
Authors
Tirelo, F; Bigonha, RS; Saraiva, J;
Publication
JOURNAL OF UNIVERSAL COMPUTER SCIENCE
Abstract
Denotational semantics is a powerful technique to formally de. ne programming languages. However, language constructs are not always orthogonal, so many semantic equations in a definition may have to be aware of unrelated constructs semantics. Current approaches for modularity in this formalism do not address this problem, providing, for this reason, tangled semantic definitions. This paper proposes an incremental approach for denotational semantic specifications, in which each step can either add new features or adapt existing equations, by means of a formal language based on function transformation and aspect weaving.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.