CINXE.COM

<!DOCTYPE html> <html lang="en" xmlns:fb="http://www.facebook.com/2008/fbml" class="wf-loading"> <head prefix="og: https://ogp.me/ns# fb: https://ogp.me/ns/fb# academia: https://ogp.me/ns/fb/academia#"> <meta charset="utf-8"> <meta name=viewport content="width=device-width, initial-scale=1"> <meta rel="search" type="application/opensearchdescription+xml" href="/open_search.xml" title="Academia.edu"> <title>Formal Methods (Formal Verification) Research Papers - Academia.edu</title>  <link href="//a.academia-assets.com/images/favicons/favicon-production.ico" rel="shortcut icon" type="image/vnd.microsoft.icon"> <link rel="apple-touch-icon" sizes="57x57" href="//a.academia-assets.com/images/favicons/apple-touch-icon-57x57.png"> <link rel="apple-touch-icon" sizes="60x60" href="//a.academia-assets.com/images/favicons/apple-touch-icon-60x60.png"> <link rel="apple-touch-icon" sizes="72x72" href="//a.academia-assets.com/images/favicons/apple-touch-icon-72x72.png"> <link rel="apple-touch-icon" sizes="76x76" href="//a.academia-assets.com/images/favicons/apple-touch-icon-76x76.png"> <link rel="apple-touch-icon" sizes="114x114" href="//a.academia-assets.com/images/favicons/apple-touch-icon-114x114.png"> <link rel="apple-touch-icon" sizes="120x120" href="//a.academia-assets.com/images/favicons/apple-touch-icon-120x120.png"> <link rel="apple-touch-icon" sizes="144x144" href="//a.academia-assets.com/images/favicons/apple-touch-icon-144x144.png"> <link rel="apple-touch-icon" sizes="152x152" href="//a.academia-assets.com/images/favicons/apple-touch-icon-152x152.png"> <link rel="apple-touch-icon" sizes="180x180" href="//a.academia-assets.com/images/favicons/apple-touch-icon-180x180.png"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-32x32.png" sizes="32x32"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-194x194.png" sizes="194x194"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-96x96.png" sizes="96x96"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/android-chrome-192x192.png" sizes="192x192"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-16x16.png" sizes="16x16"> <link rel="manifest" href="//a.academia-assets.com/images/favicons/manifest.json"> <meta name="msapplication-TileColor" content="#2b5797"> <meta name="msapplication-TileImage" content="//a.academia-assets.com/images/favicons/mstile-144x144.png"> <meta name="theme-color" content="#ffffff"> <script> window.performance && window.performance.measure && window.performance.measure("Time To First Byte", "requestStart", "responseStart"); </script> <script> (function() { if (!window.URLSearchParams || !window.history || !window.history.replaceState) { return; } var searchParams = new URLSearchParams(window.location.search); var paramsToDelete = [ 'fs', 'sm', 'swp', 'iid', 'nbs', 'rcc', // related content category 'rcpos', // related content carousel position 'rcpg', // related carousel page 'rchid', // related content hit id 'f_ri', // research interest id, for SEO tracking 'f_fri', // featured research interest, for SEO tracking (param key without value) 'f_rid', // from research interest directory for SEO tracking 'f_loswp', // from research interest pills on LOSWP sidebar for SEO tracking 'rhid', // referrring hit id ]; if (paramsToDelete.every((key) => searchParams.get(key) === null)) { return; } paramsToDelete.forEach((key) => { searchParams.delete(key); }); var cleanUrl = new URL(window.location.href); cleanUrl.search = searchParams.toString(); history.replaceState({}, document.title, cleanUrl); })(); </script> <script async src="https://www.googletagmanager.com/gtag/js?id=G-5VKX33P2DS"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-5VKX33P2DS', { cookie_domain: 'academia.edu', send_page_view: false, }); gtag('event', 'page_view', { 'controller': "by_tag", 'action': "show_one", 'controller_action': 'by_tag#show_one', 'logged_in': 'false', 'edge': 'unknown', // Send nil if there is no A/B test bucket, in case some records get logged // with missing data - that way we can distinguish between the two cases. // ab_test_bucket should be of the form <ab_test_name>:<bucket> 'ab_test_bucket': null, }) </script> <script type="text/javascript"> window.sendUserTiming = function(timingName) { if (!(window.performance && window.performance.measure)) return; var entries = window.performance.getEntriesByName(timingName, "measure"); if (entries.length !== 1) return; var timingValue = Math.round(entries[0].duration); gtag('event', 'timing_complete', { name: timingName, value: timingValue, event_category: 'User-centric', }); }; window.sendUserTiming("Time To First Byte"); </script> <meta name="csrf-param" content="authenticity_token" /> <meta name="csrf-token" content="QqgjBJ/gi1XzIO+u1FmH0lomje5jDnyf2MO0wW72zaW7VoXmREw1DE1Lla5PHVKgwZ5h0OP6LsumgiLaDM9oiQ==" /> <link href="/Documents/in/Formal_Methods_Formal_Verification_?after=50%2C4077419" rel="next" /><link crossorigin="" href="https://fonts.gstatic.com/" rel="preconnect" /><link href="https://fonts.googleapis.com/css2?family=DM+Sans:ital,opsz,wght@0,9..40,100..1000;1,9..40,100..1000&family=Gupter:wght@400;500;700&family=IBM+Plex+Mono:wght@300;400&family=Material+Symbols+Outlined:opsz,wght,FILL,GRAD@20,400,0,0&display=swap" rel="stylesheet" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system/common-10fa40af19d25203774df2d4a03b9b5771b45109c2304968038e88a81d1215c5.css" /> <meta name="description" content="View Formal Methods (Formal Verification) Research Papers on Academia.edu for free." /> <meta name="google-site-verification" content="bKJMBZA7E43xhDOopFZkssMMkBRjvYERV-NaN4R6mrs" /> <script> var $controller_name = 'by_tag'; var $action_name = "show_one"; var $rails_env = 'production'; var $app_rev = 'f7aa7b607b04a3dbf06b3308f43c8eaaa9a396d9'; var $domain = 'academia.edu'; var $app_host = "academia.edu"; var $asset_host = "academia-assets.com"; var $start_time = new Date().getTime(); var $recaptcha_key = "6LdxlRMTAAAAADnu_zyLhLg0YF9uACwz78shpjJB"; var $recaptcha_invisible_key = "6Lf3KHUUAAAAACggoMpmGJdQDtiyrjVlvGJ6BbAj"; var $disableClientRecordHit = false; </script> <script> window.Aedu = { hit_data: null }; window.Aedu.SiteStats = {"premium_universities_count":15252,"monthly_visitors":"120 million","monthly_visitor_count":120260779,"monthly_visitor_count_in_millions":120,"user_count":278652207,"paper_count":55203019,"paper_count_in_millions":55,"page_count":432000000,"page_count_in_millions":432,"pdf_count":16500000,"pdf_count_in_millions":16}; window.Aedu.serverRenderTime = new Date(1734023123000); window.Aedu.timeDifference = new Date().getTime() - 1734023123000; window.Aedu.isUsingCssV1 = false; window.Aedu.enableLocalization = true; window.Aedu.activateFullstory = false; window.Aedu.serviceAvailability = { status: {"attention_db":"on","bibliography_db":"on","contacts_db":"on","email_db":"on","indexability_db":"on","mentions_db":"on","news_db":"on","notifications_db":"on","offsite_mentions_db":"on","redshift":"on","redshift_exports_db":"on","related_works_db":"on","ring_db":"on","user_tests_db":"on"}, serviceEnabled: function(service) { return this.status[service] === "on"; }, readEnabled: function(service) { return this.serviceEnabled(service) || this.status[service] === "read_only"; }, }; window.Aedu.viewApmTrace = function() { // Check if x-apm-trace-id meta tag is set, and open the trace in APM // in a new window if it is. var apmTraceId = document.head.querySelector('meta[name="x-apm-trace-id"]'); if (apmTraceId) { var traceId = apmTraceId.content; // Use trace ID to construct URL, an example URL looks like: // https://app.datadoghq.com/apm/traces?query=trace_id%31298410148923562634 var apmUrl = 'https://app.datadoghq.com/apm/traces?query=trace_id%3A' + traceId; window.open(apmUrl, '_blank'); } }; </script>  <link href="https://fonts.googleapis.com/css?family=Roboto:100,100i,300,300i,400,400i,500,500i,700,700i,900,900i" rel="stylesheet"> <link href="//maxcdn.bootstrapcdn.com/font-awesome/4.3.0/css/font-awesome.min.css" rel="stylesheet"> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/libraries-a9675dcb01ec4ef6aa807ba772c7a5a00c1820d3ff661c1038a20f80d06bb4e4.css" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/academia-0fb6fc03c471832908791ad7ddba619b6165b3ccf7ae0f65cf933f34b0b660a7.css" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system_legacy-056a9113b9a0f5343d013b29ee1929d5a18be35fdcdceb616600b4db8bd20054.css" /> <script src="//a.academia-assets.com/assets/webpack_bundles/runtime-bundle-005434038af4252ca37c527588411a3d6a0eabb5f727fac83f8bbe7fd88d93bb.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/webpack_libraries_and_infrequently_changed.wjs-bundle-2eebbf16f94e23df09908fc0eb355e7d088296bc7bbbbe96567743814345fdd9.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/core_webpack.wjs-bundle-086d9084944b0c8a793ea96ac398b4180db6177bb674e9655034fb25e834c8b4.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/sentry.wjs-bundle-5fe03fddca915c8ba0f7edbe64c194308e8ce5abaed7bffe1255ff37549c4808.js"></script> <script> jade = window.jade || {}; jade.helpers = window.$h; jade._ = window._; </script>  <script id="tag-manager-head-root">(function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0], j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src= 'https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f); })(window,document,'script','dataLayer_old','GTM-5G9JF7Z');</script>  <script> window.gptadslots = []; window.googletag = window.googletag || {}; window.googletag.cmd = window.googletag.cmd || []; </script> <script type="text/javascript"> // TODO(jacob): This should be defined, may be rare load order problem. // Checking if null is just a quick fix, will default to en if unset. // Better fix is to run this immedietely after I18n is set. if (window.I18n != null) { I18n.defaultLocale = "en"; I18n.locale = "en"; I18n.fallbacks = true; } </script> <link rel="canonical" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_" /> </head>   <body class='c-by_tag a-show_one logged_out u-bgColorWhite'>  <div id="fb-root"></div><script>window.fbAsyncInit = function() { FB.init({ appId: "2369844204", version: "v8.0", status: true, cookie: true, xfbml: true }); // Additional initialization code. if (window.InitFacebook) { // facebook.ts already loaded, set it up. window.InitFacebook(); } else { // Set a flag for facebook.ts to find when it loads. window.academiaAuthReadyFacebook = true; } };</script><script>window.fbAsyncLoad = function() { // Protection against double calling of this function if (window.FB) { return; } (function(d, s, id){ var js, fjs = d.getElementsByTagName(s)[0]; if (d.getElementById(id)) {return;} js = d.createElement(s); js.id = id; js.src = "//connect.facebook.net/en_US/sdk.js"; fjs.parentNode.insertBefore(js, fjs); }(document, 'script', 'facebook-jssdk')); } if (!window.defer_facebook) { // Autoload if not deferred window.fbAsyncLoad(); } else { // Defer loading by 5 seconds setTimeout(function() { window.fbAsyncLoad(); }, 5000); }</script> <div id="google-root"></div><script>window.loadGoogle = function() { if (window.InitGoogle) { // google.ts already loaded, set it up. window.InitGoogle("331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b"); } else { // Set a flag for google.ts to use when it loads. window.GoogleClientID = "331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b"; } };</script><script>window.googleAsyncLoad = function() { // Protection against double calling of this function (function(d) { var js; var id = 'google-jssdk'; var ref = d.getElementsByTagName('script')[0]; if (d.getElementById(id)) { return; } js = d.createElement('script'); js.id = id; js.async = true; js.onload = loadGoogle; js.src = "https://accounts.google.com/gsi/client" ref.parentNode.insertBefore(js, ref); }(document)); } if (!window.defer_google) { // Autoload if not deferred window.googleAsyncLoad(); } else { // Defer loading by 5 seconds setTimeout(function() { window.googleAsyncLoad(); }, 5000); }</script> <div id="tag-manager-body-root">  <noscript><iframe src="https://www.googletagmanager.com/ns.html?id=GTM-5G9JF7Z" height="0" width="0" style="display:none;visibility:hidden"></iframe></noscript>   <script> window.addEventListener('load', function() { if (document.querySelector('input[name="commit"]')) { document.querySelector('input[name="commit"]').addEventListener('click', function() { gtag('event', 'click', { event_category: 'button', event_label: 'Log In' }) }) } }); </script> </div> <script>var _comscore = _comscore || []; _comscore.push({ c1: "2", c2: "26766707" }); (function() { var s = document.createElement("script"), el = document.getElementsByTagName("script")[0]; s.async = true; s.src = (document.location.protocol == "https:" ? "https://sb" : "http://b") + ".scorecardresearch.com/beacon.js"; el.parentNode.insertBefore(s, el); })();</script><img src="https://sb.scorecardresearch.com/p?c1=2&c2=26766707&cv=2.0&cj=1" style="position: absolute; visibility: hidden" /> <div id='react-modal'></div> <div class='DesignSystem'> <a class='u-showOnFocus' href='#site'> Skip to main content </a> </div> <div id="upgrade_ie_banner" style="display: none;"><p>Academia.edu no longer supports Internet Explorer.</p><p>To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to <a href="https://www.academia.edu/upgrade-browser">upgrade your browser</a>.</p></div><script>// Show this banner for all versions of IE if (!!window.MSInputMethodContext || /(MSIE)/.test(navigator.userAgent)) { document.getElementById('upgrade_ie_banner').style.display = 'block'; }</script> <div class="DesignSystem bootstrap ShrinkableNav no-sm no-md"><div class="navbar navbar-default main-header"><div class="container-wrapper" id="main-header-container"><div class="container"><div class="navbar-header"><div class="nav-left-wrapper u-mt0x"><div class="nav-logo"><a data-main-header-link-target="logo_home" href="https://www.academia.edu/"><img class="visible-xs-inline-block" style="height: 24px;" alt="Academia.edu" src="//a.academia-assets.com/images/academia-logo-redesign-2015-A.svg" width="24" height="24" /><img width="145.2" height="18" class="hidden-xs" style="height: 24px;" alt="Academia.edu" src="//a.academia-assets.com/images/academia-logo-redesign-2015.svg" /></a></div><div class="nav-search"><div class="SiteSearch-wrapper select2-no-default-pills"><form class="js-SiteSearch-form DesignSystem" action="https://www.academia.edu/search" accept-charset="UTF-8" method="get"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><i class="SiteSearch-icon fa fa-search u-fw700 u-positionAbsolute u-tcGrayDark"></i><input class="js-SiteSearch-form-input SiteSearch-form-input form-control" data-main-header-click-target="search_input" name="q" placeholder="Search" type="text" value="" /></form></div></div></div><div class="nav-right-wrapper pull-right"><ul class="NavLinks js-main-nav list-unstyled"><li class="NavLinks-link"><a class="js-header-login-url Button Button--inverseGray Button--sm u-mb4x" id="nav_log_in" rel="nofollow" href="https://www.academia.edu/login">Log In</a></li><li class="NavLinks-link u-p0x"><a class="Button Button--inverseGray Button--sm u-mb4x" rel="nofollow" href="https://www.academia.edu/signup">Sign Up</a></li></ul><button class="hidden-lg hidden-md hidden-sm u-ml4x navbar-toggle collapsed" data-target=".js-mobile-header-links" data-toggle="collapse" type="button"><span class="icon-bar"></span><span class="icon-bar"></span><span class="icon-bar"></span></button></div></div><div class="collapse navbar-collapse js-mobile-header-links"><ul class="nav navbar-nav"><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/login">Log In</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/signup">Sign Up</a></li><li class="u-borderColorGrayLight u-borderBottom1 js-mobile-nav-expand-trigger"><a href="#">more&nbsp<span class="caret"></span></a></li><li><ul class="js-mobile-nav-expand-section nav navbar-nav u-m0x collapse"><li class="u-borderColorGrayLight u-borderBottom1"><a rel="false" href="https://www.academia.edu/about">About</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/press">Press</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="false" href="https://www.academia.edu/documents">Papers</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/terms">Terms</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/privacy">Privacy</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/copyright">Copyright</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/hiring"><i class="fa fa-briefcase"></i> We're Hiring!</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://support.academia.edu/"><i class="fa fa-question-circle"></i> Help Center</a></li><li class="js-mobile-nav-collapse-trigger u-borderColorGrayLight u-borderBottom1 dropup" style="display:none"><a href="#">less&nbsp<span class="caret"></span></a></li></ul></li></ul></div></div></div><script>(function(){ var $moreLink = $(".js-mobile-nav-expand-trigger"); var $lessLink = $(".js-mobile-nav-collapse-trigger"); var $section = $('.js-mobile-nav-expand-section'); $moreLink.click(function(ev){ ev.preventDefault(); $moreLink.hide(); $lessLink.show(); $section.collapse('show'); }); $lessLink.click(function(ev){ ev.preventDefault(); $moreLink.show(); $lessLink.hide(); $section.collapse('hide'); }); })() if ($a.is_logged_in() || false) { new Aedu.NavigationController({ el: '.js-main-nav', showHighlightedNotification: false }); } else { $(".js-header-login-url").attr("href", $a.loginUrlWithRedirect()); } Aedu.autocompleteSearch = new AutocompleteSearch({el: '.js-SiteSearch-form'});</script></div></div> <div id='site' class='fixed'> <div id="content" class="clearfix"> <script>document.addEventListener('DOMContentLoaded', function(){ var $dismissible = $(".dismissible_banner"); $dismissible.click(function(ev) { $dismissible.hide(); }); });</script> <div class="DesignSystem" style="margin-top:-40px"><div class="PageHeader"><div class="container"><div class="row"><style type="text/css">.sor-abstract { display: -webkit-box; overflow: hidden; text-overflow: ellipsis; -webkit-line-clamp: 3; -webkit-box-orient: vertical; }</style><div class="col-xs-12 clearfix"><div class="u-floatLeft"><h1 class="PageHeader-title u-m0x u-fs30">Formal Methods (Formal Verification)</h1><div class="u-tcGrayDark">15,769 Followers</div><div class="u-tcGrayDark u-mt2x">Recent papers in <b>Formal Methods (Formal Verification)</b></div></div></div></div></div></div><div class="TabbedNavigation"><div class="container"><div class="row"><div class="col-xs-12 clearfix"><ul class="nav u-m0x u-p0x list-inline u-displayFlex"><li class="active"><a href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Top Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_/MostCited">Most Cited Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_/MostDownloaded">Most Downloaded Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_/MostRecent">Newest Papers</a></li><li><a class="" href="https://www.academia.edu/People/Formal_Methods_Formal_Verification_">People</a></li></ul></div><style type="text/css">ul.nav{flex-direction:row}@media(max-width: 567px){ul.nav{flex-direction:column}.TabbedNavigation li{max-width:100%}.TabbedNavigation li.active{background-color:var(--background-grey, #dddde2)}.TabbedNavigation li.active:before,.TabbedNavigation li.active:after{display:none}}</style></div></div></div><div class="container"><div class="row"><div class="col-xs-12"><div class="u-displayFlex"><div class="u-flexGrow1"><div class="works"><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_1741963" data-work_id="1741963" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/1741963/Formal_Specification_and_Documentation_using_Z_A_Case_Study_Approach_slides_and_exercises_">Formal Specification and Documentation using Z: A Case Study Approach (slides and exercises)</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest">Online material for a Z course based on the book by the author. This includes slides for some chapters and the exercises. Updated in July 1998 with minor corrections and improved formatting.</div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/1741963" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="bfae62dbb5d6337a47e8c019fa618d4c" rel="nofollow" data-download="{"attachment_id":4892606,"asset_id":1741963,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/4892606/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="12280" href="https://lsbu.academia.edu/JonathanBowen">Jonathan Bowen</a><script data-card-contents-for-user="12280" type="text/json">{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}</script></span></span></li><li class="js-paper-rank-work_1741963 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="1741963"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 1741963, container: ".js-paper-rank-work_1741963", }); });</script></li><li class="js-percentile-work_1741963 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 1741963; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_1741963"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_1741963 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="1741963"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 1741963; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=1741963]").text(description); $(".js-view-count-work_1741963").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_1741963").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="1741963"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">14</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="363" href="https://www.academia.edu/Documents/in/Set_Theory">Set Theory</a>, <script data-card-contents-for-ri="363" type="text/json">{"id":363,"name":"Set Theory","url":"https://www.academia.edu/Documents/in/Set_Theory?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a><script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=1741963]'), work: {"id":1741963,"title":"Formal Specification and Documentation using Z: A Case Study Approach (slides and exercises)","created_at":"2011-08-09T00:31:03.908-07:00","url":"https://www.academia.edu/1741963/Formal_Specification_and_Documentation_using_Z_A_Case_Study_Approach_slides_and_exercises_?f_ri=450","dom_id":"work_1741963","summary":"Online material for a Z course based on the book by the author. This includes slides for some chapters and the exercises. Updated in July 1998 with minor corrections and improved formatting.","downloadable_attachments":[{"id":4892606,"asset_id":1741963,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}],"research_interests":[{"id":363,"name":"Set Theory","url":"https://www.academia.edu/Documents/in/Set_Theory?f_ri=450","nofollow":false},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":924,"name":"Logic","url":"https://www.academia.edu/Documents/in/Logic?f_ri=450"},{"id":1128,"name":"Computer Science Education","url":"https://www.academia.edu/Documents/in/Computer_Science_Education?f_ri=450"},{"id":1380,"name":"Computer Engineering","url":"https://www.academia.edu/Documents/in/Computer_Engineering?f_ri=450"},{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=450"},{"id":9967,"name":"Software Engineering education","url":"https://www.academia.edu/Documents/in/Software_Engineering_education?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":17442,"name":"Mathematical Logic","url":"https://www.academia.edu/Documents/in/Mathematical_Logic?f_ri=450"},{"id":28530,"name":"Software Quality Engineering","url":"https://www.academia.edu/Documents/in/Software_Quality_Engineering?f_ri=450"},{"id":57987,"name":"Software Quality","url":"https://www.academia.edu/Documents/in/Software_Quality?f_ri=450"},{"id":130836,"name":"Z Notation","url":"https://www.academia.edu/Documents/in/Z_Notation?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_8273484" data-work_id="8273484" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/8273484/An_analysis_of_ATPG_and_SAT_algorithms_for_formal_verification">An analysis of ATPG and SAT algorithms for formal verification</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">We analyze the performance of satisfiability (SAT) and Automatic Test Pattern Generation (ATPG) algorithms in two state-of-the-art solvers. The goal is to best understand how features of each solver are suited for hardware verification.... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_8273484" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">We analyze the performance of satisfiability (SAT) and Automatic Test Pattern Generation (ATPG) algorithms in two state-of-the-art solvers. The goal is to best understand how features of each solver are suited for hardware verification. For ATPG, we analyze depthfirst and breadth-first decision orderings and effects of two weighting heuristics in the decision ordering, and also study the effect of randomization of decisions. Features of ATPG and SAT that affect their robustness and flexibility on real circuits are studied, and the two solvers are compared on 24 industrial circuits. We further analyze the results to identify the strengths and shortcomings of each solver. This will enable incorporation of features from each solver in order to optimize performance, since they both operate on the same principles.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/8273484" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="0aec6fe2adcbb1c58d2d4f6a1df5e2e1" rel="nofollow" data-download="{"attachment_id":48159396,"asset_id":8273484,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48159396/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="16397570" href="https://independent.academia.edu/GanapathyParthasarathy">Ganapathy Parthasarathy</a><script data-card-contents-for-user="16397570" type="text/json">{"id":16397570,"first_name":"Ganapathy","last_name":"Parthasarathy","domain_name":"independent","page_name":"GanapathyParthasarathy","display_name":"Ganapathy Parthasarathy","profile_url":"https://independent.academia.edu/GanapathyParthasarathy?f_ri=450","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_8273484 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="8273484"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 8273484, container: ".js-paper-rank-work_8273484", }); });</script></li><li class="js-percentile-work_8273484 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 8273484; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_8273484"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_8273484 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="8273484"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 8273484; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=8273484]").text(description); $(".js-view-count-work_8273484").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_8273484").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="8273484"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">2</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="31580" href="https://www.academia.edu/Documents/in/Algorithms_for_Satisfiability">Algorithms for Satisfiability</a><script data-card-contents-for-ri="31580" type="text/json">{"id":31580,"name":"Algorithms for Satisfiability","url":"https://www.academia.edu/Documents/in/Algorithms_for_Satisfiability?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=8273484]'), work: {"id":8273484,"title":"An analysis of ATPG and SAT algorithms for formal verification","created_at":"2014-09-10T06:26:08.286-07:00","url":"https://www.academia.edu/8273484/An_analysis_of_ATPG_and_SAT_algorithms_for_formal_verification?f_ri=450","dom_id":"work_8273484","summary":"We analyze the performance of satisfiability (SAT) and Automatic Test Pattern Generation (ATPG) algorithms in two state-of-the-art solvers. The goal is to best understand how features of each solver are suited for hardware verification. For ATPG, we analyze depthfirst and breadth-first decision orderings and effects of two weighting heuristics in the decision ordering, and also study the effect of randomization of decisions. Features of ATPG and SAT that affect their robustness and flexibility on real circuits are studied, and the two solvers are compared on 24 industrial circuits. We further analyze the results to identify the strengths and shortcomings of each solver. This will enable incorporation of features from each solver in order to optimize performance, since they both operate on the same principles.","downloadable_attachments":[{"id":48159396,"asset_id":8273484,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":16397570,"first_name":"Ganapathy","last_name":"Parthasarathy","domain_name":"independent","page_name":"GanapathyParthasarathy","display_name":"Ganapathy Parthasarathy","profile_url":"https://independent.academia.edu/GanapathyParthasarathy?f_ri=450","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":31580,"name":"Algorithms for Satisfiability","url":"https://www.academia.edu/Documents/in/Algorithms_for_Satisfiability?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_475656" data-work_id="475656" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/475656/Formal_Development_of_a_Cardiac_Pacemaker_from_Specification_to_Code">Formal Development of a Cardiac Pacemaker: from Specification to Code</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">"This paper presents a formal development of a cardiac pacing system based on a Boston Scientific’s model, a pilot case study from the Grand Challenge in Software Verification. We present a summary of our Z model of the system, its... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_475656" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">"This paper presents a formal development of a cardiac pacing <br />system based on a Boston Scientific’s model, a pilot case study from the Grand Challenge in Software Verification. We present a summary of our Z model of the system, its translation into Perfect Developer, and the code generation and execution. Further practical result and analysis are also in the context of this paper. <br />Keywords: formal modelling, Z, refinement, Perfect Developer, pacemaker."</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/475656" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="7ba21a3022da776b7198081456ff61ea" rel="nofollow" data-download="{"attachment_id":48896950,"asset_id":475656,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48896950/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="364334" href="https://independent.academia.edu/ArturGomes68">Artur Gomes</a><script data-card-contents-for-user="364334" type="text/json">{"id":364334,"first_name":"Artur","last_name":"Gomes","domain_name":"independent","page_name":"ArturGomes68","display_name":"Artur Gomes","profile_url":"https://independent.academia.edu/ArturGomes68?f_ri=450","photo":"https://0.academia-photos.com/364334/111500/185920/s65_artur.gomes.jpg"}</script></span></span></li><li class="js-paper-rank-work_475656 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="475656"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 475656, container: ".js-paper-rank-work_475656", }); });</script></li><li class="js-percentile-work_475656 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 475656; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_475656"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_475656 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="475656"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 475656; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=475656]").text(description); $(".js-view-count-work_475656").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_475656").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="475656"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="424" href="https://www.academia.edu/Documents/in/Automata_Theory_Formal_Languages_">Automata Theory (Formal Languages)</a>, <script data-card-contents-for-ri="424" type="text/json">{"id":424,"name":"Automata Theory (Formal Languages)","url":"https://www.academia.edu/Documents/in/Automata_Theory_Formal_Languages_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="4702" href="https://www.academia.edu/Documents/in/Case_Study_Research">Case Study Research</a><script data-card-contents-for-ri="4702" type="text/json">{"id":4702,"name":"Case Study Research","url":"https://www.academia.edu/Documents/in/Case_Study_Research?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=475656]'), work: {"id":475656,"title":"Formal Development of a Cardiac Pacemaker: from Specification to Code","created_at":"2011-03-15T06:38:45.663-07:00","url":"https://www.academia.edu/475656/Formal_Development_of_a_Cardiac_Pacemaker_from_Specification_to_Code?f_ri=450","dom_id":"work_475656","summary":"\"This paper presents a formal development of a cardiac pacing\r\nsystem based on a Boston Scientific’s model, a pilot case study from the Grand Challenge in Software Verification. We present a summary of our Z model of the system, its translation into Perfect Developer, and the code generation and execution. Further practical result and analysis are also in the context of this paper.\r\nKeywords: formal modelling, Z, refinement, Perfect Developer, pacemaker.\"","downloadable_attachments":[{"id":48896950,"asset_id":475656,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":364334,"first_name":"Artur","last_name":"Gomes","domain_name":"independent","page_name":"ArturGomes68","display_name":"Artur Gomes","profile_url":"https://independent.academia.edu/ArturGomes68?f_ri=450","photo":"https://0.academia-photos.com/364334/111500/185920/s65_artur.gomes.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":424,"name":"Automata Theory (Formal Languages)","url":"https://www.academia.edu/Documents/in/Automata_Theory_Formal_Languages_?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":4702,"name":"Case Study Research","url":"https://www.academia.edu/Documents/in/Case_Study_Research?f_ri=450","nofollow":false},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=450"},{"id":127370,"name":"Bio-Medical Engineering","url":"https://www.academia.edu/Documents/in/Bio-Medical_Engineering?f_ri=450"},{"id":139879,"name":"Engenharia de Software","url":"https://www.academia.edu/Documents/in/Engenharia_de_Software?f_ri=450"},{"id":273061,"name":"Ciência da Computação","url":"https://www.academia.edu/Documents/in/Ci%C3%AAncia_da_Computa%C3%A7%C3%A3o?f_ri=450"},{"id":294877,"name":"Metodos Formais","url":"https://www.academia.edu/Documents/in/Metodos_Formais?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_32929787" data-work_id="32929787" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/32929787/A_USER_STORY_QUALITY_MEASUREMENT_MODEL_FOR_REDUCING_AGILE_SOFTWARE_DEVELOPMENT_RISK">A USER STORY QUALITY MEASUREMENT MODEL FOR REDUCING AGILE SOFTWARE DEVELOPMENT RISK</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In Mobile communications age, the IT environment and IT technology update rapidly. The requirements change is the software project must face challenge. Able to overcome the impact of requirements change, software development risks can be... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_32929787" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In Mobile communications age, the IT environment and IT technology update rapidly. The requirements change is the software project must face challenge. Able to overcome the impact of requirements change, software development risks can be effectively reduced. Agile software development uses the Iterative and Incremental Development (IID) process and focuses on the workable software and client communication. Agile software development is a very suitable development method for handling the requirements change in software development process. In agile development, user stories are the important documents for the client communication and criteria of acceptance test. However, the agile development doesn't pay attention to the formal requirements analysis and artifacts tracability to cause the potential risks of software change management. In this paper, analyzing and collecting the critical quality factors of user stories, and proposes the User Story Quality Measurement (USQM) model. Applied USQM model, the requirements quality of agile development can be enhanced and risks of requirement changes can be reduced.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/32929787" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="2be513b0f7cd9cc83ec320b639a61160" rel="nofollow" data-download="{"attachment_id":53063334,"asset_id":32929787,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/53063334/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="21169291" href="https://independent.academia.edu/IjseaJournal">International Journal of Software Engineering & Applications (IJSEA)-ERA Indexed</a><script data-card-contents-for-user="21169291" type="text/json">{"id":21169291,"first_name":"International Journal of Software Engineering \u0026 Applications","last_name":"(IJSEA)-ERA Indexed","domain_name":"independent","page_name":"IjseaJournal","display_name":"International Journal of Software Engineering \u0026 Applications (IJSEA)-ERA Indexed","profile_url":"https://independent.academia.edu/IjseaJournal?f_ri=450","photo":"https://0.academia-photos.com/21169291/5886224/84098518/s65_international_journal_of_software_engineering_applications._ijsea_-era_indexed.png"}</script></span></span></li><li class="js-paper-rank-work_32929787 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="32929787"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 32929787, container: ".js-paper-rank-work_32929787", }); });</script></li><li class="js-percentile-work_32929787 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 32929787; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_32929787"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_32929787 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="32929787"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 32929787; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=32929787]").text(description); $(".js-view-count-work_32929787").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_32929787").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="32929787"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1384" href="https://www.academia.edu/Documents/in/Web_Engineering">Web Engineering</a>, <script data-card-contents-for-ri="1384" type="text/json">{"id":1384,"name":"Web Engineering","url":"https://www.academia.edu/Documents/in/Web_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1450" href="https://www.academia.edu/Documents/in/Software_Maintenance">Software Maintenance</a><script data-card-contents-for-ri="1450" type="text/json">{"id":1450,"name":"Software Maintenance","url":"https://www.academia.edu/Documents/in/Software_Maintenance?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=32929787]'), work: {"id":32929787,"title":"A USER STORY QUALITY MEASUREMENT MODEL FOR REDUCING AGILE SOFTWARE DEVELOPMENT RISK","created_at":"2017-05-09T18:50:05.846-07:00","url":"https://www.academia.edu/32929787/A_USER_STORY_QUALITY_MEASUREMENT_MODEL_FOR_REDUCING_AGILE_SOFTWARE_DEVELOPMENT_RISK?f_ri=450","dom_id":"work_32929787","summary":"In Mobile communications age, the IT environment and IT technology update rapidly. The requirements change is the software project must face challenge. Able to overcome the impact of requirements change, software development risks can be effectively reduced. Agile software development uses the Iterative and Incremental Development (IID) process and focuses on the workable software and client communication. Agile software development is a very suitable development method for handling the requirements change in software development process. In agile development, user stories are the important documents for the client communication and criteria of acceptance test. However, the agile development doesn't pay attention to the formal requirements analysis and artifacts tracability to cause the potential risks of software change management. In this paper, analyzing and collecting the critical quality factors of user stories, and proposes the User Story Quality Measurement (USQM) model. Applied USQM model, the requirements quality of agile development can be enhanced and risks of requirement changes can be reduced.","downloadable_attachments":[{"id":53063334,"asset_id":32929787,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":21169291,"first_name":"International Journal of Software Engineering \u0026 Applications","last_name":"(IJSEA)-ERA Indexed","domain_name":"independent","page_name":"IjseaJournal","display_name":"International Journal of Software Engineering \u0026 Applications (IJSEA)-ERA Indexed","profile_url":"https://independent.academia.edu/IjseaJournal?f_ri=450","photo":"https://0.academia-photos.com/21169291/5886224/84098518/s65_international_journal_of_software_engineering_applications._ijsea_-era_indexed.png"}],"research_interests":[{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":1384,"name":"Web Engineering","url":"https://www.academia.edu/Documents/in/Web_Engineering?f_ri=450","nofollow":false},{"id":1450,"name":"Software Maintenance","url":"https://www.academia.edu/Documents/in/Software_Maintenance?f_ri=450","nofollow":false},{"id":1451,"name":"Quality Management","url":"https://www.academia.edu/Documents/in/Quality_Management?f_ri=450"},{"id":2277,"name":"Project Management","url":"https://www.academia.edu/Documents/in/Project_Management?f_ri=450"},{"id":3419,"name":"Multimedia","url":"https://www.academia.edu/Documents/in/Multimedia?f_ri=450"},{"id":4065,"name":"Software Process Improvement and Assessment","url":"https://www.academia.edu/Documents/in/Software_Process_Improvement_and_Assessment?f_ri=450"},{"id":4761,"name":"Software Testing","url":"https://www.academia.edu/Documents/in/Software_Testing?f_ri=450"},{"id":5242,"name":"Agile Software Process Improvement","url":"https://www.academia.edu/Documents/in/Agile_Software_Process_Improvement?f_ri=450"},{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=450"},{"id":9270,"name":"Software Architecture","url":"https://www.academia.edu/Documents/in/Software_Architecture?f_ri=450"},{"id":12061,"name":"Risk Management","url":"https://www.academia.edu/Documents/in/Risk_Management?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":25795,"name":"Testing","url":"https://www.academia.edu/Documents/in/Testing?f_ri=450"},{"id":190001,"name":"Agile software development","url":"https://www.academia.edu/Documents/in/Agile_software_development?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_9735577" data-work_id="9735577" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/9735577/Distributable_Communication_Protocols_for_Platform_Independent_Software_Designs">Distributable Communication Protocols for Platform Independent Software Designs</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">We define three abstract protocols which are appropriate for characterising communications in real-time system designs. These protocols abstract from details of distribution and synchronisation. This makes them suitable for use early in... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_9735577" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">We define three abstract protocols which are appropriate for characterising communications in real-time system designs. These protocols abstract from details of distribution and synchronisation. This makes them suitable for use early in the design process, before the details of hardware network and software design deployment are finalised. The specifications are given in CSP, and are shown by model-checking to be valid abstractions of various distributed and local implementations. The utility of the protocols is demonstrated by showing that important properties can be established of designs which employ them, such as whether data must be processed once, or whether it may be processed more than once</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/9735577" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="76abd9a0e21ec77048bcebadee109a72" rel="nofollow" data-download="{"attachment_id":35920696,"asset_id":9735577,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/35920696/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4204625" href="https://independent.academia.edu/StevePaynter">Steve Paynter</a><script data-card-contents-for-user="4204625" type="text/json">{"id":4204625,"first_name":"Steve","last_name":"Paynter","domain_name":"independent","page_name":"StevePaynter","display_name":"Steve Paynter","profile_url":"https://independent.academia.edu/StevePaynter?f_ri=450","photo":"https://0.academia-photos.com/4204625/1652327/7179275/s65_steve.paynter.jpg"}</script></span></span></li><li class="js-paper-rank-work_9735577 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="9735577"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 9735577, container: ".js-paper-rank-work_9735577", }); });</script></li><li class="js-percentile-work_9735577 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 9735577; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_9735577"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_9735577 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="9735577"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 9735577; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=9735577]").text(description); $(".js-view-count-work_9735577").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_9735577").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="9735577"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="440" href="https://www.academia.edu/Documents/in/Distributed_Computing">Distributed Computing</a>, <script data-card-contents-for-ri="440" type="text/json">{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="57939" href="https://www.academia.edu/Documents/in/Software_Design">Software Design</a>, <script data-card-contents-for-ri="57939" type="text/json">{"id":57939,"name":"Software Design","url":"https://www.academia.edu/Documents/in/Software_Design?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="93194" href="https://www.academia.edu/Documents/in/Asynchronous_Communication">Asynchronous Communication</a><script data-card-contents-for-ri="93194" type="text/json">{"id":93194,"name":"Asynchronous Communication","url":"https://www.academia.edu/Documents/in/Asynchronous_Communication?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=9735577]'), work: {"id":9735577,"title":"Distributable Communication Protocols for Platform Independent Software Designs","created_at":"2014-12-12T00:23:04.566-08:00","url":"https://www.academia.edu/9735577/Distributable_Communication_Protocols_for_Platform_Independent_Software_Designs?f_ri=450","dom_id":"work_9735577","summary":"We define three abstract protocols which are appropriate for characterising communications in real-time system designs. These protocols abstract from details of distribution and synchronisation. This makes them suitable for use early in the design process, before the details of hardware network and software design deployment are finalised. The specifications are given in CSP, and are shown by model-checking to be valid abstractions of various distributed and local implementations. The utility of the protocols is demonstrated by showing that important properties can be established of designs which employ them, such as whether data must be processed once, or whether it may be processed more than once","downloadable_attachments":[{"id":35920696,"asset_id":9735577,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4204625,"first_name":"Steve","last_name":"Paynter","domain_name":"independent","page_name":"StevePaynter","display_name":"Steve Paynter","profile_url":"https://independent.academia.edu/StevePaynter?f_ri=450","photo":"https://0.academia-photos.com/4204625/1652327/7179275/s65_steve.paynter.jpg"}],"research_interests":[{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":57939,"name":"Software Design","url":"https://www.academia.edu/Documents/in/Software_Design?f_ri=450","nofollow":false},{"id":93194,"name":"Asynchronous Communication","url":"https://www.academia.edu/Documents/in/Asynchronous_Communication?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3389246" data-work_id="3389246" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3389246/Static_Deadlock_Detection_in_the_Linux_Kernel_RST_2004_">Static Deadlock Detection in the Linux Kernel (RST 2004)</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3389246" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="9634c7b1501d7bf4323b246d31211786" rel="nofollow" data-download="{"attachment_id":31182100,"asset_id":3389246,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31182100/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="650083" href="https://independent.academia.edu/PBreuer">Peter Breuer</a><script data-card-contents-for-user="650083" type="text/json">{"id":650083,"first_name":"Peter","last_name":"Breuer","domain_name":"independent","page_name":"PBreuer","display_name":"Peter Breuer","profile_url":"https://independent.academia.edu/PBreuer?f_ri=450","photo":"https://0.academia-photos.com/650083/1246440/1555669/s65_peter.breuer.jpg"}</script></span></span></li><li class="js-paper-rank-work_3389246 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3389246"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3389246, container: ".js-paper-rank-work_3389246", }); });</script></li><li class="js-percentile-work_3389246 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3389246; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3389246"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3389246 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3389246"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3389246; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3389246]").text(description); $(".js-view-count-work_3389246").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3389246").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3389246"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2201" href="https://www.academia.edu/Documents/in/Static_Analysis">Static Analysis</a>, <script data-card-contents-for-ri="2201" type="text/json">{"id":2201,"name":"Static Analysis","url":"https://www.academia.edu/Documents/in/Static_Analysis?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="7376" href="https://www.academia.edu/Documents/in/Linux_Kernel">Linux Kernel</a><script data-card-contents-for-ri="7376" type="text/json">{"id":7376,"name":"Linux Kernel","url":"https://www.academia.edu/Documents/in/Linux_Kernel?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3389246]'), work: {"id":3389246,"title":"Static Deadlock Detection in the Linux Kernel (RST 2004)","created_at":"2013-04-25T20:00:40.708-07:00","url":"https://www.academia.edu/3389246/Static_Deadlock_Detection_in_the_Linux_Kernel_RST_2004_?f_ri=450","dom_id":"work_3389246","summary":null,"downloadable_attachments":[{"id":31182100,"asset_id":3389246,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":650083,"first_name":"Peter","last_name":"Breuer","domain_name":"independent","page_name":"PBreuer","display_name":"Peter Breuer","profile_url":"https://independent.academia.edu/PBreuer?f_ri=450","photo":"https://0.academia-photos.com/650083/1246440/1555669/s65_peter.breuer.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":2201,"name":"Static Analysis","url":"https://www.academia.edu/Documents/in/Static_Analysis?f_ri=450","nofollow":false},{"id":7376,"name":"Linux Kernel","url":"https://www.academia.edu/Documents/in/Linux_Kernel?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_4016292" data-work_id="4016292" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/4016292/The_REDO_Project_Final_Report">The REDO Project: Final Report</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This report gives an overview of the work performed by the Programming Research Group as part of the European collaborative ESPRIT II REDO project (no. 2487). This work covered the areas of reverse-engineering: redocumentation and... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_4016292" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This report gives an overview of the work performed by the Programming Research Group as part of the European collaborative ESPRIT II REDO project (no. 2487). This work covered the areas of reverse-engineering: redocumentation and re-engineering; validation: post-hoc verification and generation of correct code from specifications; maintenance: new languages and methods to support maintenance. Research in areas of concurrent programming and decompilation were also performed.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/4016292" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="b626f07dcefbc80e7a622bcf7b2dc1e1" rel="nofollow" data-download="{"attachment_id":31691341,"asset_id":4016292,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31691341/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="12280" href="https://lsbu.academia.edu/JonathanBowen">Jonathan Bowen</a><script data-card-contents-for-user="12280" type="text/json">{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}</script></span></span></li><li class="js-paper-rank-work_4016292 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="4016292"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 4016292, container: ".js-paper-rank-work_4016292", }); });</script></li><li class="js-percentile-work_4016292 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 4016292; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_4016292"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_4016292 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="4016292"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4016292; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4016292]").text(description); $(".js-view-count-work_4016292").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_4016292").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="4016292"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1450" href="https://www.academia.edu/Documents/in/Software_Maintenance">Software Maintenance</a><script data-card-contents-for-ri="1450" type="text/json">{"id":1450,"name":"Software Maintenance","url":"https://www.academia.edu/Documents/in/Software_Maintenance?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=4016292]'), work: {"id":4016292,"title":"The REDO Project: Final Report","created_at":"2013-07-12T08:07:32.822-07:00","url":"https://www.academia.edu/4016292/The_REDO_Project_Final_Report?f_ri=450","dom_id":"work_4016292","summary":"This report gives an overview of the work performed by the Programming Research Group as part of the European collaborative ESPRIT II REDO project (no. 2487). This work covered the areas of reverse-engineering: redocumentation and re-engineering; validation: post-hoc veri\ffication and generation of correct code from speci\ffications; maintenance: new languages and methods to support maintenance. Research in areas of concurrent programming and decompilation were also performed.\r\n","downloadable_attachments":[{"id":31691341,"asset_id":4016292,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":1450,"name":"Software Maintenance","url":"https://www.academia.edu/Documents/in/Software_Maintenance?f_ri=450","nofollow":false},{"id":2349,"name":"Semantics","url":"https://www.academia.edu/Documents/in/Semantics?f_ri=450"},{"id":4761,"name":"Software Testing","url":"https://www.academia.edu/Documents/in/Software_Testing?f_ri=450"},{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":28991,"name":"Formal Semantics","url":"https://www.academia.edu/Documents/in/Formal_Semantics?f_ri=450"},{"id":31379,"name":"Reverse Engineering","url":"https://www.academia.edu/Documents/in/Reverse_Engineering?f_ri=450"},{"id":76371,"name":"COBOL Programming","url":"https://www.academia.edu/Documents/in/COBOL_Programming?f_ri=450"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=450"},{"id":130836,"name":"Z Notation","url":"https://www.academia.edu/Documents/in/Z_Notation?f_ri=450"},{"id":190729,"name":"Decompilation","url":"https://www.academia.edu/Documents/in/Decompilation?f_ri=450"},{"id":192342,"name":"Reverse Engineering Software","url":"https://www.academia.edu/Documents/in/Reverse_Engineering_Software?f_ri=450"},{"id":591148,"name":"Software Specification","url":"https://www.academia.edu/Documents/in/Software_Specification?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_42899062" data-work_id="42899062" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/42899062/Compositional_Verification_of_a_Medical_Device_System">Compositional Verification of a Medical Device System</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Complex systems are by necessity hierarchically organized. Decomposition into subsystems allows for intellectual control , as well as enabling different subsystems to be created by distinct teams. This decomposition affects both... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_42899062" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Complex systems are by necessity hierarchically organized. Decomposition into subsystems allows for intellectual control , as well as enabling different subsystems to be created by distinct teams. This decomposition affects both requirements and architecture. The architecture describes the structure and this affects how requirements "flow down" to each subsystem. Moreover, discoveries in the design process may affect the requirements. Demonstrating that a complex system satisfies its requirements when the subsystems are composed is a challenging problem. In this paper, we present a medical device case example where we apply an iterative approach to architecture and verification based on software architectural models. We represent the hierarchical composition of the system in the Architecture Analysis & Design Language (AADL), and use an extension to the AADL language to describe the requirements at different levels of abstraction for compositional verification. The component-level behavior for the model is described in Simulink/Stateflow. We assemble proofs of system level properties by using the Simulink Design Verifier to establish component-level properties and an open-source plug-in for the OSATE AADL environment to perform the compositional verification of the architecture. This combination of verification tools allows us to iteratively explore design and verification of detailed behavioral models, and to scale formal analysis to large software systems.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/42899062" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="c0ced72b4c28c02e753433f059b2fb7c" rel="nofollow" data-download="{"attachment_id":63146769,"asset_id":42899062,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/63146769/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="11825297" href="https://independent.academia.edu/AnithaMurugesan">Anitha Murugesan</a><script data-card-contents-for-user="11825297" type="text/json">{"id":11825297,"first_name":"Anitha","last_name":"Murugesan","domain_name":"independent","page_name":"AnithaMurugesan","display_name":"Anitha Murugesan","profile_url":"https://independent.academia.edu/AnithaMurugesan?f_ri=450","photo":"https://0.academia-photos.com/11825297/3411846/4012250/s65_anitha.murugesan.jpg"}</script></span></span></li><li class="js-paper-rank-work_42899062 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="42899062"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 42899062, container: ".js-paper-rank-work_42899062", }); });</script></li><li class="js-percentile-work_42899062 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 42899062; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_42899062"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_42899062 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="42899062"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 42899062; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=42899062]").text(description); $(".js-view-count-work_42899062").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_42899062").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="42899062"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i></div><span class="InlineList-item-text u-textTruncate u-pl6x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a><script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (false) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=42899062]'), work: {"id":42899062,"title":"Compositional Verification of a Medical Device System","created_at":"2020-04-30T03:33:45.351-07:00","url":"https://www.academia.edu/42899062/Compositional_Verification_of_a_Medical_Device_System?f_ri=450","dom_id":"work_42899062","summary":"Complex systems are by necessity hierarchically organized. Decomposition into subsystems allows for intellectual control , as well as enabling different subsystems to be created by distinct teams. This decomposition affects both requirements and architecture. The architecture describes the structure and this affects how requirements \"flow down\" to each subsystem. Moreover, discoveries in the design process may affect the requirements. Demonstrating that a complex system satisfies its requirements when the subsystems are composed is a challenging problem. In this paper, we present a medical device case example where we apply an iterative approach to architecture and verification based on software architectural models. We represent the hierarchical composition of the system in the Architecture Analysis \u0026 Design Language (AADL), and use an extension to the AADL language to describe the requirements at different levels of abstraction for compositional verification. The component-level behavior for the model is described in Simulink/Stateflow. We assemble proofs of system level properties by using the Simulink Design Verifier to establish component-level properties and an open-source plug-in for the OSATE AADL environment to perform the compositional verification of the architecture. This combination of verification tools allows us to iteratively explore design and verification of detailed behavioral models, and to scale formal analysis to large software systems.","downloadable_attachments":[{"id":63146769,"asset_id":42899062,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":11825297,"first_name":"Anitha","last_name":"Murugesan","domain_name":"independent","page_name":"AnithaMurugesan","display_name":"Anitha Murugesan","profile_url":"https://independent.academia.edu/AnithaMurugesan?f_ri=450","photo":"https://0.academia-photos.com/11825297/3411846/4012250/s65_anitha.murugesan.jpg"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_4437355" data-work_id="4437355" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/4437355/The_Industrial_Use_of_Formal_Methods_Experiences_of_an_Optimist">The Industrial Use of Formal Methods: Experiences of an Optimist</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">"Formal methods aim to apply mathematically-based techniques to the development of computer-based systems, especially at the specification level, but also down to the implementation level. This aids early detection and avoidance of errors... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_4437355" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">"Formal methods aim to apply mathematically-based techniques to the development of computer-based systems, especially at the specification level, but also down to the implementation level. This aids early detection and avoidance of errors through increased understanding. It is also beneficial for more rigorous testing coverage. This talk presents the use of formal methods on a real project. The Z notation has been used to specify a large-scale high integrity system to aid in air traffic control. The system has been implemented directly from the Z specification using SPARK Ada, an annotated subset of the Ada programming language that includes assertions and tool support for proofs. The Z specification has been used to direct the testing of the software through additional test design documents using tables and fragments of Z. In addition, Mathematica has been used as a test oracle for algorithmic aspects of the system. In summary, formal methods can be used successfully in all phases of the lifecycle for a large software project with suitably trained engineers, despite limited tool support. <br />"</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/4437355" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="4f228801da3da473e5d6dfdb3fd37e6e" rel="nofollow" data-download="{"attachment_id":31853877,"asset_id":4437355,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31853877/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="12280" href="https://lsbu.academia.edu/JonathanBowen">Jonathan Bowen</a><script data-card-contents-for-user="12280" type="text/json">{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}</script></span></span></li><li class="js-paper-rank-work_4437355 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="4437355"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 4437355, container: ".js-paper-rank-work_4437355", }); });</script></li><li class="js-percentile-work_4437355 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 4437355; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_4437355"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_4437355 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="4437355"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4437355; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4437355]").text(description); $(".js-view-count-work_4437355").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_4437355").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="4437355"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">27</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="759" href="https://www.academia.edu/Documents/in/Industrial_Organization">Industrial Organization</a><script data-card-contents-for-ri="759" type="text/json">{"id":759,"name":"Industrial Organization","url":"https://www.academia.edu/Documents/in/Industrial_Organization?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=4437355]'), work: {"id":4437355,"title":"The Industrial Use of Formal Methods: Experiences of an Optimist","created_at":"2013-09-08T14:24:19.331-07:00","url":"https://www.academia.edu/4437355/The_Industrial_Use_of_Formal_Methods_Experiences_of_an_Optimist?f_ri=450","dom_id":"work_4437355","summary":"\"Formal methods aim to apply mathematically-based techniques to the development of computer-based systems, especially at the specification level, but also down to the implementation level. This aids early detection and avoidance of errors through increased understanding. It is also beneficial for more rigorous testing coverage. This talk presents the use of formal methods on a real project. The Z notation has been used to specify a large-scale high integrity system to aid in air traffic control. The system has been implemented directly from the Z specification using SPARK Ada, an annotated subset of the Ada programming language that includes assertions and tool support for proofs. The Z specification has been used to direct the testing of the software through additional test design documents using tables and fragments of Z. In addition, Mathematica has been used as a test oracle for algorithmic aspects of the system. In summary, formal methods can be used successfully in all phases of the lifecycle for a large software project with suitably trained engineers, despite limited tool support.\r\n\"","downloadable_attachments":[{"id":31853877,"asset_id":4437355,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":759,"name":"Industrial Organization","url":"https://www.academia.edu/Documents/in/Industrial_Organization?f_ri=450","nofollow":false},{"id":1128,"name":"Computer Science Education","url":"https://www.academia.edu/Documents/in/Computer_Science_Education?f_ri=450"},{"id":1380,"name":"Computer Engineering","url":"https://www.academia.edu/Documents/in/Computer_Engineering?f_ri=450"},{"id":3952,"name":"Industrial Design","url":"https://www.academia.edu/Documents/in/Industrial_Design?f_ri=450"},{"id":4761,"name":"Software Testing","url":"https://www.academia.edu/Documents/in/Software_Testing?f_ri=450"},{"id":5446,"name":"Mathematical Programming","url":"https://www.academia.edu/Documents/in/Mathematical_Programming?f_ri=450"},{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=450"},{"id":9270,"name":"Software Architecture","url":"https://www.academia.edu/Documents/in/Software_Architecture?f_ri=450"},{"id":9542,"name":"Formal Methods (Formal Methods)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Methods_?f_ri=450"},{"id":9967,"name":"Software Engineering education","url":"https://www.academia.edu/Documents/in/Software_Engineering_education?f_ri=450"},{"id":14305,"name":"Industrial Engineering","url":"https://www.academia.edu/Documents/in/Industrial_Engineering?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":16221,"name":"Mathematical Modeling","url":"https://www.academia.edu/Documents/in/Mathematical_Modeling?f_ri=450"},{"id":16682,"name":"Mathematical Modelling","url":"https://www.academia.edu/Documents/in/Mathematical_Modelling?f_ri=450"},{"id":17442,"name":"Mathematical Logic","url":"https://www.academia.edu/Documents/in/Mathematical_Logic?f_ri=450"},{"id":28413,"name":"Air Traffic Management","url":"https://www.academia.edu/Documents/in/Air_Traffic_Management?f_ri=450"},{"id":53292,"name":"Programming","url":"https://www.academia.edu/Documents/in/Programming?f_ri=450"},{"id":53293,"name":"Software","url":"https://www.academia.edu/Documents/in/Software?f_ri=450"},{"id":55293,"name":"Air traffic control","url":"https://www.academia.edu/Documents/in/Air_traffic_control?f_ri=450"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=450"},{"id":130836,"name":"Z Notation","url":"https://www.academia.edu/Documents/in/Z_Notation?f_ri=450"},{"id":236340,"name":"Formal methods (Z notation)","url":"https://www.academia.edu/Documents/in/Formal_methods_Z_notation_?f_ri=450"},{"id":984553,"name":"Formal Systems","url":"https://www.academia.edu/Documents/in/Formal_Systems?f_ri=450"},{"id":1006845,"name":"Lightweight Formal Methods","url":"https://www.academia.edu/Documents/in/Lightweight_Formal_Methods?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_288631" data-work_id="288631" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/288631/FORTEST_Formal_Methods_and_Testing">FORTEST: Formal Methods and Testing</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Formal methods have traditionally been used for specification and development of software. However there are potential benefits for the testing stage as well. The panel session associated with this paper explores the usefulness or... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_288631" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Formal methods have traditionally been used for specification and development of software. However there are potential benefits for the testing stage as well. The panel session associated with this paper explores the usefulness or otherwise of formal methods in various contexts for improving software testing. A number of different possibilities for the use of formal methods are explored and questions raised. The contributors are all members of the UK FORTEST Network on formal methods and testing. Although the authors generally believe that formal methods are useful in aiding the testing process, this paper is intended to provoke discussion. Dissenters are encouraged to put their views to the panel or individually to the authors.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/288631" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="1fd1482189719ddf90f29849ab417cdc" rel="nofollow" data-download="{"attachment_id":31771457,"asset_id":288631,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31771457/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="12280" href="https://lsbu.academia.edu/JonathanBowen">Jonathan Bowen</a><script data-card-contents-for-user="12280" type="text/json">{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}</script></span></span></li><li class="js-paper-rank-work_288631 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="288631"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 288631, container: ".js-paper-rank-work_288631", }); });</script></li><li class="js-percentile-work_288631 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 288631; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_288631"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_288631 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="288631"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 288631; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=288631]").text(description); $(".js-view-count-work_288631").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_288631").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="288631"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">13</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="4761" href="https://www.academia.edu/Documents/in/Software_Testing">Software Testing</a><script data-card-contents-for-ri="4761" type="text/json">{"id":4761,"name":"Software Testing","url":"https://www.academia.edu/Documents/in/Software_Testing?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=288631]'), work: {"id":288631,"title":"FORTEST: Formal Methods and Testing","created_at":"2010-08-07T09:19:01.368-07:00","url":"https://www.academia.edu/288631/FORTEST_Formal_Methods_and_Testing?f_ri=450","dom_id":"work_288631","summary":"Formal methods have traditionally been used for specification and development of software. However there are potential benefits for the testing stage as well. The panel session associated with this paper explores the usefulness or otherwise of formal methods in various contexts for improving software testing. A number of different possibilities for the use of formal methods are explored and questions raised. The contributors are all members of the UK FORTEST Network on formal methods and testing. Although the authors generally believe that formal methods are useful in aiding the testing process, this paper is intended to provoke discussion. Dissenters are encouraged to put their views to the panel or individually to the authors.","downloadable_attachments":[{"id":31771457,"asset_id":288631,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":4761,"name":"Software Testing","url":"https://www.academia.edu/Documents/in/Software_Testing?f_ri=450","nofollow":false},{"id":9542,"name":"Formal Methods (Formal Methods)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Methods_?f_ri=450"},{"id":11821,"name":"Verification and Validation","url":"https://www.academia.edu/Documents/in/Verification_and_Validation?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":25795,"name":"Testing","url":"https://www.academia.edu/Documents/in/Testing?f_ri=450"},{"id":31177,"name":"Specification-based Testing","url":"https://www.academia.edu/Documents/in/Specification-based_Testing?f_ri=450"},{"id":31441,"name":"Software Verification and Validation","url":"https://www.academia.edu/Documents/in/Software_Verification_and_Validation?f_ri=450"},{"id":61109,"name":"Validation","url":"https://www.academia.edu/Documents/in/Validation?f_ri=450"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=450"},{"id":172035,"name":"Formal Verification","url":"https://www.academia.edu/Documents/in/Formal_Verification?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_1413564" data-work_id="1413564" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/1413564/Detecting_deadlock_double_free_and_other_abuses_in_a_million_lines_of_linux_kernel_source">Detecting deadlock, double-free and other abuses in a million lines of linux kernel source</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The formal analysis described here detects two so far undetected real deadlock situations per thousand C source files or million lines of code in the open source Linux operating system kernel, and three undetected accesses to freed... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_1413564" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The formal analysis described here detects two so far undetected real deadlock situations per thousand C source files or million lines of code in the open source Linux operating system kernel, and three undetected accesses to freed memory, at a few seconds per file.  That is notable because the code has been continuously under scrutiny from thousands of developers' pairs of eyes.  In distinction to model-checking techniques, which also use symbolic logic, the analysis uses a ``3-phase" compositional Hoare-style programming logic combined with abstract interpretation.  The result is a customisable post-hoc semantic analysis of C code that is capable of several different analyses at once.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/1413564" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="73bcfc73498e96224af4f8b38d87936e" rel="nofollow" data-download="{"attachment_id":30507737,"asset_id":1413564,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/30507737/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="650083" href="https://independent.academia.edu/PBreuer">Peter Breuer</a><script data-card-contents-for-user="650083" type="text/json">{"id":650083,"first_name":"Peter","last_name":"Breuer","domain_name":"independent","page_name":"PBreuer","display_name":"Peter Breuer","profile_url":"https://independent.academia.edu/PBreuer?f_ri=450","photo":"https://0.academia-photos.com/650083/1246440/1555669/s65_peter.breuer.jpg"}</script></span></span></li><li class="js-paper-rank-work_1413564 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="1413564"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 1413564, container: ".js-paper-rank-work_1413564", }); });</script></li><li class="js-percentile-work_1413564 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 1413564; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_1413564"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_1413564 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="1413564"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 1413564; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=1413564]").text(description); $(".js-view-count-work_1413564").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_1413564").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="1413564"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2201" href="https://www.academia.edu/Documents/in/Static_Analysis">Static Analysis</a><script data-card-contents-for-ri="2201" type="text/json">{"id":2201,"name":"Static Analysis","url":"https://www.academia.edu/Documents/in/Static_Analysis?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=1413564]'), work: {"id":1413564,"title":"Detecting deadlock, double-free and other abuses in a million lines of linux kernel source","created_at":"2012-02-19T17:32:19.484-08:00","url":"https://www.academia.edu/1413564/Detecting_deadlock_double_free_and_other_abuses_in_a_million_lines_of_linux_kernel_source?f_ri=450","dom_id":"work_1413564","summary":"The formal analysis described here detects two so far undetected real deadlock situations per thousand C source files or million lines of code in the open source Linux operating system kernel, and three undetected accesses to freed memory, at a few seconds per file. That is notable because the code has been continuously under scrutiny from thousands of developers' pairs of eyes. In distinction to model-checking techniques, which also use symbolic logic, the analysis uses a ``3-phase\" compositional Hoare-style programming logic combined with abstract interpretation. The result is a customisable post-hoc semantic analysis of C code that is capable of several different analyses at once.\r\n","downloadable_attachments":[{"id":30507737,"asset_id":1413564,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":650083,"first_name":"Peter","last_name":"Breuer","domain_name":"independent","page_name":"PBreuer","display_name":"Peter Breuer","profile_url":"https://independent.academia.edu/PBreuer?f_ri=450","photo":"https://0.academia-photos.com/650083/1246440/1555669/s65_peter.breuer.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":2201,"name":"Static Analysis","url":"https://www.academia.edu/Documents/in/Static_Analysis?f_ri=450","nofollow":false},{"id":7376,"name":"Linux Kernel","url":"https://www.academia.edu/Documents/in/Linux_Kernel?f_ri=450"},{"id":11821,"name":"Verification and Validation","url":"https://www.academia.edu/Documents/in/Verification_and_Validation?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":28306,"name":"Open Source and Free Software Studies","url":"https://www.academia.edu/Documents/in/Open_Source_and_Free_Software_Studies?f_ri=450"},{"id":31441,"name":"Software Verification and Validation","url":"https://www.academia.edu/Documents/in/Software_Verification_and_Validation?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_44294939" data-work_id="44294939" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/44294939/7th_International_Conference_on_Software_Engineering_SOFT_2021_">7th International Conference on Software Engineering (SOFT 2021)</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">7th International Conference on Software Engineering (SOFT 2021) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Software Engineering and Applications. The goal of... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_44294939" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">7th International Conference on Software Engineering (SOFT 2021) will provide an excellent<br />international forum for sharing knowledge and results in theory, methodology and applications of<br />Software Engineering and Applications. The goal of this Conference is to bring together researchers<br />and practitioners from academia and industry to focus on understanding Modern software<br />engineering concepts and establishing new collaborations in these areas.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/44294939" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="c510042c540e4f959a529f57fd548a6b" rel="nofollow" data-download="{"attachment_id":66682508,"asset_id":44294939,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/66682508/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="21169291" href="https://independent.academia.edu/IjseaJournal">International Journal of Software Engineering & Applications (IJSEA)-ERA Indexed</a><script data-card-contents-for-user="21169291" type="text/json">{"id":21169291,"first_name":"International Journal of Software Engineering \u0026 Applications","last_name":"(IJSEA)-ERA Indexed","domain_name":"independent","page_name":"IjseaJournal","display_name":"International Journal of Software Engineering \u0026 Applications (IJSEA)-ERA Indexed","profile_url":"https://independent.academia.edu/IjseaJournal?f_ri=450","photo":"https://0.academia-photos.com/21169291/5886224/84098518/s65_international_journal_of_software_engineering_applications._ijsea_-era_indexed.png"}</script></span></span></li><li class="js-paper-rank-work_44294939 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="44294939"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 44294939, container: ".js-paper-rank-work_44294939", }); });</script></li><li class="js-percentile-work_44294939 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 44294939; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_44294939"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_44294939 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="44294939"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 44294939; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=44294939]").text(description); $(".js-view-count-work_44294939").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_44294939").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="44294939"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">19</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="146" href="https://www.academia.edu/Documents/in/Bioinformatics">Bioinformatics</a>, <script data-card-contents-for-ri="146" type="text/json">{"id":146,"name":"Bioinformatics","url":"https://www.academia.edu/Documents/in/Bioinformatics?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1384" href="https://www.academia.edu/Documents/in/Web_Engineering">Web Engineering</a><script data-card-contents-for-ri="1384" type="text/json">{"id":1384,"name":"Web Engineering","url":"https://www.academia.edu/Documents/in/Web_Engineering?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=44294939]'), work: {"id":44294939,"title":"7th International Conference on Software Engineering (SOFT 2021)","created_at":"2020-10-14T04:41:35.548-07:00","url":"https://www.academia.edu/44294939/7th_International_Conference_on_Software_Engineering_SOFT_2021_?f_ri=450","dom_id":"work_44294939","summary":"7th International Conference on Software Engineering (SOFT 2021) will provide an excellent\ninternational forum for sharing knowledge and results in theory, methodology and applications of\nSoftware Engineering and Applications. The goal of this Conference is to bring together researchers\nand practitioners from academia and industry to focus on understanding Modern software\nengineering concepts and establishing new collaborations in these areas.","downloadable_attachments":[{"id":66682508,"asset_id":44294939,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":21169291,"first_name":"International Journal of Software Engineering \u0026 Applications","last_name":"(IJSEA)-ERA Indexed","domain_name":"independent","page_name":"IjseaJournal","display_name":"International Journal of Software Engineering \u0026 Applications (IJSEA)-ERA Indexed","profile_url":"https://independent.academia.edu/IjseaJournal?f_ri=450","photo":"https://0.academia-photos.com/21169291/5886224/84098518/s65_international_journal_of_software_engineering_applications._ijsea_-era_indexed.png"}],"research_interests":[{"id":146,"name":"Bioinformatics","url":"https://www.academia.edu/Documents/in/Bioinformatics?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":1384,"name":"Web Engineering","url":"https://www.academia.edu/Documents/in/Web_Engineering?f_ri=450","nofollow":false},{"id":1451,"name":"Quality Management","url":"https://www.academia.edu/Documents/in/Quality_Management?f_ri=450"},{"id":4761,"name":"Software Testing","url":"https://www.academia.edu/Documents/in/Software_Testing?f_ri=450"},{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=450"},{"id":9270,"name":"Software Architecture","url":"https://www.academia.edu/Documents/in/Software_Architecture?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":15117,"name":"Empirical Software Engineering","url":"https://www.academia.edu/Documents/in/Empirical_Software_Engineering?f_ri=450"},{"id":33705,"name":"Software Project Management","url":"https://www.academia.edu/Documents/in/Software_Project_Management?f_ri=450"},{"id":35486,"name":"Agile Methods (Software Engineering)","url":"https://www.academia.edu/Documents/in/Agile_Methods_Software_Engineering_?f_ri=450"},{"id":53293,"name":"Software","url":"https://www.academia.edu/Documents/in/Software?f_ri=450"},{"id":55826,"name":"Software Requirement Engineering","url":"https://www.academia.edu/Documents/in/Software_Requirement_Engineering?f_ri=450"},{"id":126337,"name":"Software Process Improvement","url":"https://www.academia.edu/Documents/in/Software_Process_Improvement?f_ri=450"},{"id":190001,"name":"Agile software development","url":"https://www.academia.edu/Documents/in/Agile_software_development?f_ri=450"},{"id":316093,"name":"Software Requirement Specification","url":"https://www.academia.edu/Documents/in/Software_Requirement_Specification?f_ri=450"},{"id":393623,"name":"Software Process","url":"https://www.academia.edu/Documents/in/Software_Process?f_ri=450"},{"id":1006845,"name":"Lightweight Formal Methods","url":"https://www.academia.edu/Documents/in/Lightweight_Formal_Methods?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_41271764 coauthored" data-work_id="41271764" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/41271764/Investigating_Network_Services_Abstraction_in_5G_enabled_Device_to_Device_D2D_Communications">Investigating Network Services Abstraction in 5G enabled Device-to-Device (D2D) Communications</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The increased demand of data rate by mobile users has led to the evolution of mobile network technologies from the fourth generation to fifth generation (5G). 5G mobile network will support various technologies that will be able to... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_41271764" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The increased demand of data rate by mobile users has led to the evolution of mobile network technologies from the fourth generation to fifth generation (5G). 5G mobile network will support various technologies that will be able to provide low latency, offload traffic and connect vertical industries. Device-to-device (D2D) communications will be used as the underlay technology for 5G network in the offloading of traffic from the cellular network and pushing content closer to the user. With D2D communication, various network services can be implemented to improve spectral efficiency and reduce energy consumption of mobile devices. This paper gives a brief overview of D2D communication and discusses different D2D applications. It proposes a network services abstraction and suggests the mapping of existing studies with the network service abstraction which can be used in the harnessing the development and implementation of D2D communication applications in 5G network. The paper also highlights possible future research for D2D communication in 5G network.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/41271764" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="45724688" href="https://mdx.academia.edu/EdKEdris">Ed K . K I Y E M B A Edris</a><script data-card-contents-for-user="45724688" type="text/json">{"id":45724688,"first_name":"Ed","last_name":"Edris","domain_name":"mdx","page_name":"EdKEdris","display_name":"Ed K . K I Y E M B A Edris","profile_url":"https://mdx.academia.edu/EdKEdris?f_ri=450","photo":"https://0.academia-photos.com/45724688/12119970/54631756/s65_ed.edris.jpg"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-41271764">+1</span><div class="hidden js-additional-users-41271764"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/JonathonLoo">Jonathon Loo</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-41271764'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-41271764').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_41271764 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="41271764"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 41271764, container: ".js-paper-rank-work_41271764", }); });</script></li><li class="js-percentile-work_41271764 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 41271764; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_41271764"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_41271764 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="41271764"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 41271764; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=41271764]").text(description); $(".js-view-count-work_41271764").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_41271764").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="41271764"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="465" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a>, <script data-card-contents-for-ri="465" type="text/json">{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1283" href="https://www.academia.edu/Documents/in/Information_Security">Information Security</a>, <script data-card-contents-for-ri="1283" type="text/json">{"id":1283,"name":"Information Security","url":"https://www.academia.edu/Documents/in/Information_Security?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3703" href="https://www.academia.edu/Documents/in/Network_Security">Network Security</a><script data-card-contents-for-ri="3703" type="text/json">{"id":3703,"name":"Network Security","url":"https://www.academia.edu/Documents/in/Network_Security?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=41271764]'), work: {"id":41271764,"title":"Investigating Network Services Abstraction in 5G enabled Device-to-Device (D2D) Communications","created_at":"2019-12-11T21:26:36.814-08:00","url":"https://www.academia.edu/41271764/Investigating_Network_Services_Abstraction_in_5G_enabled_Device_to_Device_D2D_Communications?f_ri=450","dom_id":"work_41271764","summary":"The increased demand of data rate by mobile users has led to the evolution of mobile network technologies from the fourth generation to fifth generation (5G). 5G mobile network will support various technologies that will be able to provide low latency, offload traffic and connect vertical industries. Device-to-device (D2D) communications will be used as the underlay technology for 5G network in the offloading of traffic from the cellular network and pushing content closer to the user. With D2D communication, various network services can be implemented to improve spectral efficiency and reduce energy consumption of mobile devices. This paper gives a brief overview of D2D communication and discusses different D2D applications. It proposes a network services abstraction and suggests the mapping of existing studies with the network service abstraction which can be used in the harnessing the development and implementation of D2D communication applications in 5G network. The paper also highlights possible future research for D2D communication in 5G network.","downloadable_attachments":[],"ordered_authors":[{"id":45724688,"first_name":"Ed","last_name":"Edris","domain_name":"mdx","page_name":"EdKEdris","display_name":"Ed K . K I Y E M B A Edris","profile_url":"https://mdx.academia.edu/EdKEdris?f_ri=450","photo":"https://0.academia-photos.com/45724688/12119970/54631756/s65_ed.edris.jpg"},{"id":139769968,"first_name":"Jonathon","last_name":"Loo","domain_name":"independent","page_name":"JonathonLoo","display_name":"Jonathon Loo","profile_url":"https://independent.academia.edu/JonathonLoo?f_ri=450","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=450","nofollow":false},{"id":1283,"name":"Information Security","url":"https://www.academia.edu/Documents/in/Information_Security?f_ri=450","nofollow":false},{"id":3703,"name":"Network Security","url":"https://www.academia.edu/Documents/in/Network_Security?f_ri=450","nofollow":false},{"id":13923,"name":"Computer Security","url":"https://www.academia.edu/Documents/in/Computer_Security?f_ri=450"},{"id":26825,"name":"Mobile Computing","url":"https://www.academia.edu/Documents/in/Mobile_Computing?f_ri=450"},{"id":115676,"name":"Cyber Security","url":"https://www.academia.edu/Documents/in/Cyber_Security?f_ri=450"},{"id":182289,"name":"Penetration Testing","url":"https://www.academia.edu/Documents/in/Penetration_Testing?f_ri=450"},{"id":247799,"name":"Internet of Things (IoT)","url":"https://www.academia.edu/Documents/in/Internet_of_Things_IoT_?f_ri=450"},{"id":418974,"name":"Information Centric Networking","url":"https://www.academia.edu/Documents/in/Information_Centric_Networking?f_ri=450"},{"id":1000513,"name":"Authentication Protocols","url":"https://www.academia.edu/Documents/in/Authentication_Protocols?f_ri=450"},{"id":1757354,"name":"D2D and M2M Communication","url":"https://www.academia.edu/Documents/in/D2D_and_M2M_Communication?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_74953876" data-work_id="74953876" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/74953876/Software_Engineering_and_Formal_Methods">Software Engineering and Formal Methods</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/74953876" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="4ef970db852ac0ff3332cb983a1f3015" rel="nofollow" data-download="{"attachment_id":82919434,"asset_id":74953876,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/82919434/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="166359598" href="https://independent.academia.edu/MichaelJackson271">Michael Jackson</a><script data-card-contents-for-user="166359598" type="text/json">{"id":166359598,"first_name":"Michael","last_name":"Jackson","domain_name":"independent","page_name":"MichaelJackson271","display_name":"Michael Jackson","profile_url":"https://independent.academia.edu/MichaelJackson271?f_ri=450","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_74953876 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="74953876"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 74953876, container: ".js-paper-rank-work_74953876", }); });</script></li><li class="js-percentile-work_74953876 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 74953876; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_74953876"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_74953876 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="74953876"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 74953876; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=74953876]").text(description); $(".js-view-count-work_74953876").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_74953876").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="74953876"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="37" href="https://www.academia.edu/Documents/in/Information_Systems">Information Systems</a>, <script data-card-contents-for-ri="37" type="text/json">{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a><script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=74953876]'), work: {"id":74953876,"title":"Software Engineering and Formal Methods","created_at":"2022-03-30T02:11:38.822-07:00","url":"https://www.academia.edu/74953876/Software_Engineering_and_Formal_Methods?f_ri=450","dom_id":"work_74953876","summary":null,"downloadable_attachments":[{"id":82919434,"asset_id":74953876,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":166359598,"first_name":"Michael","last_name":"Jackson","domain_name":"independent","page_name":"MichaelJackson271","display_name":"Michael Jackson","profile_url":"https://independent.academia.edu/MichaelJackson271?f_ri=450","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=450","nofollow":false},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":28532,"name":"Software Reliability","url":"https://www.academia.edu/Documents/in/Software_Reliability?f_ri=450"},{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=450"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=450"},{"id":126194,"name":"Formal method","url":"https://www.academia.edu/Documents/in/Formal_method?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19611906" data-work_id="19611906" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19611906/PROPEL_An_Approach_Supporting_User_Guidance_In_Developing_Precise_and_Understandable_Property_Specifications">PROPEL: An Approach Supporting User Guidance In Developing Precise and Understandable Property Specifications</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Property specifications are often used in requirements engineering to concisely describe a single aspect of system behavior. Although each property has a narrow focus, it can still be difficult to specify a property correctly. There are... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19611906" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Property specifications are often used in requirements engineering to concisely describe a single aspect of system behavior. Although each property has a narrow focus, it can still be difficult to specify a property correctly. There are often subtle, but important, details in desired system behavior that can easily be overlooked, and there is little guidance available for how to avoid such mistakes. In addition to capturing these details correctly, property specifications should be (a) precise enough to support automated analyses that can be used to check that actual system behavior is consistent with the specifications, and (b) understandable enough to be readily comprehended by all system developers. Property specifications can be written in a mathematical formalism, which provides precision, but such formalisms are often difficult to understand. Thus, in practice, property specifications tend to be written in natural language. Property specifications written with such informality are often ambiguous, however, and usually cannot be used in many types of automated analyses.<br /><br />To address these challenges, our approach supports elicitation and specification of properties by providing templates that build on commonly-occurring property patterns. These templates offer guidance by explicitly indicating the variations that must be considered, thereby ensuring that important subtle details are not overlooked. To support the use of this approach, we developed PROPEL, for “PROPerty ELucidator.” PROPEL provides three alternative views that users can work with to specify properties: graphical finite-state automata, which offer precision; “disciplined” natural language, which offers understandability; and question trees, which offer guidance for selecting a template.<br /><br />To evaluate this approach, we used PROPEL to specify properties in five case studies in the medical domain. The case studies showed that our approach was effective at specifying the vast majority of the properties we encountered. We also undertook a small empirical study that showed that the disciplined natural language view of the properties was usually understood. These results indicate that our approach to property elicitation and specification is a promising one.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19611906" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="e8e766131055fdb22cc30e7a1516e61d" rel="nofollow" data-download="{"attachment_id":40733193,"asset_id":19611906,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40733193/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="33474442" href="https://independent.academia.edu/RachelCobleigh">Rae S . Cobleigh</a><script data-card-contents-for-user="33474442" type="text/json">{"id":33474442,"first_name":"Rae","last_name":"Cobleigh","domain_name":"independent","page_name":"RachelCobleigh","display_name":"Rae S . Cobleigh","profile_url":"https://independent.academia.edu/RachelCobleigh?f_ri=450","photo":"https://gravatar.com/avatar/5523f94520aa480ad28d9fd25bd6852a?s=65"}</script></span></span></li><li class="js-paper-rank-work_19611906 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19611906"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19611906, container: ".js-paper-rank-work_19611906", }); });</script></li><li class="js-percentile-work_19611906 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19611906; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19611906"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19611906 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19611906"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19611906; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19611906]").text(description); $(".js-view-count-work_19611906").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19611906").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19611906"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="472" href="https://www.academia.edu/Documents/in/Human_Computer_Interaction">Human Computer Interaction</a>, <script data-card-contents-for-ri="472" type="text/json">{"id":472,"name":"Human Computer Interaction","url":"https://www.academia.edu/Documents/in/Human_Computer_Interaction?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1449" href="https://www.academia.edu/Documents/in/Requirements_Engineering">Requirements Engineering</a><script data-card-contents-for-ri="1449" type="text/json">{"id":1449,"name":"Requirements Engineering","url":"https://www.academia.edu/Documents/in/Requirements_Engineering?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19611906]'), work: {"id":19611906,"title":"PROPEL: An Approach Supporting User Guidance In Developing Precise and Understandable Property Specifications","created_at":"2015-12-11T13:21:31.800-08:00","url":"https://www.academia.edu/19611906/PROPEL_An_Approach_Supporting_User_Guidance_In_Developing_Precise_and_Understandable_Property_Specifications?f_ri=450","dom_id":"work_19611906","summary":"Property specifications are often used in requirements engineering to concisely describe a single aspect of system behavior. Although each property has a narrow focus, it can still be difficult to specify a property correctly. There are often subtle, but important, details in desired system behavior that can easily be overlooked, and there is little guidance available for how to avoid such mistakes. In addition to capturing these details correctly, property specifications should be (a) precise enough to support automated analyses that can be used to check that actual system behavior is consistent with the specifications, and (b) understandable enough to be readily comprehended by all system developers. Property specifications can be written in a mathematical formalism, which provides precision, but such formalisms are often difficult to understand. Thus, in practice, property specifications tend to be written in natural language. Property specifications written with such informality are often ambiguous, however, and usually cannot be used in many types of automated analyses.\n\nTo address these challenges, our approach supports elicitation and specification of properties by providing templates that build on commonly-occurring property patterns. These templates offer guidance by explicitly indicating the variations that must be considered, thereby ensuring that important subtle details are not overlooked. To support the use of this approach, we developed PROPEL, for “PROPerty ELucidator.” PROPEL provides three alternative views that users can work with to specify properties: graphical finite-state automata, which offer precision; “disciplined” natural language, which offers understandability; and question trees, which offer guidance for selecting a template.\n\nTo evaluate this approach, we used PROPEL to specify properties in five case studies in the medical domain. The case studies showed that our approach was effective at specifying the vast majority of the properties we encountered. We also undertook a small empirical study that showed that the disciplined natural language view of the properties was usually understood. These results indicate that our approach to property elicitation and specification is a promising one.","downloadable_attachments":[{"id":40733193,"asset_id":19611906,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":33474442,"first_name":"Rae","last_name":"Cobleigh","domain_name":"independent","page_name":"RachelCobleigh","display_name":"Rae S . Cobleigh","profile_url":"https://independent.academia.edu/RachelCobleigh?f_ri=450","photo":"https://gravatar.com/avatar/5523f94520aa480ad28d9fd25bd6852a?s=65"}],"research_interests":[{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":472,"name":"Human Computer Interaction","url":"https://www.academia.edu/Documents/in/Human_Computer_Interaction?f_ri=450","nofollow":false},{"id":1449,"name":"Requirements Engineering","url":"https://www.academia.edu/Documents/in/Requirements_Engineering?f_ri=450","nofollow":false},{"id":11119,"name":"User Interface","url":"https://www.academia.edu/Documents/in/User_Interface?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":67358,"name":"Finite State Automaton","url":"https://www.academia.edu/Documents/in/Finite_State_Automaton?f_ri=450"},{"id":100247,"name":"User Interface Design","url":"https://www.academia.edu/Documents/in/User_Interface_Design?f_ri=450"},{"id":167271,"name":"Requirements elicitation","url":"https://www.academia.edu/Documents/in/Requirements_elicitation?f_ri=450"},{"id":169703,"name":"Software Requirements","url":"https://www.academia.edu/Documents/in/Software_Requirements?f_ri=450"},{"id":385880,"name":"Finite State Automata","url":"https://www.academia.edu/Documents/in/Finite_State_Automata?f_ri=450"},{"id":614639,"name":"Software Requirements Specification","url":"https://www.academia.edu/Documents/in/Software_Requirements_Specification?f_ri=450"},{"id":743275,"name":"Finite state machines","url":"https://www.academia.edu/Documents/in/Finite_state_machines?f_ri=450"},{"id":797379,"name":"Minimizing Ambiguity in Natural Language Software Requirements Specification","url":"https://www.academia.edu/Documents/in/Minimizing_Ambiguity_in_Natural_Language_Software_Requirements_Specification?f_ri=450"},{"id":904746,"name":"Software Requirements Tools","url":"https://www.academia.edu/Documents/in/Software_Requirements_Tools?f_ri=450"},{"id":986849,"name":"Software Engineering: Software Requirements Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering_Software_Requirements_Engineering?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_12288357" data-work_id="12288357" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/12288357/Cryptographic_Adversary_Model_Timing_and_Power_Attacks">Cryptographic Adversary Model: Timing and Power Attacks</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In this work, we present an adversary model that incorporates side channel attacks in the Indistinguishability Experiment for Adaptive Chosen Ciphertext Attack (CCA2). We propose security assumptions and an attack model for a secure... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_12288357" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In this work, we present an adversary model that incorporates side channel attacks in the Indistinguishability Experiment for Adaptive Chosen Ciphertext Attack (CCA2). We propose security assumptions and an attack model for a secure SSW-ARQ protocol with an integration of TFTP protocol. We also present the security reduction of SSW-ARQ protocol from Cramer-Shoup encryption scheme, timing and power attacks as side channel security for the SSW-ARQ protocol. We suggest using a lightweight symmetric encryption for data encryption and asymmetric encryption for key exchange protocols in the TFTP. The target implementation of secure TFTP is for embedded devices such as Wi-Fi Access Points (AP) and remote Base Stations (BS). In this paper we present the security proofs based on an attack model (IND-CCA2) for securing TFTP protocol. We have also introduce a novel adversary model in IND-CCA2-(TA, PA, TPA) and it is considered a practical model because the model incorporates the timing attack and power attack.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/12288357" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="97388d0eb8e3f0abf6e01991dbf66ed1" rel="nofollow" data-download="{"attachment_id":37575715,"asset_id":12288357,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/37575715/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="2030197" href="https://upm.academia.edu/MohdAnuarMatIsa">Mohd Anuar Mat Isa</a><script data-card-contents-for-user="2030197" type="text/json">{"id":2030197,"first_name":"Mohd Anuar","last_name":"Mat Isa","domain_name":"upm","page_name":"MohdAnuarMatIsa","display_name":"Mohd Anuar Mat Isa","profile_url":"https://upm.academia.edu/MohdAnuarMatIsa?f_ri=450","photo":"https://0.academia-photos.com/2030197/2679607/6156135/s65_mohd_anuar.mat_isa.jpg"}</script></span></span></li><li class="js-paper-rank-work_12288357 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="12288357"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 12288357, container: ".js-paper-rank-work_12288357", }); });</script></li><li class="js-percentile-work_12288357 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 12288357; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_12288357"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_12288357 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="12288357"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 12288357; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=12288357]").text(description); $(".js-view-count-work_12288357").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_12288357").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="12288357"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">23</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1283" href="https://www.academia.edu/Documents/in/Information_Security">Information Security</a>, <script data-card-contents-for-ri="1283" type="text/json">{"id":1283,"name":"Information Security","url":"https://www.academia.edu/Documents/in/Information_Security?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2345" href="https://www.academia.edu/Documents/in/Wireless_Communications">Wireless Communications</a>, <script data-card-contents-for-ri="2345" type="text/json">{"id":2345,"name":"Wireless Communications","url":"https://www.academia.edu/Documents/in/Wireless_Communications?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2783" href="https://www.academia.edu/Documents/in/Privacy">Privacy</a><script data-card-contents-for-ri="2783" type="text/json">{"id":2783,"name":"Privacy","url":"https://www.academia.edu/Documents/in/Privacy?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=12288357]'), work: {"id":12288357,"title":"Cryptographic Adversary Model: Timing and Power Attacks","created_at":"2015-05-08T00:43:00.499-07:00","url":"https://www.academia.edu/12288357/Cryptographic_Adversary_Model_Timing_and_Power_Attacks?f_ri=450","dom_id":"work_12288357","summary":"In this work, we present an adversary model that incorporates side channel attacks in the Indistinguishability Experiment for Adaptive Chosen Ciphertext Attack (CCA2). We propose security assumptions and an attack model for a secure SSW-ARQ protocol with an integration of TFTP protocol. We also present the security reduction of SSW-ARQ protocol from Cramer-Shoup encryption scheme, timing and power attacks as side channel security for the SSW-ARQ protocol. We suggest using a lightweight symmetric encryption for data encryption and asymmetric encryption for key exchange protocols in the TFTP. The target implementation of secure TFTP is for embedded devices such as Wi-Fi Access Points (AP) and remote Base Stations (BS). In this paper we present the security proofs based on an attack model (IND-CCA2) for securing TFTP protocol. We have also introduce a novel adversary model in IND-CCA2-(TA, PA, TPA) and it is considered a practical model because the model incorporates the timing attack and power attack.","downloadable_attachments":[{"id":37575715,"asset_id":12288357,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":2030197,"first_name":"Mohd Anuar","last_name":"Mat Isa","domain_name":"upm","page_name":"MohdAnuarMatIsa","display_name":"Mohd Anuar Mat Isa","profile_url":"https://upm.academia.edu/MohdAnuarMatIsa?f_ri=450","photo":"https://0.academia-photos.com/2030197/2679607/6156135/s65_mohd_anuar.mat_isa.jpg"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":1283,"name":"Information Security","url":"https://www.academia.edu/Documents/in/Information_Security?f_ri=450","nofollow":false},{"id":2345,"name":"Wireless Communications","url":"https://www.academia.edu/Documents/in/Wireless_Communications?f_ri=450","nofollow":false},{"id":2783,"name":"Privacy","url":"https://www.academia.edu/Documents/in/Privacy?f_ri=450","nofollow":false},{"id":3043,"name":"Trust","url":"https://www.academia.edu/Documents/in/Trust?f_ri=450"},{"id":3703,"name":"Network Security","url":"https://www.academia.edu/Documents/in/Network_Security?f_ri=450"},{"id":4370,"name":"Security","url":"https://www.academia.edu/Documents/in/Security?f_ri=450"},{"id":5473,"name":"Embedded Systems","url":"https://www.academia.edu/Documents/in/Embedded_Systems?f_ri=450"},{"id":5475,"name":"Timing Analysis","url":"https://www.academia.edu/Documents/in/Timing_Analysis?f_ri=450"},{"id":9136,"name":"Wireless Sensor Networks","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Networks?f_ri=450"},{"id":11044,"name":"Trust Management","url":"https://www.academia.edu/Documents/in/Trust_Management?f_ri=450"},{"id":13923,"name":"Computer Security","url":"https://www.academia.edu/Documents/in/Computer_Security?f_ri=450"},{"id":16542,"name":"Cryptography","url":"https://www.academia.edu/Documents/in/Cryptography?f_ri=450"},{"id":23506,"name":"Information Security and Privacy","url":"https://www.academia.edu/Documents/in/Information_Security_and_Privacy?f_ri=450"},{"id":37097,"name":"Public Key Crypto systems","url":"https://www.academia.edu/Documents/in/Public_Key_Crypto_systems?f_ri=450"},{"id":91447,"name":"Provable Security","url":"https://www.academia.edu/Documents/in/Provable_Security?f_ri=450"},{"id":102710,"name":"Side-channel attack","url":"https://www.academia.edu/Documents/in/Side-channel_attack?f_ri=450"},{"id":115641,"name":"Lightweight Cryptography","url":"https://www.academia.edu/Documents/in/Lightweight_Cryptography?f_ri=450"},{"id":115676,"name":"Cyber Security","url":"https://www.academia.edu/Documents/in/Cyber_Security?f_ri=450"},{"id":247799,"name":"Internet of Things (IoT)","url":"https://www.academia.edu/Documents/in/Internet_of_Things_IoT_?f_ri=450"},{"id":457449,"name":"Random Oracle Model","url":"https://www.academia.edu/Documents/in/Random_Oracle_Model?f_ri=450"},{"id":563750,"name":"Raspberry Pi","url":"https://www.academia.edu/Documents/in/Raspberry_Pi?f_ri=450"},{"id":704522,"name":"TFTPS","url":"https://www.academia.edu/Documents/in/TFTPS?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_4154356" data-work_id="4154356" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/4154356/Detecting_Deadlock_Double_Free_and_Other_Abuses_in_a_Million_Lines_of_Linux_Kernel_Source_SEW_30_"> Detecting Deadlock, Double-Free and Other Abuses in a Million Lines of Linux Kernel Source (SEW 30)</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/4154356" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="81029608effa8a7de2387ba02ff31686" rel="nofollow" data-download="{"attachment_id":31661255,"asset_id":4154356,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31661255/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="650083" href="https://independent.academia.edu/PBreuer">Peter Breuer</a><script data-card-contents-for-user="650083" type="text/json">{"id":650083,"first_name":"Peter","last_name":"Breuer","domain_name":"independent","page_name":"PBreuer","display_name":"Peter Breuer","profile_url":"https://independent.academia.edu/PBreuer?f_ri=450","photo":"https://0.academia-photos.com/650083/1246440/1555669/s65_peter.breuer.jpg"}</script></span></span></li><li class="js-paper-rank-work_4154356 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="4154356"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 4154356, container: ".js-paper-rank-work_4154356", }); });</script></li><li class="js-percentile-work_4154356 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 4154356; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_4154356"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_4154356 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="4154356"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4154356; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4154356]").text(description); $(".js-view-count-work_4154356").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_4154356").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="4154356"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2201" href="https://www.academia.edu/Documents/in/Static_Analysis">Static Analysis</a>, <script data-card-contents-for-ri="2201" type="text/json">{"id":2201,"name":"Static Analysis","url":"https://www.academia.edu/Documents/in/Static_Analysis?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="7376" href="https://www.academia.edu/Documents/in/Linux_Kernel">Linux Kernel</a><script data-card-contents-for-ri="7376" type="text/json">{"id":7376,"name":"Linux Kernel","url":"https://www.academia.edu/Documents/in/Linux_Kernel?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=4154356]'), work: {"id":4154356,"title":" Detecting Deadlock, Double-Free and Other Abuses in a Million Lines of Linux Kernel Source (SEW 30)","created_at":"2013-08-01T07:26:38.275-07:00","url":"https://www.academia.edu/4154356/Detecting_Deadlock_Double_Free_and_Other_Abuses_in_a_Million_Lines_of_Linux_Kernel_Source_SEW_30_?f_ri=450","dom_id":"work_4154356","summary":null,"downloadable_attachments":[{"id":31661255,"asset_id":4154356,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":650083,"first_name":"Peter","last_name":"Breuer","domain_name":"independent","page_name":"PBreuer","display_name":"Peter Breuer","profile_url":"https://independent.academia.edu/PBreuer?f_ri=450","photo":"https://0.academia-photos.com/650083/1246440/1555669/s65_peter.breuer.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":2201,"name":"Static Analysis","url":"https://www.academia.edu/Documents/in/Static_Analysis?f_ri=450","nofollow":false},{"id":7376,"name":"Linux Kernel","url":"https://www.academia.edu/Documents/in/Linux_Kernel?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_40877913" data-work_id="40877913" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/40877913/Attack_Trees_for_Security_and_Privacy_in_Social_Virtual_Reality_Learning_Environments">Attack Trees for Security and Privacy in Social Virtual Reality Learning Environments</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Social Virtual Reality Learning Environment (VRLE) is a novel edge computing platform for collaboration amongst distributed users. Given that VRLEs are used for critical applications (e.g., special education, public safety training), it... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_40877913" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Social Virtual Reality Learning Environment (VRLE) is a novel edge computing platform for collaboration amongst distributed users. Given that VRLEs are used for critical applications (e.g., special education, public safety training), it is important to ensure security and privacy issues. In this paper, we present a novel framework to obtain quantitative assessments of threats and vulnerabilities for VRLEs. Based on the use cases from an actual social VRLE viz., vSocial, we first model the security and privacy using the attack trees. Subsequently, these attack trees are converted into stochastic timed automata representations that allow for rigorous statistical model checking. Such an analysis helps us adopt pertinent design principles such as hardening, diversity and principle of least privilege to enhance the resilience of social VRLEs.  Through experiments in a vSocial case study, we demonstrate the effectiveness of our attack tree modeling with a reduction of 26% in probability of loss of integrity (security) and 80% in privacy leakage (privacy) in before and after scenarios pertaining to the adoption of the design principles.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/40877913" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="01ff4badeb47b42af3c60549a8282685" rel="nofollow" data-download="{"attachment_id":61165038,"asset_id":40877913,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/61165038/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="1520963" href="https://missouri.academia.edu/KhazaAnuarulHoque">Khaza Anuarul Hoque</a><script data-card-contents-for-user="1520963" type="text/json">{"id":1520963,"first_name":"Khaza Anuarul","last_name":"Hoque","domain_name":"missouri","page_name":"KhazaAnuarulHoque","display_name":"Khaza Anuarul Hoque","profile_url":"https://missouri.academia.edu/KhazaAnuarulHoque?f_ri=450","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_40877913 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="40877913"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 40877913, container: ".js-paper-rank-work_40877913", }); });</script></li><li class="js-percentile-work_40877913 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 40877913; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_40877913"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_40877913 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="40877913"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 40877913; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=40877913]").text(description); $(".js-view-count-work_40877913").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_40877913").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="40877913"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2203" href="https://www.academia.edu/Documents/in/Model_Checking">Model Checking</a>, <script data-card-contents-for-ri="2203" type="text/json">{"id":2203,"name":"Model Checking","url":"https://www.academia.edu/Documents/in/Model_Checking?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="50642" href="https://www.academia.edu/Documents/in/Virtual_Reality">Virtual Reality</a>, <script data-card-contents-for-ri="50642" type="text/json">{"id":50642,"name":"Virtual Reality","url":"https://www.academia.edu/Documents/in/Virtual_Reality?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1548244" href="https://www.academia.edu/Documents/in/Attack_trees">Attack trees</a><script data-card-contents-for-ri="1548244" type="text/json">{"id":1548244,"name":"Attack trees","url":"https://www.academia.edu/Documents/in/Attack_trees?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=40877913]'), work: {"id":40877913,"title":"Attack Trees for Security and Privacy in Social Virtual Reality Learning Environments","created_at":"2019-11-08T08:02:49.158-08:00","url":"https://www.academia.edu/40877913/Attack_Trees_for_Security_and_Privacy_in_Social_Virtual_Reality_Learning_Environments?f_ri=450","dom_id":"work_40877913","summary":"Social Virtual Reality Learning Environment (VRLE) is a novel edge computing platform for collaboration amongst distributed users. Given that VRLEs are used for critical applications (e.g., special education, public safety training), it is important to ensure security and privacy issues. In this paper, we present a novel framework to obtain quantitative assessments of threats and vulnerabilities for VRLEs. Based on the use cases from an actual social VRLE viz., vSocial, we first model the security and privacy using the attack trees. Subsequently, these attack trees are converted into stochastic timed automata representations that allow for rigorous statistical model checking. Such an analysis helps us adopt pertinent design principles such as hardening, diversity and principle of least privilege to enhance the resilience of social VRLEs. Through experiments in a vSocial case study, we demonstrate the effectiveness of our attack tree modeling with a reduction of 26% in probability of loss of integrity (security) and 80% in privacy leakage (privacy) in before and after scenarios pertaining to the adoption of the design principles.","downloadable_attachments":[{"id":61165038,"asset_id":40877913,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":1520963,"first_name":"Khaza Anuarul","last_name":"Hoque","domain_name":"missouri","page_name":"KhazaAnuarulHoque","display_name":"Khaza Anuarul Hoque","profile_url":"https://missouri.academia.edu/KhazaAnuarulHoque?f_ri=450","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":2203,"name":"Model Checking","url":"https://www.academia.edu/Documents/in/Model_Checking?f_ri=450","nofollow":false},{"id":50642,"name":"Virtual Reality","url":"https://www.academia.edu/Documents/in/Virtual_Reality?f_ri=450","nofollow":false},{"id":1548244,"name":"Attack trees","url":"https://www.academia.edu/Documents/in/Attack_trees?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_77324833" data-work_id="77324833" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/77324833/11th_International_Conference_on_Software_Engineering_and_Applications_SEAPP_2022_">11th International Conference on Software Engineering and Applications (SEAPP 2022)</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">org/seapp/index Scope 11 th International Conference on Software Engineering and Applications (SEAPP 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Software... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_77324833" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">org/seapp/index Scope 11 th International Conference on Software Engineering and Applications (SEAPP 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Software Engineering and Applications. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on understanding Modern software engineering concepts and establishing new collaborations in these areas. Authors are solicited to contribute to the Conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of software engineering & applications.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/77324833" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="940cb36926b45ce74d49c8f9a4fe2362" rel="nofollow" data-download="{"attachment_id":92222748,"asset_id":77324833,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/92222748/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="21343660" href="https://independent.academia.edu/IjcseitJournal">International Journal of Computer Science, Engineering and Information Technology (IJCSEIT)</a><script data-card-contents-for-user="21343660" type="text/json">{"id":21343660,"first_name":"International Journal of Computer Science, Engineering and Information Technology","last_name":"(IJCSEIT)","domain_name":"independent","page_name":"IjcseitJournal","display_name":"International Journal of Computer Science, Engineering and Information Technology (IJCSEIT)","profile_url":"https://independent.academia.edu/IjcseitJournal?f_ri=450","photo":"https://0.academia-photos.com/21343660/5954549/114311412/s65_international_journal_of_computer_science_engineering_and_information_technology._ijcseit_.jpg"}</script></span></span></li><li class="js-paper-rank-work_77324833 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="77324833"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 77324833, container: ".js-paper-rank-work_77324833", }); });</script></li><li class="js-percentile-work_77324833 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 77324833; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_77324833"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_77324833 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="77324833"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 77324833; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=77324833]").text(description); $(".js-view-count-work_77324833").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_77324833").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="77324833"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">10</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1200" href="https://www.academia.edu/Documents/in/Languages_and_Linguistics">Languages and Linguistics</a>, <script data-card-contents-for-ri="1200" type="text/json">{"id":1200,"name":"Languages and Linguistics","url":"https://www.academia.edu/Documents/in/Languages_and_Linguistics?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1384" href="https://www.academia.edu/Documents/in/Web_Engineering">Web Engineering</a><script data-card-contents-for-ri="1384" type="text/json">{"id":1384,"name":"Web Engineering","url":"https://www.academia.edu/Documents/in/Web_Engineering?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=77324833]'), work: {"id":77324833,"title":"11th International Conference on Software Engineering and Applications (SEAPP 2022)","created_at":"2022-04-22T23:38:04.849-07:00","url":"https://www.academia.edu/77324833/11th_International_Conference_on_Software_Engineering_and_Applications_SEAPP_2022_?f_ri=450","dom_id":"work_77324833","summary":"org/seapp/index Scope 11 th International Conference on Software Engineering and Applications (SEAPP 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Software Engineering and Applications. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on understanding Modern software engineering concepts and establishing new collaborations in these areas. Authors are solicited to contribute to the Conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of software engineering \u0026 applications.","downloadable_attachments":[{"id":92222748,"asset_id":77324833,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":21343660,"first_name":"International Journal of Computer Science, Engineering and Information Technology","last_name":"(IJCSEIT)","domain_name":"independent","page_name":"IjcseitJournal","display_name":"International Journal of Computer Science, Engineering and Information Technology (IJCSEIT)","profile_url":"https://independent.academia.edu/IjcseitJournal?f_ri=450","photo":"https://0.academia-photos.com/21343660/5954549/114311412/s65_international_journal_of_computer_science_engineering_and_information_technology._ijcseit_.jpg"}],"research_interests":[{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":1200,"name":"Languages and Linguistics","url":"https://www.academia.edu/Documents/in/Languages_and_Linguistics?f_ri=450","nofollow":false},{"id":1384,"name":"Web Engineering","url":"https://www.academia.edu/Documents/in/Web_Engineering?f_ri=450","nofollow":false},{"id":1450,"name":"Software Maintenance","url":"https://www.academia.edu/Documents/in/Software_Maintenance?f_ri=450"},{"id":1451,"name":"Quality Management","url":"https://www.academia.edu/Documents/in/Quality_Management?f_ri=450"},{"id":3419,"name":"Multimedia","url":"https://www.academia.edu/Documents/in/Multimedia?f_ri=450"},{"id":4065,"name":"Software Process Improvement and Assessment","url":"https://www.academia.edu/Documents/in/Software_Process_Improvement_and_Assessment?f_ri=450"},{"id":84577,"name":"Knowledge-Based Systems","url":"https://www.academia.edu/Documents/in/Knowledge-Based_Systems?f_ri=450"},{"id":280121,"name":"Social Media and Web 2.0 Applications in Education and learning","url":"https://www.academia.edu/Documents/in/Social_Media_and_Web_2.0_Applications_in_Education_and_learning?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_41381405" data-work_id="41381405" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/41381405/Assessment_of_failures_due_to_human_interventions_in_Formal_Specification_and_Verification_of_a_Safety_Critical_systemI_">Assessment of failures due to human interventions in “Formal Specification & Verification” of a Safety Critical systemI-</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In Safety Critical Systems, failure means a hazardous situation or even loss of life. Errors are unacceptable in SCS. Formal methods are used to minimize the impact of ambiguous requirements. FM's varies with domains. Development process... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_41381405" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In Safety Critical Systems, failure means a hazardous situation or even loss of life. Errors are unacceptable in SCS. Formal methods are used to minimize the impact of ambiguous requirements. FM's varies with domains. Development process involves domain experts, safety engineers and software engineers. They do formal specification & verification of the requirement which varies according to the safety standards. This process is depending upon the human interventions with the tools or at the time of specifying the properties of the system. That's why we are not at the stage to claim a fully fault free reliable system.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/41381405" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="0bfdbd1d88694746c0f6ff59d30eb1ad" rel="nofollow" data-download="{"attachment_id":61575850,"asset_id":41381405,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/61575850/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="62725854" href="https://hublink3.academia.edu/MuhammadFarooq">Muhammad Farooq</a><script data-card-contents-for-user="62725854" type="text/json">{"id":62725854,"first_name":"Muhammad","last_name":"Farooq","domain_name":"hublink3","page_name":"MuhammadFarooq","display_name":"Muhammad Farooq","profile_url":"https://hublink3.academia.edu/MuhammadFarooq?f_ri=450","photo":"https://gravatar.com/avatar/e6b972c55eeb5ea2fcbdbe0198cc8ada?s=65"}</script></span></span></li><li class="js-paper-rank-work_41381405 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="41381405"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 41381405, container: ".js-paper-rank-work_41381405", }); });</script></li><li class="js-percentile-work_41381405 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 41381405; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_41381405"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_41381405 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="41381405"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 41381405; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=41381405]").text(description); $(".js-view-count-work_41381405").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_41381405").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="41381405"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">2</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="36535" href="https://www.academia.edu/Documents/in/Safety-Critical_Systems">Safety-Critical Systems</a><script data-card-contents-for-ri="36535" type="text/json">{"id":36535,"name":"Safety-Critical Systems","url":"https://www.academia.edu/Documents/in/Safety-Critical_Systems?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=41381405]'), work: {"id":41381405,"title":"Assessment of failures due to human interventions in “Formal Specification \u0026 Verification” of a Safety Critical systemI-","created_at":"2019-12-21T04:59:19.837-08:00","url":"https://www.academia.edu/41381405/Assessment_of_failures_due_to_human_interventions_in_Formal_Specification_and_Verification_of_a_Safety_Critical_systemI_?f_ri=450","dom_id":"work_41381405","summary":"In Safety Critical Systems, failure means a hazardous situation or even loss of life. Errors are unacceptable in SCS. Formal methods are used to minimize the impact of ambiguous requirements. FM's varies with domains. Development process involves domain experts, safety engineers and software engineers. They do formal specification \u0026 verification of the requirement which varies according to the safety standards. This process is depending upon the human interventions with the tools or at the time of specifying the properties of the system. That's why we are not at the stage to claim a fully fault free reliable system.","downloadable_attachments":[{"id":61575850,"asset_id":41381405,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":62725854,"first_name":"Muhammad","last_name":"Farooq","domain_name":"hublink3","page_name":"MuhammadFarooq","display_name":"Muhammad Farooq","profile_url":"https://hublink3.academia.edu/MuhammadFarooq?f_ri=450","photo":"https://gravatar.com/avatar/e6b972c55eeb5ea2fcbdbe0198cc8ada?s=65"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":36535,"name":"Safety-Critical Systems","url":"https://www.academia.edu/Documents/in/Safety-Critical_Systems?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_4564968" data-work_id="4564968" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/4564968/SPECIFYING_CLASS_HIERARCHIES_IN_Z">SPECIFYING CLASS HIERARCHIES IN Z</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The main target of this research is to provide a formal meta model for object-oriented systems. It provides a formal definition of the object-oriented concepts along with major consistency rules for object-oriented systems. This research... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_4564968" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The main target of this research is to provide a formal meta model for object-oriented systems. It provides a formal definition of the object-oriented concepts along with major consistency rules for object-oriented systems. This research is a contribution to the formalization of object-oriented systems. Other existing models fail to define the notion of virtual function and virtual class. In this article both concepts are specified in the proposed model and used to clarify the OO related concepts. To illustrate the expressiveness of the model a formal specification of the MOOD metric suite is provided using the model. The formal definition of the POF metric is successfully defined, providing one of the first Z formal specification for the POF metric thereof.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/4564968" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="a2b207d2809f96259a165105035d0d54" rel="nofollow" data-download="{"attachment_id":31940516,"asset_id":4564968,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31940516/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="229957" href="https://fsr.academia.edu/Youn%C3%A8sELAMRANI">Younès EL AMRANI</a><script data-card-contents-for-user="229957" type="text/json">{"id":229957,"first_name":"Younès","last_name":"EL AMRANI","domain_name":"fsr","page_name":"YounèsELAMRANI","display_name":"Younès EL AMRANI","profile_url":"https://fsr.academia.edu/Youn%C3%A8sELAMRANI?f_ri=450","photo":"https://0.academia-photos.com/229957/2765444/16012415/s65_youn_s.el_amrani.jpg"}</script></span></span></li><li class="js-paper-rank-work_4564968 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="4564968"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 4564968, container: ".js-paper-rank-work_4564968", }); });</script></li><li class="js-percentile-work_4564968 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 4564968; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_4564968"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_4564968 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="4564968"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4564968; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4564968]").text(description); $(".js-view-count-work_4564968").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_4564968").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="4564968"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i></div><span class="InlineList-item-text u-textTruncate u-pl6x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a><script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (false) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=4564968]'), work: {"id":4564968,"title":"SPECIFYING CLASS HIERARCHIES IN Z","created_at":"2013-09-23T14:11:59.196-07:00","url":"https://www.academia.edu/4564968/SPECIFYING_CLASS_HIERARCHIES_IN_Z?f_ri=450","dom_id":"work_4564968","summary":"The main target of this research is to provide a formal meta model for object-oriented systems. It provides a formal definition of the object-oriented concepts along with major consistency rules for object-oriented systems. This research is a contribution to the formalization of object-oriented systems. Other existing models fail to define the notion of virtual function and virtual class. In this article both concepts are specified in the proposed model and used to clarify the OO related concepts. To illustrate the expressiveness of the model a formal specification of the MOOD metric suite is provided using the model. The formal definition of the POF metric is successfully defined, providing one of the first Z formal specification for the POF metric thereof.","downloadable_attachments":[{"id":31940516,"asset_id":4564968,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":229957,"first_name":"Younès","last_name":"EL AMRANI","domain_name":"fsr","page_name":"YounèsELAMRANI","display_name":"Younès EL AMRANI","profile_url":"https://fsr.academia.edu/Youn%C3%A8sELAMRANI?f_ri=450","photo":"https://0.academia-photos.com/229957/2765444/16012415/s65_youn_s.el_amrani.jpg"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_4016362" data-work_id="4016362" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/4016362/Personal_view_Formal_methods_epideictic_or_apodeictic">Personal view: Formal methods: epideictic or apodeictic</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">If you are confused by the title above you are in the same boat as the vast majority of software producers when confronted with a display of formal methods. The easiest option when dealing with an activity whose benefi ts are doubtful... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_4016362" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">If you are confused by the title above you are in the same boat as the vast majority of software producers when confronted with <br />a display of formal methods. The easiest option when dealing with an activity whose benefits are doubtful and which looks impenetrable is to ignore it and do without. This is precisely what most software developers do and not necessarily to the detriment of their business (unless this business has safety implications); witness Microsoft, which makes millions of dollars selling MS-DOS and Windows without a single quantifier in sight. Even a successful mathematical product such as Mathematica, which supports the interactive computer-based use of mathematics, consists of the order of a million lines of C-based code produced with no formal development.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/4016362" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="499622d7891fd83ae4b81aded7e5d4d2" rel="nofollow" data-download="{"attachment_id":31560692,"asset_id":4016362,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31560692/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="12280" href="https://lsbu.academia.edu/JonathanBowen">Jonathan Bowen</a><script data-card-contents-for-user="12280" type="text/json">{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}</script></span></span></li><li class="js-paper-rank-work_4016362 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="4016362"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 4016362, container: ".js-paper-rank-work_4016362", }); });</script></li><li class="js-percentile-work_4016362 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 4016362; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_4016362"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_4016362 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="4016362"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4016362; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4016362]").text(description); $(".js-view-count-work_4016362").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_4016362").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="4016362"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">11</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1449" href="https://www.academia.edu/Documents/in/Requirements_Engineering">Requirements Engineering</a><script data-card-contents-for-ri="1449" type="text/json">{"id":1449,"name":"Requirements Engineering","url":"https://www.academia.edu/Documents/in/Requirements_Engineering?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=4016362]'), work: {"id":4016362,"title":"Personal view: Formal methods: epideictic or apodeictic","created_at":"2013-07-12T08:18:38.075-07:00","url":"https://www.academia.edu/4016362/Personal_view_Formal_methods_epideictic_or_apodeictic?f_ri=450","dom_id":"work_4016362","summary":"If you are confused by the title above you are in the same boat as the vast majority of software producers when confronted with\r\na display of formal methods. The easiest option when dealing with an activity whose benefi\fts are doubtful and which looks impenetrable is to ignore it and do without. This is precisely what most software developers do and not necessarily to the detriment of their business (unless this business has safety implications); witness Microsoft, which makes millions of dollars selling MS-DOS and Windows without a single quantifi\fer in sight. Even a successful mathematical product such as Mathematica, which supports the interactive computer-based use of mathematics, consists of the order of a million lines of C-based code produced with no formal development.\r\n","downloadable_attachments":[{"id":31560692,"asset_id":4016362,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":1449,"name":"Requirements Engineering","url":"https://www.academia.edu/Documents/in/Requirements_Engineering?f_ri=450","nofollow":false},{"id":7585,"name":"ICT in Education","url":"https://www.academia.edu/Documents/in/ICT_in_Education?f_ri=450"},{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=450"},{"id":9542,"name":"Formal Methods (Formal Methods)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Methods_?f_ri=450"},{"id":9967,"name":"Software Engineering education","url":"https://www.academia.edu/Documents/in/Software_Engineering_education?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":55826,"name":"Software Requirement Engineering","url":"https://www.academia.edu/Documents/in/Software_Requirement_Engineering?f_ri=450"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_9574766" data-work_id="9574766" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/9574766/Diverse_Axiomatic_Bases_for_Development_of_Safe_and_Dependable_Systems">Diverse Axiomatic Bases for Development of Safe and Dependable Systems</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In this paper there is an attempt to descript a logic basis and general way to design safe and dependable systems. The notion ‘diverse axiomatic bases’ had been introduced. It is shown that the safe and dependable software and hardware... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_9574766" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In this paper there is an attempt to descript a logic basis and general way to design safe and dependable systems. The notion ‘diverse axiomatic bases’ had been introduced. It is shown that the safe and dependable software and hardware development, which is based on diverse axiomatic bases, allow formalizing terms of diversity and common cause failure. Examples are given of such diverse axiomatic bases and ways how to use for proof of correctness for microprocessor systems. Finally, it is argued that possible important advantages, both theoretical and practical, which may follow from these topics.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/9574766" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="4cae11d8cf8d20e6d898c9f31744695f" rel="nofollow" data-download="{"attachment_id":35788843,"asset_id":9574766,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/35788843/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="19695664" href="https://gomel.academia.edu/BorisSivko">Boris Sivko</a><script data-card-contents-for-user="19695664" type="text/json">{"id":19695664,"first_name":"Boris","last_name":"Sivko","domain_name":"gomel","page_name":"BorisSivko","display_name":"Boris Sivko","profile_url":"https://gomel.academia.edu/BorisSivko?f_ri=450","photo":"https://gravatar.com/avatar/3df85ade91aada27414d76949dd19edf?s=65"}</script></span></span></li><li class="js-paper-rank-work_9574766 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="9574766"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 9574766, container: ".js-paper-rank-work_9574766", }); });</script></li><li class="js-percentile-work_9574766 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 9574766; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_9574766"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_9574766 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="9574766"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 9574766; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=9574766]").text(description); $(".js-view-count-work_9574766").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_9574766").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="9574766"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="11856" href="https://www.academia.edu/Documents/in/Axiomatics">Axiomatics</a>, <script data-card-contents-for-ri="11856" type="text/json">{"id":11856,"name":"Axiomatics","url":"https://www.academia.edu/Documents/in/Axiomatics?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="14681" href="https://www.academia.edu/Documents/in/Formal_methods">Formal methods</a>, <script data-card-contents-for-ri="14681" type="text/json">{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="36535" href="https://www.academia.edu/Documents/in/Safety-Critical_Systems">Safety-Critical Systems</a><script data-card-contents-for-ri="36535" type="text/json">{"id":36535,"name":"Safety-Critical Systems","url":"https://www.academia.edu/Documents/in/Safety-Critical_Systems?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=9574766]'), work: {"id":9574766,"title":"Diverse Axiomatic Bases for Development of Safe and Dependable Systems","created_at":"2014-11-30T21:30:38.734-08:00","url":"https://www.academia.edu/9574766/Diverse_Axiomatic_Bases_for_Development_of_Safe_and_Dependable_Systems?f_ri=450","dom_id":"work_9574766","summary":"In this paper there is an attempt to descript a logic basis and general way to design safe and dependable systems. The notion ‘diverse axiomatic bases’ had been introduced. It is shown that the safe and dependable software and hardware development, which is based on diverse axiomatic bases, allow formalizing terms of diversity and common cause failure. Examples are given of such diverse axiomatic bases and ways how to use for proof of correctness for microprocessor systems. Finally, it is argued that possible important advantages, both theoretical and practical, which may follow from these topics.","downloadable_attachments":[{"id":35788843,"asset_id":9574766,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":19695664,"first_name":"Boris","last_name":"Sivko","domain_name":"gomel","page_name":"BorisSivko","display_name":"Boris Sivko","profile_url":"https://gomel.academia.edu/BorisSivko?f_ri=450","photo":"https://gravatar.com/avatar/3df85ade91aada27414d76949dd19edf?s=65"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":11856,"name":"Axiomatics","url":"https://www.academia.edu/Documents/in/Axiomatics?f_ri=450","nofollow":false},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450","nofollow":false},{"id":36535,"name":"Safety-Critical Systems","url":"https://www.academia.edu/Documents/in/Safety-Critical_Systems?f_ri=450","nofollow":false},{"id":47840,"name":"Dependability","url":"https://www.academia.edu/Documents/in/Dependability?f_ri=450"},{"id":707524,"name":"Mission-Critical Systems","url":"https://www.academia.edu/Documents/in/Mission-Critical_Systems?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_288602" data-work_id="288602" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/288602/Safety_Critical_Systems_Formal_Methods_and_Standards">Safety-Critical Systems, Formal Methods and Standards</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Standards concerned with the development of safety-critical systems, and the software in such systems in particular, abound today as the software crisis increasingly affects the world of embedded computer-based systems. The use of formal... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_288602" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Standards concerned with the development of safety-critical systems, and the software in such systems in particular, abound today as the software crisis increasingly affects the world of embedded computer-based systems. The use of formal methods is often advocated as a way of increasing confidence in such systems. This paper examines the industrial use of these techniques, the recommendations concerning formal methods in a number of current and draft standards, and comments on the applicability and problems of using formal methods for the development of safety-critical systems of an industrial scale. Some possible future directions are suggested. <br /> <br />Winner of the IEE Charles Babbage Premium award, 1994. Other versions issued as a Oxford University Computing Laboratory Technical Report PRG-TR-5-92, and Chapter 1 in Towards Verified Systems.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/288602" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="66bf5bf7aacdfb8b35d9adae0679796b" rel="nofollow" data-download="{"attachment_id":31771386,"asset_id":288602,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31771386/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="12280" href="https://lsbu.academia.edu/JonathanBowen">Jonathan Bowen</a><script data-card-contents-for-user="12280" type="text/json">{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}</script></span></span></li><li class="js-paper-rank-work_288602 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="288602"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 288602, container: ".js-paper-rank-work_288602", }); });</script></li><li class="js-percentile-work_288602 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 288602; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_288602"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_288602 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="288602"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 288602; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=288602]").text(description); $(".js-view-count-work_288602").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_288602").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="288602"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">20</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="85" href="https://www.academia.edu/Documents/in/Safety_Engineering">Safety Engineering</a>, <script data-card-contents-for-ri="85" type="text/json">{"id":85,"name":"Safety Engineering","url":"https://www.academia.edu/Documents/in/Safety_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a><script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=288602]'), work: {"id":288602,"title":"Safety-Critical Systems, Formal Methods and Standards","created_at":"2010-08-07T09:16:51.132-07:00","url":"https://www.academia.edu/288602/Safety_Critical_Systems_Formal_Methods_and_Standards?f_ri=450","dom_id":"work_288602","summary":"Standards concerned with the development of safety-critical systems, and the software in such systems in particular, abound today as the software crisis increasingly affects the world of embedded computer-based systems. The use of formal methods is often advocated as a way of increasing confidence in such systems. This paper examines the industrial use of these techniques, the recommendations concerning formal methods in a number of current and draft standards, and comments on the applicability and problems of using formal methods for the development of safety-critical systems of an industrial scale. Some possible future directions are suggested.\r\n\r\nWinner of the IEE Charles Babbage Premium award, 1994. Other versions issued as a Oxford University Computing Laboratory Technical Report PRG-TR-5-92, and Chapter 1 in Towards Verified Systems. ","downloadable_attachments":[{"id":31771386,"asset_id":288602,"asset_type":"Work","always_allow_download":false},{"id":1338419,"asset_id":288602,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}],"research_interests":[{"id":85,"name":"Safety Engineering","url":"https://www.academia.edu/Documents/in/Safety_Engineering?f_ri=450","nofollow":false},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":1449,"name":"Requirements Engineering","url":"https://www.academia.edu/Documents/in/Requirements_Engineering?f_ri=450"},{"id":7639,"name":"Standards","url":"https://www.academia.edu/Documents/in/Standards?f_ri=450"},{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=450"},{"id":9542,"name":"Formal Methods (Formal Methods)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Methods_?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":28532,"name":"Software Reliability","url":"https://www.academia.edu/Documents/in/Software_Reliability?f_ri=450"},{"id":35232,"name":"Reliability Engineering","url":"https://www.academia.edu/Documents/in/Reliability_Engineering?f_ri=450"},{"id":35397,"name":"Safety and reliability and risk management","url":"https://www.academia.edu/Documents/in/Safety_and_reliability_and_risk_management?f_ri=450"},{"id":36535,"name":"Safety-Critical Systems","url":"https://www.academia.edu/Documents/in/Safety-Critical_Systems?f_ri=450"},{"id":47840,"name":"Dependability","url":"https://www.academia.edu/Documents/in/Dependability?f_ri=450"},{"id":49161,"name":"Safety","url":"https://www.academia.edu/Documents/in/Safety?f_ri=450"},{"id":55826,"name":"Software Requirement Engineering","url":"https://www.academia.edu/Documents/in/Software_Requirement_Engineering?f_ri=450"},{"id":88234,"name":"Software Dependability","url":"https://www.academia.edu/Documents/in/Software_Dependability?f_ri=450"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=450"},{"id":190179,"name":"Dependable Computing","url":"https://www.academia.edu/Documents/in/Dependable_Computing?f_ri=450"},{"id":987817,"name":"Safety Study","url":"https://www.academia.edu/Documents/in/Safety_Study?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_71712340" data-work_id="71712340" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/71712340/Software_engineering_and_formal_methods">Software engineering and formal methods</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest">The answer to software reliability concerns may lie in formal methods.</div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/71712340" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="5a0e748e8171f1a622a0506bb6bd1198" rel="nofollow" data-download="{"attachment_id":80941951,"asset_id":71712340,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/80941951/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="35216538" href="https://independent.academia.edu/DGiannakopoulou">D. Giannakopoulou</a><script data-card-contents-for-user="35216538" type="text/json">{"id":35216538,"first_name":"D.","last_name":"Giannakopoulou","domain_name":"independent","page_name":"DGiannakopoulou","display_name":"D. Giannakopoulou","profile_url":"https://independent.academia.edu/DGiannakopoulou?f_ri=450","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_71712340 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="71712340"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 71712340, container: ".js-paper-rank-work_71712340", }); });</script></li><li class="js-percentile-work_71712340 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 71712340; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_71712340"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_71712340 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="71712340"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 71712340; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=71712340]").text(description); $(".js-view-count-work_71712340").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_71712340").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="71712340"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="37" href="https://www.academia.edu/Documents/in/Information_Systems">Information Systems</a>, <script data-card-contents-for-ri="37" type="text/json">{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a><script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=71712340]'), work: {"id":71712340,"title":"Software engineering and formal methods","created_at":"2022-02-16T15:52:16.373-08:00","url":"https://www.academia.edu/71712340/Software_engineering_and_formal_methods?f_ri=450","dom_id":"work_71712340","summary":"The answer to software reliability concerns may lie in formal methods.","downloadable_attachments":[{"id":80941951,"asset_id":71712340,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":35216538,"first_name":"D.","last_name":"Giannakopoulou","domain_name":"independent","page_name":"DGiannakopoulou","display_name":"D. Giannakopoulou","profile_url":"https://independent.academia.edu/DGiannakopoulou?f_ri=450","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=450","nofollow":false},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":28532,"name":"Software Reliability","url":"https://www.academia.edu/Documents/in/Software_Reliability?f_ri=450"},{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=450"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=450"},{"id":126194,"name":"Formal method","url":"https://www.academia.edu/Documents/in/Formal_method?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_43419872" data-work_id="43419872" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/43419872/Account_and_Transaction_Protocol_of_the_Open_Banking_Standard">Account and Transaction Protocol of the Open Banking Standard</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">To counteract the lack of competition and innovation in the financial services industry, the EU has issued the Second Payment Services Directive (PSD2) encouraging account servicing payment service providers to share data. The UK,... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_43419872" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">To counteract the lack of competition and innovation in the financial services industry, the EU has issued the Second Payment Services Directive (PSD2) encouraging account servicing payment service providers to share data. The UK, similarly to other European countries, has promoted a standard API for data sharing: the Open Banking Standard. We present an overview of the result of a formal security analysis of the Account and Transaction API protocol.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/43419872" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="543d0fecf42983c3f1399c33b52db0d7" rel="nofollow" data-download="{"attachment_id":63721584,"asset_id":43419872,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/63721584/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="61467952" href="https://tees.academia.edu/PaoloModesti">Paolo Modesti</a><script data-card-contents-for-user="61467952" type="text/json">{"id":61467952,"first_name":"Paolo","last_name":"Modesti","domain_name":"tees","page_name":"PaoloModesti","display_name":"Paolo Modesti","profile_url":"https://tees.academia.edu/PaoloModesti?f_ri=450","photo":"https://0.academia-photos.com/61467952/15974966/20773027/s65_paolo.modesti.jpg"}</script></span></span></li><li class="js-paper-rank-work_43419872 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="43419872"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 43419872, container: ".js-paper-rank-work_43419872", }); });</script></li><li class="js-percentile-work_43419872 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 43419872; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_43419872"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_43419872 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="43419872"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 43419872; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=43419872]").text(description); $(".js-view-count-work_43419872").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_43419872").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="43419872"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1283" href="https://www.academia.edu/Documents/in/Information_Security">Information Security</a>, <script data-card-contents-for-ri="1283" type="text/json">{"id":1283,"name":"Information Security","url":"https://www.academia.edu/Documents/in/Information_Security?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="130950" href="https://www.academia.edu/Documents/in/Electronic_Banking">Electronic Banking</a>, <script data-card-contents-for-ri="130950" type="text/json">{"id":130950,"name":"Electronic Banking","url":"https://www.academia.edu/Documents/in/Electronic_Banking?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2857865" href="https://www.academia.edu/Documents/in/open_banking">open banking</a><script data-card-contents-for-ri="2857865" type="text/json">{"id":2857865,"name":"open banking","url":"https://www.academia.edu/Documents/in/open_banking?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=43419872]'), work: {"id":43419872,"title":"Account and Transaction Protocol of the Open Banking Standard","created_at":"2020-06-23T16:28:28.599-07:00","url":"https://www.academia.edu/43419872/Account_and_Transaction_Protocol_of_the_Open_Banking_Standard?f_ri=450","dom_id":"work_43419872","summary":"To counteract the lack of competition and innovation in the financial services industry, the EU has issued the Second Payment Services Directive (PSD2) encouraging account servicing payment service providers to share data. The UK, similarly to other European countries, has promoted a standard API for data sharing: the Open Banking Standard. We present an overview of the result of a formal security analysis of the Account and Transaction API protocol.","downloadable_attachments":[{"id":63721584,"asset_id":43419872,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":61467952,"first_name":"Paolo","last_name":"Modesti","domain_name":"tees","page_name":"PaoloModesti","display_name":"Paolo Modesti","profile_url":"https://tees.academia.edu/PaoloModesti?f_ri=450","photo":"https://0.academia-photos.com/61467952/15974966/20773027/s65_paolo.modesti.jpg"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":1283,"name":"Information Security","url":"https://www.academia.edu/Documents/in/Information_Security?f_ri=450","nofollow":false},{"id":130950,"name":"Electronic Banking","url":"https://www.academia.edu/Documents/in/Electronic_Banking?f_ri=450","nofollow":false},{"id":2857865,"name":"open banking","url":"https://www.academia.edu/Documents/in/open_banking?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_2827198" data-work_id="2827198" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/2827198/Towards_formal_verification_of_PLC_programs">Towards formal verification of PLC programs</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Abstract. Control systems commonly employ Programmable Logic Controllers (PLCs); it would be very useful, since some are safety critical, to use formal methods to increase their security. In this paper we propose a method to verify the... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_2827198" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Abstract. Control systems commonly employ Programmable Logic Controllers (PLCs); it would be very useful, since some are safety critical, to use formal methods to increase their security. In this paper we propose a method to verify the PLCs with the B method generating automatically the formal models, which would make it possible to integrate formal methods to an existing industrial process. We also present a case study that is being carried out in a real railway project with high speed trains.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/2827198" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="bad0e2c2cb066844cddac2f189576032" rel="nofollow" data-download="{"attachment_id":30747738,"asset_id":2827198,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/30747738/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="187889" href="https://ufrn.academia.edu/DavidD%C3%A9harbe">David Déharbe</a><script data-card-contents-for-user="187889" type="text/json">{"id":187889,"first_name":"David","last_name":"Déharbe","domain_name":"ufrn","page_name":"DavidDéharbe","display_name":"David Déharbe","profile_url":"https://ufrn.academia.edu/DavidD%C3%A9harbe?f_ri=450","photo":"https://0.academia-photos.com/187889/89965/97939/s65_david.deharbe.jpg"}</script></span></span></li><li class="js-paper-rank-work_2827198 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="2827198"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 2827198, container: ".js-paper-rank-work_2827198", }); });</script></li><li class="js-percentile-work_2827198 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 2827198; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_2827198"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_2827198 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="2827198"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 2827198; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=2827198]").text(description); $(".js-view-count-work_2827198").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_2827198").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="2827198"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">2</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="63426" href="https://www.academia.edu/Documents/in/PLC">PLC</a><script data-card-contents-for-ri="63426" type="text/json">{"id":63426,"name":"PLC","url":"https://www.academia.edu/Documents/in/PLC?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=2827198]'), work: {"id":2827198,"title":"Towards formal verification of PLC programs","created_at":"2013-03-03T19:32:54.453-08:00","url":"https://www.academia.edu/2827198/Towards_formal_verification_of_PLC_programs?f_ri=450","dom_id":"work_2827198","summary":"Abstract. Control systems commonly employ Programmable Logic Controllers (PLCs); it would be very useful, since some are safety critical, to use formal methods to increase their security. In this paper we propose a method to verify the PLCs with the B method generating automatically the formal models, which would make it possible to integrate formal methods to an existing industrial process. We also present a case study that is being carried out in a real railway project with high speed trains.","downloadable_attachments":[{"id":30747738,"asset_id":2827198,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":187889,"first_name":"David","last_name":"Déharbe","domain_name":"ufrn","page_name":"DavidDéharbe","display_name":"David Déharbe","profile_url":"https://ufrn.academia.edu/DavidD%C3%A9harbe?f_ri=450","photo":"https://0.academia-photos.com/187889/89965/97939/s65_david.deharbe.jpg"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":63426,"name":"PLC","url":"https://www.academia.edu/Documents/in/PLC?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_14137730" data-work_id="14137730" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/14137730/AUTOMATED_VERIFICATION_OF_ROLE_BASED_ACCESS_CONTROL_POLICIES_CONSTRAINTS_USING_PROVER9">AUTOMATED VERIFICATION OF ROLE-BASED ACCESS CONTROL POLICIES CONSTRAINTS USING PROVER9</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Access control policies are used to restrict access to sensitive records for authorized users only. One approach for specifying policies is using role based access control (RBAC) where authorization is given to roles instead of users.... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_14137730" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Access control policies are used to restrict access to sensitive records for authorized users only. One approach for specifying policies is using role based access control (RBAC) where authorization is given to roles instead of users. Users are assigned to roles such that each user can access all the records that are allowed to his/her role. RBAC has a great interest because of its flexibility. One issue in RBAC is dealing with constraints. Usually, policies should satisfy pre-defined constraints as for example separation of duty (SOD) which states that users are not allowed to play two conflicting roles. Verifying the satisfiability of constraints based on policies is time consuming and may lead to errors. Therefore, an automated verification is essential. In this paper, we propose a theory for specifying policies and constraints in first order logic. Furthermore, we present a comprehensive list of constraints. We identity constraints based on the relation between users and roles, between roles and permission on records, between users and permission on records, and between users, roles, and permission on records. Then, we use a general purpose theorem prover tool called Prover9 for proving the satisfaction of constraints.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/14137730" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="05c7910956b6379265747a509b5ef3d5" rel="nofollow" data-download="{"attachment_id":38212886,"asset_id":14137730,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/38212886/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="21355254" href="https://independent.academia.edu/IJSPTMJournal">International Journal of Security, Privacy and Trust Management (IJSPTM)</a><script data-card-contents-for-user="21355254" type="text/json">{"id":21355254,"first_name":"International Journal of Security, Privacy and Trust Management","last_name":"(IJSPTM)","domain_name":"independent","page_name":"IJSPTMJournal","display_name":"International Journal of Security, Privacy and Trust Management (IJSPTM)","profile_url":"https://independent.academia.edu/IJSPTMJournal?f_ri=450","photo":"https://0.academia-photos.com/21355254/7767449/110969219/s65_international_journal_of_security_privacy_and_trust_management._ijsptm_.jpg"}</script></span></span></li><li class="js-paper-rank-work_14137730 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="14137730"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 14137730, container: ".js-paper-rank-work_14137730", }); });</script></li><li class="js-percentile-work_14137730 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 14137730; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_14137730"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_14137730 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="14137730"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 14137730; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=14137730]").text(description); $(".js-view-count-work_14137730").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_14137730").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="14137730"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">15</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="20791" href="https://www.academia.edu/Documents/in/Theory_of_Constraints">Theory of Constraints</a>, <script data-card-contents-for-ri="20791" type="text/json">{"id":20791,"name":"Theory of Constraints","url":"https://www.academia.edu/Documents/in/Theory_of_Constraints?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="48484" href="https://www.academia.edu/Documents/in/Rationality_Constraints">Rationality Constraints</a>, <script data-card-contents-for-ri="48484" type="text/json">{"id":48484,"name":"Rationality Constraints","url":"https://www.academia.edu/Documents/in/Rationality_Constraints?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="71197" href="https://www.academia.edu/Documents/in/Advanced_Dairy_Farming_Techniques_Constraints_in_Dairy_Farming">Advanced Dairy Farming Techniques, Constraints in Dairy Farming</a><script data-card-contents-for-ri="71197" type="text/json">{"id":71197,"name":"Advanced Dairy Farming Techniques, Constraints in Dairy Farming","url":"https://www.academia.edu/Documents/in/Advanced_Dairy_Farming_Techniques_Constraints_in_Dairy_Farming?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=14137730]'), work: {"id":14137730,"title":"AUTOMATED VERIFICATION OF ROLE-BASED ACCESS CONTROL POLICIES CONSTRAINTS USING PROVER9","created_at":"2015-07-16T21:24:33.301-07:00","url":"https://www.academia.edu/14137730/AUTOMATED_VERIFICATION_OF_ROLE_BASED_ACCESS_CONTROL_POLICIES_CONSTRAINTS_USING_PROVER9?f_ri=450","dom_id":"work_14137730","summary":"Access control policies are used to restrict access to sensitive records for authorized users only. One approach for specifying policies is using role based access control (RBAC) where authorization is given to roles instead of users. Users are assigned to roles such that each user can access all the records that are allowed to his/her role. RBAC has a great interest because of its flexibility. One issue in RBAC is dealing with constraints. Usually, policies should satisfy pre-defined constraints as for example separation of duty (SOD) which states that users are not allowed to play two conflicting roles. Verifying the satisfiability of constraints based on policies is time consuming and may lead to errors. Therefore, an automated verification is essential. In this paper, we propose a theory for specifying policies and constraints in first order logic. Furthermore, we present a comprehensive list of constraints. We identity constraints based on the relation between users and roles, between roles and permission on records, between users and permission on records, and between users, roles, and permission on records. Then, we use a general purpose theorem prover tool called Prover9 for proving the satisfaction of constraints.\n","downloadable_attachments":[{"id":38212886,"asset_id":14137730,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":21355254,"first_name":"International Journal of Security, Privacy and Trust Management","last_name":"(IJSPTM)","domain_name":"independent","page_name":"IJSPTMJournal","display_name":"International Journal of Security, Privacy and Trust Management (IJSPTM)","profile_url":"https://independent.academia.edu/IJSPTMJournal?f_ri=450","photo":"https://0.academia-photos.com/21355254/7767449/110969219/s65_international_journal_of_security_privacy_and_trust_management._ijsptm_.jpg"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":20791,"name":"Theory of Constraints","url":"https://www.academia.edu/Documents/in/Theory_of_Constraints?f_ri=450","nofollow":false},{"id":48484,"name":"Rationality Constraints","url":"https://www.academia.edu/Documents/in/Rationality_Constraints?f_ri=450","nofollow":false},{"id":71197,"name":"Advanced Dairy Farming Techniques, Constraints in Dairy Farming","url":"https://www.academia.edu/Documents/in/Advanced_Dairy_Farming_Techniques_Constraints_in_Dairy_Farming?f_ri=450","nofollow":false},{"id":110800,"name":"Formal Verification of Cryptographic Protocols","url":"https://www.academia.edu/Documents/in/Formal_Verification_of_Cryptographic_Protocols?f_ri=450"},{"id":115338,"name":"Theory of Constraints, Constraints Management","url":"https://www.academia.edu/Documents/in/Theory_of_Constraints_Constraints_Management?f_ri=450"},{"id":175780,"name":"Geochemical constraints of lagoon sediments","url":"https://www.academia.edu/Documents/in/Geochemical_constraints_of_lagoon_sediments?f_ri=450"},{"id":181847,"name":"First-Order Logic","url":"https://www.academia.edu/Documents/in/First-Order_Logic?f_ri=450"},{"id":404176,"name":"Formal Verification of Analog and Mixed Signal Circuits","url":"https://www.academia.edu/Documents/in/Formal_Verification_of_Analog_and_Mixed_Signal_Circuits?f_ri=450"},{"id":422532,"name":"Constraints","url":"https://www.academia.edu/Documents/in/Constraints?f_ri=450"},{"id":495649,"name":"Role-Based Access Control","url":"https://www.academia.edu/Documents/in/Role-Based_Access_Control?f_ri=450"},{"id":679398,"name":"Management Under Constraints and Uncertainty","url":"https://www.academia.edu/Documents/in/Management_Under_Constraints_and_Uncertainty?f_ri=450"},{"id":932332,"name":"Goldratt, Theory of Constraints","url":"https://www.academia.edu/Documents/in/Goldratt_Theory_of_Constraints?f_ri=450"},{"id":986414,"name":"Role Based Access Control","url":"https://www.academia.edu/Documents/in/Role_Based_Access_Control?f_ri=450"},{"id":1153727,"name":"Resource Constraints","url":"https://www.academia.edu/Documents/in/Resource_Constraints?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_20193102" data-work_id="20193102" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/20193102/Crucial_Conversations">Crucial Conversations</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/20193102" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="4762cc94b1642829c45ef756306ab274" rel="nofollow" data-download="{"attachment_id":41058885,"asset_id":20193102,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/41058885/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="41345896" href="https://independent.academia.edu/SantosMireya">Mireya Santos</a><script data-card-contents-for-user="41345896" type="text/json">{"id":41345896,"first_name":"Mireya","last_name":"Santos","domain_name":"independent","page_name":"SantosMireya","display_name":"Mireya Santos","profile_url":"https://independent.academia.edu/SantosMireya?f_ri=450","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_20193102 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="20193102"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 20193102, container: ".js-paper-rank-work_20193102", }); });</script></li><li class="js-percentile-work_20193102 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 20193102; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_20193102"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_20193102 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="20193102"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 20193102; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=20193102]").text(description); $(".js-view-count-work_20193102").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_20193102").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="20193102"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i></div><span class="InlineList-item-text u-textTruncate u-pl6x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a><script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (false) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=20193102]'), work: {"id":20193102,"title":"Crucial Conversations","created_at":"2016-01-12T06:40:36.968-08:00","url":"https://www.academia.edu/20193102/Crucial_Conversations?f_ri=450","dom_id":"work_20193102","summary":null,"downloadable_attachments":[{"id":41058885,"asset_id":20193102,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":41345896,"first_name":"Mireya","last_name":"Santos","domain_name":"independent","page_name":"SantosMireya","display_name":"Mireya Santos","profile_url":"https://independent.academia.edu/SantosMireya?f_ri=450","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_1024498" data-work_id="1024498" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/1024498/Towards_A_Novel_Unified_Framework_for_Developing_Formal_Network_and_Validated_Agent_Based_Simulation_Models_of_Complex_Adaptive_Systems">Towards A Novel Unified Framework for Developing Formal, Network and Validated Agent-Based Simulation Models of Complex Adaptive Systems</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Literature on the modeling and simulation of complex adaptive systems (cas) has primarily advanced vertically in different scientific domains with scientists developing a variety of domain-specific approaches and applications. However,... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_1024498" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Literature on the modeling and simulation of complex adaptive systems (cas) has primarily advanced vertically in different scientific domains with scientists developing a variety of domain-specific approaches and applications. However, while cas researchers are inherently interested in an interdisciplinary comparison of models, to the best of our knowledge, there is currently no single unified framework for facilitating the development, comparison, communication and validation of models across different scientific domains. In this thesis, we propose first steps towards such a unified framework using a combination of agent-based and complex network-based modeling approaches and guidelines formulated in the form of a set of four levels of usage, which allow multidisciplinary researchers to adopt a suitable framework level on the basis of available data types, their research study objectives and expected outcomes, thus allowing them to better plan and conduct their respective research case studies. Firstly, the complex network modeling level of the proposed framework entails the development of appropriate complex network models for the case where interaction data of cas components is available, with the aim of detecting emergent patterns in the cas under study. The exploratory agent-based modeling level of the proposed framework allows for the development of proof-of-concept models for the cas system, primarily for purposes of exploring feasibility of further research. Descriptive agent-based modeling level of the proposed framework allows for the use of a formal step-by-step approach for developing agent-based models coupled with a quantitative complex network and pseudocode-based specification of the model, which will, in turn, facilitate interdisciplinary cas model comparison and knowledge transfer. Finally, the validated agent-based modeling level of the proposed framework is concerned with the building of in-simulation verification and validation of agent-based models using a proposed Virtual Overlay Multiagent System approach for use in a systematic team-oriented approach to developing models. The proposed framework is evaluated and validated using seven detailed case study examples selected from various scientific domains including ecology, social sciences and a range of complex adaptive communication networks. The successful case studies demonstrate the potential of the framework in appealing to multidisciplinary researchers as a methodological approach to the modeling and simulation of cas by facilitating effective communication and knowledge transfer across scientific disciplines without the requirement of extensive learning curves.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/1024498" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="06aa882b5fa89b99d1e3d96ae8fa6bad" rel="nofollow" data-download="{"attachment_id":7220548,"asset_id":1024498,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/7220548/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="318746" href="https://stir.academia.edu/MuazNiazi">Muaz A Niazi</a><script data-card-contents-for-user="318746" type="text/json">{"id":318746,"first_name":"Muaz","last_name":"Niazi","domain_name":"stir","page_name":"MuazNiazi","display_name":"Muaz A Niazi","profile_url":"https://stir.academia.edu/MuazNiazi?f_ri=450","photo":"https://0.academia-photos.com/318746/133820/4982358/s65_muaz.niazi.jpg"}</script></span></span></li><li class="js-paper-rank-work_1024498 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="1024498"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 1024498, container: ".js-paper-rank-work_1024498", }); });</script></li><li class="js-percentile-work_1024498 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 1024498; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_1024498"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_1024498 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="1024498"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 1024498; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=1024498]").text(description); $(".js-view-count-work_1024498").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_1024498").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="1024498"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">49</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="447" href="https://www.academia.edu/Documents/in/Scientific_Visualization">Scientific Visualization</a>, <script data-card-contents-for-ri="447" type="text/json">{"id":447,"name":"Scientific Visualization","url":"https://www.academia.edu/Documents/in/Scientific_Visualization?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="805" href="https://www.academia.edu/Documents/in/Ontology">Ontology</a>, <script data-card-contents-for-ri="805" type="text/json">{"id":805,"name":"Ontology","url":"https://www.academia.edu/Documents/in/Ontology?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="851" href="https://www.academia.edu/Documents/in/Complex_Systems_Science">Complex Systems Science</a><script data-card-contents-for-ri="851" type="text/json">{"id":851,"name":"Complex Systems Science","url":"https://www.academia.edu/Documents/in/Complex_Systems_Science?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=1024498]'), work: {"id":1024498,"title":"Towards A Novel Unified Framework for Developing Formal, Network and Validated Agent-Based Simulation Models of Complex Adaptive Systems","created_at":"2011-10-18T04:35:01.936-07:00","url":"https://www.academia.edu/1024498/Towards_A_Novel_Unified_Framework_for_Developing_Formal_Network_and_Validated_Agent_Based_Simulation_Models_of_Complex_Adaptive_Systems?f_ri=450","dom_id":"work_1024498","summary":"Literature on the modeling and simulation of complex adaptive systems (cas) has primarily advanced vertically in different scientific domains with scientists developing a variety of domain-specific approaches and applications. However, while cas researchers are inherently interested in an interdisciplinary comparison of models, to the best of our knowledge, there is currently no single unified framework for facilitating the development, comparison, communication and validation of models across different scientific domains. In this thesis, we propose first steps towards such a unified framework using a combination of agent-based and complex network-based modeling approaches and guidelines formulated in the form of a set of four levels of usage, which allow multidisciplinary researchers to adopt a suitable framework level on the basis of available data types, their research study objectives and expected outcomes, thus allowing them to better plan and conduct their respective research case studies. Firstly, the complex network modeling level of the proposed framework entails the development of appropriate complex network models for the case where interaction data of cas components is available, with the aim of detecting emergent patterns in the cas under study. The exploratory agent-based modeling level of the proposed framework allows for the development of proof-of-concept models for the cas system, primarily for purposes of exploring feasibility of further research. Descriptive agent-based modeling level of the proposed framework allows for the use of a formal step-by-step approach for developing agent-based models coupled with a quantitative complex network and pseudocode-based specification of the model, which will, in turn, facilitate interdisciplinary cas model comparison and knowledge transfer. Finally, the validated agent-based modeling level of the proposed framework is concerned with the building of in-simulation verification and validation of agent-based models using a proposed Virtual Overlay Multiagent System approach for use in a systematic team-oriented approach to developing models. The proposed framework is evaluated and validated using seven detailed case study examples selected from various scientific domains including ecology, social sciences and a range of complex adaptive communication networks. The successful case studies demonstrate the potential of the framework in appealing to multidisciplinary researchers as a methodological approach to the modeling and simulation of cas by facilitating effective communication and knowledge transfer across scientific disciplines without the requirement of extensive learning curves.","downloadable_attachments":[{"id":7220548,"asset_id":1024498,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":318746,"first_name":"Muaz","last_name":"Niazi","domain_name":"stir","page_name":"MuazNiazi","display_name":"Muaz A Niazi","profile_url":"https://stir.academia.edu/MuazNiazi?f_ri=450","photo":"https://0.academia-photos.com/318746/133820/4982358/s65_muaz.niazi.jpg"}],"research_interests":[{"id":447,"name":"Scientific Visualization","url":"https://www.academia.edu/Documents/in/Scientific_Visualization?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":805,"name":"Ontology","url":"https://www.academia.edu/Documents/in/Ontology?f_ri=450","nofollow":false},{"id":851,"name":"Complex Systems Science","url":"https://www.academia.edu/Documents/in/Complex_Systems_Science?f_ri=450","nofollow":false},{"id":1233,"name":"Social Networks","url":"https://www.academia.edu/Documents/in/Social_Networks?f_ri=450"},{"id":1252,"name":"Remote Sensing","url":"https://www.academia.edu/Documents/in/Remote_Sensing?f_ri=450"},{"id":1385,"name":"User Modeling","url":"https://www.academia.edu/Documents/in/User_Modeling?f_ri=450"},{"id":1440,"name":"Visualization","url":"https://www.academia.edu/Documents/in/Visualization?f_ri=450"},{"id":1676,"name":"Cognitive Modeling","url":"https://www.academia.edu/Documents/in/Cognitive_Modeling?f_ri=450"},{"id":2197,"name":"Simulation (Computer Science)","url":"https://www.academia.edu/Documents/in/Simulation_Computer_Science_?f_ri=450"},{"id":2553,"name":"Social Networking","url":"https://www.academia.edu/Documents/in/Social_Networking?f_ri=450"},{"id":2633,"name":"Business Modeling","url":"https://www.academia.edu/Documents/in/Business_Modeling?f_ri=450"},{"id":3155,"name":"Complexity Theory","url":"https://www.academia.edu/Documents/in/Complexity_Theory?f_ri=450"},{"id":3375,"name":"Self-Organization","url":"https://www.academia.edu/Documents/in/Self-Organization?f_ri=450"},{"id":3424,"name":"Information Visualization","url":"https://www.academia.edu/Documents/in/Information_Visualization?f_ri=450"},{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=450"},{"id":5105,"name":"Ontology (Computer Science)","url":"https://www.academia.edu/Documents/in/Ontology_Computer_Science_?f_ri=450"},{"id":5337,"name":"Agent Based Simulation","url":"https://www.academia.edu/Documents/in/Agent_Based_Simulation?f_ri=450"},{"id":5476,"name":"Cyber-Physical Systems","url":"https://www.academia.edu/Documents/in/Cyber-Physical_Systems?f_ri=450"},{"id":5499,"name":"Fire Ecology","url":"https://www.academia.edu/Documents/in/Fire_Ecology?f_ri=450"},{"id":5643,"name":"Emergent Phenomena","url":"https://www.academia.edu/Documents/in/Emergent_Phenomena?f_ri=450"},{"id":6177,"name":"Modeling","url":"https://www.academia.edu/Documents/in/Modeling?f_ri=450"},{"id":7406,"name":"Agent Based","url":"https://www.academia.edu/Documents/in/Agent_Based?f_ri=450"},{"id":7503,"name":"Scientometrics","url":"https://www.academia.edu/Documents/in/Scientometrics?f_ri=450"},{"id":8367,"name":"Complexity","url":"https://www.academia.edu/Documents/in/Complexity?f_ri=450"},{"id":9135,"name":"The Internet of Things","url":"https://www.academia.edu/Documents/in/The_Internet_of_Things?f_ri=450"},{"id":9136,"name":"Wireless Sensor Networks","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Networks?f_ri=450"},{"id":10480,"name":"Crowd Simulation","url":"https://www.academia.edu/Documents/in/Crowd_Simulation?f_ri=450"},{"id":11821,"name":"Verification and Validation","url":"https://www.academia.edu/Documents/in/Verification_and_Validation?f_ri=450"},{"id":13330,"name":"Complex Networks","url":"https://www.academia.edu/Documents/in/Complex_Networks?f_ri=450"},{"id":13892,"name":"Verification (Computer Science)","url":"https://www.academia.edu/Documents/in/Verification_Computer_Science_?f_ri=450"},{"id":13940,"name":"Fire Behaviour","url":"https://www.academia.edu/Documents/in/Fire_Behaviour?f_ri=450"},{"id":14725,"name":"Internet of Things","url":"https://www.academia.edu/Documents/in/Internet_of_Things?f_ri=450"},{"id":16117,"name":"Agent-Based Computational Economics","url":"https://www.academia.edu/Documents/in/Agent-Based_Computational_Economics?f_ri=450"},{"id":17829,"name":"Forest Ecology","url":"https://www.academia.edu/Documents/in/Forest_Ecology?f_ri=450"},{"id":19522,"name":"Remote sensing and GIS applications in Landscape Research","url":"https://www.academia.edu/Documents/in/Remote_sensing_and_GIS_applications_in_Landscape_Research?f_ri=450"},{"id":20219,"name":"(Multi-) Agent Technology","url":"https://www.academia.edu/Documents/in/_Multi-_Agent_Technology?f_ri=450"},{"id":21556,"name":"Crowdsourcing","url":"https://www.academia.edu/Documents/in/Crowdsourcing?f_ri=450"},{"id":24041,"name":"Social Simulation","url":"https://www.academia.edu/Documents/in/Social_Simulation?f_ri=450"},{"id":25188,"name":"Callibration and Validation of Remote Sensing Products","url":"https://www.academia.edu/Documents/in/Callibration_and_Validation_of_Remote_Sensing_Products?f_ri=450"},{"id":31091,"name":"Complex Adaptive Systems","url":"https://www.academia.edu/Documents/in/Complex_Adaptive_Systems?f_ri=450"},{"id":31139,"name":"Forest fire","url":"https://www.academia.edu/Documents/in/Forest_fire?f_ri=450"},{"id":31441,"name":"Software Verification and Validation","url":"https://www.academia.edu/Documents/in/Software_Verification_and_Validation?f_ri=450"},{"id":32947,"name":"Individual-based modeling (Evolution)","url":"https://www.academia.edu/Documents/in/Individual-based_modeling_Evolution_?f_ri=450"},{"id":34960,"name":"Emergence","url":"https://www.academia.edu/Documents/in/Emergence?f_ri=450"},{"id":38753,"name":"Citation context analysis","url":"https://www.academia.edu/Documents/in/Citation_context_analysis?f_ri=450"},{"id":90717,"name":"Crowd Behaviour and Psychology","url":"https://www.academia.edu/Documents/in/Crowd_Behaviour_and_Psychology?f_ri=450"},{"id":162099,"name":"Bibliometric and citation analysis","url":"https://www.academia.edu/Documents/in/Bibliometric_and_citation_analysis?f_ri=450"},{"id":274653,"name":"DREAM","url":"https://www.academia.edu/Documents/in/DREAM?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_1461517 coauthored" data-work_id="1461517" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/1461517/Translating_Haskell_Programs_into_Petri_Nets">Translating Haskell# Programs into Petri Nets</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Abstract Haskell# is a concurrent programming environment aimed at parallel distributed architectures. Haskell# programs may be automatically translated to Petri nets, an important formalism for analysis of properties of concurrent and... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_1461517" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Abstract Haskell# is a concurrent programming environment aimed at parallel distributed architectures. Haskell# programs may be automatically translated to Petri nets, an important formalism for analysis of properties of concurrent and non-determinisc systems. This paper motivates and formalizes the translation of Haskell# programs into Petri nets, providing some examples of their usage.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/1461517" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="7c6d60ef1e141552337e226475fbd6c8" rel="nofollow" data-download="{"attachment_id":11498055,"asset_id":1461517,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/11498055/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="1266285" href="https://ufc.academia.edu/FranciscoCarvalhoJunior">Francisco H de Carvalho Junior</a><script data-card-contents-for-user="1266285" type="text/json">{"id":1266285,"first_name":"Francisco","last_name":"de Carvalho Junior","domain_name":"ufc","page_name":"FranciscoCarvalhoJunior","display_name":"Francisco H de Carvalho Junior","profile_url":"https://ufc.academia.edu/FranciscoCarvalhoJunior?f_ri=450","photo":"https://0.academia-photos.com/1266285/464428/583090/s65_francisco.carvalho-junior.jpg"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-1461517">+1</span><div class="hidden js-additional-users-1461517"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://ufpe.academia.edu/RafaelLins">Rafael Dueire Lins</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-1461517'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-1461517').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_1461517 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="1461517"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 1461517, container: ".js-paper-rank-work_1461517", }); });</script></li><li class="js-percentile-work_1461517 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 1461517; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_1461517"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_1461517 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="1461517"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 1461517; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=1461517]").text(description); $(".js-view-count-work_1461517").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_1461517").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="1461517"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="442" href="https://www.academia.edu/Documents/in/Parallel_Computing">Parallel Computing</a>, <script data-card-contents-for-ri="442" type="text/json">{"id":442,"name":"Parallel Computing","url":"https://www.academia.edu/Documents/in/Parallel_Computing?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="454" href="https://www.academia.edu/Documents/in/Functional_Programming">Functional Programming</a>, <script data-card-contents-for-ri="454" type="text/json">{"id":454,"name":"Functional Programming","url":"https://www.academia.edu/Documents/in/Functional_Programming?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="20250" href="https://www.academia.edu/Documents/in/Petri_Nets">Petri Nets</a><script data-card-contents-for-ri="20250" type="text/json">{"id":20250,"name":"Petri Nets","url":"https://www.academia.edu/Documents/in/Petri_Nets?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=1461517]'), work: {"id":1461517,"title":"Translating Haskell# Programs into Petri Nets","created_at":"2012-03-04T20:30:14.415-08:00","url":"https://www.academia.edu/1461517/Translating_Haskell_Programs_into_Petri_Nets?f_ri=450","dom_id":"work_1461517","summary":"Abstract Haskell# is a concurrent programming environment aimed at parallel distributed architectures. Haskell# programs may be automatically translated to Petri nets, an important formalism for analysis of properties of concurrent and non-determinisc systems. This paper motivates and formalizes the translation of Haskell# programs into Petri nets, providing some examples of their usage.","downloadable_attachments":[{"id":11498055,"asset_id":1461517,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":1266285,"first_name":"Francisco","last_name":"de Carvalho Junior","domain_name":"ufc","page_name":"FranciscoCarvalhoJunior","display_name":"Francisco H de Carvalho Junior","profile_url":"https://ufc.academia.edu/FranciscoCarvalhoJunior?f_ri=450","photo":"https://0.academia-photos.com/1266285/464428/583090/s65_francisco.carvalho-junior.jpg"},{"id":23671603,"first_name":"Rafael","last_name":"Dueire Lins","domain_name":"ufpe","page_name":"RafaelLins","display_name":"Rafael Dueire Lins","profile_url":"https://ufpe.academia.edu/RafaelLins?f_ri=450","photo":"https://0.academia-photos.com/23671603/6417536/12945241/s65_rafael.lins.jpg"}],"research_interests":[{"id":442,"name":"Parallel Computing","url":"https://www.academia.edu/Documents/in/Parallel_Computing?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":454,"name":"Functional Programming","url":"https://www.academia.edu/Documents/in/Functional_Programming?f_ri=450","nofollow":false},{"id":20250,"name":"Petri Nets","url":"https://www.academia.edu/Documents/in/Petri_Nets?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_4077432" data-work_id="4077432" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/4077432/%D0%A1%D0%A2%D0%90%D0%A2%D0%98%D0%A1%D0%A2%D0%98%D0%A7%D0%95%D0%A1%D0%9A%D0%98%D0%95_%D0%9C%D0%95%D0%A2%D0%9E%D0%94%D0%AB_%D0%92_%D0%90%D0%A0%D0%A5%D0%95%D0%9E%D0%9B%D0%9E%D0%93%D0%98%D0%A7%D0%95%D0%A1%D0%9A%D0%98%D0%A5_%D0%98%D0%A1%D0%A1%D0%9B%D0%95%D0%94%D0%9E%D0%92%D0%90%D0%9D%D0%98%D0%AF%D0%A5_%D0%98%D0%A1%D0%A2%D0%9E%D0%A0%D0%98%D0%AF_%D0%A0%D0%90%D0%97%D0%92%D0%98%D0%A2%D0%98%D0%AF_70_%D0%95_%D0%93%D0%93_XX_%D0%92_%D0%9D%D0%90%D0%A7%D0%90%D0%9B%D0%9E_XXI_%D0%92_STATISTICAL_METHODS_IN_ARCHAEOLOGICAL_RESEARCHES_DEVELOPMENT_HISTORY_THE_70S_OF_THE_XXTH_CENTURY_THE_BEGINNING_OF_THE_XXI_ST_CENTURY_">СТАТИСТИЧЕСКИЕ МЕТОДЫ В АРХЕОЛОГИЧЕСКИХ ИССЛЕДОВАНИЯХ: ИСТОРИЯ РАЗВИТИЯ (70-Е ГГ. XX В. – НАЧАЛО XXI В.) (STATISTICAL METHODS IN ARCHAEOLOGICAL RESEARCHES: DEVELOPMENT HISTORY (THE 70S OF THE XXTH CENTURY – THE BEGINNING OF THE XXI ST CENTURY))</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The author reveals and analyzes the ways of mathematical statistics methods penetration into archaeological science in general and into the archeology of Western Ural in particular, aims to introduce the history of mathematical methods... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_4077432" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The author reveals and analyzes the ways of mathematical statistics methods penetration into archaeological science in general and into the archeology of Western Ural in particular, aims to introduce the history of mathematical methods application in the archeology of Western Ural into the context of the global and domestic gnoseological transformations of the end of the XIXth – the 60s of the XXth century, in the end concludes that the Ural archeologists’ interest to mathematics is a logical and timely reflection of the all-Russian and global research trends; and mentions that Kama region science is responsive to developments in the country and the world, bringing its invaluable contribution to the universal intellectual heritage. <br />DOWNLOAD THE FULL TEXT IN RUSSIAN</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/4077432" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="ca0a28efeda1b845d024ed0263cf597c" rel="nofollow" data-download="{"attachment_id":31604918,"asset_id":4077432,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31604918/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4914859" href="https://pspu.academia.edu/DmitriyShmuratko">Dmitriy Shmuratko</a><script data-card-contents-for-user="4914859" type="text/json">{"id":4914859,"first_name":"Dmitriy","last_name":"Shmuratko","domain_name":"pspu","page_name":"DmitriyShmuratko","display_name":"Dmitriy Shmuratko","profile_url":"https://pspu.academia.edu/DmitriyShmuratko?f_ri=450","photo":"https://0.academia-photos.com/4914859/2123893/2738053/s65_dmitriy.shmuratko.jpg"}</script></span></span></li><li class="js-paper-rank-work_4077432 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="4077432"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 4077432, container: ".js-paper-rank-work_4077432", }); });</script></li><li class="js-percentile-work_4077432 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 4077432; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_4077432"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_4077432 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="4077432"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4077432; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4077432]").text(description); $(".js-view-count-work_4077432").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_4077432").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="4077432"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="392" href="https://www.academia.edu/Documents/in/Archaeology">Archaeology</a>, <script data-card-contents-for-ri="392" type="text/json">{"id":392,"name":"Archaeology","url":"https://www.academia.edu/Documents/in/Archaeology?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1558" href="https://www.academia.edu/Documents/in/Research_Methods_and_Methodology">Research Methods and Methodology</a>, <script data-card-contents-for-ri="1558" type="text/json">{"id":1558,"name":"Research Methods and Methodology","url":"https://www.academia.edu/Documents/in/Research_Methods_and_Methodology?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2065" href="https://www.academia.edu/Documents/in/Research_Methodology">Research Methodology</a><script data-card-contents-for-ri="2065" type="text/json">{"id":2065,"name":"Research Methodology","url":"https://www.academia.edu/Documents/in/Research_Methodology?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=4077432]'), work: {"id":4077432,"title":"СТАТИСТИЧЕСКИЕ МЕТОДЫ В АРХЕОЛОГИЧЕСКИХ ИССЛЕДОВАНИЯХ: ИСТОРИЯ РАЗВИТИЯ (70-Е ГГ. XX В. – НАЧАЛО XXI В.) (STATISTICAL METHODS IN ARCHAEOLOGICAL RESEARCHES: DEVELOPMENT HISTORY (THE 70S OF THE XXTH CENTURY – THE BEGINNING OF THE XXI ST CENTURY))","created_at":"2013-07-21T20:02:39.333-07:00","url":"https://www.academia.edu/4077432/%D0%A1%D0%A2%D0%90%D0%A2%D0%98%D0%A1%D0%A2%D0%98%D0%A7%D0%95%D0%A1%D0%9A%D0%98%D0%95_%D0%9C%D0%95%D0%A2%D0%9E%D0%94%D0%AB_%D0%92_%D0%90%D0%A0%D0%A5%D0%95%D0%9E%D0%9B%D0%9E%D0%93%D0%98%D0%A7%D0%95%D0%A1%D0%9A%D0%98%D0%A5_%D0%98%D0%A1%D0%A1%D0%9B%D0%95%D0%94%D0%9E%D0%92%D0%90%D0%9D%D0%98%D0%AF%D0%A5_%D0%98%D0%A1%D0%A2%D0%9E%D0%A0%D0%98%D0%AF_%D0%A0%D0%90%D0%97%D0%92%D0%98%D0%A2%D0%98%D0%AF_70_%D0%95_%D0%93%D0%93_XX_%D0%92_%D0%9D%D0%90%D0%A7%D0%90%D0%9B%D0%9E_XXI_%D0%92_STATISTICAL_METHODS_IN_ARCHAEOLOGICAL_RESEARCHES_DEVELOPMENT_HISTORY_THE_70S_OF_THE_XXTH_CENTURY_THE_BEGINNING_OF_THE_XXI_ST_CENTURY_?f_ri=450","dom_id":"work_4077432","summary":"The author reveals and analyzes the ways of mathematical statistics methods penetration into archaeological science in general and into the archeology of Western Ural in particular, aims to introduce the history of mathematical methods application in the archeology of Western Ural into the context of the global and domestic gnoseological transformations of the end of the XIXth – the 60s of the XXth century, in the end concludes that the Ural archeologists’ interest to mathematics is a logical and timely reflection of the all-Russian and global research trends; and mentions that Kama region science is responsive to developments in the country and the world, bringing its invaluable contribution to the universal intellectual heritage. \r\nDOWNLOAD THE FULL TEXT IN RUSSIAN","downloadable_attachments":[{"id":31604918,"asset_id":4077432,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4914859,"first_name":"Dmitriy","last_name":"Shmuratko","domain_name":"pspu","page_name":"DmitriyShmuratko","display_name":"Dmitriy Shmuratko","profile_url":"https://pspu.academia.edu/DmitriyShmuratko?f_ri=450","photo":"https://0.academia-photos.com/4914859/2123893/2738053/s65_dmitriy.shmuratko.jpg"}],"research_interests":[{"id":392,"name":"Archaeology","url":"https://www.academia.edu/Documents/in/Archaeology?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":1558,"name":"Research Methods and Methodology","url":"https://www.academia.edu/Documents/in/Research_Methods_and_Methodology?f_ri=450","nofollow":false},{"id":2065,"name":"Research Methodology","url":"https://www.academia.edu/Documents/in/Research_Methodology?f_ri=450","nofollow":false},{"id":3723,"name":"History of Science","url":"https://www.academia.edu/Documents/in/History_of_Science?f_ri=450"},{"id":5346,"name":"Archaeological Method \u0026 Theory","url":"https://www.academia.edu/Documents/in/Archaeological_Method_and_Theory?f_ri=450"},{"id":12620,"name":"Quantitative Methods","url":"https://www.academia.edu/Documents/in/Quantitative_Methods?f_ri=450"},{"id":27926,"name":"Statistical Methods in Archaeology","url":"https://www.academia.edu/Documents/in/Statistical_Methods_in_Archaeology?f_ri=450"},{"id":43884,"name":"History of Archaeology","url":"https://www.academia.edu/Documents/in/History_of_Archaeology?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_1413537" data-work_id="1413537" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/1413537/Static_deadlock_detection_in_the_Linux_kernel">Static deadlock detection in the Linux kernel</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This article describes a C code static analyser that detects misuse of spinlocks in the Linux kernel. Spinlock misuse is difficult to detect by testing, relatively common, and leads to runtime deadlocks in the Linux operating system... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_1413537" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This article describes a C code static analyser that detects misuse of spinlocks in the Linux kernel.  Spinlock misuse is difficult to detect by testing, relatively common, and leads to runtime deadlocks in the Linux operating system kernel on multiprocessor architectures.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/1413537" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="07293c4ad311134cae6b1956796c4a9f" rel="nofollow" data-download="{"attachment_id":31181559,"asset_id":1413537,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31181559/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="650083" href="https://independent.academia.edu/PBreuer">Peter Breuer</a><script data-card-contents-for-user="650083" type="text/json">{"id":650083,"first_name":"Peter","last_name":"Breuer","domain_name":"independent","page_name":"PBreuer","display_name":"Peter Breuer","profile_url":"https://independent.academia.edu/PBreuer?f_ri=450","photo":"https://0.academia-photos.com/650083/1246440/1555669/s65_peter.breuer.jpg"}</script></span></span></li><li class="js-paper-rank-work_1413537 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="1413537"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 1413537, container: ".js-paper-rank-work_1413537", }); });</script></li><li class="js-percentile-work_1413537 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 1413537; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_1413537"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_1413537 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="1413537"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 1413537; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=1413537]").text(description); $(".js-view-count-work_1413537").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_1413537").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="1413537"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">5</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2201" href="https://www.academia.edu/Documents/in/Static_Analysis">Static Analysis</a>, <script data-card-contents-for-ri="2201" type="text/json">{"id":2201,"name":"Static Analysis","url":"https://www.academia.edu/Documents/in/Static_Analysis?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="7376" href="https://www.academia.edu/Documents/in/Linux_Kernel">Linux Kernel</a><script data-card-contents-for-ri="7376" type="text/json">{"id":7376,"name":"Linux Kernel","url":"https://www.academia.edu/Documents/in/Linux_Kernel?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=1413537]'), work: {"id":1413537,"title":"Static deadlock detection in the Linux kernel","created_at":"2012-02-19T17:30:44.395-08:00","url":"https://www.academia.edu/1413537/Static_deadlock_detection_in_the_Linux_kernel?f_ri=450","dom_id":"work_1413537","summary":"This article describes a C code static analyser that detects misuse of spinlocks in the Linux kernel. Spinlock misuse is difficult to detect by testing, relatively common, and leads to runtime deadlocks in the Linux operating system kernel on multiprocessor architectures.","downloadable_attachments":[{"id":31181559,"asset_id":1413537,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":650083,"first_name":"Peter","last_name":"Breuer","domain_name":"independent","page_name":"PBreuer","display_name":"Peter Breuer","profile_url":"https://independent.academia.edu/PBreuer?f_ri=450","photo":"https://0.academia-photos.com/650083/1246440/1555669/s65_peter.breuer.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":2201,"name":"Static Analysis","url":"https://www.academia.edu/Documents/in/Static_Analysis?f_ri=450","nofollow":false},{"id":7376,"name":"Linux Kernel","url":"https://www.academia.edu/Documents/in/Linux_Kernel?f_ri=450","nofollow":false},{"id":28306,"name":"Open Source and Free Software Studies","url":"https://www.academia.edu/Documents/in/Open_Source_and_Free_Software_Studies?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_51638871" data-work_id="51638871" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/51638871/Generating_Decompilers">Generating Decompilers</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Compiler compilers are in widespread use, but decompiler compilers are a more novel concept. This paper presents an approach for the decompilation of object code back to source code using a decompiler generator. An example decompilation... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_51638871" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Compiler compilers are in widespread use, but decompiler compilers are a more novel concept. This paper presents an approach for the decompilation of object code back to source code using a decompiler generator. An example decompilation is presented. Potential applications include reverse engineering, quality assessment, debugging and safety-critical code validation or verification.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/51638871" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="b576b659ba0331b29ad3ffd032d0f058" rel="nofollow" data-download="{"attachment_id":69275373,"asset_id":51638871,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/69275373/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="650083" href="https://independent.academia.edu/PBreuer">Peter Breuer</a><script data-card-contents-for-user="650083" type="text/json">{"id":650083,"first_name":"Peter","last_name":"Breuer","domain_name":"independent","page_name":"PBreuer","display_name":"Peter Breuer","profile_url":"https://independent.academia.edu/PBreuer?f_ri=450","photo":"https://0.academia-photos.com/650083/1246440/1555669/s65_peter.breuer.jpg"}</script></span></span></li><li class="js-paper-rank-work_51638871 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="51638871"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 51638871, container: ".js-paper-rank-work_51638871", }); });</script></li><li class="js-percentile-work_51638871 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 51638871; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_51638871"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_51638871 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="51638871"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 51638871; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=51638871]").text(description); $(".js-view-count-work_51638871").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_51638871").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="51638871"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="453" href="https://www.academia.edu/Documents/in/Object_Oriented_Programming">Object Oriented Programming</a><script data-card-contents-for-ri="453" type="text/json">{"id":453,"name":"Object Oriented Programming","url":"https://www.academia.edu/Documents/in/Object_Oriented_Programming?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=51638871]'), work: {"id":51638871,"title":"Generating Decompilers","created_at":"2021-09-09T12:57:48.008-07:00","url":"https://www.academia.edu/51638871/Generating_Decompilers?f_ri=450","dom_id":"work_51638871","summary":"Compiler compilers are in widespread use, but decompiler compilers are a more novel concept. This paper presents an approach for the decompilation of object code back to source code using a decompiler generator. An example decompilation is presented. Potential applications include reverse engineering, quality assessment, debugging and safety-critical code validation or verification.","downloadable_attachments":[{"id":69275373,"asset_id":51638871,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":650083,"first_name":"Peter","last_name":"Breuer","domain_name":"independent","page_name":"PBreuer","display_name":"Peter Breuer","profile_url":"https://independent.academia.edu/PBreuer?f_ri=450","photo":"https://0.academia-photos.com/650083/1246440/1555669/s65_peter.breuer.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":453,"name":"Object Oriented Programming","url":"https://www.academia.edu/Documents/in/Object_Oriented_Programming?f_ri=450","nofollow":false},{"id":457,"name":"Compilers","url":"https://www.academia.edu/Documents/in/Compilers?f_ri=450"},{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=450"},{"id":14657,"name":"Compiler Construction","url":"https://www.academia.edu/Documents/in/Compiler_Construction?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":32244,"name":"C Programming","url":"https://www.academia.edu/Documents/in/C_Programming-4?f_ri=450"},{"id":53293,"name":"Software","url":"https://www.academia.edu/Documents/in/Software?f_ri=450"},{"id":66863,"name":"Lazy Evaluation","url":"https://www.academia.edu/Documents/in/Lazy_Evaluation?f_ri=450"},{"id":67047,"name":"INFORMATION TECHNOLOGY AND SOFTWARE DEVELOPMENT","url":"https://www.academia.edu/Documents/in/INFORMATION_TECHNOLOGY_AND_SOFTWARE_DEVELOPMENT?f_ri=450"},{"id":77583,"name":"Compilation","url":"https://www.academia.edu/Documents/in/Compilation?f_ri=450"},{"id":190729,"name":"Decompilation","url":"https://www.academia.edu/Documents/in/Decompilation?f_ri=450"},{"id":234107,"name":"Compiler Design and Construction","url":"https://www.academia.edu/Documents/in/Compiler_Design_and_Construction?f_ri=450"},{"id":516232,"name":"Source Code","url":"https://www.academia.edu/Documents/in/Source_Code?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_288635" data-work_id="288635" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/288635/The_Ethics_of_Safety_Critical_Systems">The Ethics of Safety-Critical Systems</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Safety-critical systems require the utmost care in their specification and design to avoid errors in their implementation, using state of the art techniques in a responsible manner. To do otherwise is at best unprofessional and at worst... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_288635" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Safety-critical systems require the utmost care in their specification and design to avoid errors in their implementation, using state of the art techniques in a responsible manner. To do otherwise is at best unprofessional and at worst can lead to disastrous consequences. An inappropriate approach could lead to loss of life, and will almost certainly result in financial penalties in the long run, whether because of loss of business or because of the imposition of fines. Legislation and standards impose external pressures, but education and ethical considerations should help provide more self-imposed guidelines for all those involved in the production of safety-critical systems. This paper considers some of the issues involved, with pointers to material providing greater depth in particular areas, especially with respect to the use of formal methods.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/288635" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="c8ce6e7824b26c2c65474bfe4b1d9931" rel="nofollow" data-download="{"attachment_id":31772198,"asset_id":288635,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31772198/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="12280" href="https://lsbu.academia.edu/JonathanBowen">Jonathan Bowen</a><script data-card-contents-for-user="12280" type="text/json">{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}</script></span></span></li><li class="js-paper-rank-work_288635 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="288635"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 288635, container: ".js-paper-rank-work_288635", }); });</script></li><li class="js-percentile-work_288635 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 288635; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_288635"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_288635 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="288635"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 288635; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=288635]").text(description); $(".js-view-count-work_288635").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_288635").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="288635"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">23</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="438" href="https://www.academia.edu/Documents/in/Computer_Security_And_Reliability">Computer Security And Reliability</a>, <script data-card-contents-for-ri="438" type="text/json">{"id":438,"name":"Computer Security And Reliability","url":"https://www.academia.edu/Documents/in/Computer_Security_And_Reliability?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a><script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=288635]'), work: {"id":288635,"title":"The Ethics of Safety-Critical Systems","created_at":"2010-08-07T09:19:03.313-07:00","url":"https://www.academia.edu/288635/The_Ethics_of_Safety_Critical_Systems?f_ri=450","dom_id":"work_288635","summary":"Safety-critical systems require the utmost care in their specification and design to avoid errors in their implementation, using state of the art techniques in a responsible manner. To do otherwise is at best unprofessional and at worst can lead to disastrous consequences. An inappropriate approach could lead to loss of life, and will almost certainly result in financial penalties in the long run, whether because of loss of business or because of the imposition of fines. Legislation and standards impose external pressures, but education and ethical considerations should help provide more self-imposed guidelines for all those involved in the production of safety-critical systems. This paper considers some of the issues involved, with pointers to material providing greater depth in particular areas, especially with respect to the use of formal methods.","downloadable_attachments":[{"id":31772198,"asset_id":288635,"asset_type":"Work","always_allow_download":false},{"id":1338464,"asset_id":288635,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":438,"name":"Computer Security And Reliability","url":"https://www.academia.edu/Documents/in/Computer_Security_And_Reliability?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":485,"name":"Computing In Social Sciences, Arts And Humanities, Professions","url":"https://www.academia.edu/Documents/in/Computing_In_Social_Sciences_Arts_And_Humanities_Professions?f_ri=450"},{"id":814,"name":"Ethics","url":"https://www.academia.edu/Documents/in/Ethics?f_ri=450"},{"id":988,"name":"Design","url":"https://www.academia.edu/Documents/in/Design?f_ri=450"},{"id":2517,"name":"Continuing Professional Development","url":"https://www.academia.edu/Documents/in/Continuing_Professional_Development?f_ri=450"},{"id":4759,"name":"Computer Ethics","url":"https://www.academia.edu/Documents/in/Computer_Ethics?f_ri=450"},{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=450"},{"id":9542,"name":"Formal Methods (Formal Methods)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Methods_?f_ri=450"},{"id":13923,"name":"Computer Security","url":"https://www.academia.edu/Documents/in/Computer_Security?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":17097,"name":"Philosophy of Computer Science","url":"https://www.academia.edu/Documents/in/Philosophy_of_Computer_Science?f_ri=450"},{"id":17769,"name":"Professional Development","url":"https://www.academia.edu/Documents/in/Professional_Development?f_ri=450"},{"id":18373,"name":"Moral Philosophy","url":"https://www.academia.edu/Documents/in/Moral_Philosophy?f_ri=450"},{"id":35232,"name":"Reliability Engineering","url":"https://www.academia.edu/Documents/in/Reliability_Engineering?f_ri=450"},{"id":36535,"name":"Safety-Critical Systems","url":"https://www.academia.edu/Documents/in/Safety-Critical_Systems?f_ri=450"},{"id":47840,"name":"Dependability","url":"https://www.academia.edu/Documents/in/Dependability?f_ri=450"},{"id":88234,"name":"Software Dependability","url":"https://www.academia.edu/Documents/in/Software_Dependability?f_ri=450"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=450"},{"id":190179,"name":"Dependable Computing","url":"https://www.academia.edu/Documents/in/Dependable_Computing?f_ri=450"},{"id":476956,"name":"Sociology of Computing","url":"https://www.academia.edu/Documents/in/Sociology_of_Computing?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_9883891" data-work_id="9883891" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/9883891/MODEL_TO_SPECIFY_REAL_TIME_SYSTEM_USING_Z_AND_ALLOY_LANGUAGES_A_COMPARATIVE_APPROACH">MODEL TO SPECIFY REAL TIME SYSTEM USING Z AND ALLOY LANGUAGES: A COMPARATIVE APPROACH</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Choice of a particular specification language depends on the type of product. Z and Alloy both are formal specification languages used for specifying the software requirements in a succinct manner. Alloy language is designed... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_9883891" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Choice of a particular specification  language depends on the <br />type  of  product.  Z  and  Alloy  both  are  formal  specification <br />languages used for specifying the software requirements in a <br />succinct manner. Alloy language is designed specifically for <br />automatic  analysis  of  any  real  time  system.  This  paper <br />proposes  comparison  between  the  effectiveness  of  Z  and <br />Alloy  languages.  An  Automated  Teller  Machine  (ATM) <br />example  has  been  considered  as  a  case  study  for  real  time <br />analysis  and  is  used  to  demonstrate  the  comparative <br />differences  between  the  functionalities  of  Z  and  Alloy <br />languages. To make the explanation more precise, we present <br />formal  specification  of  some  states  (wait  or  busy)  and <br />operations  (withdrawal  or  balance  enquiry)  of  ATM  system <br />using  Z  and  Alloy  languages.  By  using  Z/EVES  tool,  the <br />syntax of  Z language is verified and instances of these states <br />and operations are generated by using a tool Alloy Analyzer.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/9883891" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="513d08f411d04f5411a4dc3c154c4e5c" rel="nofollow" data-download="{"attachment_id":36043377,"asset_id":9883891,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/36043377/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="23982698" href="https://nitrkl.academia.edu/AshishDwivedi">Ashish Dwivedi</a><script data-card-contents-for-user="23982698" type="text/json">{"id":23982698,"first_name":"Ashish","last_name":"Dwivedi","domain_name":"nitrkl","page_name":"AshishDwivedi","display_name":"Ashish Dwivedi","profile_url":"https://nitrkl.academia.edu/AshishDwivedi?f_ri=450","photo":"https://0.academia-photos.com/23982698/6474134/7321919/s65_ashish.dwivedi.jpg"}</script></span></span></li><li class="js-paper-rank-work_9883891 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="9883891"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 9883891, container: ".js-paper-rank-work_9883891", }); });</script></li><li class="js-percentile-work_9883891 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 9883891; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_9883891"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_9883891 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="9883891"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 9883891; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=9883891]").text(description); $(".js-view-count-work_9883891").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_9883891").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="9883891"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="805" href="https://www.academia.edu/Documents/in/Ontology">Ontology</a>, <script data-card-contents-for-ri="805" type="text/json">{"id":805,"name":"Ontology","url":"https://www.academia.edu/Documents/in/Ontology?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="9324" href="https://www.academia.edu/Documents/in/Design_Patterns">Design Patterns</a>, <script data-card-contents-for-ri="9324" type="text/json">{"id":9324,"name":"Design Patterns","url":"https://www.academia.edu/Documents/in/Design_Patterns?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="743586" href="https://www.academia.edu/Documents/in/Security_design_patterns">Security design patterns</a><script data-card-contents-for-ri="743586" type="text/json">{"id":743586,"name":"Security design patterns","url":"https://www.academia.edu/Documents/in/Security_design_patterns?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=9883891]'), work: {"id":9883891,"title":"MODEL TO SPECIFY REAL TIME SYSTEM USING Z AND ALLOY LANGUAGES: A COMPARATIVE APPROACH","created_at":"2014-12-23T22:00:49.759-08:00","url":"https://www.academia.edu/9883891/MODEL_TO_SPECIFY_REAL_TIME_SYSTEM_USING_Z_AND_ALLOY_LANGUAGES_A_COMPARATIVE_APPROACH?f_ri=450","dom_id":"work_9883891","summary":"Choice of a particular specification language depends on the \ntype of product. Z and Alloy both are formal specification \nlanguages used for specifying the software requirements in a \nsuccinct manner. Alloy language is designed specifically for \nautomatic analysis of any real time system. This paper \nproposes comparison between the effectiveness of Z and \nAlloy languages. An Automated Teller Machine (ATM) \nexample has been considered as a case study for real time \nanalysis and is used to demonstrate the comparative \ndifferences between the functionalities of Z and Alloy \nlanguages. To make the explanation more precise, we present \nformal specification of some states (wait or busy) and \noperations (withdrawal or balance enquiry) of ATM system \nusing Z and Alloy languages. By using Z/EVES tool, the \nsyntax of Z language is verified and instances of these states \nand operations are generated by using a tool Alloy Analyzer.","downloadable_attachments":[{"id":36043377,"asset_id":9883891,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":23982698,"first_name":"Ashish","last_name":"Dwivedi","domain_name":"nitrkl","page_name":"AshishDwivedi","display_name":"Ashish Dwivedi","profile_url":"https://nitrkl.academia.edu/AshishDwivedi?f_ri=450","photo":"https://0.academia-photos.com/23982698/6474134/7321919/s65_ashish.dwivedi.jpg"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":805,"name":"Ontology","url":"https://www.academia.edu/Documents/in/Ontology?f_ri=450","nofollow":false},{"id":9324,"name":"Design Patterns","url":"https://www.academia.edu/Documents/in/Design_Patterns?f_ri=450","nofollow":false},{"id":743586,"name":"Security design patterns","url":"https://www.academia.edu/Documents/in/Security_design_patterns?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_32014314" data-work_id="32014314" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/32014314/ON_DEDUCTIONISM">ON DEDUCTIONISM</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Deductionism assimilates nature to conceptual artifacts (models, equations), and tacitly holds that real physical systems are such artifacts. Some physical concepts represent properties of deductive systems rather than of nature.... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_32014314" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Deductionism assimilates nature to conceptual artifacts (models, equations), and tacitly holds that real physical systems are such artifacts. Some physical concepts represent properties of deductive systems rather than of nature. Properties of mathematical or deductive systems can thereby sometimes falsely be ascribed to natural systems.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/32014314" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="cfa4d1c2cd6c37a921d619d2bc3ccefe" rel="nofollow" data-download="{"attachment_id":52280477,"asset_id":32014314,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/52280477/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="3133151" href="https://independent.academia.edu/DanBruiger">Dan Bruiger</a><script data-card-contents-for-user="3133151" type="text/json">{"id":3133151,"first_name":"Dan","last_name":"Bruiger","domain_name":"independent","page_name":"DanBruiger","display_name":"Dan Bruiger","profile_url":"https://independent.academia.edu/DanBruiger?f_ri=450","photo":"https://0.academia-photos.com/3133151/1030018/1287072/s65_dan.bruiger.jpg"}</script></span></span></li><li class="js-paper-rank-work_32014314 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="32014314"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 32014314, container: ".js-paper-rank-work_32014314", }); });</script></li><li class="js-percentile-work_32014314 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 32014314; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_32014314"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_32014314 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="32014314"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 32014314; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=32014314]").text(description); $(".js-view-count-work_32014314").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_32014314").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="32014314"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="6087" href="https://www.academia.edu/Documents/in/Deductive_reasoning">Deductive reasoning</a>, <script data-card-contents-for-ri="6087" type="text/json">{"id":6087,"name":"Deductive reasoning","url":"https://www.academia.edu/Documents/in/Deductive_reasoning?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="16682" href="https://www.academia.edu/Documents/in/Mathematical_Modelling">Mathematical Modelling</a>, <script data-card-contents-for-ri="16682" type="text/json">{"id":16682,"name":"Mathematical Modelling","url":"https://www.academia.edu/Documents/in/Mathematical_Modelling?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="70529" href="https://www.academia.edu/Documents/in/Indeterminacy">Indeterminacy</a><script data-card-contents-for-ri="70529" type="text/json">{"id":70529,"name":"Indeterminacy","url":"https://www.academia.edu/Documents/in/Indeterminacy?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=32014314]'), work: {"id":32014314,"title":"ON DEDUCTIONISM","created_at":"2017-03-23T15:51:43.810-07:00","url":"https://www.academia.edu/32014314/ON_DEDUCTIONISM?f_ri=450","dom_id":"work_32014314","summary":"Deductionism assimilates nature to conceptual artifacts (models, equations), and tacitly holds that real physical systems are such artifacts. Some physical concepts represent properties of deductive systems rather than of nature. Properties of mathematical or deductive systems can thereby sometimes falsely be ascribed to natural systems.","downloadable_attachments":[{"id":52280477,"asset_id":32014314,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":3133151,"first_name":"Dan","last_name":"Bruiger","domain_name":"independent","page_name":"DanBruiger","display_name":"Dan Bruiger","profile_url":"https://independent.academia.edu/DanBruiger?f_ri=450","photo":"https://0.academia-photos.com/3133151/1030018/1287072/s65_dan.bruiger.jpg"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":6087,"name":"Deductive reasoning","url":"https://www.academia.edu/Documents/in/Deductive_reasoning?f_ri=450","nofollow":false},{"id":16682,"name":"Mathematical Modelling","url":"https://www.academia.edu/Documents/in/Mathematical_Modelling?f_ri=450","nofollow":false},{"id":70529,"name":"Indeterminacy","url":"https://www.academia.edu/Documents/in/Indeterminacy?f_ri=450","nofollow":false},{"id":76151,"name":"Determinism","url":"https://www.academia.edu/Documents/in/Determinism?f_ri=450"},{"id":126829,"name":"Symmetry","url":"https://www.academia.edu/Documents/in/Symmetry?f_ri=450"},{"id":129087,"name":"Randomness","url":"https://www.academia.edu/Documents/in/Randomness?f_ri=450"},{"id":150057,"name":"Idealization","url":"https://www.academia.edu/Documents/in/Idealization?f_ri=450"},{"id":182444,"name":"Metaphysical poetry","url":"https://www.academia.edu/Documents/in/Metaphysical_poetry?f_ri=450"},{"id":278634,"name":"Time Reversibility","url":"https://www.academia.edu/Documents/in/Time_Reversibility?f_ri=450"},{"id":389120,"name":"Logical necessity","url":"https://www.academia.edu/Documents/in/Logical_necessity?f_ri=450"},{"id":1220956,"name":"Causality and Analyticity","url":"https://www.academia.edu/Documents/in/Causality_and_Analyticity?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_817032" data-work_id="817032" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/817032/System_and_Software_Safety_in_Critical_Systems">System and Software Safety in Critical Systems</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The safety aspects of computer-based systems as increasingly important as the use of software escalates because of its convenience and flexibility. However the complexity of even modestly sized programs is such that the elimination of... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_817032" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The safety aspects of computer-based systems as increasingly important as the use of software escalates because of its convenience and flexibility. However the complexity of even modestly sized programs is such that the elimination of errors with a high degree of confidence is extremely difficult. There are a number of approaches to enhancing safety in safety-critical control systems. These are surveyed and compared with particular emphasis on systems with software in the controlling system. A glossary of terms and an extensive bibliography for further reading are included.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/817032" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="3fa9e640077b403d20f5a2e5e92f0ba3" rel="nofollow" data-download="{"attachment_id":30425737,"asset_id":817032,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/30425737/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="12280" href="https://lsbu.academia.edu/JonathanBowen">Jonathan Bowen</a><script data-card-contents-for-user="12280" type="text/json">{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}</script></span></span></li><li class="js-paper-rank-work_817032 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="817032"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 817032, container: ".js-paper-rank-work_817032", }); });</script></li><li class="js-percentile-work_817032 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 817032; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_817032"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_817032 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="817032"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 817032; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=817032]").text(description); $(".js-view-count-work_817032").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_817032").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="817032"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="37" href="https://www.academia.edu/Documents/in/Information_Systems">Information Systems</a>, <script data-card-contents-for-ri="37" type="text/json">{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="78" href="https://www.academia.edu/Documents/in/Control_Systems_Engineering">Control Systems Engineering</a>, <script data-card-contents-for-ri="78" type="text/json">{"id":78,"name":"Control Systems Engineering","url":"https://www.academia.edu/Documents/in/Control_Systems_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="85" href="https://www.academia.edu/Documents/in/Safety_Engineering">Safety Engineering</a>, <script data-card-contents-for-ri="85" type="text/json">{"id":85,"name":"Safety Engineering","url":"https://www.academia.edu/Documents/in/Safety_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a><script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=817032]'), work: {"id":817032,"title":"System and Software Safety in Critical Systems","created_at":"2011-08-08T22:03:40.899-07:00","url":"https://www.academia.edu/817032/System_and_Software_Safety_in_Critical_Systems?f_ri=450","dom_id":"work_817032","summary":"The safety aspects of computer-based systems as increasingly important as the use of software escalates because of its convenience and flexibility. However the complexity of even modestly sized programs is such that the elimination of errors with a high degree of confidence is extremely difficult. There are a number of approaches to enhancing safety in safety-critical control systems. These are surveyed and compared with particular emphasis on systems with software in the controlling system. A glossary of terms and an extensive bibliography for further reading are included.","downloadable_attachments":[{"id":30425737,"asset_id":817032,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}],"research_interests":[{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=450","nofollow":false},{"id":78,"name":"Control Systems Engineering","url":"https://www.academia.edu/Documents/in/Control_Systems_Engineering?f_ri=450","nofollow":false},{"id":85,"name":"Safety Engineering","url":"https://www.academia.edu/Documents/in/Safety_Engineering?f_ri=450","nofollow":false},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450"},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450"},{"id":851,"name":"Complex Systems Science","url":"https://www.academia.edu/Documents/in/Complex_Systems_Science?f_ri=450"},{"id":3391,"name":"Systems Engineering","url":"https://www.academia.edu/Documents/in/Systems_Engineering?f_ri=450"},{"id":5473,"name":"Embedded Systems","url":"https://www.academia.edu/Documents/in/Embedded_Systems?f_ri=450"},{"id":5474,"name":"Real-time Systems","url":"https://www.academia.edu/Documents/in/Real-time_Systems?f_ri=450"},{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":35397,"name":"Safety and reliability and risk management","url":"https://www.academia.edu/Documents/in/Safety_and_reliability_and_risk_management?f_ri=450"},{"id":36535,"name":"Safety-Critical Systems","url":"https://www.academia.edu/Documents/in/Safety-Critical_Systems?f_ri=450"},{"id":49161,"name":"Safety","url":"https://www.academia.edu/Documents/in/Safety?f_ri=450"},{"id":88861,"name":"Computer Systems","url":"https://www.academia.edu/Documents/in/Computer_Systems?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_4192288" data-work_id="4192288" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/4192288/A_Study_of_Genre_in_In_Cold_Blood_a_Formal_Perspective">A Study of Genre in In Cold Blood: a Formal Perspective</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In this study we tried to analyse Truman Capote's In Cold Blood in order to determine why it is a literary masterpiece and the genre it belongs to. In order to do so, we studied different theories related to the nature of a literary text,... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_4192288" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In this study we tried to analyse Truman Capote's In Cold Blood in order to determine why it is a literary masterpiece and the genre it belongs to. In order to do so, we studied different theories related to the nature of a literary text, and the one that mostly satisfied us was Victor Schklovsky's in which he explains the concept of ostranine. Following this perspective, we then continued to study the question of genre. To do this, we concentrated on the way in which the schematic structure is shaped by estrangement in In Cold Blood and the relationship established with other literary texts as Roland Barthes suggested. We also included comments on fictionality and nonfictionality based on Van Dijk's view and finally, with the help of some Aristotelian concepts, we analised other features that make this novel a literary text. We also tried to decide whether In Cold Blood is a detective story or journalistic fiction and we concluded that it is indeed a literary text in spite of its non-fictionality, and that that non-fictionality is only partial.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/4192288" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="648230a161264a5fe95186a3f6447e20" rel="nofollow" data-download="{"attachment_id":31689324,"asset_id":4192288,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31689324/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="372560" href="https://unlp.academia.edu/Jer%C3%B3nimoCorregido">Jerónimo Corregido</a><script data-card-contents-for-user="372560" type="text/json">{"id":372560,"first_name":"Jerónimo","last_name":"Corregido","domain_name":"unlp","page_name":"JerónimoCorregido","display_name":"Jerónimo Corregido","profile_url":"https://unlp.academia.edu/Jer%C3%B3nimoCorregido?f_ri=450","photo":"https://0.academia-photos.com/372560/114852/3913657/s65_jer_nimo.corregido.jpg"}</script></span></span></li><li class="js-paper-rank-work_4192288 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="4192288"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 4192288, container: ".js-paper-rank-work_4192288", }); });</script></li><li class="js-percentile-work_4192288 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 4192288; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_4192288"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_4192288 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="4192288"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4192288; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4192288]").text(description); $(".js-view-count-work_4192288").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_4192288").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="4192288"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">17</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2418" href="https://www.academia.edu/Documents/in/Literature">Literature</a>, <script data-card-contents-for-ri="2418" type="text/json">{"id":2418,"name":"Literature","url":"https://www.academia.edu/Documents/in/Literature?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3125" href="https://www.academia.edu/Documents/in/Genre">Genre</a>, <script data-card-contents-for-ri="3125" type="text/json">{"id":3125,"name":"Genre","url":"https://www.academia.edu/Documents/in/Genre?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="38092" href="https://www.academia.edu/Documents/in/Russian_Formalism">Russian Formalism</a><script data-card-contents-for-ri="38092" type="text/json">{"id":38092,"name":"Russian Formalism","url":"https://www.academia.edu/Documents/in/Russian_Formalism?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=4192288]'), work: {"id":4192288,"title":"A Study of Genre in In Cold Blood: a Formal Perspective","created_at":"2013-08-07T10:15:02.492-07:00","url":"https://www.academia.edu/4192288/A_Study_of_Genre_in_In_Cold_Blood_a_Formal_Perspective?f_ri=450","dom_id":"work_4192288","summary":"In this study we tried to analyse Truman Capote's In Cold Blood in order to determine why it is a literary masterpiece and the genre it belongs to. In order to do so, we studied different theories related to the nature of a literary text, and the one that mostly satisfied us was Victor Schklovsky's in which he explains the concept of ostranine. Following this perspective, we then continued to study the question of genre. To do this, we concentrated on the way in which the schematic structure is shaped by estrangement in In Cold Blood and the relationship established with other literary texts as Roland Barthes suggested. We also included comments on fictionality and nonfictionality based on Van Dijk's view and finally, with the help of some Aristotelian concepts, we analised other features that make this novel a literary text. We also tried to decide whether In Cold Blood is a detective story or journalistic fiction and we concluded that it is indeed a literary text in spite of its non-fictionality, and that that non-fictionality is only partial.","downloadable_attachments":[{"id":31689324,"asset_id":4192288,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":372560,"first_name":"Jerónimo","last_name":"Corregido","domain_name":"unlp","page_name":"JerónimoCorregido","display_name":"Jerónimo Corregido","profile_url":"https://unlp.academia.edu/Jer%C3%B3nimoCorregido?f_ri=450","photo":"https://0.academia-photos.com/372560/114852/3913657/s65_jer_nimo.corregido.jpg"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":2418,"name":"Literature","url":"https://www.academia.edu/Documents/in/Literature?f_ri=450","nofollow":false},{"id":3125,"name":"Genre","url":"https://www.academia.edu/Documents/in/Genre?f_ri=450","nofollow":false},{"id":38092,"name":"Russian Formalism","url":"https://www.academia.edu/Documents/in/Russian_Formalism?f_ri=450","nofollow":false},{"id":87847,"name":"Género","url":"https://www.academia.edu/Documents/in/G%C3%A9nero?f_ri=450"},{"id":103303,"name":"Classroom Discourse","url":"https://www.academia.edu/Documents/in/Classroom_Discourse?f_ri=450"},{"id":172512,"name":"Estudios Literarios","url":"https://www.academia.edu/Documents/in/Estudios_Literarios?f_ri=450"},{"id":382864,"name":"In cold blood","url":"https://www.academia.edu/Documents/in/In_cold_blood?f_ri=450"},{"id":458141,"name":"Barthes","url":"https://www.academia.edu/Documents/in/Barthes?f_ri=450"},{"id":482573,"name":"Géneros discursivos","url":"https://www.academia.edu/Documents/in/Generos_discursivos?f_ri=450"},{"id":485094,"name":"Literariness","url":"https://www.academia.edu/Documents/in/Literariness?f_ri=450"},{"id":613154,"name":"Truman Capote","url":"https://www.academia.edu/Documents/in/Truman_Capote?f_ri=450"},{"id":920575,"name":"Swales","url":"https://www.academia.edu/Documents/in/Swales?f_ri=450"},{"id":920576,"name":"Formalismo Ruso","url":"https://www.academia.edu/Documents/in/Formalismo_Ruso?f_ri=450"},{"id":920577,"name":"Detective Novel","url":"https://www.academia.edu/Documents/in/Detective_Novel?f_ri=450"},{"id":1011586,"name":"ESL Curriculum Design","url":"https://www.academia.edu/Documents/in/ESL_Curriculum_Design?f_ri=450"},{"id":1011587,"name":"Functional Grammar for ESLTeaching","url":"https://www.academia.edu/Documents/in/Functional_Grammar_for_ESLTeaching?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_36744667" data-work_id="36744667" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/36744667/TOP_10_SOFTWARE_ENGINEERING_PAPERS_RECOMMENDED_READING_SOFTWARE_ENGINEERING_and_APPLICATIONS_S_RESEARCH">TOP 10 SOFTWARE ENGINEERING PAPERS: RECOMMENDED READING – SOFTWARE ENGINEERING & APPLICATIONS S RESEARCH</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/36744667" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="ec7dc88fa9d6fcfd9dcdb800def500a1" rel="nofollow" data-download="{"attachment_id":56689317,"asset_id":36744667,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/56689317/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="21169291" href="https://independent.academia.edu/IjseaJournal">International Journal of Software Engineering & Applications (IJSEA)-ERA Indexed</a><script data-card-contents-for-user="21169291" type="text/json">{"id":21169291,"first_name":"International Journal of Software Engineering \u0026 Applications","last_name":"(IJSEA)-ERA Indexed","domain_name":"independent","page_name":"IjseaJournal","display_name":"International Journal of Software Engineering \u0026 Applications (IJSEA)-ERA Indexed","profile_url":"https://independent.academia.edu/IjseaJournal?f_ri=450","photo":"https://0.academia-photos.com/21169291/5886224/84098518/s65_international_journal_of_software_engineering_applications._ijsea_-era_indexed.png"}</script></span></span></li><li class="js-paper-rank-work_36744667 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="36744667"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 36744667, container: ".js-paper-rank-work_36744667", }); });</script></li><li class="js-percentile-work_36744667 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 36744667; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_36744667"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_36744667 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="36744667"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 36744667; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=36744667]").text(description); $(".js-view-count-work_36744667").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_36744667").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="36744667"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="464" href="https://www.academia.edu/Documents/in/Information_Retrieval">Information Retrieval</a>, <script data-card-contents-for-ri="464" type="text/json">{"id":464,"name":"Information Retrieval","url":"https://www.academia.edu/Documents/in/Information_Retrieval?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1384" href="https://www.academia.edu/Documents/in/Web_Engineering">Web Engineering</a><script data-card-contents-for-ri="1384" type="text/json">{"id":1384,"name":"Web Engineering","url":"https://www.academia.edu/Documents/in/Web_Engineering?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=36744667]'), work: {"id":36744667,"title":"TOP 10 SOFTWARE ENGINEERING PAPERS: RECOMMENDED READING – SOFTWARE ENGINEERING \u0026 APPLICATIONS S RESEARCH","created_at":"2018-05-29T23:06:28.674-07:00","url":"https://www.academia.edu/36744667/TOP_10_SOFTWARE_ENGINEERING_PAPERS_RECOMMENDED_READING_SOFTWARE_ENGINEERING_and_APPLICATIONS_S_RESEARCH?f_ri=450","dom_id":"work_36744667","summary":null,"downloadable_attachments":[{"id":56689317,"asset_id":36744667,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":21169291,"first_name":"International Journal of Software Engineering \u0026 Applications","last_name":"(IJSEA)-ERA Indexed","domain_name":"independent","page_name":"IjseaJournal","display_name":"International Journal of Software Engineering \u0026 Applications (IJSEA)-ERA Indexed","profile_url":"https://independent.academia.edu/IjseaJournal?f_ri=450","photo":"https://0.academia-photos.com/21169291/5886224/84098518/s65_international_journal_of_software_engineering_applications._ijsea_-era_indexed.png"}],"research_interests":[{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":464,"name":"Information Retrieval","url":"https://www.academia.edu/Documents/in/Information_Retrieval?f_ri=450","nofollow":false},{"id":1384,"name":"Web Engineering","url":"https://www.academia.edu/Documents/in/Web_Engineering?f_ri=450","nofollow":false},{"id":1451,"name":"Quality Management","url":"https://www.academia.edu/Documents/in/Quality_Management?f_ri=450"},{"id":4065,"name":"Software Process Improvement and Assessment","url":"https://www.academia.edu/Documents/in/Software_Process_Improvement_and_Assessment?f_ri=450"},{"id":9542,"name":"Formal Methods (Formal Methods)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Methods_?f_ri=450"},{"id":12039,"name":"Music Information Retrieval","url":"https://www.academia.edu/Documents/in/Music_Information_Retrieval?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":15117,"name":"Empirical Software Engineering","url":"https://www.academia.edu/Documents/in/Empirical_Software_Engineering?f_ri=450"},{"id":15176,"name":"Knowledge Management in Software Engineering","url":"https://www.academia.edu/Documents/in/Knowledge_Management_in_Software_Engineering?f_ri=450"},{"id":21349,"name":"Information retrieval (Library Science)","url":"https://www.academia.edu/Documents/in/Information_retrieval_Library_Science_?f_ri=450"},{"id":28530,"name":"Software Quality Engineering","url":"https://www.academia.edu/Documents/in/Software_Quality_Engineering?f_ri=450"},{"id":176149,"name":"Service Oriented Software Engineering","url":"https://www.academia.edu/Documents/in/Service_Oriented_Software_Engineering?f_ri=450"},{"id":262209,"name":"Computer Software Engineering","url":"https://www.academia.edu/Documents/in/Computer_Software_Engineering?f_ri=450"},{"id":393623,"name":"Software Process","url":"https://www.academia.edu/Documents/in/Software_Process?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_853329" data-work_id="853329" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/853329/Convertendo_Diagramas_Ladder_em_modelos_de_Redes_de_Petri_Coloridas">Convertendo Diagramas Ladder em modelos de Redes de Petri Coloridas</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Resumo-Neste trabalho apresentamos uma técnica para a tradução de programas Ladder para modelos em Redes de Petri Coloridas (CPN). Ladderé usada no desenvolvimento de software para Controladores Lógico Programáveis, dispositivos usados na... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_853329" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Resumo-Neste trabalho apresentamos uma técnica para a tradução de programas Ladder para modelos em Redes de Petri Coloridas (CPN). Ladderé usada no desenvolvimento de software para Controladores Lógico Programáveis, dispositivos usados na automação industrial (e.g.; plantas químicas, de gás e de petróleo). Neste contexto são necessários alto nível de confiança e de segurança, pois a ocorrência de faltas pode resultar em grandes perdas financeiras e até mesmo de vidas humanas. Assim, aspectos formais inerentesàs CPN e seu suporte ferramental podem ser usados para garantir o nível de confiança desejado de tais sistemas.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/853329" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="9c64efb5b1cc463d0fc0174775f09a60" rel="nofollow" data-download="{"attachment_id":30594547,"asset_id":853329,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/30594547/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="379929" href="https://ufal.academia.edu/elthonoliveira">Elthon Oliveira</a><script data-card-contents-for-user="379929" type="text/json">{"id":379929,"first_name":"Elthon","last_name":"Oliveira","domain_name":"ufal","page_name":"elthonoliveira","display_name":"Elthon Oliveira","profile_url":"https://ufal.academia.edu/elthonoliveira?f_ri=450","photo":"https://0.academia-photos.com/379929/97378/880322/s65_elthon.oliveira.gif"}</script></span></span></li><li class="js-paper-rank-work_853329 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="853329"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 853329, container: ".js-paper-rank-work_853329", }); });</script></li><li class="js-percentile-work_853329 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 853329; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_853329"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_853329 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="853329"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 853329; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=853329]").text(description); $(".js-view-count-work_853329").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_853329").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="853329"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">2</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="20250" href="https://www.academia.edu/Documents/in/Petri_Nets">Petri Nets</a><script data-card-contents-for-ri="20250" type="text/json">{"id":20250,"name":"Petri Nets","url":"https://www.academia.edu/Documents/in/Petri_Nets?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=853329]'), work: {"id":853329,"title":"Convertendo Diagramas Ladder em modelos de Redes de Petri Coloridas","created_at":"2011-08-22T23:18:49.969-07:00","url":"https://www.academia.edu/853329/Convertendo_Diagramas_Ladder_em_modelos_de_Redes_de_Petri_Coloridas?f_ri=450","dom_id":"work_853329","summary":"Resumo-Neste trabalho apresentamos uma técnica para a tradução de programas Ladder para modelos em Redes de Petri Coloridas (CPN). Ladderé usada no desenvolvimento de software para Controladores Lógico Programáveis, dispositivos usados na automação industrial (e.g.; plantas químicas, de gás e de petróleo). Neste contexto são necessários alto nível de confiança e de segurança, pois a ocorrência de faltas pode resultar em grandes perdas financeiras e até mesmo de vidas humanas. Assim, aspectos formais inerentesàs CPN e seu suporte ferramental podem ser usados para garantir o nível de confiança desejado de tais sistemas.","downloadable_attachments":[{"id":30594547,"asset_id":853329,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":379929,"first_name":"Elthon","last_name":"Oliveira","domain_name":"ufal","page_name":"elthonoliveira","display_name":"Elthon Oliveira","profile_url":"https://ufal.academia.edu/elthonoliveira?f_ri=450","photo":"https://0.academia-photos.com/379929/97378/880322/s65_elthon.oliveira.gif"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":20250,"name":"Petri Nets","url":"https://www.academia.edu/Documents/in/Petri_Nets?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_39766209" data-work_id="39766209" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/39766209/ONLINE_BUS_PASS_GENERATION_USING_QR_CODE">ONLINE BUS PASS GENERATION USING QR CODE</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The main objectives of this work are to describe the online bus pass generation and ticket booking using QR code. Online bus pass generation is helpful to people who are suffering issues with the present technique for the generation of... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_39766209" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The main objectives of this work are to describe the online bus pass generation and ticket booking using QR code. Online bus pass generation is helpful to people who are suffering issues with the present technique for the generation of bus pass and renewal. This project consists of two login pages, one for user registration and the other one for admin. Users need to register by submitting their details through online. Once the registration process is done then a security code called One Time Password (OTP) code will be sent to the user's registered mail. This system is used for ticket generation, bus pass formation and renewing of the bus pass of the users. The user can login with Idno and password to perform the pass booking and renewal. Bus Ticket Checker can scan the users QR code to check the validity of bus pass.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/39766209" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="774a48c93192317dccddc346b91c3335" rel="nofollow" data-download="{"attachment_id":59948439,"asset_id":39766209,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/59948439/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="13733577" href="https://iiitb.academia.edu/IJIRAEInternationalJournalofInnovativeResearchinAdvancedEngineering">IJIRAE - International Journal of Innovative Research in Advanced Engineering</a><script data-card-contents-for-user="13733577" type="text/json">{"id":13733577,"first_name":"IJIRAE","last_name":"International Journal of Innovative Research in Advanced Engineering","domain_name":"iiitb","page_name":"IJIRAEInternationalJournalofInnovativeResearchinAdvancedEngineering","display_name":"IJIRAE - International Journal of Innovative Research in Advanced Engineering","profile_url":"https://iiitb.academia.edu/IJIRAEInternationalJournalofInnovativeResearchinAdvancedEngineering?f_ri=450","photo":"https://0.academia-photos.com/13733577/3819053/35118444/s65_ijirae.international_journal_of_innovative_research_in_advanced_engineering.jpg"}</script></span></span></li><li class="js-paper-rank-work_39766209 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="39766209"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 39766209, container: ".js-paper-rank-work_39766209", }); });</script></li><li class="js-percentile-work_39766209 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 39766209; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_39766209"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_39766209 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="39766209"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 39766209; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=39766209]").text(description); $(".js-view-count-work_39766209").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_39766209").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="39766209"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">11</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="11821" href="https://www.academia.edu/Documents/in/Verification_and_Validation">Verification and Validation</a>, <script data-card-contents-for-ri="11821" type="text/json">{"id":11821,"name":"Verification and Validation","url":"https://www.academia.edu/Documents/in/Verification_and_Validation?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="13892" href="https://www.academia.edu/Documents/in/Verification_Computer_Science_">Verification (Computer Science)</a>, <script data-card-contents-for-ri="13892" type="text/json">{"id":13892,"name":"Verification (Computer Science)","url":"https://www.academia.edu/Documents/in/Verification_Computer_Science_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="31441" href="https://www.academia.edu/Documents/in/Software_Verification_and_Validation">Software Verification and Validation</a><script data-card-contents-for-ri="31441" type="text/json">{"id":31441,"name":"Software Verification and Validation","url":"https://www.academia.edu/Documents/in/Software_Verification_and_Validation?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=39766209]'), work: {"id":39766209,"title":"ONLINE BUS PASS GENERATION USING QR CODE","created_at":"2019-07-06T21:00:35.563-07:00","url":"https://www.academia.edu/39766209/ONLINE_BUS_PASS_GENERATION_USING_QR_CODE?f_ri=450","dom_id":"work_39766209","summary":"The main objectives of this work are to describe the online bus pass generation and ticket booking using QR code. Online bus pass generation is helpful to people who are suffering issues with the present technique for the generation of bus pass and renewal. This project consists of two login pages, one for user registration and the other one for admin. Users need to register by submitting their details through online. Once the registration process is done then a security code called One Time Password (OTP) code will be sent to the user's registered mail. This system is used for ticket generation, bus pass formation and renewing of the bus pass of the users. The user can login with Idno and password to perform the pass booking and renewal. Bus Ticket Checker can scan the users QR code to check the validity of bus pass.","downloadable_attachments":[{"id":59948439,"asset_id":39766209,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":13733577,"first_name":"IJIRAE","last_name":"International Journal of Innovative Research in Advanced Engineering","domain_name":"iiitb","page_name":"IJIRAEInternationalJournalofInnovativeResearchinAdvancedEngineering","display_name":"IJIRAE - International Journal of Innovative Research in Advanced Engineering","profile_url":"https://iiitb.academia.edu/IJIRAEInternationalJournalofInnovativeResearchinAdvancedEngineering?f_ri=450","photo":"https://0.academia-photos.com/13733577/3819053/35118444/s65_ijirae.international_journal_of_innovative_research_in_advanced_engineering.jpg"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":11821,"name":"Verification and Validation","url":"https://www.academia.edu/Documents/in/Verification_and_Validation?f_ri=450","nofollow":false},{"id":13892,"name":"Verification (Computer Science)","url":"https://www.academia.edu/Documents/in/Verification_Computer_Science_?f_ri=450","nofollow":false},{"id":31441,"name":"Software Verification and Validation","url":"https://www.academia.edu/Documents/in/Software_Verification_and_Validation?f_ri=450","nofollow":false},{"id":45655,"name":"Speaker Verification","url":"https://www.academia.edu/Documents/in/Speaker_Verification?f_ri=450"},{"id":114561,"name":"Signature Verification","url":"https://www.academia.edu/Documents/in/Signature_Verification?f_ri=450"},{"id":117397,"name":"Verification","url":"https://www.academia.edu/Documents/in/Verification?f_ri=450"},{"id":160278,"name":"Handwritten Signature Verification","url":"https://www.academia.edu/Documents/in/Handwritten_Signature_Verification?f_ri=450"},{"id":171466,"name":"Hardware Verification","url":"https://www.academia.edu/Documents/in/Hardware_Verification?f_ri=450"},{"id":172035,"name":"Formal Verification","url":"https://www.academia.edu/Documents/in/Formal_Verification?f_ri=450"},{"id":485571,"name":"Online news business models","url":"https://www.academia.edu/Documents/in/Online_news_business_models?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_288606" data-work_id="288606" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/288606/High_Integrity_System_Specification_and_Design">High-Integrity System Specification and Design</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This volume provides the reader with a comprehensive introduction to system specification an d design methods, with particular emphasis on structured and formal methods, method integration, concurrency and safety-critical systems. It... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_288606" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This volume provides the reader with a comprehensive introduction to system specification an d design methods, with particular emphasis on structured and formal methods, method integration, concurrency and safety-critical systems. It contains new material by Jonathan Bowen and Michael Hinchey, along with reprints of classic articles on high-integrity systems which have never bef ore appeared in a single volume. Among these classic articles are contributions from such leading names as Leslie Lamport, Nancy Leveson and C.A.R. Hoare. <br />High-Integrity System Specification and Design provides practitioners and researchers with convenient access to a range of essential essays — both classic and state-of-the-art — in a single volume. It will provide them with details of specification and design approaches for this type of system, an overview of the development process, and evidence of how various classes of high-integrity system may be approached and developed successfully. <br /> <br />The volume is also available from the IEEE Computer Society Press. <br /> <br />Jonathan P. Bowen and Mike Hinchey (University of Nebraska at Omaha). Springer-Verlag, London, FACIT series, April 1999. ISBN 3-540-76226-4. (xix+701 pages) Co-author of the following reprinted papers:Seven More Myths of Formal Methods, Jonathan P. Bowen and Mike Hinchey, pages 153-165.Ten Commandments of Formal Methods, Jonathan P. Bowen and Mike Hinchey, pages 217-230.Safety-Critical Systems, Formal Methods and Standards, Jonathan P. Bowen and Victoria Stavridou, pages 485-528. <br />Table of contents <br />Preface <br />Parts: <br />Specification and Design <br />Structured Methods <br />Formal Methods <br />Object-Orientation <br />Concurrent and Distributed Systems <br />Real-Time and Safety-Critical Systems <br />Integrating Methods <br />Implementation <br />CASE <br />Glossary <br />Bibliography <br />Index <br />List of reprints <br /> <br />The following papers are included: <br /> <br />Grady Booch. Object-Oriented Development. IEEE Transactions on Software Engineering, 12(2):211–221, February 1986.Jonathan P. Bowen and Michael G. Hinchey. Ten Commandments of Formal Methods. IEEE Computer, 28(4):56–63, April 1995. <br />Jonathan P. Bowen and Michael G. Hinchey. Seven More Myths of Formal Methods. IEEE Software, 12(7):34–41, July 1995. <br />Jonathan P. Bowen and Victoria Stavridou. Formal Methods, Safety-Critical Systems and Standards. Software Engineering Journal, 8(4):189–209, July 1993. <br />Frederick P. Brooks, Jr. No Silver Bullet: Essence and Accidents of Software Engineering. IEEE Computer, 20(4):10–19, April 1987. First published in H.-J. Kugler (ed.), Information Processing '86, Elsevier Science Publishers B.V. (North-Holland).John R. Cameron. An Overview of JSD. IEEE Transactions on Software Engineering, 12(2):222–240, February 1986. <br />Eliott J. Chikofsky and B.L. Rubenstein. CASE: Reliability Engineering for Information Systems. IEEE Software, 5(2):11–16, March 1988. <br />Robert G. Fichman and Chris F. Kemerer. Object-Oriented and Conventional Analysis and Design Methodologies. IEEE Computer, 25(10):22–39, October 1992. <br />Norbert E. Fuchs. Specifications are (Preferably) Executable. Software Engineering Journal, 7(5):323–334, September 1992. <br />Susan Gerhart, Dan Craigen and Ted Ralston. Experience with Formal Methods in Critical Systems. IEEE Software, 11(1):21–28, January 1994. <br />Susan Gerhart, Dan Craigen and Ted Ralston. Regulatory Case Studies. IEEE Software, 11(1):30–39, January 1994.J. Anthony Hall. Seven Myths of Formal Methods. IEEE Software, 7(5):11–19, September 1990. <br />David Harel. On Visual Formalisms. Communications of the ACM, 31(5):514–530, May 1988. <br />David Harel. Biting the Silver Bullet: Toward a Brighter Future for System Development. IEEE Computer, 25(1):8–20, January 1992.Ian J. Hayes and Cliff B. Jones. Specifications are not (Necessarily) Executable. Software Engineering Journal, 4(6):330–338, 1989. <br />C.A.R. Hoare. Communicating Sequential Processes. Communications of the ACM, 21(8):666–677, August 1978. <br />C.A.R. Hoare. An Overview of some Formal Methods for Program Design. IEEE Computer, 20(9):85–91, September 1987. <br />Leslie Lamport. A Simple Approach to Specifying Concurrent Systems. Communications of the ACM, 32(1):32–45, January 1989. <br />Nancy G. Leveson. Medical Devices: The Therac-25 Story. In Safeware: System Safety and Computers, Addison-Wesley Publishing Company, Appendix A, pages 515–553, 1995. Based on Nancy G. Leveson and Clark S. Turner. An Investigation of the Therac-25 Accidents. IEEE Computer, 26(7):18–41, July 1993. <br />Ken Orr, Chris Gane, Edward Yourdon, Peter P. Chen and Larry L. Constantine. Methodology: The Experts Speak. BYTE, 14(4):221–233, April 1989.Jonathan S. Ostroff. Formal Methods for the Specification and Design of Real-Time Safety Critical Systems. Journal of Systems and Software, pp 33–60, April 1992. <br />Lesley T. Semmens, Robert B. France and Tom W.G. Docker. Integrated Structured Analysis and Formal Specification Techniques. The Computer Journal, 35(6):600–610, 1992. <br />Jeannette M. Wing. A Specifier's Introduction to Formal Methods. IEEE Computer, 23(9):8–24, September 1990.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/288606" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="d94bc4162e8fa14eebe65ad5906adafe" rel="nofollow" data-download="{"attachment_id":1338435,"asset_id":288606,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/1338435/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="12280" href="https://lsbu.academia.edu/JonathanBowen">Jonathan Bowen</a><script data-card-contents-for-user="12280" type="text/json">{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}</script></span></span></li><li class="js-paper-rank-work_288606 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="288606"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 288606, container: ".js-paper-rank-work_288606", }); });</script></li><li class="js-percentile-work_288606 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 288606; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_288606"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_288606 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="288606"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 288606; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=288606]").text(description); $(".js-view-count-work_288606").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_288606").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="288606"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">13</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="988" href="https://www.academia.edu/Documents/in/Design">Design</a><script data-card-contents-for-ri="988" type="text/json">{"id":988,"name":"Design","url":"https://www.academia.edu/Documents/in/Design?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=288606]'), work: {"id":288606,"title":"High-Integrity System Specification and Design","created_at":"2010-08-07T09:17:47.772-07:00","url":"https://www.academia.edu/288606/High_Integrity_System_Specification_and_Design?f_ri=450","dom_id":"work_288606","summary":"This volume provides the reader with a comprehensive introduction to system specification an d design methods, with particular emphasis on structured and formal methods, method integration, concurrency and safety-critical systems. It contains new material by Jonathan Bowen and Michael Hinchey, along with reprints of classic articles on high-integrity systems which have never bef ore appeared in a single volume. Among these classic articles are contributions from such leading names as Leslie Lamport, Nancy Leveson and C.A.R. Hoare.\r\nHigh-Integrity System Specification and Design provides practitioners and researchers with convenient access to a range of essential essays — both classic and state-of-the-art — in a single volume. It will provide them with details of specification and design approaches for this type of system, an overview of the development process, and evidence of how various classes of high-integrity system may be approached and developed successfully.\r\n\r\nThe volume is also available from the IEEE Computer Society Press.\r\n\r\nJonathan P. Bowen and Mike Hinchey (University of Nebraska at Omaha). Springer-Verlag, London, FACIT series, April 1999. ISBN 3-540-76226-4. (xix+701 pages) Co-author of the following reprinted papers:Seven More Myths of Formal Methods, Jonathan P. Bowen and Mike Hinchey, pages 153-165.Ten Commandments of Formal Methods, Jonathan P. Bowen and Mike Hinchey, pages 217-230.Safety-Critical Systems, Formal Methods and Standards, Jonathan P. Bowen and Victoria Stavridou, pages 485-528.\r\nTable of contents\r\nPreface\r\nParts:\r\nSpecification and Design\r\nStructured Methods\r\nFormal Methods\r\nObject-Orientation\r\nConcurrent and Distributed Systems\r\nReal-Time and Safety-Critical Systems\r\nIntegrating Methods\r\nImplementation\r\nCASE\r\nGlossary\r\nBibliography\r\nIndex\r\nList of reprints\r\n\r\nThe following papers are included:\r\n\r\nGrady Booch. Object-Oriented Development. IEEE Transactions on Software Engineering, 12(2):211–221, February 1986.Jonathan P. Bowen and Michael G. Hinchey. Ten Commandments of Formal Methods. IEEE Computer, 28(4):56–63, April 1995.\r\nJonathan P. Bowen and Michael G. Hinchey. Seven More Myths of Formal Methods. IEEE Software, 12(7):34–41, July 1995.\r\nJonathan P. Bowen and Victoria Stavridou. Formal Methods, Safety-Critical Systems and Standards. Software Engineering Journal, 8(4):189–209, July 1993.\r\nFrederick P. Brooks, Jr. No Silver Bullet: Essence and Accidents of Software Engineering. IEEE Computer, 20(4):10–19, April 1987. First published in H.-J. Kugler (ed.), Information Processing '86, Elsevier Science Publishers B.V. (North-Holland).John R. Cameron. An Overview of JSD. IEEE Transactions on Software Engineering, 12(2):222–240, February 1986.\r\nEliott J. Chikofsky and B.L. Rubenstein. CASE: Reliability Engineering for Information Systems. IEEE Software, 5(2):11–16, March 1988.\r\nRobert G. Fichman and Chris F. Kemerer. Object-Oriented and Conventional Analysis and Design Methodologies. IEEE Computer, 25(10):22–39, October 1992.\r\nNorbert E. Fuchs. Specifications are (Preferably) Executable. Software Engineering Journal, 7(5):323–334, September 1992.\r\nSusan Gerhart, Dan Craigen and Ted Ralston. Experience with Formal Methods in Critical Systems. IEEE Software, 11(1):21–28, January 1994.\r\nSusan Gerhart, Dan Craigen and Ted Ralston. Regulatory Case Studies. IEEE Software, 11(1):30–39, January 1994.J. Anthony Hall. Seven Myths of Formal Methods. IEEE Software, 7(5):11–19, September 1990.\r\nDavid Harel. On Visual Formalisms. Communications of the ACM, 31(5):514–530, May 1988.\r\nDavid Harel. Biting the Silver Bullet: Toward a Brighter Future for System Development. IEEE Computer, 25(1):8–20, January 1992.Ian J. Hayes and Cliff B. Jones. Specifications are not (Necessarily) Executable. Software Engineering Journal, 4(6):330–338, 1989.\r\nC.A.R. Hoare. Communicating Sequential Processes. Communications of the ACM, 21(8):666–677, August 1978.\r\nC.A.R. Hoare. An Overview of some Formal Methods for Program Design. IEEE Computer, 20(9):85–91, September 1987.\r\nLeslie Lamport. A Simple Approach to Specifying Concurrent Systems. Communications of the ACM, 32(1):32–45, January 1989.\r\nNancy G. Leveson. Medical Devices: The Therac-25 Story. In Safeware: System Safety and Computers, Addison-Wesley Publishing Company, Appendix A, pages 515–553, 1995. Based on Nancy G. Leveson and Clark S. Turner. An Investigation of the Therac-25 Accidents. IEEE Computer, 26(7):18–41, July 1993.\r\nKen Orr, Chris Gane, Edward Yourdon, Peter P. Chen and Larry L. Constantine. Methodology: The Experts Speak. BYTE, 14(4):221–233, April 1989.Jonathan S. Ostroff. Formal Methods for the Specification and Design of Real-Time Safety Critical Systems. Journal of Systems and Software, pp 33–60, April 1992.\r\nLesley T. Semmens, Robert B. France and Tom W.G. Docker. Integrated Structured Analysis and Formal Specification Techniques. The Computer Journal, 35(6):600–610, 1992.\r\nJeannette M. Wing. A Specifier's Introduction to Formal Methods. IEEE Computer, 23(9):8–24, September 1990.","downloadable_attachments":[{"id":1338435,"asset_id":288606,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":988,"name":"Design","url":"https://www.academia.edu/Documents/in/Design?f_ri=450","nofollow":false},{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":16781,"name":"Standards \u0026 Specifications","url":"https://www.academia.edu/Documents/in/Standards_and_Specifications?f_ri=450"},{"id":28530,"name":"Software Quality Engineering","url":"https://www.academia.edu/Documents/in/Software_Quality_Engineering?f_ri=450"},{"id":36535,"name":"Safety-Critical Systems","url":"https://www.academia.edu/Documents/in/Safety-Critical_Systems?f_ri=450"},{"id":39820,"name":"Software Quality Assurance","url":"https://www.academia.edu/Documents/in/Software_Quality_Assurance?f_ri=450"},{"id":57939,"name":"Software Design","url":"https://www.academia.edu/Documents/in/Software_Design?f_ri=450"},{"id":57987,"name":"Software Quality","url":"https://www.academia.edu/Documents/in/Software_Quality?f_ri=450"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3671180" data-work_id="3671180" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3671180/FORMAL_VERIFICATION_OF_FINITE_STATE_MACHINES">FORMAL VERIFICATION OF FINITE STATE MACHINES</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The classical methods of design verification of a digital design had been simulation and testing. Due to constraint of time, simulation based testing approaches use only a small sub set of input patterns whereas formal verification allows... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_3671180" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The classical methods of design verification of a digital design had been simulation and testing. Due to constraint of time, simulation based testing approaches use only a small sub set of input patterns whereas formal verification allows all input combinations to be taken into consideration. Model checking is one of the approaches of formal verification. The design description, modeled using the model verifier script, allows specification of some properties of the design using temporal logic. A synchronous sequential design can always be described as a finite state machine (FSM)</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3671180" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="223a4d93e4096bf1a0b8aa40a401d61e" rel="nofollow" data-download="{"attachment_id":31361377,"asset_id":3671180,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31361377/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4140032" href="https://mnit.academia.edu/VineetSahula">Vineet Sahula</a><script data-card-contents-for-user="4140032" type="text/json">{"id":4140032,"first_name":"Vineet","last_name":"Sahula","domain_name":"mnit","page_name":"VineetSahula","display_name":"Vineet Sahula","profile_url":"https://mnit.academia.edu/VineetSahula?f_ri=450","photo":"https://0.academia-photos.com/4140032/1608867/1943285/s65_vineet.sahula.jpg"}</script></span></span></li><li class="js-paper-rank-work_3671180 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3671180"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3671180, container: ".js-paper-rank-work_3671180", }); });</script></li><li class="js-percentile-work_3671180 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3671180; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3671180"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3671180 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3671180"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3671180; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3671180]").text(description); $(".js-view-count-work_3671180").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3671180").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3671180"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i></div><span class="InlineList-item-text u-textTruncate u-pl6x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a><script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (false) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3671180]'), work: {"id":3671180,"title":"FORMAL VERIFICATION OF FINITE STATE MACHINES","created_at":"2013-06-07T16:28:25.797-07:00","url":"https://www.academia.edu/3671180/FORMAL_VERIFICATION_OF_FINITE_STATE_MACHINES?f_ri=450","dom_id":"work_3671180","summary":"The classical methods of design verification of a digital design had been simulation and testing. Due to constraint of time, simulation based testing approaches use only a small sub set of input patterns whereas formal verification allows all input combinations to be taken into consideration. Model checking is one of the approaches of formal verification. The design description, modeled using the model verifier script, allows specification of some properties of the design using temporal logic. A synchronous sequential design can always be described as a finite state machine (FSM)","downloadable_attachments":[{"id":31361377,"asset_id":3671180,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4140032,"first_name":"Vineet","last_name":"Sahula","domain_name":"mnit","page_name":"VineetSahula","display_name":"Vineet Sahula","profile_url":"https://mnit.academia.edu/VineetSahula?f_ri=450","photo":"https://0.academia-photos.com/4140032/1608867/1943285/s65_vineet.sahula.jpg"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_7437972" data-work_id="7437972" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/7437972/Formal_Method_in_Software_Engineering">Formal Method in Software Engineering</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/7437972" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="7a86e0f6407c82649fe2a0202f82b703" rel="nofollow" data-download="{"attachment_id":34020623,"asset_id":7437972,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/34020623/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="1094455" href="https://sbu-ir.academia.edu/MehranAlidoostNia">Mehran Alidoost Nia</a><script data-card-contents-for-user="1094455" type="text/json">{"id":1094455,"first_name":"Mehran","last_name":"Alidoost Nia","domain_name":"sbu-ir","page_name":"MehranAlidoostNia","display_name":"Mehran Alidoost Nia","profile_url":"https://sbu-ir.academia.edu/MehranAlidoostNia?f_ri=450","photo":"https://0.academia-photos.com/1094455/857167/132452616/s65_mehran.alidoost_nia.jpg"}</script></span></span></li><li class="js-paper-rank-work_7437972 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="7437972"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 7437972, container: ".js-paper-rank-work_7437972", }); });</script></li><li class="js-percentile-work_7437972 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 7437972; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_7437972"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_7437972 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="7437972"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 7437972; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=7437972]").text(description); $(".js-view-count-work_7437972").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_7437972").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="7437972"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">5</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="28532" href="https://www.academia.edu/Documents/in/Software_Reliability">Software Reliability</a>, <script data-card-contents-for-ri="28532" type="text/json">{"id":28532,"name":"Software Reliability","url":"https://www.academia.edu/Documents/in/Software_Reliability?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="262209" href="https://www.academia.edu/Documents/in/Computer_Software_Engineering">Computer Software Engineering</a><script data-card-contents-for-ri="262209" type="text/json">{"id":262209,"name":"Computer Software Engineering","url":"https://www.academia.edu/Documents/in/Computer_Software_Engineering?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=7437972]'), work: {"id":7437972,"title":"Formal Method in Software Engineering","created_at":"2014-06-23T16:07:29.243-07:00","url":"https://www.academia.edu/7437972/Formal_Method_in_Software_Engineering?f_ri=450","dom_id":"work_7437972","summary":null,"downloadable_attachments":[{"id":34020623,"asset_id":7437972,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":1094455,"first_name":"Mehran","last_name":"Alidoost Nia","domain_name":"sbu-ir","page_name":"MehranAlidoostNia","display_name":"Mehran Alidoost Nia","profile_url":"https://sbu-ir.academia.edu/MehranAlidoostNia?f_ri=450","photo":"https://0.academia-photos.com/1094455/857167/132452616/s65_mehran.alidoost_nia.jpg"}],"research_interests":[{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":28532,"name":"Software Reliability","url":"https://www.academia.edu/Documents/in/Software_Reliability?f_ri=450","nofollow":false},{"id":262209,"name":"Computer Software Engineering","url":"https://www.academia.edu/Documents/in/Computer_Software_Engineering?f_ri=450","nofollow":false},{"id":395416,"name":"Software Reliability Prediction","url":"https://www.academia.edu/Documents/in/Software_Reliability_Prediction?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_11856478" data-work_id="11856478" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/11856478/ESTRATEGIAS_Y_T%C3%89CNICAS_DE_EDUCACI%C3%93N_MORAL">ESTRATEGIAS Y TÉCNICAS DE EDUCACIÓN MORAL</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest">Kohlberg: "más probable que exista un cambio en el juicio moral cuando se establecen debates a partir de dilemas morales".</div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/11856478" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="93cc74e499670cf5d429cd62985aacfa" rel="nofollow" data-download="{"attachment_id":37250647,"asset_id":11856478,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/37250647/download_file?st=MTczNDAyMzEyMiw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="29273111" href="https://colpos.academia.edu/C%C3%A9sarUrielRiveraN%C3%A1jera">César Uriel Rivera Nájera</a><script data-card-contents-for-user="29273111" type="text/json">{"id":29273111,"first_name":"César Uriel","last_name":"Rivera Nájera","domain_name":"colpos","page_name":"CésarUrielRiveraNájera","display_name":"César Uriel Rivera Nájera","profile_url":"https://colpos.academia.edu/C%C3%A9sarUrielRiveraN%C3%A1jera?f_ri=450","photo":"https://0.academia-photos.com/29273111/134752355/124192246/s65_c_sar_uriel.rivera_n_jera.png"}</script></span></span></li><li class="js-paper-rank-work_11856478 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="11856478"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 11856478, container: ".js-paper-rank-work_11856478", }); });</script></li><li class="js-percentile-work_11856478 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 11856478; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_11856478"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_11856478 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="11856478"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 11856478; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=11856478]").text(description); $(".js-view-count-work_11856478").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_11856478").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="11856478"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i></div><span class="InlineList-item-text u-textTruncate u-pl6x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a><script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (false) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=11856478]'), work: {"id":11856478,"title":"ESTRATEGIAS Y TÉCNICAS DE EDUCACIÓN MORAL","created_at":"2015-04-08T15:32:18.780-07:00","url":"https://www.academia.edu/11856478/ESTRATEGIAS_Y_T%C3%89CNICAS_DE_EDUCACI%C3%93N_MORAL?f_ri=450","dom_id":"work_11856478","summary":"Kohlberg: \"más probable que exista un cambio en el juicio moral cuando se establecen debates a partir de dilemas morales\".","downloadable_attachments":[{"id":37250647,"asset_id":11856478,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":29273111,"first_name":"César Uriel","last_name":"Rivera Nájera","domain_name":"colpos","page_name":"CésarUrielRiveraNájera","display_name":"César Uriel Rivera Nájera","profile_url":"https://colpos.academia.edu/C%C3%A9sarUrielRiveraN%C3%A1jera?f_ri=450","photo":"https://0.academia-photos.com/29273111/134752355/124192246/s65_c_sar_uriel.rivera_n_jera.png"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_36996612" data-work_id="36996612" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/36996612/TOP_10_SOFTWARE_ENGINEERING_PAPERS_RECOMMENDED_READING_SOFTWARE_ENGINEERING_and_APPLICATIONS_RESEARCH">TOP 10 SOFTWARE ENGINEERING PAPERS: RECOMMENDED READING – SOFTWARE ENGINEERING & APPLICATIONS RESEARCH</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The International Journal of Software Engineering & Applications (IJSEA) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Software Engineering & Applications. The... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_36996612" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The International Journal of Software Engineering & Applications (IJSEA) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Software Engineering & Applications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on understanding Modern software engineering concepts & establishing new collaborations in these areas.<br /><br />Authors are solicited to contribute to the journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of software engineering & applications.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/36996612" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="e6c84ee986c11073feeae6c2690df6a2" rel="nofollow" data-download="{"attachment_id":63050948,"asset_id":36996612,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/63050948/download_file?st=MTczNDAyMzEyMyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="21169291" href="https://independent.academia.edu/IjseaJournal">International Journal of Software Engineering & Applications (IJSEA)-ERA Indexed</a><script data-card-contents-for-user="21169291" type="text/json">{"id":21169291,"first_name":"International Journal of Software Engineering \u0026 Applications","last_name":"(IJSEA)-ERA Indexed","domain_name":"independent","page_name":"IjseaJournal","display_name":"International Journal of Software Engineering \u0026 Applications (IJSEA)-ERA Indexed","profile_url":"https://independent.academia.edu/IjseaJournal?f_ri=450","photo":"https://0.academia-photos.com/21169291/5886224/84098518/s65_international_journal_of_software_engineering_applications._ijsea_-era_indexed.png"}</script></span></span></li><li class="js-paper-rank-work_36996612 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="36996612"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 36996612, container: ".js-paper-rank-work_36996612", }); });</script></li><li class="js-percentile-work_36996612 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 36996612; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_36996612"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_36996612 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="36996612"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 36996612; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=36996612]").text(description); $(".js-view-count-work_36996612").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_36996612").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="36996612"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">22</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="464" href="https://www.academia.edu/Documents/in/Information_Retrieval">Information Retrieval</a>, <script data-card-contents-for-ri="464" type="text/json">{"id":464,"name":"Information Retrieval","url":"https://www.academia.edu/Documents/in/Information_Retrieval?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1451" href="https://www.academia.edu/Documents/in/Quality_Management">Quality Management</a><script data-card-contents-for-ri="1451" type="text/json">{"id":1451,"name":"Quality Management","url":"https://www.academia.edu/Documents/in/Quality_Management?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=36996612]'), work: {"id":36996612,"title":"TOP 10 SOFTWARE ENGINEERING PAPERS: RECOMMENDED READING – SOFTWARE ENGINEERING \u0026 APPLICATIONS RESEARCH","created_at":"2018-07-06T20:57:37.013-07:00","url":"https://www.academia.edu/36996612/TOP_10_SOFTWARE_ENGINEERING_PAPERS_RECOMMENDED_READING_SOFTWARE_ENGINEERING_and_APPLICATIONS_RESEARCH?f_ri=450","dom_id":"work_36996612","summary":"The International Journal of Software Engineering \u0026 Applications (IJSEA) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Software Engineering \u0026 Applications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on understanding Modern software engineering concepts \u0026 establishing new collaborations in these areas.\n\nAuthors are solicited to contribute to the journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of software engineering \u0026 applications.","downloadable_attachments":[{"id":63050948,"asset_id":36996612,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":21169291,"first_name":"International Journal of Software Engineering \u0026 Applications","last_name":"(IJSEA)-ERA Indexed","domain_name":"independent","page_name":"IjseaJournal","display_name":"International Journal of Software Engineering \u0026 Applications (IJSEA)-ERA Indexed","profile_url":"https://independent.academia.edu/IjseaJournal?f_ri=450","photo":"https://0.academia-photos.com/21169291/5886224/84098518/s65_international_journal_of_software_engineering_applications._ijsea_-era_indexed.png"}],"research_interests":[{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":464,"name":"Information Retrieval","url":"https://www.academia.edu/Documents/in/Information_Retrieval?f_ri=450","nofollow":false},{"id":1451,"name":"Quality Management","url":"https://www.academia.edu/Documents/in/Quality_Management?f_ri=450","nofollow":false},{"id":4065,"name":"Software Process Improvement and Assessment","url":"https://www.academia.edu/Documents/in/Software_Process_Improvement_and_Assessment?f_ri=450"},{"id":9317,"name":"Component-Based Software Engineering (CBSE)","url":"https://www.academia.edu/Documents/in/Component-Based_Software_Engineering_CBSE_?f_ri=450"},{"id":9542,"name":"Formal Methods (Formal Methods)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Methods_?f_ri=450"},{"id":9967,"name":"Software Engineering education","url":"https://www.academia.edu/Documents/in/Software_Engineering_education?f_ri=450"},{"id":12039,"name":"Music Information Retrieval","url":"https://www.academia.edu/Documents/in/Music_Information_Retrieval?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":15117,"name":"Empirical Software Engineering","url":"https://www.academia.edu/Documents/in/Empirical_Software_Engineering?f_ri=450"},{"id":21349,"name":"Information retrieval (Library Science)","url":"https://www.academia.edu/Documents/in/Information_retrieval_Library_Science_?f_ri=450"},{"id":28530,"name":"Software Quality Engineering","url":"https://www.academia.edu/Documents/in/Software_Quality_Engineering?f_ri=450"},{"id":35486,"name":"Agile Methods (Software Engineering)","url":"https://www.academia.edu/Documents/in/Agile_Methods_Software_Engineering_?f_ri=450"},{"id":55826,"name":"Software Requirement Engineering","url":"https://www.academia.edu/Documents/in/Software_Requirement_Engineering?f_ri=450"},{"id":62367,"name":"Agent Oriented Software Engineering","url":"https://www.academia.edu/Documents/in/Agent_Oriented_Software_Engineering?f_ri=450"},{"id":71997,"name":"Multimedia information retrieval","url":"https://www.academia.edu/Documents/in/Multimedia_information_retrieval?f_ri=450"},{"id":154704,"name":"Total Quality Management","url":"https://www.academia.edu/Documents/in/Total_Quality_Management?f_ri=450"},{"id":262209,"name":"Computer Software Engineering","url":"https://www.academia.edu/Documents/in/Computer_Software_Engineering?f_ri=450"},{"id":393623,"name":"Software Process","url":"https://www.academia.edu/Documents/in/Software_Process?f_ri=450"},{"id":402808,"name":"Project Quality Management","url":"https://www.academia.edu/Documents/in/Project_Quality_Management?f_ri=450"},{"id":1142601,"name":"Quality and school management","url":"https://www.academia.edu/Documents/in/Quality_and_school_management?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_4298588" data-work_id="4298588" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/4298588/LightWeight_Theorem_Proving_for_Debugging_and_Verifying_Units_of_Code">LightWeight Theorem Proving for Debugging and Verifying Units of Code</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">is the fourth in a series of workshops intended to focus effort on First-Order Theorem Proving as a core theme of Automated Deduction, and to provide a forum for presentation of recent work and discussion of research in progress. The... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_4298588" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">is the fourth in a series of workshops intended to focus effort on First-Order Theorem Proving as a core theme of Automated Deduction, and to provide a forum for presentation of recent work and discussion of research in progress. The previous workshops of this series were held at Schloss The technical program of FTP'2003 consists of three invited talks, twelve regular papers, two system descriptions and two position papers. The topics of these papers match very well those of the workshop which cover theorem proving in first-order classical, many-valued, modal and description logics, including nonexclusively: resolution, equational reasoning, term-rewriting, model construction, constraint reasoning, unification, description logics, propositional logic, specialized decision procedures; strategies and complexity of theorem proving procedures; implementation techniques and applications of first-order theorem provers to verification, artificial intelligence, mathematics and education. We sincerely thank everyone who contributed to make this workshop possible.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/4298588" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="6c9f99d758af4eb9901ed9178a96802e" rel="nofollow" data-download="{"attachment_id":49954349,"asset_id":4298588,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/49954349/download_file?st=MTczNDAyMzEyMyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="5227017" href="https://fbk.academia.edu/SilvioRanise">Silvio Ranise</a><script data-card-contents-for-user="5227017" type="text/json">{"id":5227017,"first_name":"Silvio","last_name":"Ranise","domain_name":"fbk","page_name":"SilvioRanise","display_name":"Silvio Ranise","profile_url":"https://fbk.academia.edu/SilvioRanise?f_ri=450","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_4298588 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="4298588"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 4298588, container: ".js-paper-rank-work_4298588", }); });</script></li><li class="js-percentile-work_4298588 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 4298588; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_4298588"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_4298588 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="4298588"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4298588; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4298588]").text(description); $(".js-view-count-work_4298588").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_4298588").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="4298588"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="13891" href="https://www.academia.edu/Documents/in/Program_Analysis">Program Analysis</a>, <script data-card-contents-for-ri="13891" type="text/json">{"id":13891,"name":"Program Analysis","url":"https://www.academia.edu/Documents/in/Program_Analysis?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="19795" href="https://www.academia.edu/Documents/in/Theorem_Proving">Theorem Proving</a>, <script data-card-contents-for-ri="19795" type="text/json">{"id":19795,"name":"Theorem Proving","url":"https://www.academia.edu/Documents/in/Theorem_Proving?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="123652" href="https://www.academia.edu/Documents/in/SMT">SMT</a><script data-card-contents-for-ri="123652" type="text/json">{"id":123652,"name":"SMT","url":"https://www.academia.edu/Documents/in/SMT?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=4298588]'), work: {"id":4298588,"title":"LightWeight Theorem Proving for Debugging and Verifying Units of Code","created_at":"2013-08-22T01:50:05.095-07:00","url":"https://www.academia.edu/4298588/LightWeight_Theorem_Proving_for_Debugging_and_Verifying_Units_of_Code?f_ri=450","dom_id":"work_4298588","summary":"is the fourth in a series of workshops intended to focus effort on First-Order Theorem Proving as a core theme of Automated Deduction, and to provide a forum for presentation of recent work and discussion of research in progress. The previous workshops of this series were held at Schloss The technical program of FTP'2003 consists of three invited talks, twelve regular papers, two system descriptions and two position papers. The topics of these papers match very well those of the workshop which cover theorem proving in first-order classical, many-valued, modal and description logics, including nonexclusively: resolution, equational reasoning, term-rewriting, model construction, constraint reasoning, unification, description logics, propositional logic, specialized decision procedures; strategies and complexity of theorem proving procedures; implementation techniques and applications of first-order theorem provers to verification, artificial intelligence, mathematics and education. We sincerely thank everyone who contributed to make this workshop possible.","downloadable_attachments":[{"id":49954349,"asset_id":4298588,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":5227017,"first_name":"Silvio","last_name":"Ranise","domain_name":"fbk","page_name":"SilvioRanise","display_name":"Silvio Ranise","profile_url":"https://fbk.academia.edu/SilvioRanise?f_ri=450","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":13891,"name":"Program Analysis","url":"https://www.academia.edu/Documents/in/Program_Analysis?f_ri=450","nofollow":false},{"id":19795,"name":"Theorem Proving","url":"https://www.academia.edu/Documents/in/Theorem_Proving?f_ri=450","nofollow":false},{"id":123652,"name":"SMT","url":"https://www.academia.edu/Documents/in/SMT?f_ri=450","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_288614 coauthored" data-work_id="288614" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/288614/Formal_Specification_and_Documentation_Using_Z_A_Case_Study_Approach">Formal Specification and Documentation Using Z: A Case Study Approach</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Formal methods are becoming more accepted in both academia and industry as one possible way in which to help improve the quality of both software and hardware systems. It should be remembered however that they are not a panacea, but... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_288614" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Formal methods are becoming more accepted in both academia and industry as one possible way in which to help improve the quality of both software and hardware systems. It should be remembered however that they are not a panacea, but rather one <br />more weapon in the armoury against making design mistakes. To quote from Prof. Tony Hoare: <br /> <br />"Of course, there is no fool-proof methodology or magic formula that will ensure a good, efficient, or even feasible design. For that, the designer needs experience, insight, flair, judgement, invention. Formal methods can only stimulate, guide, and <br />discipline our human inspiration, clarify design alternatives, assist in exploring their consequences, formalize and communicate design decisions, and help to ensure that they are correctly carried out." - C.A.R. Hoare, 1988 <br /> <br />Thus we should not expect too much from formal methods, but rather use them to advantage where appropriate. <br /> <br />Even within the formal methods community, there are many camps: for example, those that believe that a formally correct system must be proved correct mechanically, one small step at a time, and those who use the term formal to mean mathematical, using high-level pencil-and-paper style proofs to verify a design is ‘correct’ with respect to its specification. Sometimes the latter method is known as ‘rigorous’ to differentiate it from the former; and of course there are positions between these two extremes. <br /> <br />Even if a system is proved correct, there are still many assumptions which may be invalid. The specification must be ‘obviously right.’ There is no way that this can be formally verified to be what is wanted. It must be simple enough to be understandable and should be acceptable to both the designer and the customer. <br /> <br />This book presents an even more pragmatic view of the use of formal methods than that held by some academics: that is that formal specification alone can still be beneficial (and is much more cost effective in general) than attempting proofs in many cases. While the cost of proving a system correct may be justified in safety-critical systems where lives are at risk, many systems are less critical, but could still benefit from formalization earlier on in the design process than is normally the case in much industrial practice. <br /> <br />Ultimately the computer system will be communicating with the outside world. In a control system, we will probably be dealing with physical laws, continuous mathematics (e.g., differential equations), etc. This will have to be converted into digital values and approximations will have to be made. In many cases, a Human-Computer Interface will be involved. Great engineering skill will be needed to ensure that any assumptions made are correct and will not invalidate any formally verified design. It is very important to apportion responsibility between the engineers associated with each design task. Mutually agreed interfaces must be drawn up. Ideally these should be formalized to reduce the risk of ambiguity and misunderstanding on each side of the interfaces. <br /> <br />This book presents the use of one notation in the accumulation of available mathematical techniques to help ensure the correctness of computer-based systems, namely the Z notation (pronounced ‘zed’), intended for the specification of such systems. The formal notation Z is based on set theory and predicate calculus, and has been developed at the Oxford University Computing Laboratory since the late 1970’s. <br /> <br />The use of a formal notation early on in the design process helps to remove many errors that would not otherwise be discovered until a later stage. The book includes specification of a number of digital systems in a variety of areas to help demonstrate the scope of the notation. Most of the specifications are of real systems that have been built, either commercially or experimentally. It is hoped that the variety of examples in this book will encourage more developers to attempt to specify their systems in a more formal manner before they attempt the development or programming stage. <br /> <br />In Part I, the first two chapters give an introduction to formal specification, using Z in particular, and also to the issues concerning the practical take-up and use of formal methods in industry. Chapter 2 gives an overview of some industrial issues, for those contemplating the use of formal methods as part of the software development process. Some guidelines to help with successful use are given. Finally a brief tutorial is given in Chapter 3, which introduces Z for those who have not seen the notation before, but who wish to tackle the rest of the book. However, it should be noted that this is not a substitute for a fuller treatment, which if required should be sought from one of the numerous Z textbooks now available. <br /> <br />Z has been designed to be read by (suitably trained) humans, rather than by computers, and as such may be included in manuals documenting computer-based systems. Part II gives some examples, using network services designed and built at Oxford University. Two types of manual have been developed, one of the user of a service, giving an idealized external abstract view, and one for potential implementors, giving more details of the suggested internal structure of the service. <br /> <br />In Part III, Chapter 6 details the specification of a text formatting tool designed for using under the UNIX operating system. The structure of UNIX files is discussed in this context. A specification of a mouse-based input system for UNIX workstations is also presented in Chapter 7. <br /> <br />Although Z has mainly been applied to software systems, it is also applicable to hardware. In Part IV, a number of aspects important in the specification of machine instruction sets are discussed. Chapter 8 formally defines some concepts which are useful in the specification of any microprocessor. Building of this, a part of a specific instruction set, namely that of the Transputer, is then presented in Chapter 9. <br /> <br />Part V details some graphical concepts. Chapter 10 introduces general concepts useful for specifying pixel maps and window systems. Chapter 11 defines the rasterop function which is fundamental to many graphics operations. <br /> <br />Window systems are now one of the most popular interfaces for computers. Part VI builds on the ideas presented in Part V and gives details of three window systems, including the highly successful XWindow System. Chapter 15 remarks on experience <br />gained by formally specifying the three window systems and other case studies. <br /> <br />Appendix A gives some indications on how to obtain further up-to-date information on Z. A glossary of the Z notation may be found in Appendix B. A literature guide in Appendix C together with a substantial bibliography at the end of the book are included to allow readers to follow up on another aspect of Z and formal methods that are of special interest. Finally an index, particularly of names of definitions in the specifications presented in the book, will aid the reader in navigating the text, especially the formal parts. <br /> <br />It is hoped that the specifications presented here will help students and industrial practitioners alike to produce better specifications of their designs, be they large or small. Even if no proofs or refinement of a system are attempted, mere formalization early on in the design process will help to clarify a designer’s thoughts (especially when undertaken as part of a team) and remove many errors before they become implemented, <br />and therefore much more difficult and expensive to rectify. <br />For further on-line information related to this book, held as part of the distributed World Wide Web (WWW) Virtual Library, the reader is referred to the following URL <br />(Uniform Resource Locator): <br />http://<a href="http://formalmethods.wikia.com/zbook" rel="nofollow">http://formalmethods.wikia.com/zbook</a> <br /> <br />J.P.B. <br />June 1995</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/288614" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="2bbb84664382c9b02a953163d7efff22" rel="nofollow" data-download="{"attachment_id":1338443,"asset_id":288614,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/1338443/download_file?st=MTczNDAyMzEyMyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="12280" href="https://lsbu.academia.edu/JonathanBowen">Jonathan Bowen</a><script data-card-contents-for-user="12280" type="text/json">{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-288614">+1</span><div class="hidden js-additional-users-288614"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/XiaopingJia">Xiaoping Jia</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-288614'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-288614').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_288614 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="288614"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 288614, container: ".js-paper-rank-work_288614", }); });</script></li><li class="js-percentile-work_288614 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 288614; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_288614"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_288614 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="288614"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 288614; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=288614]").text(description); $(".js-view-count-work_288614").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_288614").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="288614"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="363" href="https://www.academia.edu/Documents/in/Set_Theory">Set Theory</a>, <script data-card-contents-for-ri="363" type="text/json">{"id":363,"name":"Set Theory","url":"https://www.academia.edu/Documents/in/Set_Theory?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a><script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=288614]'), work: {"id":288614,"title":"Formal Specification and Documentation Using Z: A Case Study Approach","created_at":"2010-08-07T09:17:50.900-07:00","url":"https://www.academia.edu/288614/Formal_Specification_and_Documentation_Using_Z_A_Case_Study_Approach?f_ri=450","dom_id":"work_288614","summary":"Formal methods are becoming more accepted in both academia and industry as one possible way in which to help improve the quality of both software and hardware systems. It should be remembered however that they are not a panacea, but rather one\r\nmore weapon in the armoury against making design mistakes. To quote from Prof. Tony Hoare:\r\n\r\n\"Of course, there is no fool-proof methodology or magic formula that will ensure a good, efficient, or even feasible design. For that, the designer needs experience, insight, flair, judgement, invention. Formal methods can only stimulate, guide, and\r\ndiscipline our human inspiration, clarify design alternatives, assist in exploring their consequences, formalize and communicate design decisions, and help to ensure that they are correctly carried out.\" - C.A.R. Hoare, 1988\r\n\r\nThus we should not expect too much from formal methods, but rather use them to advantage where appropriate.\r\n\r\nEven within the formal methods community, there are many camps: for example, those that believe that a formally correct system must be proved correct mechanically, one small step at a time, and those who use the term formal to mean mathematical, using high-level pencil-and-paper style proofs to verify a design is ‘correct’ with respect to its specification. Sometimes the latter method is known as ‘rigorous’ to differentiate it from the former; and of course there are positions between these two extremes.\r\n\r\nEven if a system is proved correct, there are still many assumptions which may be invalid. The specification must be ‘obviously right.’ There is no way that this can be formally verified to be what is wanted. It must be simple enough to be understandable and should be acceptable to both the designer and the customer.\r\n\r\nThis book presents an even more pragmatic view of the use of formal methods than that held by some academics: that is that formal specification alone can still be beneficial (and is much more cost effective in general) than attempting proofs in many cases. While the cost of proving a system correct may be justified in safety-critical systems where lives are at risk, many systems are less critical, but could still benefit from formalization earlier on in the design process than is normally the case in much industrial practice.\r\n\r\nUltimately the computer system will be communicating with the outside world. In a control system, we will probably be dealing with physical laws, continuous mathematics (e.g., differential equations), etc. This will have to be converted into digital values and approximations will have to be made. In many cases, a Human-Computer Interface will be involved. Great engineering skill will be needed to ensure that any assumptions made are correct and will not invalidate any formally verified design. It is very important to apportion responsibility between the engineers associated with each design task. Mutually agreed interfaces must be drawn up. Ideally these should be formalized to reduce the risk of ambiguity and misunderstanding on each side of the interfaces.\r\n\r\nThis book presents the use of one notation in the accumulation of available mathematical techniques to help ensure the correctness of computer-based systems, namely the Z notation (pronounced ‘zed’), intended for the specification of such systems. The formal notation Z is based on set theory and predicate calculus, and has been developed at the Oxford University Computing Laboratory since the late 1970’s.\r\n\r\nThe use of a formal notation early on in the design process helps to remove many errors that would not otherwise be discovered until a later stage. The book includes specification of a number of digital systems in a variety of areas to help demonstrate the scope of the notation. Most of the specifications are of real systems that have been built, either commercially or experimentally. It is hoped that the variety of examples in this book will encourage more developers to attempt to specify their systems in a more formal manner before they attempt the development or programming stage.\r\n\r\nIn Part I, the first two chapters give an introduction to formal specification, using Z in particular, and also to the issues concerning the practical take-up and use of formal methods in industry. Chapter 2 gives an overview of some industrial issues, for those contemplating the use of formal methods as part of the software development process. Some guidelines to help with successful use are given. Finally a brief tutorial is given in Chapter 3, which introduces Z for those who have not seen the notation before, but who wish to tackle the rest of the book. However, it should be noted that this is not a substitute for a fuller treatment, which if required should be sought from one of the numerous Z textbooks now available.\r\n\r\nZ has been designed to be read by (suitably trained) humans, rather than by computers, and as such may be included in manuals documenting computer-based systems. Part II gives some examples, using network services designed and built at Oxford University. Two types of manual have been developed, one of the user of a service, giving an idealized external abstract view, and one for potential implementors, giving more details of the suggested internal structure of the service.\r\n\r\nIn Part III, Chapter 6 details the specification of a text formatting tool designed for using under the UNIX operating system. The structure of UNIX files is discussed in this context. A specification of a mouse-based input system for UNIX workstations is also presented in Chapter 7.\r\n\r\nAlthough Z has mainly been applied to software systems, it is also applicable to hardware. In Part IV, a number of aspects important in the specification of machine instruction sets are discussed. Chapter 8 formally defines some concepts which are useful in the specification of any microprocessor. Building of this, a part of a specific instruction set, namely that of the Transputer, is then presented in Chapter 9.\r\n\r\nPart V details some graphical concepts. Chapter 10 introduces general concepts useful for specifying pixel maps and window systems. Chapter 11 defines the rasterop function which is fundamental to many graphics operations.\r\n\r\nWindow systems are now one of the most popular interfaces for computers. Part VI builds on the ideas presented in Part V and gives details of three window systems, including the highly successful XWindow System. Chapter 15 remarks on experience\r\ngained by formally specifying the three window systems and other case studies.\r\n\r\nAppendix A gives some indications on how to obtain further up-to-date information on Z. A glossary of the Z notation may be found in Appendix B. A literature guide in Appendix C together with a substantial bibliography at the end of the book are included to allow readers to follow up on another aspect of Z and formal methods that are of special interest. Finally an index, particularly of names of definitions in the specifications presented in the book, will aid the reader in navigating the text, especially the formal parts.\r\n\r\nIt is hoped that the specifications presented here will help students and industrial practitioners alike to produce better specifications of their designs, be they large or small. Even if no proofs or refinement of a system are attempted, mere formalization early on in the design process will help to clarify a designer’s thoughts (especially when undertaken as part of a team) and remove many errors before they become implemented,\r\nand therefore much more difficult and expensive to rectify.\r\nFor further on-line information related to this book, held as part of the distributed World Wide Web (WWW) Virtual Library, the reader is referred to the following URL\r\n(Uniform Resource Locator):\r\nhttp://http://formalmethods.wikia.com/zbook\r\n\r\nJ.P.B.\r\nJune 1995","downloadable_attachments":[{"id":1338443,"asset_id":288614,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=450","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"},{"id":45099560,"first_name":"Xiaoping","last_name":"Jia","domain_name":"independent","page_name":"XiaopingJia","display_name":"Xiaoping Jia","profile_url":"https://independent.academia.edu/XiaopingJia?f_ri=450","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":363,"name":"Set Theory","url":"https://www.academia.edu/Documents/in/Set_Theory?f_ri=450","nofollow":false},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=450","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":924,"name":"Logic","url":"https://www.academia.edu/Documents/in/Logic?f_ri=450"},{"id":2725,"name":"Documentation","url":"https://www.academia.edu/Documents/in/Documentation?f_ri=450"},{"id":4702,"name":"Case Study Research","url":"https://www.academia.edu/Documents/in/Case_Study_Research?f_ri=450"},{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=450"},{"id":9967,"name":"Software Engineering education","url":"https://www.academia.edu/Documents/in/Software_Engineering_education?f_ri=450"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=450"},{"id":17442,"name":"Mathematical Logic","url":"https://www.academia.edu/Documents/in/Mathematical_Logic?f_ri=450"},{"id":28530,"name":"Software Quality Engineering","url":"https://www.academia.edu/Documents/in/Software_Quality_Engineering?f_ri=450"},{"id":57987,"name":"Software Quality","url":"https://www.academia.edu/Documents/in/Software_Quality?f_ri=450"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=450"},{"id":103616,"name":"Typed Predicate Logic","url":"https://www.academia.edu/Documents/in/Typed_Predicate_Logic?f_ri=450"},{"id":130836,"name":"Z Notation","url":"https://www.academia.edu/Documents/in/Z_Notation?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_4077419" data-work_id="4077419" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/4077419/%D0%A1%D0%A2%D0%90%D0%A2%D0%98%D0%A1%D0%A2%D0%98%D0%A7%D0%95%D0%A1%D0%9A%D0%98%D0%95_%D0%9C%D0%95%D0%A2%D0%9E%D0%94%D0%AB_%D0%92_%D0%90%D0%A0%D0%A5%D0%95%D0%9E%D0%9B%D0%9E%D0%93%D0%98%D0%A7%D0%95%D0%A1%D0%9A%D0%98%D0%A5_%D0%98%D0%A1%D0%A1%D0%9B%D0%95%D0%94%D0%9E%D0%92%D0%90%D0%9D%D0%98%D0%AF%D0%A5_%D0%98%D0%A1%D0%A2%D0%9E%D0%A0%D0%98%D0%AF_%D0%A0%D0%90%D0%97%D0%92%D0%98%D0%A2%D0%98%D0%AF_%D0%9A%D0%9E%D0%9D%D0%95%D0%A6_XIX_60_E_%D0%93%D0%93_XX_%D0%92_STATISTICAL_METHODS_IN_ARCHAEOLOGICAL_RESEARCHES_DEVELOPMENT_HISTORY_THE_END_OF_THE_XIXTH_THE_60S_OF_THE_XXTH_CENTURY_">СТАТИСТИЧЕСКИЕ МЕТОДЫ В АРХЕОЛОГИЧЕСКИХ ИССЛЕДОВАНИЯХ: ИСТОРИЯ РАЗВИТИЯ (КОНЕЦ XIX – 60-E ГГ. XX В.) (STATISTICAL METHODS IN ARCHAEOLOGICAL RESEARCHES: DEVELOPMENT HISTORY (THE END OF THE XIXTH – THE 60S OF THE XXTH CENTURY))</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">"The author undertakes an attempt to trace the ways of mathematical statistics methods penetration into archeological science in general and in the archeology of Western Ural in particular, aims to write the history of mathematical... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_4077419" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">"The author undertakes an attempt to trace the ways of mathematical statistics methods penetration into archeological science in general and in the archeology of Western Ural in particular, aims to write the history of mathematical methods application in the archeology of Western Ural into the context of global and domestic gnoseological transformations from the beginning of the 70s of the XXth  century till the present day, concludes that the Ural  archeologists’ interest in mathematics is a logical and timely reflection of the all-Russian and international research trends, and tells that the science of Kama region is responsive to all the changes in the country and in the world, making its invaluable contribution to the universal intellectual heritage. <br />DOWNLOAD THE FULL TEXT IN RUSSIAN"</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/4077419" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="bb0d07d713fc0913b3ee8b5cfac3d212" rel="nofollow" data-download="{"attachment_id":31604908,"asset_id":4077419,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31604908/download_file?st=MTczNDAyMzEyMyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4914859" href="https://pspu.academia.edu/DmitriyShmuratko">Dmitriy Shmuratko</a><script data-card-contents-for-user="4914859" type="text/json">{"id":4914859,"first_name":"Dmitriy","last_name":"Shmuratko","domain_name":"pspu","page_name":"DmitriyShmuratko","display_name":"Dmitriy Shmuratko","profile_url":"https://pspu.academia.edu/DmitriyShmuratko?f_ri=450","photo":"https://0.academia-photos.com/4914859/2123893/2738053/s65_dmitriy.shmuratko.jpg"}</script></span></span></li><li class="js-paper-rank-work_4077419 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="4077419"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 4077419, container: ".js-paper-rank-work_4077419", }); });</script></li><li class="js-percentile-work_4077419 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 4077419; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_4077419"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_4077419 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="4077419"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4077419; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4077419]").text(description); $(".js-view-count-work_4077419").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_4077419").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="4077419"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="392" href="https://www.academia.edu/Documents/in/Archaeology">Archaeology</a>, <script data-card-contents-for-ri="392" type="text/json">{"id":392,"name":"Archaeology","url":"https://www.academia.edu/Documents/in/Archaeology?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a>, <script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2065" href="https://www.academia.edu/Documents/in/Research_Methodology">Research Methodology</a>, <script data-card-contents-for-ri="2065" type="text/json">{"id":2065,"name":"Research Methodology","url":"https://www.academia.edu/Documents/in/Research_Methodology?f_ri=450","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3723" href="https://www.academia.edu/Documents/in/History_of_Science">History of Science</a><script data-card-contents-for-ri="3723" type="text/json">{"id":3723,"name":"History of Science","url":"https://www.academia.edu/Documents/in/History_of_Science?f_ri=450","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=4077419]'), work: {"id":4077419,"title":"СТАТИСТИЧЕСКИЕ МЕТОДЫ В АРХЕОЛОГИЧЕСКИХ ИССЛЕДОВАНИЯХ: ИСТОРИЯ РАЗВИТИЯ (КОНЕЦ XIX – 60-E ГГ. XX В.) (STATISTICAL METHODS IN ARCHAEOLOGICAL RESEARCHES: DEVELOPMENT HISTORY (THE END OF THE XIXTH – THE 60S OF THE XXTH CENTURY))","created_at":"2013-07-21T20:00:14.725-07:00","url":"https://www.academia.edu/4077419/%D0%A1%D0%A2%D0%90%D0%A2%D0%98%D0%A1%D0%A2%D0%98%D0%A7%D0%95%D0%A1%D0%9A%D0%98%D0%95_%D0%9C%D0%95%D0%A2%D0%9E%D0%94%D0%AB_%D0%92_%D0%90%D0%A0%D0%A5%D0%95%D0%9E%D0%9B%D0%9E%D0%93%D0%98%D0%A7%D0%95%D0%A1%D0%9A%D0%98%D0%A5_%D0%98%D0%A1%D0%A1%D0%9B%D0%95%D0%94%D0%9E%D0%92%D0%90%D0%9D%D0%98%D0%AF%D0%A5_%D0%98%D0%A1%D0%A2%D0%9E%D0%A0%D0%98%D0%AF_%D0%A0%D0%90%D0%97%D0%92%D0%98%D0%A2%D0%98%D0%AF_%D0%9A%D0%9E%D0%9D%D0%95%D0%A6_XIX_60_E_%D0%93%D0%93_XX_%D0%92_STATISTICAL_METHODS_IN_ARCHAEOLOGICAL_RESEARCHES_DEVELOPMENT_HISTORY_THE_END_OF_THE_XIXTH_THE_60S_OF_THE_XXTH_CENTURY_?f_ri=450","dom_id":"work_4077419","summary":"\"The author undertakes an attempt to trace the ways of mathematical statistics methods penetration into archeological science in general and in the archeology of Western Ural in particular, aims to write the history of mathematical methods application in the archeology of Western Ural into the context of global and domestic gnoseological transformations from the beginning of the 70s of the XXth century till the present day, concludes that the Ural archeologists’ interest in mathematics is a logical and timely reflection of the all-Russian and international research trends, and tells that the science of Kama region is responsive to all the changes in the country and in the world, making its invaluable contribution to the universal intellectual heritage. \r\nDOWNLOAD THE FULL TEXT IN RUSSIAN\"","downloadable_attachments":[{"id":31604908,"asset_id":4077419,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4914859,"first_name":"Dmitriy","last_name":"Shmuratko","domain_name":"pspu","page_name":"DmitriyShmuratko","display_name":"Dmitriy Shmuratko","profile_url":"https://pspu.academia.edu/DmitriyShmuratko?f_ri=450","photo":"https://0.academia-photos.com/4914859/2123893/2738053/s65_dmitriy.shmuratko.jpg"}],"research_interests":[{"id":392,"name":"Archaeology","url":"https://www.academia.edu/Documents/in/Archaeology?f_ri=450","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=450","nofollow":false},{"id":2065,"name":"Research Methodology","url":"https://www.academia.edu/Documents/in/Research_Methodology?f_ri=450","nofollow":false},{"id":3723,"name":"History of Science","url":"https://www.academia.edu/Documents/in/History_of_Science?f_ri=450","nofollow":false},{"id":5346,"name":"Archaeological Method \u0026 Theory","url":"https://www.academia.edu/Documents/in/Archaeological_Method_and_Theory?f_ri=450"},{"id":12620,"name":"Quantitative Methods","url":"https://www.academia.edu/Documents/in/Quantitative_Methods?f_ri=450"},{"id":27926,"name":"Statistical Methods in Archaeology","url":"https://www.academia.edu/Documents/in/Statistical_Methods_in_Archaeology?f_ri=450"},{"id":43884,"name":"History of Archaeology","url":"https://www.academia.edu/Documents/in/History_of_Archaeology?f_ri=450"}]}, }) } })();</script></ul></li></ul></div></div></div><div class="u-taCenter Pagination"><ul class="pagination"><li class="next_page"><a href="/Documents/in/Formal_Methods_Formal_Verification_?after=50%2C4077419" rel="next">Next</a></li><li class="last next"><a href="/Documents/in/Formal_Methods_Formal_Verification_?page=last">Last »</a></li></ul></div></div><div class="hidden-xs hidden-sm"><div class="u-pl6x"><div style="width: 300px;"><div class="panel panel-flat u-mt7x"><div class="panel-heading u-p5x"><div class="u-tcGrayDark u-taCenter u-fw700 u-textUppercase">Related Topics</div></div><ul class="list-group"><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Formal_methods">Formal methods</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="14681">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="14681">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Model_Checking">Model Checking</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="2203">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="2203">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="449">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="449">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="422">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="422">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Verification_Computer_Science_">Verification (Computer Science)</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="13892">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="13892">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Software_Verification_and_Validation">Software Verification and Validation</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="31441">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="31441">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Formal_Semantics">Formal Semantics</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="28991">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="28991">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Programming_Languages">Programming Languages</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="451">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="451">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Program_Semantics">Program Semantics</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="455">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="455">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Software_Testing">Software Testing</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="4761">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="4761">Following</a></div></li></ul></div></div></div></div></div></div><script>// MIT License // Copyright © 2011 Sebastian Tschan, https://blueimp.net // Permission is hereby granted, free of charge, to any person obtaining a copy of // this software and associated documentation files (the "Software"), to deal in // the Software without restriction, including without limitation the rights to // use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of // the Software, and to permit persons to whom the Software is furnished to do so, // subject to the following conditions: // The above copyright notice and this permission notice shall be included in all // copies or substantial portions of the Software. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS // FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR // COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER // IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN // CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. !function(n){"use strict";function d(n,t){var r=(65535&n)+(65535&t);return(n>>16)+(t>>16)+(r>>16)<<16|65535&r}function f(n,t,r,e,o,u){return d((c=d(d(t,n),d(e,u)))<<(f=o)|c>>>32-f,r);var c,f}function l(n,t,r,e,o,u,c){return f(t&r|~t&e,n,t,o,u,c)}function v(n,t,r,e,o,u,c){return f(t&e|r&~e,n,t,o,u,c)}function g(n,t,r,e,o,u,c){return f(t^r^e,n,t,o,u,c)}function m(n,t,r,e,o,u,c){return f(r^(t|~e),n,t,o,u,c)}function i(n,t){var r,e,o,u;n[t>>5]|=128<<t%32,n[14+(t+64>>>9<<4)]=t;for(var c=1732584193,f=-271733879,i=-1732584194,a=271733878,h=0;h<n.length;h+=16)c=l(r=c,e=f,o=i,u=a,n[h],7,-680876936),a=l(a,c,f,i,n[h+1],12,-389564586),i=l(i,a,c,f,n[h+2],17,606105819),f=l(f,i,a,c,n[h+3],22,-1044525330),c=l(c,f,i,a,n[h+4],7,-176418897),a=l(a,c,f,i,n[h+5],12,1200080426),i=l(i,a,c,f,n[h+6],17,-1473231341),f=l(f,i,a,c,n[h+7],22,-45705983),c=l(c,f,i,a,n[h+8],7,1770035416),a=l(a,c,f,i,n[h+9],12,-1958414417),i=l(i,a,c,f,n[h+10],17,-42063),f=l(f,i,a,c,n[h+11],22,-1990404162),c=l(c,f,i,a,n[h+12],7,1804603682),a=l(a,c,f,i,n[h+13],12,-40341101),i=l(i,a,c,f,n[h+14],17,-1502002290),c=v(c,f=l(f,i,a,c,n[h+15],22,1236535329),i,a,n[h+1],5,-165796510),a=v(a,c,f,i,n[h+6],9,-1069501632),i=v(i,a,c,f,n[h+11],14,643717713),f=v(f,i,a,c,n[h],20,-373897302),c=v(c,f,i,a,n[h+5],5,-701558691),a=v(a,c,f,i,n[h+10],9,38016083),i=v(i,a,c,f,n[h+15],14,-660478335),f=v(f,i,a,c,n[h+4],20,-405537848),c=v(c,f,i,a,n[h+9],5,568446438),a=v(a,c,f,i,n[h+14],9,-1019803690),i=v(i,a,c,f,n[h+3],14,-187363961),f=v(f,i,a,c,n[h+8],20,1163531501),c=v(c,f,i,a,n[h+13],5,-1444681467),a=v(a,c,f,i,n[h+2],9,-51403784),i=v(i,a,c,f,n[h+7],14,1735328473),c=g(c,f=v(f,i,a,c,n[h+12],20,-1926607734),i,a,n[h+5],4,-378558),a=g(a,c,f,i,n[h+8],11,-2022574463),i=g(i,a,c,f,n[h+11],16,1839030562),f=g(f,i,a,c,n[h+14],23,-35309556),c=g(c,f,i,a,n[h+1],4,-1530992060),a=g(a,c,f,i,n[h+4],11,1272893353),i=g(i,a,c,f,n[h+7],16,-155497632),f=g(f,i,a,c,n[h+10],23,-1094730640),c=g(c,f,i,a,n[h+13],4,681279174),a=g(a,c,f,i,n[h],11,-358537222),i=g(i,a,c,f,n[h+3],16,-722521979),f=g(f,i,a,c,n[h+6],23,76029189),c=g(c,f,i,a,n[h+9],4,-640364487),a=g(a,c,f,i,n[h+12],11,-421815835),i=g(i,a,c,f,n[h+15],16,530742520),c=m(c,f=g(f,i,a,c,n[h+2],23,-995338651),i,a,n[h],6,-198630844),a=m(a,c,f,i,n[h+7],10,1126891415),i=m(i,a,c,f,n[h+14],15,-1416354905),f=m(f,i,a,c,n[h+5],21,-57434055),c=m(c,f,i,a,n[h+12],6,1700485571),a=m(a,c,f,i,n[h+3],10,-1894986606),i=m(i,a,c,f,n[h+10],15,-1051523),f=m(f,i,a,c,n[h+1],21,-2054922799),c=m(c,f,i,a,n[h+8],6,1873313359),a=m(a,c,f,i,n[h+15],10,-30611744),i=m(i,a,c,f,n[h+6],15,-1560198380),f=m(f,i,a,c,n[h+13],21,1309151649),c=m(c,f,i,a,n[h+4],6,-145523070),a=m(a,c,f,i,n[h+11],10,-1120210379),i=m(i,a,c,f,n[h+2],15,718787259),f=m(f,i,a,c,n[h+9],21,-343485551),c=d(c,r),f=d(f,e),i=d(i,o),a=d(a,u);return[c,f,i,a]}function a(n){for(var t="",r=32*n.length,e=0;e<r;e+=8)t+=String.fromCharCode(n[e>>5]>>>e%32&255);return t}function h(n){var t=[];for(t[(n.length>>2)-1]=void 0,e=0;e<t.length;e+=1)t[e]=0;for(var r=8*n.length,e=0;e<r;e+=8)t[e>>5]|=(255&n.charCodeAt(e/8))<<e%32;return t}function e(n){for(var t,r="0123456789abcdef",e="",o=0;o<n.length;o+=1)t=n.charCodeAt(o),e+=r.charAt(t>>>4&15)+r.charAt(15&t);return e}function r(n){return unescape(encodeURIComponent(n))}function o(n){return a(i(h(t=r(n)),8*t.length));var t}function u(n,t){return function(n,t){var r,e,o=h(n),u=[],c=[];for(u[15]=c[15]=void 0,16<o.length&&(o=i(o,8*n.length)),r=0;r<16;r+=1)u[r]=909522486^o[r],c[r]=1549556828^o[r];return e=i(u.concat(h(t)),512+8*t.length),a(i(c.concat(e),640))}(r(n),r(t))}function t(n,t,r){return t?r?u(t,n):e(u(t,n)):r?o(n):e(o(n))}"function"==typeof define&&define.amd?define(function(){return t}):"object"==typeof module&&module.exports?module.exports=t:n.md5=t}(this);</script><script>window.AbTest = (function() { return { 'ab_test': (uniqueId, test_name, buckets) => { let override = new URLSearchParams(window.location.search).get(`ab_test[${test_name}]`); if ( override ) { return override; } const bucketNames = buckets.map((bucket) => { return typeof bucket === 'string' ? bucket : Object.keys(bucket)[0]; }); const weights = buckets.map((bucket) => { return typeof bucket === 'string' ? 1 : Object.values(bucket)[0]; }); const total = weights.reduce((sum, weight) => sum + weight); const hash = md5(`${uniqueId}${test_name}`); const hashNum = parseInt(hash.slice(-12), 16); let bucketPoint = total * (hashNum % 100000) / 100000; const bucket = bucketNames.find((_, i) => { if (weights[i] > bucketPoint) { return true; } bucketPoint -= weights[i]; return false; }); return bucket; } }; })();</script><div data-auto_select="false" data-client_id="331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b" data-landing_url="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_" data-login_uri="https://www.academia.edu/registrations/google_one_tap" data-moment_callback="onGoogleOneTapEvent" id="g_id_onload"></div><script>function onGoogleOneTapEvent(event) { var momentType = event.getMomentType(); var momentReason = null; if (event.isNotDisplayed()) { momentReason = event.getNotDisplayedReason(); } else if (event.isSkippedMoment()) { momentReason = event.getSkippedReason(); } else if (event.isDismissedMoment()) { momentReason = event.getDismissedReason(); } Aedu.arbitraryEvents.write('GoogleOneTapEvent', { moment_type: momentType, moment_reason: momentReason, }); }</script><script>(function() { var auvid = unescape( document.cookie .split(/; ?/) .find((s) => s.startsWith('auvid')) .substring(6)); var bucket = AbTest.ab_test(auvid, 'lo_ri_one_tap_google_sign_on', ['control', 'one_tap_google_sign_on']); if (bucket === 'control') return; var oneTapTag = document.createElement('script') oneTapTag.async = true oneTapTag.defer = true oneTapTag.src = 'https://accounts.google.com/gsi/client' document.body.appendChild(oneTapTag) })();</script></div></div></div> </div> <div class="bootstrap login"><div class="modal fade login-modal" id="login-modal"><div class="login-modal-dialog modal-dialog"><div class="modal-content"><div class="modal-header"><button class="close close" data-dismiss="modal" type="button"><span aria-hidden="true">×</span><span class="sr-only">Close</span></button><h4 class="modal-title text-center"><strong>Log In</strong></h4></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><button class="btn btn-fb btn-lg btn-block btn-v-center-content" id="login-facebook-oauth-button"><svg style="float: left; width: 19px; line-height: 1em; margin-right: .3em;" aria-hidden="true" focusable="false" data-prefix="fab" data-icon="facebook-square" class="svg-inline--fa fa-facebook-square fa-w-14" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512"><path fill="currentColor" d="M400 32H48A48 48 0 0 0 0 80v352a48 48 0 0 0 48 48h137.25V327.69h-63V256h63v-54.64c0-62.15 37-96.48 93.67-96.48 27.14 0 55.52 4.84 55.52 4.84v61h-31.27c-30.81 0-40.42 19.12-40.42 38.73V256h68.78l-11 71.69h-57.78V480H400a48 48 0 0 0 48-48V80a48 48 0 0 0-48-48z"></path></svg><small><strong>Log in</strong> with <strong>Facebook</strong></small></button><br /><button class="btn btn-google btn-lg btn-block btn-v-center-content" id="login-google-oauth-button"><svg style="float: left; width: 22px; line-height: 1em; margin-right: .3em;" aria-hidden="true" focusable="false" data-prefix="fab" data-icon="google-plus" class="svg-inline--fa fa-google-plus fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M256,8C119.1,8,8,119.1,8,256S119.1,504,256,504,504,392.9,504,256,392.9,8,256,8ZM185.3,380a124,124,0,0,1,0-248c31.3,0,60.1,11,83,32.3l-33.6,32.6c-13.2-12.9-31.3-19.1-49.4-19.1-42.9,0-77.2,35.5-77.2,78.1S142.3,334,185.3,334c32.6,0,64.9-19.1,70.1-53.3H185.3V238.1H302.2a109.2,109.2,0,0,1,1.9,20.7c0,70.8-47.5,121.2-118.8,121.2ZM415.5,273.8v35.5H380V273.8H344.5V238.3H380V202.8h35.5v35.5h35.2v35.5Z"></path></svg><small><strong>Log in</strong> with <strong>Google</strong></small></button><br /><style type="text/css">.sign-in-with-apple-button { width: 100%; height: 52px; border-radius: 3px; border: 1px solid black; cursor: pointer; }</style><script src="https://appleid.cdn-apple.com/appleauth/static/jsapi/appleid/1/en_US/appleid.auth.js" type="text/javascript"></script><div class="sign-in-with-apple-button" data-border="false" data-color="white" id="appleid-signin"><span   ="Sign Up with Apple" class="u-fs11"></span></div><script>AppleID.auth.init({ clientId: 'edu.academia.applesignon', scope: 'name email', redirectURI: 'https://www.academia.edu/sessions', state: "55af1290c21cc36b6869cff2ee3eb6fe62f992fa897df2842558169b2c8dd595", });</script><script>// Hacky way of checking if on fast loswp if (window.loswp == null) { (function() { const Google = window?.Aedu?.Auth?.OauthButton?.Login?.Google; const Facebook = window?.Aedu?.Auth?.OauthButton?.Login?.Facebook; if (Google) { new Google({ el: '#login-google-oauth-button', rememberMeCheckboxId: 'remember_me', track: null }); } if (Facebook) { new Facebook({ el: '#login-facebook-oauth-button', rememberMeCheckboxId: 'remember_me', track: null }); } })(); }</script></div></div></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><div class="hr-heading login-hr-heading"><span class="hr-heading-text">or</span></div></div></div></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><form class="js-login-form" action="https://www.academia.edu/sessions" accept-charset="UTF-8" method="post"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><input type="hidden" name="authenticity_token" value="nVMUaKVf2rA2/y21aanAesABxJ7ztpYC08EHQvC3KcZkrbKKfvNk6YiUV7Xy7RUIW7kooHNCxFatgJFZko6M6g==" autocomplete="off" /><div class="form-group"><label class="control-label" for="login-modal-email-input" style="font-size: 14px;">Email</label><input class="form-control" id="login-modal-email-input" name="login" type="email" /></div><div class="form-group"><label class="control-label" for="login-modal-password-input" style="font-size: 14px;">Password</label><input class="form-control" id="login-modal-password-input" name="password" type="password" /></div><input type="hidden" name="post_login_redirect_url" id="post_login_redirect_url" value="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_" autocomplete="off" /><div class="checkbox"><label><input type="checkbox" name="remember_me" id="remember_me" value="1" checked="checked" /><small style="font-size: 12px; margin-top: 2px; display: inline-block;">Remember me on this computer</small></label></div><br><input type="submit" name="commit" value="Log In" class="btn btn-primary btn-block btn-lg js-login-submit" data-disable-with="Log In" /></br></form><script>typeof window?.Aedu?.recaptchaManagedForm === 'function' && window.Aedu.recaptchaManagedForm( document.querySelector('.js-login-form'), document.querySelector('.js-login-submit') );</script><small style="font-size: 12px;"><br />or <a data-target="#login-modal-reset-password-container" data-toggle="collapse" href="javascript:void(0)">reset password</a></small><div class="collapse" id="login-modal-reset-password-container"><br /><div class="well margin-0x"><form class="js-password-reset-form" action="https://www.academia.edu/reset_password" accept-charset="UTF-8" method="post"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><input type="hidden" name="authenticity_token" value="Fd8W9L+PHMLSGMEmZApzFOT52GsOBTrmA+DwPL/0dRbsIbAWZCOim2xzuyb/TqZmf0E0VY7xaLJ9oWYn3c3QOg==" autocomplete="off" /><p>Enter the email address you signed up with and we'll email you a reset link.</p><div class="form-group"><input class="form-control" name="email" type="email" /></div><script src="https://recaptcha.net/recaptcha/api.js" async defer></script> <script> var invisibleRecaptchaSubmit = function () { var closestForm = function (ele) { var curEle = ele.parentNode; while (curEle.nodeName !== 'FORM' && curEle.nodeName !== 'BODY'){ curEle = curEle.parentNode; } return curEle.nodeName === 'FORM' ? curEle : null }; var eles = document.getElementsByClassName('g-recaptcha'); if (eles.length > 0) { var form = closestForm(eles[0]); if (form) { form.submit(); } } }; </script> <input type="submit" data-sitekey="6Lf3KHUUAAAAACggoMpmGJdQDtiyrjVlvGJ6BbAj" data-callback="invisibleRecaptchaSubmit" class="g-recaptcha btn btn-primary btn-block" value="Email me a link" value=""/> </form></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/collapse-45805421cf446ca5adf7aaa1935b08a3a8d1d9a6cc5d91a62a2a3a00b20b3e6a.js"], function() { // from javascript_helper.rb $("#login-modal-reset-password-container").on("shown.bs.collapse", function() { $(this).find("input[type=email]").focus(); }); }); </script> </div></div></div><div class="modal-footer"><div class="text-center"><small style="font-size: 12px;">Need an account? <a rel="nofollow" href="https://www.academia.edu/signup">Click here to sign up</a></small></div></div></div></div></div></div><script>// If we are on subdomain or non-bootstrapped page, redirect to login page instead of showing modal (function(){ if (typeof $ === 'undefined') return; var host = window.location.hostname; if ((host === $domain || host === "www."+$domain) && (typeof $().modal === 'function')) { $("#nav_log_in").click(function(e) { // Don't follow the link and open the modal e.preventDefault(); $("#login-modal").on('shown.bs.modal', function() { $(this).find("#login-modal-email-input").focus() }).modal('show'); }); } })()</script> <div class="bootstrap" id="footer"><div class="footer-content clearfix text-center padding-top-7x" style="width:100%;"><ul class="footer-links-secondary footer-links-wide list-inline margin-bottom-1x"><li><a href="https://www.academia.edu/about">About</a></li><li><a href="https://www.academia.edu/press">Press</a></li><li><a href="https://www.academia.edu/documents">Papers</a></li><li><a href="https://www.academia.edu/topics">Topics</a></li><li><a href="https://www.academia.edu/journals">Academia.edu Journals</a></li><li><a rel="nofollow" href="https://www.academia.edu/hiring"><svg style="width: 13px; height: 13px;" aria-hidden="true" focusable="false" data-prefix="fas" data-icon="briefcase" class="svg-inline--fa fa-briefcase fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M320 336c0 8.84-7.16 16-16 16h-96c-8.84 0-16-7.16-16-16v-48H0v144c0 25.6 22.4 48 48 48h416c25.6 0 48-22.4 48-48V288H320v48zm144-208h-80V80c0-25.6-22.4-48-48-48H176c-25.6 0-48 22.4-48 48v48H48c-25.6 0-48 22.4-48 48v80h512v-80c0-25.6-22.4-48-48-48zm-144 0H192V96h128v32z"></path></svg> <strong>We're Hiring!</strong></a></li><li><a rel="nofollow" href="https://support.academia.edu/"><svg style="width: 12px; height: 12px;" aria-hidden="true" focusable="false" data-prefix="fas" data-icon="question-circle" class="svg-inline--fa fa-question-circle fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M504 256c0 136.997-111.043 248-248 248S8 392.997 8 256C8 119.083 119.043 8 256 8s248 111.083 248 248zM262.655 90c-54.497 0-89.255 22.957-116.549 63.758-3.536 5.286-2.353 12.415 2.715 16.258l34.699 26.31c5.205 3.947 12.621 3.008 16.665-2.122 17.864-22.658 30.113-35.797 57.303-35.797 20.429 0 45.698 13.148 45.698 32.958 0 14.976-12.363 22.667-32.534 33.976C247.128 238.528 216 254.941 216 296v4c0 6.627 5.373 12 12 12h56c6.627 0 12-5.373 12-12v-1.333c0-28.462 83.186-29.647 83.186-106.667 0-58.002-60.165-102-116.531-102zM256 338c-25.365 0-46 20.635-46 46 0 25.364 20.635 46 46 46s46-20.636 46-46c0-25.365-20.635-46-46-46z"></path></svg> <strong>Help Center</strong></a></li></ul><ul class="footer-links-tertiary list-inline margin-bottom-1x"><li class="small">Find new research papers in:</li><li class="small"><a href="https://www.academia.edu/Documents/in/Physics">Physics</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Chemistry">Chemistry</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Biology">Biology</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Health_Sciences">Health Sciences</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Ecology">Ecology</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Earth_Sciences">Earth Sciences</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Cognitive_Science">Cognitive Science</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Mathematics">Mathematics</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a></li></ul></div></div><div class="DesignSystem" id="credit" style="width:100%;"><ul class="u-pl0x footer-links-legal list-inline"><li><a rel="nofollow" href="https://www.academia.edu/terms">Terms</a></li><li><a rel="nofollow" href="https://www.academia.edu/privacy">Privacy</a></li><li><a rel="nofollow" href="https://www.academia.edu/copyright">Copyright</a></li><li>Academia ©2024</li></ul></div><script> //<![CDATA[ window.detect_gmtoffset = true; window.Academia && window.Academia.set_gmtoffset && Academia.set_gmtoffset('/gmtoffset'); //]]> </script> <div id='overlay_background'></div> <div id='bootstrap-modal-container' class='bootstrap'></div> <div id='ds-modal-container' class='bootstrap DesignSystem'></div> <div id='full-screen-modal'></div> </div> </body> </html>