{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:30:13Z","timestamp":1729618213371,"version":"3.28.0"},"reference-count":43,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1109\/lics.2009.12","type":"proceedings-article","created":{"date-parts":[[2009,9,9]],"date-time":"2009-09-09T15:32:57Z","timestamp":1252510377000},"page":"59-68","source":"Crossref","is-referenced-by-count":5,"title":["Trace Semantics is Fully Abstract"],"prefix":"10.1109","author":[{"given":"Sumit","family":"Nain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","first-page":"993","article-title":"the semantics of a simple language for parallel programming","volume":"74","author":"kahn","year":"1977","journal-title":"Information Processing"},{"key":"35","first-page":"142","article-title":"the joys of bisimulation","author":"stirling","year":"1998","journal-title":"23th Int Symp on MFCS"},{"journal-title":"Algebraic Structure Theory of Sequential Machines","year":"1966","author":"hartmanis","key":"17"},{"journal-title":"Fully Abstract Models of Programming Languages","year":"1988","author":"stoughton","key":"36"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75291"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24611-4_1"},{"key":"15","first-page":"84","article-title":"modalities for model checking: branching time logic strikes back","author":"emerson","year":"1985","journal-title":"Proc 12th ACM Symp on POPL"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51803-7_19"},{"journal-title":"Logic Synthesis and Verification Algorithms","year":"1996","author":"hachtel","key":"16"},{"key":"39","first-page":"1","article-title":"sometimes and not never re-revisited: on branching vs. linear time","author":"vardi","year":"1998","journal-title":"Proc 9th Int'l CONCUR"},{"key":"13","first-page":"169","article-title":"characterizing correctness properties of parallel programs using fixpoints","author":"emerson","year":"1980","journal-title":"Proc 7th ICALP"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/4904.4999"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482830-9\/50019-9"},{"journal-title":"Measure Theory","year":"1994","author":"cohn","key":"11"},{"key":"38","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/LICS.1998.705674","article-title":"linear vs. branching time: a complexitytheoretic perspective","author":"vardi","year":"1998","journal-title":"Proc 13th IEEE Sym on Logic in Computer Science"},{"journal-title":"A Practical Introduction to PSL","year":"2006","author":"eisner","key":"12"},{"journal-title":"Specifying Systems The TLA+ Language and Tools for Hardware and Software Engineers","year":"2002","author":"lamport","key":"21"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/567446.567463"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00056-X"},{"key":"42","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","author":"winskel","year":"1993","journal-title":"The Formal Semantics of Programming Languages"},{"journal-title":"A Practical Guide for SystemVerilog Assertions","year":"2005","author":"vijayaraghavan","key":"41"},{"key":"40","first-page":"1","article-title":"branching vs. linear time: final showdown","author":"vardi","year":"2001","journal-title":"Proc 8th ICTACAS"},{"journal-title":"Bisimulation through probabilistic testing","year":"1991","author":"larsen","key":"22"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45187-7_14"},{"key":"24","first-page":"219","article-title":"an introduction to input\/output automata","volume":"2","author":"lynch","year":"1989","journal-title":"CWI Quarterly"},{"key":"25","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","author":"milner","year":"1980","journal-title":"A Calculus of Communicating Systems"},{"journal-title":"Communication and Concurrency","year":"1989","author":"milner","key":"26"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75596-8_4"},{"key":"28","article-title":"concurrencyand automata on infinite sequences","author":"park","year":"1981","journal-title":"Proc 5th GI Conf on TCS"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0015727"},{"key":"3","first-page":"296","article-title":"the forspec temporal logic: a new temporal property-specification logic","author":"armoni","year":"2002","journal-title":"Proc 8th ICTACAS"},{"key":"2","first-page":"37","article-title":"what are the fundamental structures of concurrency?: we still don't know!","volume":"162","author":"abramsky","year":"2006","journal-title":"Elec Notes in TCS"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6874.001.0001","author":"dill","year":"1989","journal-title":"Trace theory for automatic hierarchical verification of speed independent circuits"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/151646.151649"},{"journal-title":"Measure Theory","year":"1978","author":"halmos","key":"30"},{"key":"7","first-page":"428","article-title":"expressibility results for linear-time and branching-time logics","author":"clarke","year":"1988","journal-title":"Workshop on Linear Time Branching Time Partial Order in Logics and Models for Concurrency"},{"key":"6","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/BF01888216","article-title":"branching vs linear logics yet again","volume":"2","author":"carmo","year":"1990","journal-title":"Formal Aspects of Computing"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(63)90290-0"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(92)90005-V"},{"key":"31","first-page":"130","article-title":"reactive generative, and stratified models of probabilistic processes","volume":"121","author":"smolka","year":"1995","journal-title":"Information and Computation"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01257083"},{"journal-title":"Finite-State Markovian Decision Processes","year":"1970","author":"derman","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90113-0"}],"event":{"name":"2009 24th Annual IEEE Symposium on Logic In Computer Science (LICS)","start":{"date-parts":[[2009,8,11]]},"location":"Los Angeles, California, USA","end":{"date-parts":[[2009,8,14]]}},"container-title":["2009 24th Annual IEEE Symposium on Logic In Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5230546\/5230547\/05230594.pdf?arnumber=5230594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T22:57:07Z","timestamp":1590101827000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5230594\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/lics.2009.12","relation":{},"subject":[],"published":{"date-parts":[[2009,8]]}}}