Utilize este link para identificar ou citar este item: https://bdm.unb.br/handle/10483/18357
Arquivos neste item:
Arquivo Descrição TamanhoFormato 
2017_PedroAbreuJunior_tcc.pdf474,36 kBAdobe PDFver/abrir
Registro completo
Campo Dublin CoreValorLíngua
dc.contributor.advisorAlmeida, Rodrigo Bonifácio de-
dc.contributor.authorAbreu Júnior, Pedro da Costa-
dc.identifier.citationABREU JÚNIOR, Pedro da Costa. Mechanization and overhaul of feature featherweight Java. 2017. viii, 25 f., il. Trabalho de Conclusão de Curso (Bacharelado em Ciência da Computação)—Universidade de Brasília, Brasília, 2017.pt_BR
dc.descriptionTrabalho de conclusão de curso (graduação)—Universidade de Brasília, Instituto de Ciências Exatas, Departamento de Ciência da Computação, 2017.pt_BR
dc.rightsAcesso Abertopt_BR
dc.subject.keywordSoftwarept_BR
dc.subject.keywordLinhas de Produtos de Software (LPS)pt_BR
dc.subject.keywordJava (Linguagem de programação de computador)pt_BR
dc.titleMechanization and overhaul of feature featherweight Javapt_BR
dc.typeTrabalho de Conclusão de Curso - Graduação - Bachareladopt_BR
dc.date.accessioned2017-11-21T13:51:28Z-
dc.date.available2017-11-21T13:51:28Z-
dc.date.submitted2017-08-08-
dc.identifier.urihttp://bdm.unb.br/handle/10483/18357-
dc.language.isoInglêspt_BR
dc.description.abstract1Specifying a language using an Interactive Theorem Prover (ITP) is seldom faithful to its original pen-and-paper specication. However, the process of mechanizing a language and type safety proofs might also unearth insights for improving the original specication. In this work, we detail some design decisions related to our process of first specifying Featherweight Java (FJ) in Coq and thus evolving such a specication to prove the type system properties of an revised version of Feature Featherweight Java (FFJ)-a core-calculus for a family of languages that address variability management in highly congurable systems, such as software product lines (SPLs); which we name as Overhaul Feature Featherweight Java (FFJ*). Indeed, FFJ* is the first mechanization of FFJ, and as such it might also help researchers to derive proofs about software product line renements without considering several assumptions about the underlying SPL assets. We believe that the whole process led us to a clearer, unambiguous, and equivalent syntax and semantics of FFJ, while keeping the proofs as well as our FJ extensions as simple as possible.pt_BR
Aparece na Coleção:Ciência da Computação



Este item está licenciado na Licença Creative Commons Creative Commons