A strategy to verify the code generation from concurrent and state-rich circus specifications to executable code

The use of Automatic Code Generators for Formal Methods not only minimizes efforts on the implementation of Software Systems, but also reduces the chance of existing errors on the execution of such Systems. These tools, however, can themselves have faults on their source codes that may cause erro...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Autor principal: Barrocas, Samuel Lincoln Magalhães
Outros Autores: Oliveira, Marcel Vinicius Medeiros
Formato: doctoralThesis
Idioma:por
Publicado em: Brasil
Assuntos:
Métodos formais
Verificação de código
Testes de Software
Síntese de código
Circus
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO
Endereço do item:https://repositorio.ufrn.br/jspui/handle/123456789/25443
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
id ri-123456789-25443
record_format dspace
institution Repositório Institucional
collection RI - UFRN
language por
topic Métodos formais
Verificação de código
Testes de Software
Síntese de código
Circus
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO
spellingShingle Métodos formais
Verificação de código
Testes de Software
Síntese de código
Circus
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO
Barrocas, Samuel Lincoln Magalhães
A strategy to verify the code generation from concurrent and state-rich circus specifications to executable code
description The use of Automatic Code Generators for Formal Methods not only minimizes efforts on the implementation of Software Systems, but also reduces the chance of existing errors on the execution of such Systems. These tools, however, can themselves have faults on their source codes that may cause errors on the generation of Software Systems, and thus verification of such tools is encouraged. This PhD thesis aims at creating and developing a strategy to verify the code generation from the Circus formal method to Java Code. The interest in Circus comes from the fact that it allows the specification of concurrent and state-rich aspects of a System in a straightforward manner. The code generation envisaged to be verified is performed by JCircus, a tool that translates a large subset of Circus to Java code that implements the JCSP API. The strategy of verification consists on the following steps: (1) extension of Woodcock’s Operational Semantics to Circus processes and proof that it is sound with respect to the Denotational Semantics of Circus in the Unifying Theories of Programming (UTP), that is a framework that allows proof and unification of different theories; (2) development and implementation of a strategy that refinement-checks the code generated by JCircus, through a toolchain that encompasses (2.1) a Labelled Predicate Transition System (LPTS) Generator for Circus and (2.2) a Model Generator that inputs (I) a LPTS and (II) the code generated by JCircus, and generates a model (that uses the Java Pathfinder code model-checker) that refinement-checks the code generated by JCircus. Combined with coverage-based techniques on the source code of JCircus, we envisage improving the reliability of the Code Generation from Circus to Java.
author2 Oliveira, Marcel Vinicius Medeiros
author_facet Oliveira, Marcel Vinicius Medeiros
Barrocas, Samuel Lincoln Magalhães
format doctoralThesis
author Barrocas, Samuel Lincoln Magalhães
author_sort Barrocas, Samuel Lincoln Magalhães
title A strategy to verify the code generation from concurrent and state-rich circus specifications to executable code
title_short A strategy to verify the code generation from concurrent and state-rich circus specifications to executable code
title_full A strategy to verify the code generation from concurrent and state-rich circus specifications to executable code
title_fullStr A strategy to verify the code generation from concurrent and state-rich circus specifications to executable code
title_full_unstemmed A strategy to verify the code generation from concurrent and state-rich circus specifications to executable code
title_sort strategy to verify the code generation from concurrent and state-rich circus specifications to executable code
publisher Brasil
publishDate 2018
url https://repositorio.ufrn.br/jspui/handle/123456789/25443
work_keys_str_mv AT barrocassamuellincolnmagalhaes astrategytoverifythecodegenerationfromconcurrentandstaterichcircusspecificationstoexecutablecode
AT barrocassamuellincolnmagalhaes strategytoverifythecodegenerationfromconcurrentandstaterichcircusspecificationstoexecutablecode
_version_ 1773961053218013184
spelling ri-123456789-254432019-01-29T21:23:19Z A strategy to verify the code generation from concurrent and state-rich circus specifications to executable code Barrocas, Samuel Lincoln Magalhães Oliveira, Marcel Vinicius Medeiros Musicante, Martin Alejandro Costa, Umberto Souza Da Mota, Alexandre Cabral Gomes, Bruno Emerson Gurgel Métodos formais Verificação de código Testes de Software Síntese de código Circus CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO The use of Automatic Code Generators for Formal Methods not only minimizes efforts on the implementation of Software Systems, but also reduces the chance of existing errors on the execution of such Systems. These tools, however, can themselves have faults on their source codes that may cause errors on the generation of Software Systems, and thus verification of such tools is encouraged. This PhD thesis aims at creating and developing a strategy to verify the code generation from the Circus formal method to Java Code. The interest in Circus comes from the fact that it allows the specification of concurrent and state-rich aspects of a System in a straightforward manner. The code generation envisaged to be verified is performed by JCircus, a tool that translates a large subset of Circus to Java code that implements the JCSP API. The strategy of verification consists on the following steps: (1) extension of Woodcock’s Operational Semantics to Circus processes and proof that it is sound with respect to the Denotational Semantics of Circus in the Unifying Theories of Programming (UTP), that is a framework that allows proof and unification of different theories; (2) development and implementation of a strategy that refinement-checks the code generated by JCircus, through a toolchain that encompasses (2.1) a Labelled Predicate Transition System (LPTS) Generator for Circus and (2.2) a Model Generator that inputs (I) a LPTS and (II) the code generated by JCircus, and generates a model (that uses the Java Pathfinder code model-checker) that refinement-checks the code generated by JCircus. Combined with coverage-based techniques on the source code of JCircus, we envisage improving the reliability of the Code Generation from Circus to Java. O uso de Geradores Automáticos de Código para Métodos Formais não apenas minimiza esforços na implementação de Sistemas de Software, como também reduz a chance da existência de erros na execução destes Sistemas. Estas ferramentas, no entanto, podem ter faltas em seus códigos-fonte que causam erros na geração dos Sistemas de Software, e então a verificação de tais ferramentas é encorajada. Esta tese de Doutorado visa criar e desenvolver uma estratégia para verificar JCircus, um Gerador Automático de Código de um amplo sub-conjunto de Circus para Java. O interesse em Circus vem do fato de que ele permite a especificação dos aspectos concorrentes e de estado de um Sistema de maneira direta. A estratégia de verificação consiste nos seguintes passos: (1) extensão da Semântica Operacional de Woodcock e prova de que ela é sólida com respeito à Semântica Denotacional existente de Circus na Teoria Unificada de Programação (UTP), que é um framework que permite prova e unificação entre diferentes teorias; (2) desenvolvimento e implementação de uma estratégia que verifica o refinamento do código gerado por JCircus, através de uma toolchain que engloba um Gerador de Sistema de Transições Rotuladas com Predicado (LPTS) para Circus e um Gerador de Modelos que aceita como entrada (I) o LPTS e (II) o código gerado por JCircus, e gera um modelo em Java Pathfinder que verifica o refinamento do código gerado por JCircus. Através da aplicação do passo (2) combinada com técnicas baseadas em cobertura no código fonte de JCircus, nós visamos aumentar a confiabilidade do código gerado de Circus para Java. 2018-06-18T19:19:46Z 2018-06-18T19:19:46Z 2018-02-22 doctoralThesis BARROCAS, Samuel Lincoln Magalhães. A strategy to verify the code generation from concurrent and state-rich circus specifications to executable code. 2018. 234f. Tese (Doutorado em Ciência da Computação) - Centro de Ciências Exatas e da Terra, Universidade Federal do Rio Grande do Norte, Natal, 2018. https://repositorio.ufrn.br/jspui/handle/123456789/25443 por Acesso Aberto application/pdf Brasil UFRN PROGRAMA DE PÓS-GRADUAÇÃO EM SISTEMAS E COMPUTAÇÃO

Registros relacionados