{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T10:56:23Z","timestamp":1777805783190,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2011,2,14]],"date-time":"2011-02-14T00:00:00Z","timestamp":1297641600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer Security"],"published-print":{"date-parts":[[2011,2,14]]},"abstract":"<jats:p>In this paper we consider the problem of verifying trace-based information flow properties for different classes of system models. We begin by proposing an automata-theoretic technique for model-checking trace-based information flow properties for finite-state systems. We do this by showing that Mantel's Basic Security Predicates (BSPs), which were shown to be the building blocks of most trace-based properties in the literature, can be verified in an automated way for finite-state system models. We also consider the problem for the class of pushdown system models, and show that it is undecidable to check such systems for any of the trace-based information flow properties. Finally we consider a simple trace-based property we call \u201cweak non-inference\u201d and show that it is undecidable even for finite-state systems.<\/jats:p>","DOI":"10.3233\/jcs-2010-0400","type":"journal-article","created":{"date-parts":[[2016,5,18]],"date-time":"2016-05-18T03:41:32Z","timestamp":1463542892000},"page":"101-138","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":9,"title":["Model-checking trace-based information flow properties"],"prefix":"10.1177","volume":"19","author":[{"given":"Deepak","family":"D'Souza","sequence":"first","affiliation":[{"name":"Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India. E-mails: , ,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raveendra","family":"Holla","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India. E-mails: , ,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.R.","family":"Raghavendra","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India. E-mails: , ,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"Sprick","sequence":"additional","affiliation":[{"name":"TU Darmdstadt, Fachbereich Informatik, Darmdstadt, Germany."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2011,2,14]]},"container-title":["Journal of Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-2010-0400","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-2010-0400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:44:20Z","timestamp":1777495460000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JCS-2010-0400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,14]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2,14]]}},"alternative-id":["10.3233\/JCS-2010-0400"],"URL":"https:\/\/doi.org\/10.3233\/jcs-2010-0400","relation":{},"ISSN":["0926-227X","1875-8924"],"issn-type":[{"value":"0926-227X","type":"print"},{"value":"1875-8924","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,14]]}}}