
{"id":82,"date":"2008-02-11T08:01:56","date_gmt":"2008-02-11T15:01:56","guid":{"rendered":"http:\/\/briantroy.com\/blog\/2008\/02\/11\/2007-turing-awards\/"},"modified":"2008-02-11T08:01:56","modified_gmt":"2008-02-11T15:01:56","slug":"2007-turing-awards","status":"publish","type":"post","link":"https:\/\/blogarchive.briantroy.com\/index.php\/2008\/02\/11\/2007-turing-awards\/","title":{"rendered":"2007 Turing Awards"},"content":{"rendered":"<p>This years winners are Edmund M. Clarke, E. Allen Emerson, and Joseph Sifakis.<\/p>\n<p>This years winners are recognized for their work on Model Checking:<\/p>\n<blockquote><p>\n  <span style=\"font-family:'Trebuchet MS';font-style:italic;\">Model Checking is a type of &#8220;formal verification&#8221; that analyzes the logic underlying a design, much as a mathematician uses a proof to determine that a theorem is correct. Far from hit or miss, Model Checking considers every possible state of a hardware or software design and determines if it is consistent with the designer&#8217;s specifications. Clarke and Emerson originated the idea of Model Checking at Harvard in 1981. They developed a theoretical technique for determining whether an abstract model of a hardware or software design satisfies a formal specification, given as a formula in Temporal Logic, a notation for describing possible sequences of events. Moreover, when the system fails the specification, it could identify a counterexample to show the source of the problem. Numerous model checking systems have been implemented, such as<\/span> <a href=\"http:\/\/www.ddj.com\/184410300\"><span style=\"font-family:'Trebuchet MS';font-style:italic;\">Spin<\/span><\/a> <span style=\"font-family:'Trebuchet MS';font-style:italic;\">at Bell Labs.<\/span>\n<\/p><\/blockquote>\n<p><a href=\"http:\/\/www.ddj.com\/206103622\">Full article here&#8230;<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>This years winners are Edmund M. Clarke, E. Allen Emerson, and Joseph Sifakis. This years winners are recognized for their work on Model Checking: Model Checking is a type of &#8220;formal verification&#8221; that analyzes the logic underlying a design, much as a mathematician uses a proof to determine that a theorem is correct. Far from&hellip; <a class=\"more-link\" href=\"https:\/\/blogarchive.briantroy.com\/index.php\/2008\/02\/11\/2007-turing-awards\/\">Continue reading <span class=\"screen-reader-text\">2007 Turing Awards<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[11,30],"tags":[],"_links":{"self":[{"href":"https:\/\/blogarchive.briantroy.com\/index.php\/wp-json\/wp\/v2\/posts\/82"}],"collection":[{"href":"https:\/\/blogarchive.briantroy.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogarchive.briantroy.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogarchive.briantroy.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blogarchive.briantroy.com\/index.php\/wp-json\/wp\/v2\/comments?post=82"}],"version-history":[{"count":0,"href":"https:\/\/blogarchive.briantroy.com\/index.php\/wp-json\/wp\/v2\/posts\/82\/revisions"}],"wp:attachment":[{"href":"https:\/\/blogarchive.briantroy.com\/index.php\/wp-json\/wp\/v2\/media?parent=82"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogarchive.briantroy.com\/index.php\/wp-json\/wp\/v2\/categories?post=82"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogarchive.briantroy.com\/index.php\/wp-json\/wp\/v2\/tags?post=82"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}