Especificação e implementação de uma linguagem para transformação de modelos MOF em repositórios dMOF

This work presents the specification and the implementation of a language of Transformations in definite Models specification MOF (Meta Object Facility) of OMG (Object Management Group). The specification uses a boarding based on rules ECA (Event-Condition-Action) and was made on the basis of a set of scenes of use previously defined. The Parser Responsible parser for guaranteeing that the syntactic structure of the language is correct was constructed with the tool JavaCC (Java Compiler Compiler) and the description of the syntax of the language was made with EBNF (Extended Backus-Naur Form). The implementation is divided in three parts: the creation of the interpretative program properly said in Java, the creation of an executor of the actions specified in the language and its integration with the type of considered repository (generated for tool DSTC dMOF). A final prototype was developed and tested in the scenes previously defined

Vaga-lume na treva: a poesia de João Lins Caldas

This thesis analyses the poetry of João Lins Caldas (1888-1967), in Brazilian literature context, aiming at describing and understanding the main features of his poetry. Thus, this research presents a corpus to be worked on: the poems in Poeira do céu e outros poemas (2009). Our study is characterized by a biographical, historiographical and critical tendency, by trying to organize the manuscripts of the author and biographical aspects while analyzing his poems. It is showed the relation between Brazilian poetry written by some authors, since the parnasianism and symbolism period until the twentieth century. On the one hand, our analysis is based on the ideas and criticism by Antonio Candido (2006; 2002; 1985), discussing the process of formation of Brazilian literature and the procedure to analyse poetry. It is also based on the concept of poetry and resistance, developed by Alfredo Bosi (2000; 2002), and the notion of Brazilian matter, identified by Roberto Schwarz (1987, 1997, 1999). On the other hand, this work focuses on melancholy under the theoretical ideas of authors such as Aristotle (1998), Walter Benjamin (1984), Jaime Ginzburg (1997) and Moacyr Scliar (2003). This focus on melancholy contributes to a better understanding of one of the main themes found in the poems analysed. By studying the poetry of João Lins Caldas, it was perceived the relevance of melancholy and resistance in his verses. This can be seen in his dissonant language, characterized by the broken syntax in his verses, as well as contradictory images and complex meanings in his poetry. This causes the effect of unfamiliarity on the reader. His poetry is the result of a style that finds its place in the best moment of modern Brazilian poetry and reveals its singularity through the inverted syntax with powerful themes such as love, death, pain, delusion, loss, memory, nature and God. All of them are aspects of Brazilian historicity. Finally, the work of João Lins Caldas is part of a multifaceted poetry

Poesia digital: três leituras da Obra de Jason Nelson

The development of digital technologies has opened up a new niche for artistic production. It began to emerge artworks that could only happen in the digital context. In this study, we investigated the syntax of defining digital poetry, recognized internationally as one of the possibilities of this new artistic practice, and how happens the meaning during the reading process. As research corpus, we chose the poem "Birds Still Warm From Flying", by american poet Jason Nelson. And we structure our analysis looking through three perspectives: the digital poem as a game; as the evolution of experimental trends of twentieth-century poetry; and as a representation of Rubik`s Cube, a famous three-dimensional puzzle from the 1970`s. Initially, we made some considerations about the construction of digital poetry as a hypermedia artwork, looking through convergence and hybridization of artistic and media languages. Then, we saw some similarities between Nelson`s poem and electronic games, based on our critical observations about the concept of interactivity. Subsequently, we wrote a historical overview about the poetic experimentation in the twentieth century, bringing examples of sound poetry and visual poetry as evidence that the birth of digital poetry is also the result of the evolution of these experiments. Finally, we use the Charles Sanders Peirce`s semiotics to analyze the signs that give references able to make us recognize the Rubik`s Cube in "Birds Still Warm From Flying"

O modelo de dados Resource Description Framework (RDF) e o seu papel na descrição de recursos

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

JCircus 2.0: Uma extensão da ferramenta de tradução de Circus para Java

This dissertation aims at extending the JCircus tool, a translator of formal specifications into code that receives a Circus specification as input, and translates the specification into Java code. Circus is a formal language whose syntax is based on Z s and CSP s syntax. JCircus generated code uses JCSP, which is a Java API that implements CSP primitives. As JCSP does not implement all CSP s primitives, the translation strategy from Circus to Java is not trivial. Some CSP primitives, like parallelism, external choice, communication and multi-synchronization are partially implemented. As an aditional scope, this dissertation will also develop a tool for testing JCSP programs, called JCSPUnit, which will also be included in JCircus new version. The extended version of JCircus will be called JCircus 2.0.

Estendendo CRefine para o suporte de táticas de refinamento

The use of increasingly complex software applications is demanding greater investment in the development of such systems to ensure applications with better quality. Therefore, new techniques are being used in Software Engineering, thus making the development process more effective. Among these new approaches, we highlight Formal Methods, which use formal languages that are strongly based on mathematics and have a well-defined semantics and syntax. One of these languages is Circus, which can be used to model concurrent systems. It was developed from the union of concepts from two other specification languages: Z, which specifies systems with complex data, and CSP, which is normally used to model concurrent systems. Circus has an associated refinement calculus, which can be used to develop software in a precise and stepwise fashion. Each step is justified by the application of a refinement law (possibly with the discharge of proof obligations). Sometimes, the same laws can be applied in the same manner in different developments or even in different parts of a single development. A strategy to optimize this calculus is to formalise these application as a refinement tactic, which can then be used as a single transformation rule. CRefine was developed to support the Circus refinement calculus. However, before the work presented here, it did not provide support for refinement tactics. The aim of this work is to provide tool support for refinement tactics. For that, we develop a new module in CRefine, which automates the process of defining and applying refinement tactics that are formalised in the tactic language ArcAngelC. Finally, we validate the extension by applying the new module in a case study, which used the refinement tactics in a refinement strategy for verification of SPARK Ada implementations of control systems. In this work, we apply our module in the first two phases of this strategy

POPT: uma abordagem de ensino de programação orientada a problema e testes

There is a growing interest of the Computer Science education community for including testing concepts on introductory programming courses. Aiming at contributing to this issue, we introduce POPT, a Problem-Oriented Programming and Testing approach for Introductory Programming Courses. POPT main goal is to improve the traditional method of teaching introductory programming that concentrates mainly on implementation and neglects testing. POPT extends POP (Problem Oriented Programing) methodology proposed on the PhD Thesis of Andrea Mendonça (UFCG). In both methodologies POPT and POP, students skills in dealing with ill-defined problems must be developed since the first programming courses. In POPT however, students are stimulated to clarify ill-defined problem specifications, guided by de definition of test cases (in a table-like manner). This paper presents POPT, and TestBoot a tool developed to support the methodology. In order to evaluate the approach a case study and a controlled experiment (which adopted the Latin Square design) were performed. In an Introductory Programming course of Computer Science and Software Engineering Graduation Programs at the Federal University of Rio Grande do Norte, Brazil. The study results have shown that, when compared to a Blind Testing approach, POPT stimulates the implementation of programs of better external quality the first program version submitted by POPT students passed in twice the number of test cases (professor-defined ones) when compared to non-POPT students. Moreover, POPT students submitted fewer program versions and spent more time to submit the first version to the automatic evaluation system, which lead us to think that POPT students are stimulated to think better about the solution they are implementing. The controlled experiment confirmed the influence of the proposed methodology on the quality of the code developed by POPT students

Verificação formal automatizada para sistemas de raciocínio procedural (PRS) utilizando redes de petri coloridas (RPC)

Este trabalho apresenta uma técnica de verificação formal de Sistemas de Raciocínio Procedural, PRS (Procedural Reasoning System), uma linguagem de programação que utiliza a abordagem do raciocínio procedural. Esta técnica baseia-se na utilização de regras de conversão entre programas PRS e Redes de Petri Coloridas (RPC). Para isso, são apresentadas regras de conversão de um sub-conjunto bem expressivo da maioria da sintaxe utilizada na linguagem PRS para RPC. A fim de proceder fia verificação formal do programa PRS especificado, uma vez que se disponha da rede de Petri equivalente ao programa PRS, utilizamos o formalismo das RPCs (verificação das propriedades estruturais e comportamentais) para analisarmos formalmente o programa PRS equivalente. Utilizamos uma ferramenta computacional disponível para desenhar, simular e analisar as redes de Petri coloridas geradas. Uma vez que disponhamos das regras de conversão PRS-RPC, podemos ser levados a querer fazer esta conversão de maneira estritamente manual. No entanto, a probabilidade de introdução de erros na conversão é grande, fazendo com que o esforço necessário para garantirmos a corretude da conversão manual seja da mesma ordem de grandeza que a eliminação de eventuais erros diretamente no programa PRS original. Assim, a conversão automatizada é de suma importância para evitar que a conversão manual nos leve a erros indesejáveis, podendo invalidar todo o processo de conversão. A principal contribuição deste trabalho de pesquisa diz respeito ao desenvolvimento de uma técnica de verificação formal automatizada que consiste basicamente em duas etapas distintas, embora inter-relacionadas. A primeira fase diz respeito fias regras de conversão de PRS para RPC. A segunda fase é concernente ao desenvolvimento de um conversor para fazer a transformação de maneira automatizada dos programas PRS para as RPCs. A conversão automática é possível, porque todas as regras de conversão apresentadas seguem leis de formação genéricas, passíveis de serem incluídas em algoritmos

História de uma completiva: origem e desenvolvimento do complemento oracional introduzido por se do português

O propósito deste trabalho é investigar o percurso histórico da oração completiva iniciada pela conjunção se do português, que também introduz, nessa e em outras línguas românicas, uma oração adverbial condicional. Com base em registros de filólogos e romanistas, demonstra-se que a similaridade existente entre essas orações é resultado de gramaticalização da oração condicional que, no latim, passou a funcionar como oração completiva, em razão da extinção das partículas interrogativas que passaram a ser substituídas pela conjunção condicional latina si. Como oração completiva, a oração com se submete-se à gramaticalização, integrando-se à oração matriz de um modo que, conforme proposta de Hopper e Traugott (1993) e de Lehmann (1988), é próprio a construções completivas. A forma que tem essa oração de se gramaticalizar, incorporando-se à oração matriz, é, entretanto, diferente do que é previsto ocorrer a uma completiva introduzida por que, uma diferença que se deve, sobretudo, ao significado hipotético que a completiva com se preserva de sua fonte histórica. Demonstra-se, por fim, que, do português arcaico ao português contemporâneo, a gramaticalização do complemento oracional introduzido por se não se configura em mudança diacrônica, já que essa gramaticalização é atestada desde períodos mais remotos, em textos do século XIV.

A variação de pluralidade nas estruturas predictaivas da variedade falada na região de São José do Rio Preto

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A marcação de pluralidade no SN na fala e na escrita de adolescentes da região de São José do Rio Preto

Pós-graduação em Estudos Linguísticos - IBILCE

A expressão da estrutura argumental dos nomes derivados

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Tableaux e indução na lógica do plausível

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Um modelo algébrico para a lógica do muito

Pós-graduação em Filosofia - FFC

Proposta de uma estrutura conceitual de modelagem de empresas para implementação do ERP5 baseada na ISO 19440:2007

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)