A Systematic Judgement to Automated Programming Contracts Generation

Contracts provide a pre-emptive approach in identifying programming errors at run-time using assertions or by formal Static analysis tool or Manual source code reviews. They describe the expected software behavior. Contracts written by developers have a greater error detection ability than the gener...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of recent technology and engineering 2019-08, Vol.8 (2S3), p.629-637
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 637
container_issue 2S3
container_start_page 629
container_title International journal of recent technology and engineering
container_volume 8
description Contracts provide a pre-emptive approach in identifying programming errors at run-time using assertions or by formal Static analysis tool or Manual source code reviews. They describe the expected software behavior. Contracts written by developers have a greater error detection ability than the generic ones that are created automatically but may involve strenuous efforts for larger sized source codes. The intent of this paper is a concise study of prevalent approaches in the generation of contracts and to put forward an approach to derive programming rules for real-time concurrent Java source code automatically with reduced efforts. The proposed method extracts the scalar variables and computed constants from Static program code analysis, then identifies various dependencies dynamically and generates the declarative contracts automatically by Decision tree modeling of computed dependencies. These rules can then be utilized for software Verification.
doi_str_mv 10.35940/ijrte.B1116.0782S319
format Article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_35940_ijrte_B1116_0782S319</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_35940_ijrte_B1116_0782S319</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1639-dfcda8fcb87cd48040f0a30c72dd780f99f8f44a556726c04c4754c9d502aec73</originalsourceid><addsrcrecordid>eNpN0N9KwzAUBvAgCo65RxDyAp0n_5r0sladykBhel3iSVI6bCtJdrG3d1QFr87Hge-7-BFyzWAtVCXhpt_H7Ne3jLFyDdrwnWDVGVlwrnUhjDbn__IlWaW0BwAmSiZFuSB3Nd0dU_aDzT3S54Pr_ODHTPNE60OeTm_v6GucumiHoR872kxjjhZzohs_-niqTeMVuQj2M_nV712S94f7t-ax2L5snpp6WyArRVW4gM6agB9Go5MGJASwAlBz57SBUFXBBCmtUqXmJYJEqZXEying1qMWS6J-djFOKUUf2q_YDzYeWwbtrNHOGu2s0f5piG9rYlUq</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Systematic Judgement to Automated Programming Contracts Generation</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><description>Contracts provide a pre-emptive approach in identifying programming errors at run-time using assertions or by formal Static analysis tool or Manual source code reviews. They describe the expected software behavior. Contracts written by developers have a greater error detection ability than the generic ones that are created automatically but may involve strenuous efforts for larger sized source codes. The intent of this paper is a concise study of prevalent approaches in the generation of contracts and to put forward an approach to derive programming rules for real-time concurrent Java source code automatically with reduced efforts. The proposed method extracts the scalar variables and computed constants from Static program code analysis, then identifies various dependencies dynamically and generates the declarative contracts automatically by Decision tree modeling of computed dependencies. These rules can then be utilized for software Verification.</description><identifier>ISSN: 2277-3878</identifier><identifier>EISSN: 2277-3878</identifier><identifier>DOI: 10.35940/ijrte.B1116.0782S319</identifier><language>eng</language><ispartof>International journal of recent technology and engineering, 2019-08, Vol.8 (2S3), p.629-637</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><title>A Systematic Judgement to Automated Programming Contracts Generation</title><title>International journal of recent technology and engineering</title><description>Contracts provide a pre-emptive approach in identifying programming errors at run-time using assertions or by formal Static analysis tool or Manual source code reviews. They describe the expected software behavior. Contracts written by developers have a greater error detection ability than the generic ones that are created automatically but may involve strenuous efforts for larger sized source codes. The intent of this paper is a concise study of prevalent approaches in the generation of contracts and to put forward an approach to derive programming rules for real-time concurrent Java source code automatically with reduced efforts. The proposed method extracts the scalar variables and computed constants from Static program code analysis, then identifies various dependencies dynamically and generates the declarative contracts automatically by Decision tree modeling of computed dependencies. These rules can then be utilized for software Verification.</description><issn>2277-3878</issn><issn>2277-3878</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNpN0N9KwzAUBvAgCo65RxDyAp0n_5r0sladykBhel3iSVI6bCtJdrG3d1QFr87Hge-7-BFyzWAtVCXhpt_H7Ne3jLFyDdrwnWDVGVlwrnUhjDbn__IlWaW0BwAmSiZFuSB3Nd0dU_aDzT3S54Pr_ODHTPNE60OeTm_v6GucumiHoR872kxjjhZzohs_-niqTeMVuQj2M_nV712S94f7t-ax2L5snpp6WyArRVW4gM6agB9Go5MGJASwAlBz57SBUFXBBCmtUqXmJYJEqZXEying1qMWS6J-djFOKUUf2q_YDzYeWwbtrNHOGu2s0f5piG9rYlUq</recordid><startdate>20190810</startdate><enddate>20190810</enddate><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20190810</creationdate><title>A Systematic Judgement to Automated Programming Contracts Generation</title></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1639-dfcda8fcb87cd48040f0a30c72dd780f99f8f44a556726c04c4754c9d502aec73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><toplevel>online_resources</toplevel><collection>CrossRef</collection><jtitle>International journal of recent technology and engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Systematic Judgement to Automated Programming Contracts Generation</atitle><jtitle>International journal of recent technology and engineering</jtitle><date>2019-08-10</date><risdate>2019</risdate><volume>8</volume><issue>2S3</issue><spage>629</spage><epage>637</epage><pages>629-637</pages><issn>2277-3878</issn><eissn>2277-3878</eissn><abstract>Contracts provide a pre-emptive approach in identifying programming errors at run-time using assertions or by formal Static analysis tool or Manual source code reviews. They describe the expected software behavior. Contracts written by developers have a greater error detection ability than the generic ones that are created automatically but may involve strenuous efforts for larger sized source codes. The intent of this paper is a concise study of prevalent approaches in the generation of contracts and to put forward an approach to derive programming rules for real-time concurrent Java source code automatically with reduced efforts. The proposed method extracts the scalar variables and computed constants from Static program code analysis, then identifies various dependencies dynamically and generates the declarative contracts automatically by Decision tree modeling of computed dependencies. These rules can then be utilized for software Verification.</abstract><doi>10.35940/ijrte.B1116.0782S319</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2277-3878
ispartof International journal of recent technology and engineering, 2019-08, Vol.8 (2S3), p.629-637
issn 2277-3878
2277-3878
language eng
recordid cdi_crossref_primary_10_35940_ijrte_B1116_0782S319
source Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals
title A Systematic Judgement to Automated Programming Contracts Generation
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-15T01%3A54%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Systematic%20Judgement%20to%20Automated%20Programming%20Contracts%20Generation&rft.jtitle=International%20journal%20of%20recent%20technology%20and%20engineering&rft.date=2019-08-10&rft.volume=8&rft.issue=2S3&rft.spage=629&rft.epage=637&rft.pages=629-637&rft.issn=2277-3878&rft.eissn=2277-3878&rft_id=info:doi/10.35940/ijrte.B1116.0782S319&rft_dat=%3Ccrossref%3E10_35940_ijrte_B1116_0782S319%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true