var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://raghavendra80.github.io/files/conf.bib\",\"jsonp\":\"1\",\"host\":\"bibbase.org\",\"ssl\":false},\n      data: [{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Robinson\"],\"firstnames\":[\"Peter\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ramesh\"],\"firstnames\":[\"Raghavendra\"],\"suffixes\":[]}],\"booktitle\":\"2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)\",\"title\":\"General Purpose Atomic Crosschain Transactions\",\"year\":\"2021\",\"volume\":\"\",\"number\":\"\",\"pages\":\"1-3\",\"url\":\"\",\"keywords\":\"Protocols;Conferences;Blockchain;Writing;Programming;Cryptocurrency;blockchain;ethereum;cross;transaction;atomic\",\"doi\":\"10.1109/ICBC51069.2021.9461132\",\"bibtex\":\"@INPROCEEDINGS{9461132,\\n  author={Robinson, Peter and Ramesh, Raghavendra},\\n  booktitle={2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)}, \\n  title={General Purpose Atomic Crosschain Transactions}, \\n  year={2021},\\n  volume={},\\n  number={},\\n  pages={1-3},\\n  url={},\\n  keywords={Protocols;Conferences;Blockchain;Writing;Programming;Cryptocurrency;blockchain;ethereum;cross;transaction;atomic},\\n  doi={10.1109/ICBC51069.2021.9461132}}\\n\\n\",\"author_short\":[\"Robinson, P.\",\"Ramesh, R.\"],\"key\":\"9461132\",\"id\":\"9461132\",\"bibbaseid\":\"robinson-ramesh-generalpurposeatomiccrosschaintransactions-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://raghavendra80.github.io/files/conf.bib\"},\"keyword\":[\"Protocols;Conferences;Blockchain;Writing;Programming;Cryptocurrency;blockchain;ethereum;cross;transaction;atomic\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"I.\"],\"propositions\":[],\"lastnames\":[\"Doidge\"],\"suffixes\":[]},{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Ramesh\"],\"suffixes\":[]},{\"firstnames\":[\"N.\"],\"propositions\":[],\"lastnames\":[\"Shrestha\"],\"suffixes\":[]},{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Tobkin\"],\"suffixes\":[]}],\"booktitle\":\"2024 54th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)\",\"title\":\"Moonshot: Optimizing Block Period and Commit Latency in Chain-Based Rotating Leader BFT\",\"year\":\"2024\",\"volume\":\"\",\"issn\":\"\",\"pages\":\"470-482\",\"abstract\":\"Existing chain-based rotating-leader BFT SMR protocols for the partially synchronous network model with constant commit latencies incur block periods of at least $2δ$ (where $δ$ is the message transmission latency). While a protocol with a block period of $δ$ exists under the synchronous model, its commit latency is linear in the size of the system. To close this gap, we present the first chain-based BFT SMR protocols with $δ$ delay between the proposals of consecutive honest leaders and commit latencies of $3δ$. We present three protocols for the partially synchronous model under different notions of optimistic responsiveness, two of which implement pipelining. All of our protocols achieve reorg resilience and two have short view lengths; properties that many existing chain-based BFT SMR protocols lack. We present an evaluation of our protocols in a wide-area network wherein they demonstrate significant increases in throughput and reductions in latency compared to the state-of-the-art, Jolteon. Our results also demonstrate that techniques commonly employed to reduce communication complexity—such as vote-pipelining and the use of designated vote-aggregators—actually reduce practical performance in many settings.\",\"keywords\":\"wide area networks;protocols;throughput;delays;blockchains;proposals;low latency communication\",\"doi\":\"10.1109/DSN58291.2024.00052\",\"url\":\"https://doi.ieeecomputersociety.org/10.1109/DSN58291.2024.00052\",\"publisher\":\"IEEE Computer Society\",\"address\":\"Los Alamitos, CA, USA\",\"month\":\"jun\",\"bibtex\":\"@INPROCEEDINGS {10646973,\\nauthor = {I. Doidge and R. Ramesh and N. Shrestha and J. Tobkin},\\nbooktitle = {2024 54th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)},\\ntitle = {Moonshot: Optimizing Block Period and Commit Latency in Chain-Based Rotating Leader BFT},\\nyear = {2024},\\nvolume = {},\\nissn = {},\\npages = {470-482},\\nabstract = {Existing chain-based rotating-leader BFT SMR protocols for the partially synchronous network model with constant commit latencies incur block periods of at least $2\\\\delta$ (where $\\\\delta$ is the message transmission latency). While a protocol with a block period of $\\\\delta$ exists under the synchronous model, its commit latency is linear in the size of the system. To close this gap, we present the first chain-based BFT SMR protocols with $\\\\delta$ delay between the proposals of consecutive honest leaders and commit latencies of $3\\\\delta$. We present three protocols for the partially synchronous model under different notions of optimistic responsiveness, two of which implement pipelining. All of our protocols achieve reorg resilience and two have short view lengths; properties that many existing chain-based BFT SMR protocols lack. We present an evaluation of our protocols in a wide-area network wherein they demonstrate significant increases in throughput and reductions in latency compared to the state-of-the-art, Jolteon. Our results also demonstrate that techniques commonly employed to reduce communication complexity—such as vote-pipelining and the use of designated vote-aggregators—actually reduce practical performance in many settings.},\\nkeywords = {wide area networks;protocols;throughput;delays;blockchains;proposals;low latency communication},\\ndoi = {10.1109/DSN58291.2024.00052},\\nurl = {https://doi.ieeecomputersociety.org/10.1109/DSN58291.2024.00052},\\npublisher = {IEEE Computer Society},\\naddress = {Los Alamitos, CA, USA},\\nmonth = {jun}\\n}\\n\\n\",\"author_short\":[\"Doidge, I.\",\"Ramesh, R.\",\"Shrestha, N.\",\"Tobkin, J.\"],\"key\":\"10646973\",\"id\":\"10646973\",\"bibbaseid\":\"doidge-ramesh-shrestha-tobkin-moonshotoptimizingblockperiodandcommitlatencyinchainbasedrotatingleaderbft-2024\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.ieeecomputersociety.org/10.1109/DSN58291.2024.00052\"},\"keyword\":[\"wide area networks;protocols;throughput;delays;blockchains;proposals;low latency communication\"],\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Praveen\"],\"firstnames\":[\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ramesh\"],\"firstnames\":[\"Raghavendra\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Doidge\"],\"firstnames\":[\"Isaac\"],\"suffixes\":[]}],\"title\":\"Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol\",\"booktitle\":\"5th International Workshop on Formal Methods for Blockchains (FMBC 2024)\",\"pages\":\"3:1–3:16\",\"series\":\"Open Access Series in Informatics (OASIcs)\",\"isbn\":\"978-3-95977-317-1\",\"issn\":\"2190-6807\",\"year\":\"2024\",\"volume\":\"118\",\"editor\":[{\"propositions\":[],\"lastnames\":[\"Bernardo\"],\"firstnames\":[\"Bruno\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Marmsoler\"],\"firstnames\":[\"Diego\"],\"suffixes\":[]}],\"publisher\":\"Schloss Dagstuhl – Leibniz-Zentrum für Informatik\",\"address\":\"Dagstuhl, Germany\",\"url\":\"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FMBC.2024.3\",\"urn\":\"urn:nbn:de:0030-drops-198688\",\"doi\":\"10.4230/OASIcs.FMBC.2024.3\",\"annote\":\"Keywords: Blockchain consensus, Safety, Formal verification\",\"bibtex\":\"@InProceedings{praveen_et_al:OASIcs.FMBC.2024.3,\\n  author =\\t{Praveen, M. and Ramesh, Raghavendra and Doidge, Isaac},\\n  title =\\t{{Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol}},\\n  booktitle =\\t{5th International Workshop on Formal Methods for Blockchains (FMBC 2024)},\\n  pages =\\t{3:1--3:16},\\n  series =\\t{Open Access Series in Informatics (OASIcs)},\\n  ISBN =\\t{978-3-95977-317-1},\\n  ISSN =\\t{2190-6807},\\n  year =\\t{2024},\\n  volume =\\t{118},\\n  editor =\\t{Bernardo, Bruno and Marmsoler, Diego},\\n  publisher =\\t{Schloss Dagstuhl -- Leibniz-Zentrum f{\\\\\\\"u}r Informatik},\\n  address =\\t{Dagstuhl, Germany},\\n  URL =\\t\\t{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FMBC.2024.3},\\n  URN =\\t\\t{urn:nbn:de:0030-drops-198688},\\n  doi =\\t\\t{10.4230/OASIcs.FMBC.2024.3},\\n  annote =\\t{Keywords: Blockchain consensus, Safety, Formal verification}\\n}\\n\\n\",\"author_short\":[\"Praveen, M.\",\"Ramesh, R.\",\"Doidge, I.\"],\"editor_short\":[\"Bernardo, B.\",\"Marmsoler, D.\"],\"key\":\"praveen_et_al:OASIcs.FMBC.2024.3\",\"id\":\"praveen_et_al:OASIcs.FMBC.2024.3\",\"bibbaseid\":\"praveen-ramesh-doidge-formallyverifyingthesafetyofpipelinedmoonshotconsensusprotocol-2024\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FMBC.2024.3\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Atomic Crosschain Transactions for Ethereum Private Sidechains\",\"journal\":\"Blockchain: Research and Applications\",\"volume\":\"3\",\"number\":\"1\",\"pages\":\"100030\",\"year\":\"2022\",\"issn\":\"2096-7209\",\"doi\":\"https://doi.org/10.1016/j.bcra.2021.100030\",\"url\":\"https://www.sciencedirect.com/science/article/pii/S2096720921000257\",\"author\":[{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Robinson\"],\"suffixes\":[]},{\"firstnames\":[\"Raghavendra\"],\"propositions\":[],\"lastnames\":[\"Ramesh\"],\"suffixes\":[]},{\"firstnames\":[\"Sandra\"],\"propositions\":[],\"lastnames\":[\"Johnson\"],\"suffixes\":[]}],\"keywords\":\"Crosschain, Blockchain, Transaction, Atomic, Ethereum\",\"abstract\":\"The Atomic Crosschain Transaction for Ethereum Private Sidechains protocol allows composable programming across permissioned Ethereum blockchains. It allows for inter-contract and inter-blockchain function calls that are both synchronous and atomic: if one part fails, the whole call tree of function calls is discarded. The protocol is not based on existing techniques such as Hash Time Locked Contracts, relay chains, block header transfer, or trusted intermediaries. It uses (a) threshold signatures to prove values across blockchains, (b) coordination contracts to manage the state of crosschain transactions, and (c) a function call tree commitment scheme to allow users to commit to a call tree and then later check that the correct function calls have been executed. This paper analyses the processing overhead of using this technique compared to using multiple standard non-atomic single blockchain transactions. The additional processing is analysed for four scenarios involving multiple blockchains: a Trade–Finance system, the Hotel–Train problem, a Supply Chain with Provenance, and an Oracle. The protocol is shown to have both safety and liveness properties.\",\"bibtex\":\"@article{ROBINSON2022100030,\\ntitle = {Atomic Crosschain Transactions for Ethereum Private Sidechains},\\njournal = {Blockchain: Research and Applications},\\nvolume = {3},\\nnumber = {1},\\npages = {100030},\\nyear = {2022},\\nissn = {2096-7209},\\ndoi = {https://doi.org/10.1016/j.bcra.2021.100030},\\nurl = {https://www.sciencedirect.com/science/article/pii/S2096720921000257},\\nauthor = {Peter Robinson and Raghavendra Ramesh and Sandra Johnson},\\nkeywords = {Crosschain, Blockchain, Transaction, Atomic, Ethereum},\\nabstract = {The Atomic Crosschain Transaction for Ethereum Private Sidechains protocol allows composable programming across permissioned Ethereum blockchains. It allows for inter-contract and inter-blockchain function calls that are both synchronous and atomic: if one part fails, the whole call tree of function calls is discarded. The protocol is not based on existing techniques such as Hash Time Locked Contracts, relay chains, block header transfer, or trusted intermediaries. It uses (a) threshold signatures to prove values across blockchains, (b) coordination contracts to manage the state of crosschain transactions, and (c) a function call tree commitment scheme to allow users to commit to a call tree and then later check that the correct function calls have been executed. This paper analyses the processing overhead of using this technique compared to using multiple standard non-atomic single blockchain transactions. The additional processing is analysed for four scenarios involving multiple blockchains: a Trade–Finance system, the Hotel–Train problem, a Supply Chain with Provenance, and an Oracle. The protocol is shown to have both safety and liveness properties.}\\n}\\n\\n\",\"author_short\":[\"Robinson, P.\",\"Ramesh, R.\",\"Johnson, S.\"],\"key\":\"ROBINSON2022100030\",\"id\":\"ROBINSON2022100030\",\"bibbaseid\":\"robinson-ramesh-johnson-atomiccrosschaintransactionsforethereumprivatesidechains-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.sciencedirect.com/science/article/pii/S2096720921000257\"},\"keyword\":[\"Crosschain\",\"Blockchain\",\"Transaction\",\"Atomic\",\"Ethereum\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hassanshahi\"],\"firstnames\":[\"Behnaz\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ramesh\"],\"firstnames\":[\"Raghavendra\",\"Kagalavadi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Krishnan\"],\"firstnames\":[\"Padmanabhan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Scholz\"],\"firstnames\":[\"Bernhard\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Lu\"],\"firstnames\":[\"Yi\"],\"suffixes\":[]}],\"title\":\"An efficient tunable selective points-to analysis for large codebases\",\"year\":\"2017\",\"isbn\":\"9781450350723\",\"publisher\":\"Association for Computing Machinery\",\"address\":\"New York, NY, USA\",\"url\":\"https://doi.org/10.1145/3088515.3088519\",\"doi\":\"10.1145/3088515.3088519\",\"abstract\":\"Points-to analysis is a fundamental static program analysis technique for tools including compilers and bug-checkers. Although object-based context sensitivity is known to improve precision of points-to analysis, scaling it for large Java codebases remains a challenge. In this work, we develop a tunable, client-independent, object-sensitive points-to analysis framework where heap cloning is applied selectively. This approach is aimed at large codebases where standard analysis is typically expensive. Our design includes a pre-analysis that determines program points that contribute to the cost of an object-sensitive points-to analysis. A subsequent analysis then determines the context depth for each allocation site. While our framework can run standalone, it is also possible to tune it – the user of the framework can use the knowledge of the codebase being analysed to influence the selection of expensive program points as well as the process to differentiate the required context-depth. Overall, the approach determines where the cloning is beneficial and where the cloning is unlikely to be beneficial. We have implemented our approach using Soufflé (a Datalog compiler) and an extension of the DOOP framework. Our experiments on large programs, including OpenJDK, show that our technique is efficient and precise. For the OpenJDK, our analysis reduces 27% of runtime and 18% of memory usage in comparison with 2O1H points-to analysis for a negligible loss of precision, while for Jython from the DaCapo benchmark suite, the same analysis reduces 91% of runtime for no loss of precision.\",\"booktitle\":\"Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis\",\"pages\":\"13–18\",\"numpages\":\"6\",\"keywords\":\"points-to analysis, selective context-sensitivity\",\"location\":\"Barcelona, Spain\",\"series\":\"SOAP 2017\",\"bibtex\":\"@inproceedings{10.1145/3088515.3088519,\\nauthor = {Hassanshahi, Behnaz and Ramesh, Raghavendra Kagalavadi and Krishnan, Padmanabhan and Scholz, Bernhard and Lu, Yi},\\ntitle = {An efficient tunable selective points-to analysis for large codebases},\\nyear = {2017},\\nisbn = {9781450350723},\\npublisher = {Association for Computing Machinery},\\naddress = {New York, NY, USA},\\nurl = {https://doi.org/10.1145/3088515.3088519},\\ndoi = {10.1145/3088515.3088519},\\nabstract = {Points-to analysis is a fundamental static program analysis technique for tools including compilers and bug-checkers. Although object-based context sensitivity is known to improve precision of points-to analysis, scaling it for large Java codebases remains a challenge.  In this work, we develop a tunable, client-independent, object-sensitive points-to analysis framework where heap cloning is applied selectively. This approach is aimed at large codebases where standard analysis is typically expensive. Our design includes a pre-analysis that determines program points that contribute to the cost of an object-sensitive points-to analysis. A subsequent analysis then determines the context depth for each allocation site. While our framework can run standalone, it is also possible to tune it – the user of the framework can use the knowledge of the codebase being analysed to influence the selection of expensive program points as well as the process to differentiate the required context-depth. Overall, the approach determines where the cloning is beneficial and where the cloning is unlikely to be beneficial.  We have implemented our approach using Souffl\\\\'{e} (a Datalog compiler) and an extension of the DOOP framework. Our experiments on large programs, including OpenJDK, show that our technique is efficient and precise. For the OpenJDK, our analysis reduces 27\\\\% of runtime and 18\\\\% of memory usage in comparison with 2O1H points-to analysis for a negligible loss of precision, while for Jython from the DaCapo benchmark suite, the same analysis reduces 91\\\\% of runtime for no loss of precision.},\\nbooktitle = {Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis},\\npages = {13–18},\\nnumpages = {6},\\nkeywords = {points-to analysis, selective context-sensitivity},\\nlocation = {Barcelona, Spain},\\nseries = {SOAP 2017}\\n}\\n\\n\",\"author_short\":[\"Hassanshahi, B.\",\"Ramesh, R. K.\",\"Krishnan, P.\",\"Scholz, B.\",\"Lu, Y.\"],\"key\":\"10.1145/3088515.3088519\",\"id\":\"10.1145/3088515.3088519\",\"bibbaseid\":\"hassanshahi-ramesh-krishnan-scholz-lu-anefficienttunableselectivepointstoanalysisforlargecodebases-2017\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1145/3088515.3088519\"},\"keyword\":[\"points-to analysis\",\"selective context-sensitivity\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Detecting Unauthorized Information Flows using Points-to Analysis\",\"author\":[{\"firstnames\":[\"Padmanabhan\"],\"propositions\":[],\"lastnames\":[\"Krishnan\"],\"suffixes\":[]},{\"firstnames\":[\"Yi\"],\"propositions\":[],\"lastnames\":[\"Lu\"],\"suffixes\":[]},{\"firstnames\":[\"Kagalavadi\",\"Ramesh\"],\"propositions\":[],\"lastnames\":[\"Raghavendra\"],\"suffixes\":[]}],\"journal\":\"Engineering & Technology Reference\",\"year\":\"2016\",\"publisher\":\"IET Digital Library\",\"doi\":\"10.1049/etr.2015.0141\",\"url\":\"https://digital-library.theiet.org/content/reference/10.1049/etr.2015.0141\",\"bibtex\":\"@article{krishnan2016detecting,\\n  title={Detecting Unauthorized Information Flows using Points-to Analysis},\\n  author={Padmanabhan Krishnan and Yi Lu and Kagalavadi Ramesh Raghavendra},\\n  journal={Engineering \\\\& Technology Reference},\\n  year={2016},\\n  publisher={IET Digital Library},\\n  doi={10.1049/etr.2015.0141},\\n  url={https://digital-library.theiet.org/content/reference/10.1049/etr.2015.0141}\\n}\\n\\n\",\"author_short\":[\"Krishnan, P.\",\"Lu, Y.\",\"Raghavendra, K. R.\"],\"key\":\"krishnan2016detecting\",\"id\":\"krishnan2016detecting\",\"bibbaseid\":\"krishnan-lu-raghavendra-detectingunauthorizedinformationflowsusingpointstoanalysis-2016\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://digital-library.theiet.org/content/reference/10.1049/etr.2015.0141\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Model-Checking Trace-Based Information Flow Properties for Infinite-State Systems\",\"author\":[{\"firstnames\":[\"Deepak\"],\"propositions\":[],\"lastnames\":[\"D'Souza\"],\"suffixes\":[]},{\"firstnames\":[\"Kagalavadi\",\"Ramesh\"],\"propositions\":[],\"lastnames\":[\"Raghavendra\"],\"suffixes\":[]}],\"journal\":\"Journal of Computer Security\",\"volume\":\"19\",\"number\":\"1\",\"pages\":\"101–138\",\"year\":\"2011\",\"publisher\":\"IOS Press\",\"doi\":\"10.3233/JCS-2010-0549\",\"url\":\"https://content.iospress.com/articles/journal-of-computer-security/jcs549\",\"bibtex\":\"@article{dsouza2011model,\\n  title={Model-Checking Trace-Based Information Flow Properties for Infinite-State Systems},\\n  author={Deepak D'Souza and Kagalavadi Ramesh Raghavendra},\\n  journal={Journal of Computer Security},\\n  volume={19},\\n  number={1},\\n  pages={101--138},\\n  year={2011},\\n  publisher={IOS Press},\\n  doi={10.3233/JCS-2010-0549},\\n  url={https://content.iospress.com/articles/journal-of-computer-security/jcs549}\\n}\\n\\n\",\"author_short\":[\"D'Souza, D.\",\"Raghavendra, K. R.\"],\"key\":\"dsouza2011model\",\"id\":\"dsouza2011model\",\"bibbaseid\":\"dsouza-raghavendra-modelcheckingtracebasedinformationflowpropertiesforinfinitestatesystems-2011\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://content.iospress.com/articles/journal-of-computer-security/jcs549\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Baskar\"],\"firstnames\":[\"Anguraj\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Naldurg\"],\"firstnames\":[\"Prasad\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Raghavendra\"],\"firstnames\":[\"K.\",\"R.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Suresh\"],\"firstnames\":[\"S.\",\"P.\"],\"suffixes\":[]}],\"title\":\"Primal Infon Logic: Derivability in Polynomial Time\",\"booktitle\":\"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)\",\"pages\":\"163–174\",\"series\":\"Leibniz International Proceedings in Informatics (LIPIcs)\",\"isbn\":\"978-3-939897-64-4\",\"issn\":\"1868-8969\",\"year\":\"2013\",\"volume\":\"24\",\"editor\":[{\"propositions\":[],\"lastnames\":[\"Seth\"],\"firstnames\":[\"Anil\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Vishnoi\"],\"firstnames\":[\"Nisheeth\",\"K.\"],\"suffixes\":[]}],\"publisher\":\"Schloss Dagstuhl – Leibniz-Zentrum für Informatik\",\"address\":\"Dagstuhl, Germany\",\"url\":\"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.163\",\"urn\":\"urn:nbn:de:0030-drops-43708\",\"doi\":\"10.4230/LIPIcs.FSTTCS.2013.163\",\"annote\":\"Keywords: Authorization logics, Intuitionistic modal logic, Proof theory, Cut elimination, Subformula property\",\"bibtex\":\"@InProceedings{baskar_et_al:LIPIcs.FSTTCS.2013.163,\\n  author =\\t{Baskar, Anguraj and Naldurg, Prasad and Raghavendra, K. R. and Suresh, S. P.},\\n  title =\\t{{Primal Infon Logic: Derivability in Polynomial Time}},\\n  booktitle =\\t{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)},\\n  pages =\\t{163--174},\\n  series =\\t{Leibniz International Proceedings in Informatics (LIPIcs)},\\n  ISBN =\\t{978-3-939897-64-4},\\n  ISSN =\\t{1868-8969},\\n  year =\\t{2013},\\n  volume =\\t{24},\\n  editor =\\t{Seth, Anil and Vishnoi, Nisheeth K.},\\n  publisher =\\t{Schloss Dagstuhl -- Leibniz-Zentrum f{\\\\\\\"u}r Informatik},\\n  address =\\t{Dagstuhl, Germany},\\n  URL =\\t\\t{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.163},\\n  URN =\\t\\t{urn:nbn:de:0030-drops-43708},\\n  doi =\\t\\t{10.4230/LIPIcs.FSTTCS.2013.163},\\n  annote =\\t{Keywords: Authorization logics, Intuitionistic modal logic, Proof theory, Cut elimination, Subformula property}\\n}\\n\\n\",\"author_short\":[\"Baskar, A.\",\"Naldurg, P.\",\"Raghavendra, K. R.\",\"Suresh, S. P.\"],\"editor_short\":[\"Seth, A.\",\"Vishnoi, N. K.\"],\"key\":\"baskar_et_al:LIPIcs.FSTTCS.2013.163\",\"id\":\"baskar_et_al:LIPIcs.FSTTCS.2013.163\",\"bibbaseid\":\"baskar-naldurg-raghavendra-suresh-primalinfonlogicderivabilityinpolynomialtime-2013\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.163\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"D'Souza\"],\"firstnames\":[\"Deepak\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Raghavendra\"],\"firstnames\":[\"K.\",\"R.\"],\"suffixes\":[]}],\"editor\":[{\"propositions\":[],\"lastnames\":[\"Foresti\"],\"firstnames\":[\"Sara\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Yung\"],\"firstnames\":[\"Moti\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Martinelli\"],\"firstnames\":[\"Fabio\"],\"suffixes\":[]}],\"title\":\"Model-Checking Bisimulation-Based Information Flow Properties for Infinite State Systems\",\"booktitle\":\"Computer Security – ESORICS 2012\",\"year\":\"2012\",\"publisher\":\"Springer Berlin Heidelberg\",\"address\":\"Berlin, Heidelberg\",\"pages\":\"591–608\",\"abstract\":\"Bisimulation-based information flow properties were introduced by Focardi and Gorrieri [1] as a way of specifying security properties for transition system models. These properties were shown to be decidable for finite-state systems. In this paper, we study the problem of verifying these properties for some well-known classes of infinite state systems. We show that all the properties are undecidable for each of these classes of systems.\",\"isbn\":\"978-3-642-33167-1\",\"bibtex\":\"@InProceedings{10.1007/978-3-642-33167-1_34,\\nauthor=\\\"D'Souza, Deepak and Raghavendra, K. R.\\\",\\neditor=\\\"Foresti, Sara and Yung, Moti and Martinelli, Fabio\\\",\\ntitle=\\\"Model-Checking Bisimulation-Based Information Flow Properties for Infinite State Systems\\\",\\nbooktitle=\\\"Computer Security -- ESORICS 2012\\\",\\nyear=\\\"2012\\\",\\npublisher=\\\"Springer Berlin Heidelberg\\\",\\naddress=\\\"Berlin, Heidelberg\\\",\\npages=\\\"591--608\\\",\\nabstract=\\\"Bisimulation-based information flow properties were introduced by Focardi and Gorrieri [1] as a way of specifying security properties for transition system models. These properties were shown to be decidable for finite-state systems. In this paper, we study the problem of verifying these properties for some well-known classes of infinite state systems. We show that all the properties are undecidable for each of these classes of systems.\\\",\\nisbn=\\\"978-3-642-33167-1\\\"\\n}\\n\\n\",\"author_short\":[\"D'Souza, D.\",\"Raghavendra, K. R.\"],\"editor_short\":[\"Foresti, S.\",\"Yung, M.\",\"Martinelli, F.\"],\"key\":\"10.1007/978-3-642-33167-1_34\",\"id\":\"10.1007/978-3-642-33167-1_34\",\"bibbaseid\":\"dsouza-raghavendra-modelcheckingbisimulationbasedinformationflowpropertiesforinfinitestatesystems-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Naldurg\"],\"firstnames\":[\"Prasad\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"K.R.\"],\"firstnames\":[\"Raghavendra\"],\"suffixes\":[]}],\"title\":\"SEAL: a logic programming framework for specifying and verifying access control models\",\"year\":\"2011\",\"isbn\":\"9781450306881\",\"publisher\":\"Association for Computing Machinery\",\"address\":\"New York, NY, USA\",\"url\":\"https://doi.org/10.1145/1998441.1998454\",\"doi\":\"10.1145/1998441.1998454\",\"abstract\":\"We present SEAL, a language for specification and analysis of safety properties for label-based access control systems. A SEAL program represents a possibly infinite-state non-deterministic transition system describing the dynamic behavior of entities and their relevant access control operations. The features of our language are derived directly from the need to model new access control features arising from state-of-the art models in Windows 7, Asbestos, HiStar and others. We show that the reachability problem for this class of models is undecidable even for simple SEAL programs, but a bounded model-checking algorithm is able to validate interesting properties and discover relevant attacks.\",\"booktitle\":\"Proceedings of the 16th ACM Symposium on Access Control Models and Technologies\",\"pages\":\"83–92\",\"numpages\":\"10\",\"keywords\":\"logic programs, label-based access, bounded model checking, attacks, access control, Windows 7\",\"location\":\"Innsbruck, Austria\",\"series\":\"SACMAT '11\",\"bibtex\":\"@inproceedings{10.1145/1998441.1998454,\\nauthor = {Naldurg, Prasad and K.R., Raghavendra},\\ntitle = {SEAL: a logic programming framework for specifying and verifying access control models},\\nyear = {2011},\\nisbn = {9781450306881},\\npublisher = {Association for Computing Machinery},\\naddress = {New York, NY, USA},\\nurl = {https://doi.org/10.1145/1998441.1998454},\\ndoi = {10.1145/1998441.1998454},\\nabstract = {We present SEAL, a language for specification and analysis of safety properties for label-based access control systems. A SEAL program represents a possibly infinite-state non-deterministic transition system describing the dynamic behavior of entities and their relevant access control operations. The features of our language are derived directly from the need to model new access control features arising from state-of-the art models in Windows 7, Asbestos, HiStar and others. We show that the reachability problem for this class of models is undecidable even for simple SEAL programs, but a bounded model-checking algorithm is able to validate interesting properties and discover relevant attacks.},\\nbooktitle = {Proceedings of the 16th ACM Symposium on Access Control Models and Technologies},\\npages = {83–92},\\nnumpages = {10},\\nkeywords = {logic programs, label-based access, bounded model checking, attacks, access control, Windows 7},\\nlocation = {Innsbruck, Austria},\\nseries = {SACMAT '11}\\n}\\n\\n\",\"author_short\":[\"Naldurg, P.\",\"K.R., R.\"],\"key\":\"10.1145/1998441.1998454\",\"id\":\"10.1145/1998441.1998454\",\"bibbaseid\":\"naldurg-kr-sealalogicprogrammingframeworkforspecifyingandverifyingaccesscontrolmodels-2011\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1145/1998441.1998454\"},\"keyword\":[\"logic programs\",\"label-based access\",\"bounded model checking\",\"attacks\",\"access control\",\"Windows 7\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Model-Checking Trace-Based Information Flow Properties\",\"author\":[{\"firstnames\":[\"Deepak\"],\"propositions\":[],\"lastnames\":[\"D'Souza\"],\"suffixes\":[]},{\"firstnames\":[\"Raveendra\"],\"propositions\":[],\"lastnames\":[\"Holla\"],\"suffixes\":[]},{\"firstnames\":[\"Kagalavadi\",\"Ramesh\"],\"propositions\":[],\"lastnames\":[\"Raghavendra\"],\"suffixes\":[]},{\"firstnames\":[\"Barbara\"],\"propositions\":[],\"lastnames\":[\"Sprick\"],\"suffixes\":[]}],\"journal\":\"Journal of Computer Security\",\"volume\":\"19\",\"number\":\"1\",\"pages\":\"101–138\",\"year\":\"2011\",\"publisher\":\"IOS Press\",\"doi\":\"10.3233/JCS-2010-0400\",\"url\":\"https://content.iospress.com/articles/journal-of-computer-security/jcs400\",\"bibtex\":\"@article{dsouza2011model,\\n  title={Model-Checking Trace-Based Information Flow Properties},\\n  author={Deepak D'Souza and Raveendra Holla and Kagalavadi Ramesh Raghavendra and Barbara Sprick},\\n  journal={Journal of Computer Security},\\n  volume={19},\\n  number={1},\\n  pages={101--138},\\n  year={2011},\\n  publisher={IOS Press},\\n  doi={10.3233/JCS-2010-0400},\\n  url={https://content.iospress.com/articles/journal-of-computer-security/jcs400}\\n}\\n\\n\",\"author_short\":[\"D'Souza, D.\",\"Holla, R.\",\"Raghavendra, K. R.\",\"Sprick, B.\"],\"key\":\"dsouza2011model-1\",\"id\":\"dsouza2011model-1\",\"bibbaseid\":\"dsouza-holla-raghavendra-sprick-modelcheckingtracebasedinformationflowproperties-2011\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://content.iospress.com/articles/journal-of-computer-security/jcs400\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"D'Souza\"],\"firstnames\":[\"Deepak\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Holla\"],\"firstnames\":[\"Raveendra\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Kulkarni\"],\"firstnames\":[\"Janardhan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ramesh\"],\"firstnames\":[\"Raghavendra\",\"K.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Sprick\"],\"firstnames\":[\"Barbara\"],\"suffixes\":[]}],\"editor\":[{\"propositions\":[],\"lastnames\":[\"Sekar\"],\"firstnames\":[\"R.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Pujari\"],\"firstnames\":[\"Arun\",\"K.\"],\"suffixes\":[]}],\"title\":\"On the Decidability of Model-Checking Information Flow Properties\",\"booktitle\":\"Information Systems Security\",\"year\":\"2008\",\"publisher\":\"Springer Berlin Heidelberg\",\"address\":\"Berlin, Heidelberg\",\"pages\":\"26–40\",\"abstract\":\"Current standard security practices do not provide substantial assurance about information flow security: the end-to-end behavior of a computing system. Noninterference is the basic semantical condition used to account for information flow security. In the literature, there are many definitions of noninterference: Non-inference, Separability and so on. Mantel presented a framework of Basic Security Predicates (BSPs) for characterizing the definitions of noninterference in the literature. Model-checking these BSPs for finite state systems was shown to be decidable in [8]. In this paper, we show that verifying these BSPs for the more expressive system model of pushdown systems is undecidable. We also give an example of a simple security property which is undecidable even for finite-state systems: the property is a weak form of non-inference called WNI, which is not expressible in Mantel's BSP framework.\",\"isbn\":\"978-3-540-89862-7\",\"bibtex\":\"@InProceedings{10.1007/978-3-540-89862-7_2,\\nauthor=\\\"D'Souza, Deepak\\nand Holla, Raveendra\\nand Kulkarni, Janardhan\\nand Ramesh, Raghavendra K.\\nand Sprick, Barbara\\\",\\neditor=\\\"Sekar, R.\\nand Pujari, Arun K.\\\",\\ntitle=\\\"On the Decidability of Model-Checking Information Flow Properties\\\",\\nbooktitle=\\\"Information Systems Security\\\",\\nyear=\\\"2008\\\",\\npublisher=\\\"Springer Berlin Heidelberg\\\",\\naddress=\\\"Berlin, Heidelberg\\\",\\npages=\\\"26--40\\\",\\nabstract=\\\"Current standard security practices do not provide substantial assurance about information flow security: the end-to-end behavior of a computing system. Noninterference is the basic semantical condition used to account for information flow security. In the literature, there are many definitions of noninterference: Non-inference, Separability and so on. Mantel presented a framework of Basic Security Predicates (BSPs) for characterizing the definitions of noninterference in the literature. Model-checking these BSPs for finite state systems was shown to be decidable in [8]. In this paper, we show that verifying these BSPs for the more expressive system model of pushdown systems is undecidable. We also give an example of a simple security property which is undecidable even for finite-state systems: the property is a weak form of non-inference called WNI, which is not expressible in Mantel's BSP framework.\\\",\\nisbn=\\\"978-3-540-89862-7\\\"\\n}\\n\\n\",\"author_short\":[\"D'Souza, D.\",\"Holla, R.\",\"Kulkarni, J.\",\"Ramesh, R. K.\",\"Sprick, B.\"],\"editor_short\":[\"Sekar, R.\",\"Pujari, A. K.\"],\"key\":\"10.1007/978-3-540-89862-7_2\",\"id\":\"10.1007/978-3-540-89862-7_2\",\"bibbaseid\":\"dsouza-holla-kulkarni-ramesh-sprick-onthedecidabilityofmodelcheckinginformationflowproperties-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"An Automata Based Approach for Verifying Information Flow Properties\",\"journal\":\"Electronic Notes in Theoretical Computer Science\",\"volume\":\"135\",\"number\":\"1\",\"pages\":\"39-58\",\"year\":\"2005\",\"note\":\"Proceedings of the Second Workshop on Automated Reasoning for Security Protocol Analysis (ARSPA 2005)\",\"issn\":\"1571-0661\",\"doi\":\"https://doi.org/10.1016/j.entcs.2005.06.005\",\"url\":\"https://www.sciencedirect.com/science/article/pii/S1571066105050516\",\"author\":[{\"firstnames\":[\"Deepak\"],\"propositions\":[],\"lastnames\":[\"D'Souza\"],\"suffixes\":[]},{\"firstnames\":[\"K.R.\"],\"propositions\":[],\"lastnames\":[\"Raghavendra\"],\"suffixes\":[]},{\"firstnames\":[\"Barbara\"],\"propositions\":[],\"lastnames\":[\"Sprick\"],\"suffixes\":[]}],\"keywords\":\"information flow control, verification, finite state systems\",\"abstract\":\"We present an automated verification technique to verify trace based information flow properties for finite state systems. We show that the Basic Security Predicates (BSPs) defined by Mantel in [Mantel, H., Possibilistic Definitions of Security – An Assembly Kit, in: Proceedings of the 13th IEEE Computer Security Foundations Workshop (2000), pp. 185–199], which are shown to be the building blocks of known trace based information flow properties, can be characterised in terms of regularity preserving language theoretic operations. This leads to a decision procedure for checking whether a finite state system satisfies a given BSP. Verification techniques in the literature (e.g. unwinding) are based on the structure of the transition system and are incomplete in some cases. In contrast, our technique is language based and complete for all information flow properties that can be expressed in terms of BSPs.\",\"bibtex\":\"@article{DSOUZA200539,\\ntitle = {An Automata Based Approach for Verifying Information Flow Properties},\\njournal = {Electronic Notes in Theoretical Computer Science},\\nvolume = {135},\\nnumber = {1},\\npages = {39-58},\\nyear = {2005},\\nnote = {Proceedings of the Second Workshop on Automated Reasoning for Security Protocol Analysis (ARSPA 2005)},\\nissn = {1571-0661},\\ndoi = {https://doi.org/10.1016/j.entcs.2005.06.005},\\nurl = {https://www.sciencedirect.com/science/article/pii/S1571066105050516},\\nauthor = {Deepak D'Souza and K.R. Raghavendra and Barbara Sprick},\\nkeywords = {information flow control, verification, finite state systems},\\nabstract = {We present an automated verification technique to verify trace based information flow properties for finite state systems. We show that the Basic Security Predicates (BSPs) defined by Mantel in [Mantel, H., Possibilistic Definitions of Security – An Assembly Kit, in: Proceedings of the 13th IEEE Computer Security Foundations Workshop (2000), pp. 185–199], which are shown to be the building blocks of known trace based information flow properties, can be characterised in terms of regularity preserving language theoretic operations. This leads to a decision procedure for checking whether a finite state system satisfies a given BSP. Verification techniques in the literature (e.g. unwinding) are based on the structure of the transition system and are incomplete in some cases. In contrast, our technique is language based and complete for all information flow properties that can be expressed in terms of BSPs.}\\n}\\n\\n\\n\\n\",\"author_short\":[\"D'Souza, D.\",\"Raghavendra, K.\",\"Sprick, B.\"],\"key\":\"DSOUZA200539\",\"id\":\"DSOUZA200539\",\"bibbaseid\":\"dsouza-raghavendra-sprick-anautomatabasedapproachforverifyinginformationflowproperties-2005\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.sciencedirect.com/science/article/pii/S1571066105050516\"},\"keyword\":[\"information flow control\",\"verification\",\"finite state systems\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"}],\n      metadata: {\"authorlinks\":{}},\n      ownerID: undefined\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"conf.bib\" href=\"data:text/bibtex;base64,@INPROCEEDINGS{9461132,
  author={Robinson, Peter and Ramesh, Raghavendra},
  booktitle={2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)}, 
  title={General Purpose Atomic Crosschain Transactions}, 
  year={2021},
  volume={},
  number={},
  pages={1-3},
  url={},
  keywords={Protocols;Conferences;Blockchain;Writing;Programming;Cryptocurrency;blockchain;ethereum;cross;transaction;atomic},
  doi={10.1109/ICBC51069.2021.9461132}}



@INPROCEEDINGS {10646973,
author = {I. Doidge and R. Ramesh and N. Shrestha and J. Tobkin},
booktitle = {2024 54th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)},
title = {Moonshot: Optimizing Block Period and Commit Latency in Chain-Based Rotating Leader BFT},
year = {2024},
volume = {},
issn = {},
pages = {470-482},
abstract = {Existing chain-based rotating-leader BFT SMR protocols for the partially synchronous network model with constant commit latencies incur block periods of at least $2\delta$ (where $\delta$ is the message transmission latency). While a protocol with a block period of $\delta$ exists under the synchronous model, its commit latency is linear in the size of the system. To close this gap, we present the first chain-based BFT SMR protocols with $\delta$ delay between the proposals of consecutive honest leaders and commit latencies of $3\delta$. We present three protocols for the partially synchronous model under different notions of optimistic responsiveness, two of which implement pipelining. All of our protocols achieve reorg resilience and two have short view lengths; properties that many existing chain-based BFT SMR protocols lack. We present an evaluation of our protocols in a wide-area network wherein they demonstrate significant increases in throughput and reductions in latency compared to the state-of-the-art, Jolteon. Our results also demonstrate that techniques commonly employed to reduce communication complexity—such as vote-pipelining and the use of designated vote-aggregators—actually reduce practical performance in many settings.},
keywords = {wide area networks;protocols;throughput;delays;blockchains;proposals;low latency communication},
doi = {10.1109/DSN58291.2024.00052},
url = {https://doi.ieeecomputersociety.org/10.1109/DSN58291.2024.00052},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
month = {jun}
}



@InProceedings{praveen_et_al:OASIcs.FMBC.2024.3,
  author =	{Praveen, M. and Ramesh, Raghavendra and Doidge, Isaac},
  title =	{{Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol}},
  booktitle =	{5th International Workshop on Formal Methods for Blockchains (FMBC 2024)},
  pages =	{3:1--3:16},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-317-1},
  ISSN =	{2190-6807},
  year =	{2024},
  volume =	{118},
  editor =	{Bernardo, Bruno and Marmsoler, Diego},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FMBC.2024.3},
  URN =		{urn:nbn:de:0030-drops-198688},
  doi =		{10.4230/OASIcs.FMBC.2024.3},
  annote =	{Keywords: Blockchain consensus, Safety, Formal verification}
}



@article{ROBINSON2022100030,
title = {Atomic Crosschain Transactions for Ethereum Private Sidechains},
journal = {Blockchain: Research and Applications},
volume = {3},
number = {1},
pages = {100030},
year = {2022},
issn = {2096-7209},
doi = {https://doi.org/10.1016/j.bcra.2021.100030},
url = {https://www.sciencedirect.com/science/article/pii/S2096720921000257},
author = {Peter Robinson and Raghavendra Ramesh and Sandra Johnson},
keywords = {Crosschain, Blockchain, Transaction, Atomic, Ethereum},
abstract = {The Atomic Crosschain Transaction for Ethereum Private Sidechains protocol allows composable programming across permissioned Ethereum blockchains. It allows for inter-contract and inter-blockchain function calls that are both synchronous and atomic: if one part fails, the whole call tree of function calls is discarded. The protocol is not based on existing techniques such as Hash Time Locked Contracts, relay chains, block header transfer, or trusted intermediaries. It uses (a) threshold signatures to prove values across blockchains, (b) coordination contracts to manage the state of crosschain transactions, and (c) a function call tree commitment scheme to allow users to commit to a call tree and then later check that the correct function calls have been executed. This paper analyses the processing overhead of using this technique compared to using multiple standard non-atomic single blockchain transactions. The additional processing is analysed for four scenarios involving multiple blockchains: a Trade–Finance system, the Hotel–Train problem, a Supply Chain with Provenance, and an Oracle. The protocol is shown to have both safety and liveness properties.}
}



@inproceedings{10.1145/3088515.3088519,
author = {Hassanshahi, Behnaz and Ramesh, Raghavendra Kagalavadi and Krishnan, Padmanabhan and Scholz, Bernhard and Lu, Yi},
title = {An efficient tunable selective points-to analysis for large codebases},
year = {2017},
isbn = {9781450350723},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3088515.3088519},
doi = {10.1145/3088515.3088519},
abstract = {Points-to analysis is a fundamental static program analysis technique for tools including compilers and bug-checkers. Although object-based context sensitivity is known to improve precision of points-to analysis, scaling it for large Java codebases remains a challenge.  In this work, we develop a tunable, client-independent, object-sensitive points-to analysis framework where heap cloning is applied selectively. This approach is aimed at large codebases where standard analysis is typically expensive. Our design includes a pre-analysis that determines program points that contribute to the cost of an object-sensitive points-to analysis. A subsequent analysis then determines the context depth for each allocation site. While our framework can run standalone, it is also possible to tune it – the user of the framework can use the knowledge of the codebase being analysed to influence the selection of expensive program points as well as the process to differentiate the required context-depth. Overall, the approach determines where the cloning is beneficial and where the cloning is unlikely to be beneficial.  We have implemented our approach using Souffl\'{e} (a Datalog compiler) and an extension of the DOOP framework. Our experiments on large programs, including OpenJDK, show that our technique is efficient and precise. For the OpenJDK, our analysis reduces 27\% of runtime and 18\% of memory usage in comparison with 2O1H points-to analysis for a negligible loss of precision, while for Jython from the DaCapo benchmark suite, the same analysis reduces 91\% of runtime for no loss of precision.},
booktitle = {Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis},
pages = {13–18},
numpages = {6},
keywords = {points-to analysis, selective context-sensitivity},
location = {Barcelona, Spain},
series = {SOAP 2017}
}



@article{krishnan2016detecting,
  title={Detecting Unauthorized Information Flows using Points-to Analysis},
  author={Padmanabhan Krishnan and Yi Lu and Kagalavadi Ramesh Raghavendra},
  journal={Engineering \& Technology Reference},
  year={2016},
  publisher={IET Digital Library},
  doi={10.1049/etr.2015.0141},
  url={https://digital-library.theiet.org/content/reference/10.1049/etr.2015.0141}
}



@article{dsouza2011model,
  title={Model-Checking Trace-Based Information Flow Properties for Infinite-State Systems},
  author={Deepak D'Souza and Kagalavadi Ramesh Raghavendra},
  journal={Journal of Computer Security},
  volume={19},
  number={1},
  pages={101--138},
  year={2011},
  publisher={IOS Press},
  doi={10.3233/JCS-2010-0549},
  url={https://content.iospress.com/articles/journal-of-computer-security/jcs549}
}



@InProceedings{baskar_et_al:LIPIcs.FSTTCS.2013.163,
  author =	{Baskar, Anguraj and Naldurg, Prasad and Raghavendra, K. R. and Suresh, S. P.},
  title =	{{Primal Infon Logic: Derivability in Polynomial Time}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)},
  pages =	{163--174},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-64-4},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{24},
  editor =	{Seth, Anil and Vishnoi, Nisheeth K.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.163},
  URN =		{urn:nbn:de:0030-drops-43708},
  doi =		{10.4230/LIPIcs.FSTTCS.2013.163},
  annote =	{Keywords: Authorization logics, Intuitionistic modal logic, Proof theory, Cut elimination, Subformula property}
}



@InProceedings{10.1007/978-3-642-33167-1_34,
author="D'Souza, Deepak and Raghavendra, K. R.",
editor="Foresti, Sara and Yung, Moti and Martinelli, Fabio",
title="Model-Checking Bisimulation-Based Information Flow Properties for Infinite State Systems",
booktitle="Computer Security -- ESORICS 2012",
year="2012",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="591--608",
abstract="Bisimulation-based information flow properties were introduced by Focardi and Gorrieri [1] as a way of specifying security properties for transition system models. These properties were shown to be decidable for finite-state systems. In this paper, we study the problem of verifying these properties for some well-known classes of infinite state systems. We show that all the properties are undecidable for each of these classes of systems.",
isbn="978-3-642-33167-1"
}



@inproceedings{10.1145/1998441.1998454,
author = {Naldurg, Prasad and K.R., Raghavendra},
title = {SEAL: a logic programming framework for specifying and verifying access control models},
year = {2011},
isbn = {9781450306881},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1998441.1998454},
doi = {10.1145/1998441.1998454},
abstract = {We present SEAL, a language for specification and analysis of safety properties for label-based access control systems. A SEAL program represents a possibly infinite-state non-deterministic transition system describing the dynamic behavior of entities and their relevant access control operations. The features of our language are derived directly from the need to model new access control features arising from state-of-the art models in Windows 7, Asbestos, HiStar and others. We show that the reachability problem for this class of models is undecidable even for simple SEAL programs, but a bounded model-checking algorithm is able to validate interesting properties and discover relevant attacks.},
booktitle = {Proceedings of the 16th ACM Symposium on Access Control Models and Technologies},
pages = {83–92},
numpages = {10},
keywords = {logic programs, label-based access, bounded model checking, attacks, access control, Windows 7},
location = {Innsbruck, Austria},
series = {SACMAT '11}
}



@article{dsouza2011model,
  title={Model-Checking Trace-Based Information Flow Properties},
  author={Deepak D'Souza and Raveendra Holla and Kagalavadi Ramesh Raghavendra and Barbara Sprick},
  journal={Journal of Computer Security},
  volume={19},
  number={1},
  pages={101--138},
  year={2011},
  publisher={IOS Press},
  doi={10.3233/JCS-2010-0400},
  url={https://content.iospress.com/articles/journal-of-computer-security/jcs400}
}



@InProceedings{10.1007/978-3-540-89862-7_2,
author="D'Souza, Deepak
and Holla, Raveendra
and Kulkarni, Janardhan
and Ramesh, Raghavendra K.
and Sprick, Barbara",
editor="Sekar, R.
and Pujari, Arun K.",
title="On the Decidability of Model-Checking Information Flow Properties",
booktitle="Information Systems Security",
year="2008",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="26--40",
abstract="Current standard security practices do not provide substantial assurance about information flow security: the end-to-end behavior of a computing system. Noninterference is the basic semantical condition used to account for information flow security. In the literature, there are many definitions of noninterference: Non-inference, Separability and so on. Mantel presented a framework of Basic Security Predicates (BSPs) for characterizing the definitions of noninterference in the literature. Model-checking these BSPs for finite state systems was shown to be decidable in [8]. In this paper, we show that verifying these BSPs for the more expressive system model of pushdown systems is undecidable. We also give an example of a simple security property which is undecidable even for finite-state systems: the property is a weak form of non-inference called WNI, which is not expressible in Mantel's BSP framework.",
isbn="978-3-540-89862-7"
}



@article{DSOUZA200539,
title = {An Automata Based Approach for Verifying Information Flow Properties},
journal = {Electronic Notes in Theoretical Computer Science},
volume = {135},
number = {1},
pages = {39-58},
year = {2005},
note = {Proceedings of the Second Workshop on Automated Reasoning for Security Protocol Analysis (ARSPA 2005)},
issn = {1571-0661},
doi = {https://doi.org/10.1016/j.entcs.2005.06.005},
url = {https://www.sciencedirect.com/science/article/pii/S1571066105050516},
author = {Deepak D'Souza and K.R. Raghavendra and Barbara Sprick},
keywords = {information flow control, verification, finite state systems},
abstract = {We present an automated verification technique to verify trace based information flow properties for finite state systems. We show that the Basic Security Predicates (BSPs) defined by Mantel in [Mantel, H., Possibilistic Definitions of Security – An Assembly Kit, in: Proceedings of the 13th IEEE Computer Security Foundations Workshop (2000), pp. 185–199], which are shown to be the building blocks of known trace based information flow properties, can be characterised in terms of regularity preserving language theoretic operations. This leads to a decision procedure for checking whether a finite state system satisfies a given BSP. Verification techniques in the literature (e.g. unwinding) are based on the structure of the transition system and are incomplete in some cases. In contrast, our technique is language based and complete for all information flow properties that can be expressed in terms of BSPs.}
}



\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://raghavendra80.github.io/files/conf.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://raghavendra80.github.io/files/conf.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fraghavendra80.github.io%2Ffiles%2Fconf.bib&amp;jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fraghavendra80.github.io%2Ffiles%2Fconf.bib&amp;jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fraghavendra80.github.io%2Ffiles%2Fconf.bib&amp;jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2024\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2024')\"\n      onkeypress=\"toggleGroup('group_2024')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2024</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"doidge-ramesh-shrestha-tobkin-moonshotoptimizingblockperiodandcommitlatencyinchainbasedrotatingleaderbft-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.ieeecomputersociety.org/10.1109/DSN58291.2024.00052\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'doidge-ramesh-shrestha-tobkin-moonshotoptimizingblockperiodandcommitlatencyinchainbasedrotatingleaderbft-2024', 'https://doi.ieeecomputersociety.org/10.1109/DSN58291.2024.00052', event);\">\n    Moonshot: Optimizing Block Period and Commit Latency in Chain-Based Rotating Leader BFT.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Doidge, I.; Ramesh, R.; Shrestha, N.;  and Tobkin, J.\n</span>\n\n  \n\n</span>\n\n  In <i>2024 54th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)</i>, pages 470-482, Los Alamitos, CA, USA, jun 2024. IEEE Computer Society\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.ieeecomputersociety.org/10.1109/DSN58291.2024.00052\"\n     onclick=\"log_download('doidge-ramesh-shrestha-tobkin-moonshotoptimizingblockperiodandcommitlatencyinchainbasedrotatingleaderbft-2024', 'https://doi.ieeecomputersociety.org/10.1109/DSN58291.2024.00052', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Moonshot: Optimizing Block Period and Commit Latency in Chain-Based Rotating Leader BFT [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/DSN58291.2024.00052\"\n     onclick=\"log_download('doidge-ramesh-shrestha-tobkin-moonshotoptimizingblockperiodandcommitlatencyinchainbasedrotatingleaderbft-2024', 'http://doi.org/10.1109/DSN58291.2024.00052', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/doidge-ramesh-shrestha-tobkin-moonshotoptimizingblockperiodandcommitlatencyinchainbasedrotatingleaderbft-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('doidge-ramesh-shrestha-tobkin-moonshotoptimizingblockperiodandcommitlatencyinchainbasedrotatingleaderbft-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS {10646973,\nauthor = {I. Doidge and R. Ramesh and N. Shrestha and J. Tobkin},\nbooktitle = {2024 54th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)},\ntitle = {Moonshot: Optimizing Block Period and Commit Latency in Chain-Based Rotating Leader BFT},\nyear = {2024},\nvolume = {},\nissn = {},\npages = {470-482},\nabstract = {Existing chain-based rotating-leader BFT SMR protocols for the partially synchronous network model with constant commit latencies incur block periods of at least $2\\delta$ (where $\\delta$ is the message transmission latency). While a protocol with a block period of $\\delta$ exists under the synchronous model, its commit latency is linear in the size of the system. To close this gap, we present the first chain-based BFT SMR protocols with $\\delta$ delay between the proposals of consecutive honest leaders and commit latencies of $3\\delta$. We present three protocols for the partially synchronous model under different notions of optimistic responsiveness, two of which implement pipelining. All of our protocols achieve reorg resilience and two have short view lengths; properties that many existing chain-based BFT SMR protocols lack. We present an evaluation of our protocols in a wide-area network wherein they demonstrate significant increases in throughput and reductions in latency compared to the state-of-the-art, Jolteon. Our results also demonstrate that techniques commonly employed to reduce communication complexity—such as vote-pipelining and the use of designated vote-aggregators—actually reduce practical performance in many settings.},\nkeywords = {wide area networks;protocols;throughput;delays;blockchains;proposals;low latency communication},\ndoi = {10.1109/DSN58291.2024.00052},\nurl = {https://doi.ieeecomputersociety.org/10.1109/DSN58291.2024.00052},\npublisher = {IEEE Computer Society},\naddress = {Los Alamitos, CA, USA},\nmonth = {jun}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Existing chain-based rotating-leader BFT SMR protocols for the partially synchronous network model with constant commit latencies incur block periods of at least $2δ$ (where $δ$ is the message transmission latency). While a protocol with a block period of $δ$ exists under the synchronous model, its commit latency is linear in the size of the system. To close this gap, we present the first chain-based BFT SMR protocols with $δ$ delay between the proposals of consecutive honest leaders and commit latencies of $3δ$. We present three protocols for the partially synchronous model under different notions of optimistic responsiveness, two of which implement pipelining. All of our protocols achieve reorg resilience and two have short view lengths; properties that many existing chain-based BFT SMR protocols lack. We present an evaluation of our protocols in a wide-area network wherein they demonstrate significant increases in throughput and reductions in latency compared to the state-of-the-art, Jolteon. Our results also demonstrate that techniques commonly employed to reduce communication complexity—such as vote-pipelining and the use of designated vote-aggregators—actually reduce practical performance in many settings.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"praveen-ramesh-doidge-formallyverifyingthesafetyofpipelinedmoonshotconsensusprotocol-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FMBC.2024.3\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'praveen-ramesh-doidge-formallyverifyingthesafetyofpipelinedmoonshotconsensusprotocol-2024', 'https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FMBC.2024.3', event);\">\n    Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Praveen, M.; Ramesh, R.;  and Doidge, I.\n</span>\n\n  \n\n</span>\n\n  In Bernardo, B.;  and Marmsoler, D., editor(s), <i>5th International Workshop on Formal Methods for Blockchains (FMBC 2024)</i>, volume 118, of <i>Open Access Series in Informatics (OASIcs)</i>, pages 3:1–3:16, Dagstuhl, Germany,  2024. Schloss Dagstuhl – Leibniz-Zentrum für Informatik\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FMBC.2024.3\"\n     onclick=\"log_download('praveen-ramesh-doidge-formallyverifyingthesafetyofpipelinedmoonshotconsensusprotocol-2024', 'https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FMBC.2024.3', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.4230/OASIcs.FMBC.2024.3\"\n     onclick=\"log_download('praveen-ramesh-doidge-formallyverifyingthesafetyofpipelinedmoonshotconsensusprotocol-2024', 'http://doi.org/10.4230/OASIcs.FMBC.2024.3', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/praveen-ramesh-doidge-formallyverifyingthesafetyofpipelinedmoonshotconsensusprotocol-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('praveen-ramesh-doidge-formallyverifyingthesafetyofpipelinedmoonshotconsensusprotocol-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{praveen_et_al:OASIcs.FMBC.2024.3,\n  author =\t{Praveen, M. and Ramesh, Raghavendra and Doidge, Isaac},\n  title =\t{{Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol}},\n  booktitle =\t{5th International Workshop on Formal Methods for Blockchains (FMBC 2024)},\n  pages =\t{3:1--3:16},\n  series =\t{Open Access Series in Informatics (OASIcs)},\n  ISBN =\t{978-3-95977-317-1},\n  ISSN =\t{2190-6807},\n  year =\t{2024},\n  volume =\t{118},\n  editor =\t{Bernardo, Bruno and Marmsoler, Diego},\n  publisher =\t{Schloss Dagstuhl -- Leibniz-Zentrum f{\\&quot;u}r Informatik},\n  address =\t{Dagstuhl, Germany},\n  URL =\t\t{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FMBC.2024.3},\n  URN =\t\t{urn:nbn:de:0030-drops-198688},\n  doi =\t\t{10.4230/OASIcs.FMBC.2024.3},\n  annote =\t{Keywords: Blockchain consensus, Safety, Formal verification}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2022\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2022')\"\n      onkeypress=\"toggleGroup('group_2022')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2022</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"robinson-ramesh-johnson-atomiccrosschaintransactionsforethereumprivatesidechains-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S2096720921000257\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'robinson-ramesh-johnson-atomiccrosschaintransactionsforethereumprivatesidechains-2022', 'https://www.sciencedirect.com/science/article/pii/S2096720921000257', event);\">\n    Atomic Crosschain Transactions for Ethereum Private Sidechains.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Robinson, P.; Ramesh, R.;  and Johnson, S.\n</span>\n\n  \n\n</span>\n\n  <i>Blockchain: Research and Applications</i>, 3(1): 100030.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S2096720921000257\"\n     onclick=\"log_download('robinson-ramesh-johnson-atomiccrosschaintransactionsforethereumprivatesidechains-2022', 'https://www.sciencedirect.com/science/article/pii/S2096720921000257', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Atomic Crosschain Transactions for Ethereum Private Sidechains [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/https://doi.org/10.1016/j.bcra.2021.100030\"\n     onclick=\"log_download('robinson-ramesh-johnson-atomiccrosschaintransactionsforethereumprivatesidechains-2022', 'http://doi.org/https://doi.org/10.1016/j.bcra.2021.100030', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/robinson-ramesh-johnson-atomiccrosschaintransactionsforethereumprivatesidechains-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('robinson-ramesh-johnson-atomiccrosschaintransactionsforethereumprivatesidechains-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ROBINSON2022100030,\ntitle = {Atomic Crosschain Transactions for Ethereum Private Sidechains},\njournal = {Blockchain: Research and Applications},\nvolume = {3},\nnumber = {1},\npages = {100030},\nyear = {2022},\nissn = {2096-7209},\ndoi = {https://doi.org/10.1016/j.bcra.2021.100030},\nurl = {https://www.sciencedirect.com/science/article/pii/S2096720921000257},\nauthor = {Peter Robinson and Raghavendra Ramesh and Sandra Johnson},\nkeywords = {Crosschain, Blockchain, Transaction, Atomic, Ethereum},\nabstract = {The Atomic Crosschain Transaction for Ethereum Private Sidechains protocol allows composable programming across permissioned Ethereum blockchains. It allows for inter-contract and inter-blockchain function calls that are both synchronous and atomic: if one part fails, the whole call tree of function calls is discarded. The protocol is not based on existing techniques such as Hash Time Locked Contracts, relay chains, block header transfer, or trusted intermediaries. It uses (a) threshold signatures to prove values across blockchains, (b) coordination contracts to manage the state of crosschain transactions, and (c) a function call tree commitment scheme to allow users to commit to a call tree and then later check that the correct function calls have been executed. This paper analyses the processing overhead of using this technique compared to using multiple standard non-atomic single blockchain transactions. The additional processing is analysed for four scenarios involving multiple blockchains: a Trade–Finance system, the Hotel–Train problem, a Supply Chain with Provenance, and an Oracle. The protocol is shown to have both safety and liveness properties.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The Atomic Crosschain Transaction for Ethereum Private Sidechains protocol allows composable programming across permissioned Ethereum blockchains. It allows for inter-contract and inter-blockchain function calls that are both synchronous and atomic: if one part fails, the whole call tree of function calls is discarded. The protocol is not based on existing techniques such as Hash Time Locked Contracts, relay chains, block header transfer, or trusted intermediaries. It uses (a) threshold signatures to prove values across blockchains, (b) coordination contracts to manage the state of crosschain transactions, and (c) a function call tree commitment scheme to allow users to commit to a call tree and then later check that the correct function calls have been executed. This paper analyses the processing overhead of using this technique compared to using multiple standard non-atomic single blockchain transactions. The additional processing is analysed for four scenarios involving multiple blockchains: a Trade–Finance system, the Hotel–Train problem, a Supply Chain with Provenance, and an Oracle. The protocol is shown to have both safety and liveness properties.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2021\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2021')\"\n      onkeypress=\"toggleGroup('group_2021')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2021</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"robinson-ramesh-generalpurposeatomiccrosschaintransactions-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://raghavendra80.github.io/files/conf.bib\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'robinson-ramesh-generalpurposeatomiccrosschaintransactions-2021', 'https://raghavendra80.github.io/files/conf.bib', event);\">\n    General Purpose Atomic Crosschain Transactions.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Robinson, P.;  and Ramesh, R.\n</span>\n\n  \n\n</span>\n\n  In <i>2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)</i>, pages 1-3,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://raghavendra80.github.io/files/conf.bib\"\n     onclick=\"log_download('robinson-ramesh-generalpurposeatomiccrosschaintransactions-2021', 'https://raghavendra80.github.io/files/conf.bib', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"General Purpose Atomic Crosschain Transactions [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ICBC51069.2021.9461132\"\n     onclick=\"log_download('robinson-ramesh-generalpurposeatomiccrosschaintransactions-2021', 'http://doi.org/10.1109/ICBC51069.2021.9461132', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/robinson-ramesh-generalpurposeatomiccrosschaintransactions-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('robinson-ramesh-generalpurposeatomiccrosschaintransactions-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{9461132,\n  author={Robinson, Peter and Ramesh, Raghavendra},\n  booktitle={2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)}, \n  title={General Purpose Atomic Crosschain Transactions}, \n  year={2021},\n  volume={},\n  number={},\n  pages={1-3},\n  url={},\n  keywords={Protocols;Conferences;Blockchain;Writing;Programming;Cryptocurrency;blockchain;ethereum;cross;transaction;atomic},\n  doi={10.1109/ICBC51069.2021.9461132}}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2017\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2017')\"\n      onkeypress=\"toggleGroup('group_2017')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2017</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hassanshahi-ramesh-krishnan-scholz-lu-anefficienttunableselectivepointstoanalysisforlargecodebases-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1145/3088515.3088519\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hassanshahi-ramesh-krishnan-scholz-lu-anefficienttunableselectivepointstoanalysisforlargecodebases-2017', 'https://doi.org/10.1145/3088515.3088519', event);\">\n    An efficient tunable selective points-to analysis for large codebases.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Hassanshahi, B.; Ramesh, R. K.; Krishnan, P.; Scholz, B.;  and Lu, Y.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis</i>, of <i>SOAP 2017</i>, pages 13–18, New York, NY, USA,  2017. Association for Computing Machinery\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1145/3088515.3088519\"\n     onclick=\"log_download('hassanshahi-ramesh-krishnan-scholz-lu-anefficienttunableselectivepointstoanalysisforlargecodebases-2017', 'https://doi.org/10.1145/3088515.3088519', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"An efficient tunable selective points-to analysis for large codebases [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1145/3088515.3088519\"\n     onclick=\"log_download('hassanshahi-ramesh-krishnan-scholz-lu-anefficienttunableselectivepointstoanalysisforlargecodebases-2017', 'http://doi.org/10.1145/3088515.3088519', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hassanshahi-ramesh-krishnan-scholz-lu-anefficienttunableselectivepointstoanalysisforlargecodebases-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hassanshahi-ramesh-krishnan-scholz-lu-anefficienttunableselectivepointstoanalysisforlargecodebases-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{10.1145/3088515.3088519,\nauthor = {Hassanshahi, Behnaz and Ramesh, Raghavendra Kagalavadi and Krishnan, Padmanabhan and Scholz, Bernhard and Lu, Yi},\ntitle = {An efficient tunable selective points-to analysis for large codebases},\nyear = {2017},\nisbn = {9781450350723},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https://doi.org/10.1145/3088515.3088519},\ndoi = {10.1145/3088515.3088519},\nabstract = {Points-to analysis is a fundamental static program analysis technique for tools including compilers and bug-checkers. Although object-based context sensitivity is known to improve precision of points-to analysis, scaling it for large Java codebases remains a challenge.  In this work, we develop a tunable, client-independent, object-sensitive points-to analysis framework where heap cloning is applied selectively. This approach is aimed at large codebases where standard analysis is typically expensive. Our design includes a pre-analysis that determines program points that contribute to the cost of an object-sensitive points-to analysis. A subsequent analysis then determines the context depth for each allocation site. While our framework can run standalone, it is also possible to tune it – the user of the framework can use the knowledge of the codebase being analysed to influence the selection of expensive program points as well as the process to differentiate the required context-depth. Overall, the approach determines where the cloning is beneficial and where the cloning is unlikely to be beneficial.  We have implemented our approach using Souffl\\&#x27;{e} (a Datalog compiler) and an extension of the DOOP framework. Our experiments on large programs, including OpenJDK, show that our technique is efficient and precise. For the OpenJDK, our analysis reduces 27\\% of runtime and 18\\% of memory usage in comparison with 2O1H points-to analysis for a negligible loss of precision, while for Jython from the DaCapo benchmark suite, the same analysis reduces 91\\% of runtime for no loss of precision.},\nbooktitle = {Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis},\npages = {13–18},\nnumpages = {6},\nkeywords = {points-to analysis, selective context-sensitivity},\nlocation = {Barcelona, Spain},\nseries = {SOAP 2017}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Points-to analysis is a fundamental static program analysis technique for tools including compilers and bug-checkers. Although object-based context sensitivity is known to improve precision of points-to analysis, scaling it for large Java codebases remains a challenge. In this work, we develop a tunable, client-independent, object-sensitive points-to analysis framework where heap cloning is applied selectively. This approach is aimed at large codebases where standard analysis is typically expensive. Our design includes a pre-analysis that determines program points that contribute to the cost of an object-sensitive points-to analysis. A subsequent analysis then determines the context depth for each allocation site. While our framework can run standalone, it is also possible to tune it – the user of the framework can use the knowledge of the codebase being analysed to influence the selection of expensive program points as well as the process to differentiate the required context-depth. Overall, the approach determines where the cloning is beneficial and where the cloning is unlikely to be beneficial. We have implemented our approach using Soufflé (a Datalog compiler) and an extension of the DOOP framework. Our experiments on large programs, including OpenJDK, show that our technique is efficient and precise. For the OpenJDK, our analysis reduces 27% of runtime and 18% of memory usage in comparison with 2O1H points-to analysis for a negligible loss of precision, while for Jython from the DaCapo benchmark suite, the same analysis reduces 91% of runtime for no loss of precision.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2016\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2016')\"\n      onkeypress=\"toggleGroup('group_2016')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2016</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"krishnan-lu-raghavendra-detectingunauthorizedinformationflowsusingpointstoanalysis-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://digital-library.theiet.org/content/reference/10.1049/etr.2015.0141\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'krishnan-lu-raghavendra-detectingunauthorizedinformationflowsusingpointstoanalysis-2016', 'https://digital-library.theiet.org/content/reference/10.1049/etr.2015.0141', event);\">\n    Detecting Unauthorized Information Flows using Points-to Analysis.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Krishnan, P.; Lu, Y.;  and Raghavendra, K. R.\n</span>\n\n  \n\n</span>\n\n  <i>Engineering & Technology Reference</i>.  2016.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://digital-library.theiet.org/content/reference/10.1049/etr.2015.0141\"\n     onclick=\"log_download('krishnan-lu-raghavendra-detectingunauthorizedinformationflowsusingpointstoanalysis-2016', 'https://digital-library.theiet.org/content/reference/10.1049/etr.2015.0141', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Detecting Unauthorized Information Flows using Points-to Analysis [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1049/etr.2015.0141\"\n     onclick=\"log_download('krishnan-lu-raghavendra-detectingunauthorizedinformationflowsusingpointstoanalysis-2016', 'http://doi.org/10.1049/etr.2015.0141', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/krishnan-lu-raghavendra-detectingunauthorizedinformationflowsusingpointstoanalysis-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('krishnan-lu-raghavendra-detectingunauthorizedinformationflowsusingpointstoanalysis-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{krishnan2016detecting,\n  title={Detecting Unauthorized Information Flows using Points-to Analysis},\n  author={Padmanabhan Krishnan and Yi Lu and Kagalavadi Ramesh Raghavendra},\n  journal={Engineering \\&amp; Technology Reference},\n  year={2016},\n  publisher={IET Digital Library},\n  doi={10.1049/etr.2015.0141},\n  url={https://digital-library.theiet.org/content/reference/10.1049/etr.2015.0141}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2013\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2013')\"\n      onkeypress=\"toggleGroup('group_2013')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2013</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"baskar-naldurg-raghavendra-suresh-primalinfonlogicderivabilityinpolynomialtime-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.163\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'baskar-naldurg-raghavendra-suresh-primalinfonlogicderivabilityinpolynomialtime-2013', 'https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.163', event);\">\n    Primal Infon Logic: Derivability in Polynomial Time.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Baskar, A.; Naldurg, P.; Raghavendra, K. R.;  and Suresh, S. P.\n</span>\n\n  \n\n</span>\n\n  In Seth, A.;  and Vishnoi, N. K., editor(s), <i>IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)</i>, volume 24, of <i>Leibniz International Proceedings in Informatics (LIPIcs)</i>, pages 163–174, Dagstuhl, Germany,  2013. Schloss Dagstuhl – Leibniz-Zentrum für Informatik\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.163\"\n     onclick=\"log_download('baskar-naldurg-raghavendra-suresh-primalinfonlogicderivabilityinpolynomialtime-2013', 'https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.163', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Primal Infon Logic: Derivability in Polynomial Time [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.4230/LIPIcs.FSTTCS.2013.163\"\n     onclick=\"log_download('baskar-naldurg-raghavendra-suresh-primalinfonlogicderivabilityinpolynomialtime-2013', 'http://doi.org/10.4230/LIPIcs.FSTTCS.2013.163', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/baskar-naldurg-raghavendra-suresh-primalinfonlogicderivabilityinpolynomialtime-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('baskar-naldurg-raghavendra-suresh-primalinfonlogicderivabilityinpolynomialtime-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{baskar_et_al:LIPIcs.FSTTCS.2013.163,\n  author =\t{Baskar, Anguraj and Naldurg, Prasad and Raghavendra, K. R. and Suresh, S. P.},\n  title =\t{{Primal Infon Logic: Derivability in Polynomial Time}},\n  booktitle =\t{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)},\n  pages =\t{163--174},\n  series =\t{Leibniz International Proceedings in Informatics (LIPIcs)},\n  ISBN =\t{978-3-939897-64-4},\n  ISSN =\t{1868-8969},\n  year =\t{2013},\n  volume =\t{24},\n  editor =\t{Seth, Anil and Vishnoi, Nisheeth K.},\n  publisher =\t{Schloss Dagstuhl -- Leibniz-Zentrum f{\\&quot;u}r Informatik},\n  address =\t{Dagstuhl, Germany},\n  URL =\t\t{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.163},\n  URN =\t\t{urn:nbn:de:0030-drops-43708},\n  doi =\t\t{10.4230/LIPIcs.FSTTCS.2013.163},\n  annote =\t{Keywords: Authorization logics, Intuitionistic modal logic, Proof theory, Cut elimination, Subformula property}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2012\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2012')\"\n      onkeypress=\"toggleGroup('group_2012')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2012</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"dsouza-raghavendra-modelcheckingbisimulationbasedinformationflowpropertiesforinfinitestatesystems-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Model-Checking Bisimulation-Based Information Flow Properties for Infinite State Systems.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  D'Souza, D.;  and Raghavendra, K. R.\n</span>\n\n  \n\n</span>\n\n  In Foresti, S.; Yung, M.;  and Martinelli, F., editor(s), <i>Computer Security – ESORICS 2012</i>, pages 591–608, Berlin, Heidelberg,  2012. Springer Berlin Heidelberg\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dsouza-raghavendra-modelcheckingbisimulationbasedinformationflowpropertiesforinfinitestatesystems-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dsouza-raghavendra-modelcheckingbisimulationbasedinformationflowpropertiesforinfinitestatesystems-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{10.1007/978-3-642-33167-1_34,\nauthor=&quot;D&#x27;Souza, Deepak and Raghavendra, K. R.&quot;,\neditor=&quot;Foresti, Sara and Yung, Moti and Martinelli, Fabio&quot;,\ntitle=&quot;Model-Checking Bisimulation-Based Information Flow Properties for Infinite State Systems&quot;,\nbooktitle=&quot;Computer Security -- ESORICS 2012&quot;,\nyear=&quot;2012&quot;,\npublisher=&quot;Springer Berlin Heidelberg&quot;,\naddress=&quot;Berlin, Heidelberg&quot;,\npages=&quot;591--608&quot;,\nabstract=&quot;Bisimulation-based information flow properties were introduced by Focardi and Gorrieri [1] as a way of specifying security properties for transition system models. These properties were shown to be decidable for finite-state systems. In this paper, we study the problem of verifying these properties for some well-known classes of infinite state systems. We show that all the properties are undecidable for each of these classes of systems.&quot;,\nisbn=&quot;978-3-642-33167-1&quot;\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Bisimulation-based information flow properties were introduced by Focardi and Gorrieri [1] as a way of specifying security properties for transition system models. These properties were shown to be decidable for finite-state systems. In this paper, we study the problem of verifying these properties for some well-known classes of infinite state systems. We show that all the properties are undecidable for each of these classes of systems.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2011\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2011')\"\n      onkeypress=\"toggleGroup('group_2011')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2011</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"dsouza-raghavendra-modelcheckingtracebasedinformationflowpropertiesforinfinitestatesystems-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://content.iospress.com/articles/journal-of-computer-security/jcs549\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dsouza-raghavendra-modelcheckingtracebasedinformationflowpropertiesforinfinitestatesystems-2011', 'https://content.iospress.com/articles/journal-of-computer-security/jcs549', event);\">\n    Model-Checking Trace-Based Information Flow Properties for Infinite-State Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  D'Souza, D.;  and Raghavendra, K. R.\n</span>\n\n  \n\n</span>\n\n  <i>Journal of Computer Security</i>, 19(1): 101–138.  2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://content.iospress.com/articles/journal-of-computer-security/jcs549\"\n     onclick=\"log_download('dsouza-raghavendra-modelcheckingtracebasedinformationflowpropertiesforinfinitestatesystems-2011', 'https://content.iospress.com/articles/journal-of-computer-security/jcs549', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Model-Checking Trace-Based Information Flow Properties for Infinite-State Systems [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.3233/JCS-2010-0549\"\n     onclick=\"log_download('dsouza-raghavendra-modelcheckingtracebasedinformationflowpropertiesforinfinitestatesystems-2011', 'http://doi.org/10.3233/JCS-2010-0549', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dsouza-raghavendra-modelcheckingtracebasedinformationflowpropertiesforinfinitestatesystems-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dsouza-raghavendra-modelcheckingtracebasedinformationflowpropertiesforinfinitestatesystems-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{dsouza2011model,\n  title={Model-Checking Trace-Based Information Flow Properties for Infinite-State Systems},\n  author={Deepak D&#x27;Souza and Kagalavadi Ramesh Raghavendra},\n  journal={Journal of Computer Security},\n  volume={19},\n  number={1},\n  pages={101--138},\n  year={2011},\n  publisher={IOS Press},\n  doi={10.3233/JCS-2010-0549},\n  url={https://content.iospress.com/articles/journal-of-computer-security/jcs549}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"naldurg-kr-sealalogicprogrammingframeworkforspecifyingandverifyingaccesscontrolmodels-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1145/1998441.1998454\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'naldurg-kr-sealalogicprogrammingframeworkforspecifyingandverifyingaccesscontrolmodels-2011', 'https://doi.org/10.1145/1998441.1998454', event);\">\n    SEAL: a logic programming framework for specifying and verifying access control models.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Naldurg, P.;  and K.R., R.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 16th ACM Symposium on Access Control Models and Technologies</i>, of <i>SACMAT '11</i>, pages 83–92, New York, NY, USA,  2011. Association for Computing Machinery\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1145/1998441.1998454\"\n     onclick=\"log_download('naldurg-kr-sealalogicprogrammingframeworkforspecifyingandverifyingaccesscontrolmodels-2011', 'https://doi.org/10.1145/1998441.1998454', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"SEAL: a logic programming framework for specifying and verifying access control models [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1145/1998441.1998454\"\n     onclick=\"log_download('naldurg-kr-sealalogicprogrammingframeworkforspecifyingandverifyingaccesscontrolmodels-2011', 'http://doi.org/10.1145/1998441.1998454', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/naldurg-kr-sealalogicprogrammingframeworkforspecifyingandverifyingaccesscontrolmodels-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('naldurg-kr-sealalogicprogrammingframeworkforspecifyingandverifyingaccesscontrolmodels-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{10.1145/1998441.1998454,\nauthor = {Naldurg, Prasad and K.R., Raghavendra},\ntitle = {SEAL: a logic programming framework for specifying and verifying access control models},\nyear = {2011},\nisbn = {9781450306881},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https://doi.org/10.1145/1998441.1998454},\ndoi = {10.1145/1998441.1998454},\nabstract = {We present SEAL, a language for specification and analysis of safety properties for label-based access control systems. A SEAL program represents a possibly infinite-state non-deterministic transition system describing the dynamic behavior of entities and their relevant access control operations. The features of our language are derived directly from the need to model new access control features arising from state-of-the art models in Windows 7, Asbestos, HiStar and others. We show that the reachability problem for this class of models is undecidable even for simple SEAL programs, but a bounded model-checking algorithm is able to validate interesting properties and discover relevant attacks.},\nbooktitle = {Proceedings of the 16th ACM Symposium on Access Control Models and Technologies},\npages = {83–92},\nnumpages = {10},\nkeywords = {logic programs, label-based access, bounded model checking, attacks, access control, Windows 7},\nlocation = {Innsbruck, Austria},\nseries = {SACMAT &#x27;11}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present SEAL, a language for specification and analysis of safety properties for label-based access control systems. A SEAL program represents a possibly infinite-state non-deterministic transition system describing the dynamic behavior of entities and their relevant access control operations. The features of our language are derived directly from the need to model new access control features arising from state-of-the art models in Windows 7, Asbestos, HiStar and others. We show that the reachability problem for this class of models is undecidable even for simple SEAL programs, but a bounded model-checking algorithm is able to validate interesting properties and discover relevant attacks.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dsouza-holla-raghavendra-sprick-modelcheckingtracebasedinformationflowproperties-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://content.iospress.com/articles/journal-of-computer-security/jcs400\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dsouza-holla-raghavendra-sprick-modelcheckingtracebasedinformationflowproperties-2011', 'https://content.iospress.com/articles/journal-of-computer-security/jcs400', event);\">\n    Model-Checking Trace-Based Information Flow Properties.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  D'Souza, D.; Holla, R.; Raghavendra, K. R.;  and Sprick, B.\n</span>\n\n  \n\n</span>\n\n  <i>Journal of Computer Security</i>, 19(1): 101–138.  2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://content.iospress.com/articles/journal-of-computer-security/jcs400\"\n     onclick=\"log_download('dsouza-holla-raghavendra-sprick-modelcheckingtracebasedinformationflowproperties-2011', 'https://content.iospress.com/articles/journal-of-computer-security/jcs400', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Model-Checking Trace-Based Information Flow Properties [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.3233/JCS-2010-0400\"\n     onclick=\"log_download('dsouza-holla-raghavendra-sprick-modelcheckingtracebasedinformationflowproperties-2011', 'http://doi.org/10.3233/JCS-2010-0400', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dsouza-holla-raghavendra-sprick-modelcheckingtracebasedinformationflowproperties-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dsouza-holla-raghavendra-sprick-modelcheckingtracebasedinformationflowproperties-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{dsouza2011model,\n  title={Model-Checking Trace-Based Information Flow Properties},\n  author={Deepak D&#x27;Souza and Raveendra Holla and Kagalavadi Ramesh Raghavendra and Barbara Sprick},\n  journal={Journal of Computer Security},\n  volume={19},\n  number={1},\n  pages={101--138},\n  year={2011},\n  publisher={IOS Press},\n  doi={10.3233/JCS-2010-0400},\n  url={https://content.iospress.com/articles/journal-of-computer-security/jcs400}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2008\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2008')\"\n      onkeypress=\"toggleGroup('group_2008')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2008</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"dsouza-holla-kulkarni-ramesh-sprick-onthedecidabilityofmodelcheckinginformationflowproperties-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the Decidability of Model-Checking Information Flow Properties.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  D'Souza, D.; Holla, R.; Kulkarni, J.; Ramesh, R. K.;  and Sprick, B.\n</span>\n\n  \n\n</span>\n\n  In Sekar, R.;  and Pujari, A. K., editor(s), <i>Information Systems Security</i>, pages 26–40, Berlin, Heidelberg,  2008. Springer Berlin Heidelberg\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dsouza-holla-kulkarni-ramesh-sprick-onthedecidabilityofmodelcheckinginformationflowproperties-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dsouza-holla-kulkarni-ramesh-sprick-onthedecidabilityofmodelcheckinginformationflowproperties-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{10.1007/978-3-540-89862-7_2,\nauthor=&quot;D&#x27;Souza, Deepak\nand Holla, Raveendra\nand Kulkarni, Janardhan\nand Ramesh, Raghavendra K.\nand Sprick, Barbara&quot;,\neditor=&quot;Sekar, R.\nand Pujari, Arun K.&quot;,\ntitle=&quot;On the Decidability of Model-Checking Information Flow Properties&quot;,\nbooktitle=&quot;Information Systems Security&quot;,\nyear=&quot;2008&quot;,\npublisher=&quot;Springer Berlin Heidelberg&quot;,\naddress=&quot;Berlin, Heidelberg&quot;,\npages=&quot;26--40&quot;,\nabstract=&quot;Current standard security practices do not provide substantial assurance about information flow security: the end-to-end behavior of a computing system. Noninterference is the basic semantical condition used to account for information flow security. In the literature, there are many definitions of noninterference: Non-inference, Separability and so on. Mantel presented a framework of Basic Security Predicates (BSPs) for characterizing the definitions of noninterference in the literature. Model-checking these BSPs for finite state systems was shown to be decidable in [8]. In this paper, we show that verifying these BSPs for the more expressive system model of pushdown systems is undecidable. We also give an example of a simple security property which is undecidable even for finite-state systems: the property is a weak form of non-inference called WNI, which is not expressible in Mantel&#x27;s BSP framework.&quot;,\nisbn=&quot;978-3-540-89862-7&quot;\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Current standard security practices do not provide substantial assurance about information flow security: the end-to-end behavior of a computing system. Noninterference is the basic semantical condition used to account for information flow security. In the literature, there are many definitions of noninterference: Non-inference, Separability and so on. Mantel presented a framework of Basic Security Predicates (BSPs) for characterizing the definitions of noninterference in the literature. Model-checking these BSPs for finite state systems was shown to be decidable in [8]. In this paper, we show that verifying these BSPs for the more expressive system model of pushdown systems is undecidable. We also give an example of a simple security property which is undecidable even for finite-state systems: the property is a weak form of non-inference called WNI, which is not expressible in Mantel's BSP framework.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2005\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2005')\"\n      onkeypress=\"toggleGroup('group_2005')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2005</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"dsouza-raghavendra-sprick-anautomatabasedapproachforverifyinginformationflowproperties-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S1571066105050516\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dsouza-raghavendra-sprick-anautomatabasedapproachforverifyinginformationflowproperties-2005', 'https://www.sciencedirect.com/science/article/pii/S1571066105050516', event);\">\n    An Automata Based Approach for Verifying Information Flow Properties.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  D'Souza, D.; Raghavendra, K.;  and Sprick, B.\n</span>\n\n  \n\n</span>\n\n  <i>Electronic Notes in Theoretical Computer Science</i>, 135(1): 39-58.  2005.\n  <span class=\"note\">Proceedings of the Second Workshop on Automated Reasoning for Security Protocol Analysis (ARSPA 2005)</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S1571066105050516\"\n     onclick=\"log_download('dsouza-raghavendra-sprick-anautomatabasedapproachforverifyinginformationflowproperties-2005', 'https://www.sciencedirect.com/science/article/pii/S1571066105050516', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"An Automata Based Approach for Verifying Information Flow Properties [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/https://doi.org/10.1016/j.entcs.2005.06.005\"\n     onclick=\"log_download('dsouza-raghavendra-sprick-anautomatabasedapproachforverifyinginformationflowproperties-2005', 'http://doi.org/https://doi.org/10.1016/j.entcs.2005.06.005', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dsouza-raghavendra-sprick-anautomatabasedapproachforverifyinginformationflowproperties-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dsouza-raghavendra-sprick-anautomatabasedapproachforverifyinginformationflowproperties-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DSOUZA200539,\ntitle = {An Automata Based Approach for Verifying Information Flow Properties},\njournal = {Electronic Notes in Theoretical Computer Science},\nvolume = {135},\nnumber = {1},\npages = {39-58},\nyear = {2005},\nnote = {Proceedings of the Second Workshop on Automated Reasoning for Security Protocol Analysis (ARSPA 2005)},\nissn = {1571-0661},\ndoi = {https://doi.org/10.1016/j.entcs.2005.06.005},\nurl = {https://www.sciencedirect.com/science/article/pii/S1571066105050516},\nauthor = {Deepak D&#x27;Souza and K.R. Raghavendra and Barbara Sprick},\nkeywords = {information flow control, verification, finite state systems},\nabstract = {We present an automated verification technique to verify trace based information flow properties for finite state systems. We show that the Basic Security Predicates (BSPs) defined by Mantel in [Mantel, H., Possibilistic Definitions of Security – An Assembly Kit, in: Proceedings of the 13th IEEE Computer Security Foundations Workshop (2000), pp. 185–199], which are shown to be the building blocks of known trace based information flow properties, can be characterised in terms of regularity preserving language theoretic operations. This leads to a decision procedure for checking whether a finite state system satisfies a given BSP. Verification techniques in the literature (e.g. unwinding) are based on the structure of the transition system and are incomplete in some cases. In contrast, our technique is language based and complete for all information flow properties that can be expressed in terms of BSPs.}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present an automated verification technique to verify trace based information flow properties for finite state systems. We show that the Basic Security Predicates (BSPs) defined by Mantel in [Mantel, H., Possibilistic Definitions of Security – An Assembly Kit, in: Proceedings of the 13th IEEE Computer Security Foundations Workshop (2000), pp. 185–199], which are shown to be the building blocks of known trace based information flow properties, can be characterised in terms of regularity preserving language theoretic operations. This leads to a decision procedure for checking whether a finite state system satisfies a given BSP. Verification techniques in the literature (e.g. unwinding) are based on the structure of the transition system and are incomplete in some cases. In contrast, our technique is language based and complete for all information flow properties that can be expressed in terms of BSPs.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);