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://harrisonwl.github.io/assets/bibliography/harrison.bib\",\"jsonp\":\"1\",\"host\":\"bibbase.org\",\"ssl\":false},\n      data: [{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"William\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Adam\"],\"propositions\":[],\"lastnames\":[\"Procter\"],\"suffixes\":[]}],\"title\":\"Cheap (But Functional) Threads\",\"journal\":\"Higher Order and Symbolic Computation (accepted for publication)\",\"note\":\"Draft version\",\"year\":\"2015\",\"abstract\":\"This article demonstrates how a powerful and expressive abstraction from concurrency theory plays a dual role as a programming tool for concurrent applications and as a foundation for their verification. This abstraction—monads of resumptions expressed using monad transformers—is \\\\emphcheap: it is easy to understand, easy to implement, and easy to reason about. We illustrate the expressiveness of the resumption monad with the construction of an exemplary multitasking operating system kernel with process forking, preemption, message passing, and synchronization constructs in the pure functional programming language Haskell. Because resumption computations are stream-like structures, reasoning about this kernel may be posed as reasoning about streams, a problem which is well-understood. And, as an example, this article illustrates how a liveness property—fairness—is proven and especially how the resumption-monadic structure promotes such verifications.\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/hosc-cheapthreads.pdf\",\"bibtex\":\"@article{CheapThreads,\\n  author =       \\\"William L. Harrison and Adam Procter\\\",\\n  title =        \\\"Cheap (But Functional) Threads\\\",\\n  journal =      \\\"Higher Order and Symbolic Computation (accepted for publication)\\\",\\n  note = {Draft version},\\n  year = 2015,                  \\n  abstract = \\\"This article demonstrates how a powerful and expressive abstraction \\nfrom concurrency theory plays a dual role as a programming tool \\nfor concurrent applications and as a foundation for their verification.\\nThis abstraction---monads of resumptions expressed using monad \\ntransformers---is \\\\emph{cheap}: it is easy to understand, easy to \\nimplement, and easy to reason about.\\nWe illustrate the expressiveness of the resumption monad with the \\nconstruction of an exemplary multitasking operating system kernel \\nwith process forking, preemption, message passing, and \\nsynchronization constructs in the pure functional programming \\nlanguage Haskell.\\nBecause resumption computations are stream-like structures, reasoning \\nabout this kernel may be posed as reasoning about streams, a problem \\nwhich is well-understood. And, as an example, this article \\nillustrates how a liveness property---fairness---is proven and \\nespecially how the resumption-monadic structure promotes such \\nverifications.\\\",\\n  url_Paper = \\\"https://harrisonwl.github.io/assets/papers/hosc-cheapthreads.pdf\\\",\\n}\\n\\n\",\"author_short\":[\"Harrison, W. L.\",\"Procter, A.\"],\"key\":\"CheapThreads\",\"id\":\"CheapThreads\",\"bibbaseid\":\"harrison-procter-cheapbutfunctionalthreads-2015\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/hosc-cheapthreads.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Formalized High Level Synthesis with Applications to Cryptographic Hardware\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Blumenfeld\"],\"firstnames\":[\"Ian\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Bond\"],\"firstnames\":[\"Eric\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hathhorn\"],\"firstnames\":[\"Chris\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Li\"],\"firstnames\":[\"Paul\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Torrence\"],\"firstnames\":[\"May\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ziegler\"],\"firstnames\":[\"Jared\"],\"suffixes\":[]}],\"booktitle\":\"NASA Formal Methods Symposium (NFM23)\",\"year\":\"2023\",\"abstract\":\"Verification of hardware-based cryptographic accelerators connects a low-level RTL implementation to the abstract algorithm itself; generally, the more optimized for performance an accelerator is, the more challenging its verification. This paper introduces a verification methodology, \\\\emphmodel validation, that uses a formalized high-level synthesis language (FHLS) as an intermediary between algorithm specification and hardware implementation. The foundation of our approach to model validation is a mechanized denotational semantics for the ReWire HLS language. Model validation proves the faithfulness of FHLS models to the RTL implementation and we summarize a model validation case study for a suite of pipelined Barrett multipliers. \",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/nfm23.pdf\",\"bibtex\":\"@inproceedings{harrison23,\\n  title = {Formalized High Level Synthesis with Applications to Cryptographic Hardware},\\n  author = {Harrison, William L. and Blumenfeld, Ian and Bond, Eric and Hathhorn, Chris and Li, Paul and Torrence, May and Ziegler, Jared},\\n  booktitle = {NASA Formal Methods Symposium (NFM23)},\\n  year = {2023},\\n  abstract = {\\n  Verification of hardware-based cryptographic accelerators connects a low-level RTL implementation to the abstract algorithm itself; generally, \\nthe more optimized for performance an accelerator is, the more challenging its verification. This paper introduces a verification methodology, \\\\emph{model validation}, that uses a formalized high-level synthesis language (FHLS) as an intermediary between algorithm specification and hardware implementation. The foundation of our approach to model validation is a mechanized denotational semantics for the ReWire HLS language. Model validation proves the faithfulness of FHLS models to the RTL implementation and we summarize a model validation case study for a suite of pipelined Barrett multipliers.\\n},\\n  url_Paper = \\\"https://harrisonwl.github.io/assets/papers/nfm23.pdf\\\",\\n}\\n\\n\",\"author_short\":[\"Harrison, W. L.\",\"Blumenfeld, I.\",\"Bond, E.\",\"Hathhorn, C.\",\"Li, P.\",\"Torrence, M.\",\"Ziegler, J.\"],\"key\":\"harrison23\",\"id\":\"harrison23\",\"bibbaseid\":\"harrison-blumenfeld-bond-hathhorn-li-torrence-ziegler-formalizedhighlevelsynthesiswithapplicationstocryptographichardware-2023\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/nfm23.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":5,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Temporal Staging for Correct-by-Construction Cryptographic Hardware\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Forman\"],\"firstnames\":[\"Yakir\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]}],\"booktitle\":\"Rapid Systems Prototyping (RSP24)\",\"year\":\"2024\",\"abstract\":\"There is a conceptual divide between the ways cryptographic algorithms are defined (i.e., informal imperative pseudocode) and commodity hardware design languages (e.g., Verilog). How does one even begin to compare a pseudocode to an HDL design that purports to implement it in hardware? Bridging this divide requires substantial manual intervention and, consequently, ``shrinking the divide'' can drastically reduce the cost of high-assurance cryptographic hardware by reducing the cost of formal verification. We present a correct-by-construction methodology for the functional hardware design language, ReWire, in which a reference cryptographic algorithm is transformed into a provably correct hardware design with a program transformation called temporal staging. We illustrate this methodology with case studies including one for the BLAKE2b cryptographic hash function. Because the reference algorithm, the temporal staging transformation, and the resulting implementation are all expressed in ReWire, formal verification can proceed immediately via a published ReWire semantics. \",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/rsp24.pdf\",\"bibtex\":\"@inproceedings{harrison24,\\n  title = {Temporal Staging for Correct-by-Construction Cryptographic Hardware},\\n  author = {Forman, Yakir and Harrison, William L.},\\n  booktitle = {Rapid Systems Prototyping (RSP24)},\\n  year = {2024},\\n  abstract = {\\n There is a conceptual divide between the ways cryptographic algorithms are defined (i.e., informal imperative pseudocode) and commodity hardware design languages (e.g., Verilog). How does one even begin to compare a pseudocode to an HDL design that purports to implement it in hardware? Bridging this divide requires substantial manual intervention and, consequently, ``shrinking the divide'' can drastically reduce the cost of high-assurance cryptographic hardware by reducing the cost of formal verification. We present a correct-by-construction methodology for the functional hardware design language, ReWire, in which a reference cryptographic algorithm is transformed into a provably correct hardware design with a program transformation called temporal staging. We illustrate this methodology with case studies including one for the BLAKE2b cryptographic hash function. Because the reference algorithm, the temporal staging transformation, and the resulting implementation are all expressed in ReWire, formal verification can proceed immediately via a published ReWire semantics.\\n},\\n  url_Paper = \\\"https://harrisonwl.github.io/assets/papers/rsp24.pdf\\\",\\n}\\n\\n                  \\n\",\"author_short\":[\"Forman, Y.\",\"Harrison, W. L.\"],\"key\":\"harrison24\",\"id\":\"harrison24\",\"bibbaseid\":\"forman-harrison-temporalstagingforcorrectbyconstructioncryptographichardware-2024\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/rsp24.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"A Mechanized Semantic Metalanguage for High Level Synthesis\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hathhorn\"],\"firstnames\":[\"Chris\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]}],\"booktitle\":\"23rd International Symposium on Principles and Practice of Declarative Programming (PPDP 2021)\",\"year\":\"2021\",\"abstract\":\"High-level synthesis (HLS) seeks to make hardware development more like software development by adapting ideas from programming languages to hardware description and HLS from functional languages is usually motivated as a means of bringing software-like productivity to hardware development. Formalized semantics support a range of important capabilities in software languages (e.g., compositionality, comprehensibility, interoperability, formal methods, and security) that are desirable in hardware languages as well. This paper considers the formalized semantics of the Device Calculus, a typed lambda-calculus with operators for constructing Mealy machines that forms a semantic substratum suitable for high-level synthesis and we demonstrate the utility of the Device Calculus as a foundation for formal methods in functional HLS with a case study specifying the semantics of an idealized subset of the FIRRTL language. FIRRTL (``Flexible Internal Representation for RTL'') is an open-source hardware intermediate representation targeted by the Chisel hardware construction language and the semantics we present is also a starting point for exploring formal methods and security within both the Chisel toolchain and any other high-level synthesis flows that target FIRRTL. \",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/ppdp21.pdf\",\"bibtex\":\"@inproceedings{harrison21,\\n  title = {A Mechanized Semantic Metalanguage for High Level Synthesis},\\n  author = {Harrison, William L. and Hathhorn, Chris and Allwein, Gerard},\\n  booktitle = {23rd International Symposium on Principles and Practice of Declarative Programming (PPDP 2021)},\\n  year = {2021},\\n  abstract = {High-level synthesis (HLS) seeks to make hardware development more like software development by adapting ideas from programming languages to hardware description and HLS from functional languages is usually motivated as a means of bringing software-like productivity to hardware development. Formalized semantics support a range of important capabilities in software languages (e.g., compositionality, comprehensibility, interoperability, formal methods, and security) that are desirable in hardware languages as well. This paper considers the formalized semantics of the Device Calculus, a typed lambda-calculus with operators for constructing Mealy machines that forms a semantic substratum suitable for high-level synthesis and we demonstrate the utility of the Device Calculus as a foundation for formal methods in functional HLS with a case study specifying the semantics of an idealized subset of the FIRRTL language. FIRRTL  (``Flexible Internal Representation for RTL'') is an open-source hardware intermediate representation targeted by the Chisel hardware construction language and the semantics we present is also a starting point for exploring formal methods and security within both the Chisel toolchain and any other high-level synthesis flows that target FIRRTL.\\n},\\n  url_Paper = \\\"https://harrisonwl.github.io/assets/papers/ppdp21.pdf\\\",\\n}\\n\\n\",\"author_short\":[\"Harrison, W. L.\",\"Hathhorn, C.\",\"Allwein, G.\"],\"key\":\"harrison21\",\"id\":\"harrison21\",\"bibbaseid\":\"harrison-hathhorn-allwein-amechanizedsemanticmetalanguageforhighlevelsynthesis-2021\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/ppdp21.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Verifiable Security Templates for Hardware\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the Design, Automation, and Test Europe (DATE) Conference\",\"year\":\"2020\",\"abstract\":\"High-level synthesis (HLS) research generally focuses on transferring ``software engineering virtues'' (e.g., modularity, abstraction, extensibility, etc.) to hardware development with the ultimate goal of making hardware development as agile as software development. And recent HLS research has focused on transferring ideas and techniques from high assurance software formal methods to hardware development. Just as it has introduced software engineering virtues, we believe HLS can also become a vector for adapting software formal methods to the challenge of high assurance security in hardware. This paper introduces the Device Calculus and its mechanization in the Agda proof checking system. The Device Calculus is a starting point for exploring the formal methods and security of high-level synthesis flows. We illustrate the Device Calculus with a number of examples of formally verifiable security templates—i.e., functions in the Device Calculus that express common security structures at a high-level of abstraction. \",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/date20.pdf\",\"bibtex\":\"@inproceedings{harrison20,\\n  title = {Verifiable Security Templates for Hardware},\\n  author = {Harrison, William L. and Allwein, Gerard},\\n  booktitle = {Proceedings of the Design, Automation, and Test Europe (DATE) Conference},\\n  year = {2020},\\n  abstract = {High-level synthesis (HLS) research generally focuses on transferring ``software engineering virtues'' (e.g., modularity, abstraction, extensibility, etc.) to hardware development with the ultimate goal of making hardware development as agile as software development. And recent HLS research has focused on transferring ideas and techniques from high assurance software formal methods to hardware development. Just as it has introduced software engineering virtues, we believe HLS can also become a vector for adapting software formal methods to the challenge of high assurance security in hardware. This paper introduces the Device Calculus and its mechanization in the Agda proof checking system. The Device Calculus is a starting point for exploring the formal methods and security of high-level synthesis flows. We illustrate the Device Calculus with a number of examples of formally verifiable security templates---i.e., functions in the Device Calculus that express common security structures at a high-level of abstraction.\\n},\\n  url_Paper = \\\"https://harrisonwl.github.io/assets/papers/date20.pdf\\\",\\n}\\n\\n\",\"author_short\":[\"Harrison, W. L.\",\"Allwein, G.\"],\"key\":\"harrison20\",\"id\":\"harrison20\",\"bibbaseid\":\"harrison-allwein-verifiablesecuritytemplatesforhardware-2020\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/date20.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Strongly Bounded Termination with Applications to Security and Hardware Synthesis\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Reynolds\"],\"firstnames\":[\"Thomas\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Chadha\"],\"firstnames\":[\"Rohit\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]}],\"booktitle\":\"ACM Workshop on Type Driven Development (TyDe)\",\"year\":\"2020\",\"abstract\":\"Termination checking is a classic static analysis, and, within this focus, there are type-based approaches that formalize termination analysis as type systems (i.e., so that all well-typed programs terminate). But there are situations where a stronger termination property (which we call strongly- bounded termination) must be determined and, accordingly, we explore this property via a variant of the simply-typed λ-calculus called the bounded-time lambda calculus (BTC). This paper presents the BTC and its semantics and metatheory through a Coq formalization. Important examples (e.g., hardware synthesis from functional languages and detection of covert timing channels) motivating strongly-bounded termination and BTC are described as well.\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/tyde20.pdf\",\"bibtex\":\"@inproceedings{reynolds20,\\n  title = {Strongly Bounded Termination with Applications to Security and Hardware Synthesis},\\n  author = {Reynolds, Thomas and Chadha, Rohit and Harrison, William L. and Allwein, Gerard},\\n  booktitle = {ACM Workshop on Type Driven Development (TyDe)},\\n  year = {2020},\\n  abstract = {Termination checking is a classic static analysis, and, within this focus, there are type-based approaches that formalize termination analysis as type systems (i.e., so that all well-typed programs terminate). But there are situations where a stronger termination property (which we call strongly- bounded termination) must be determined and, accordingly, we explore this property via a variant of the simply-typed λ-calculus called the bounded-time lambda calculus (BTC). This paper presents the BTC and its semantics and metatheory through a Coq formalization. Important examples (e.g., hardware synthesis from functional languages and detection of covert timing channels) motivating strongly-bounded termination and BTC are described as well.},\\n  url_Paper = \\\"https://harrisonwl.github.io/assets/papers/tyde20.pdf\\\",\\n  }\\n\\n\",\"author_short\":[\"Reynolds, T.\",\"Chadha, R.\",\"Harrison, W. L.\",\"Allwein, G.\"],\"key\":\"reynolds20\",\"id\":\"reynolds20\",\"bibbaseid\":\"reynolds-chadha-harrison-allwein-stronglyboundedterminationwithapplicationstosecurityandhardwaresynthesis-2020\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/tyde20.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Information Flow and Homotopy Theory\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]}],\"journal\":\"Journal of Logical and Algebraic Methods in Programming (under submission)\",\"year\":\"2019\",\"numpages\":\"38\",\"abstract\":\"Simulation and bisimulation are used in many areas of security in Computing Science, however the methods used do not come with a supporting logic giving the regularities of information flow. We have developed Distributed Logic to represent regularities governing information flow between localities of a distributed system, each locality can be outfitted with its own notion of state and language. The flows, either internal to a locality or between localities, follow a connection structure specified by a graph in the logic and semantically by relations in a category. We use some basic homotopy notions for use in distributed systems by using the notions as a template for properties of (bi)simulations useful for security and other properties of distributed systems. The logic can express formulas whose validity is unwritten by the (bi)simulations. This presents new ways of formalizing and proving properties of distributed systems.\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/dist_hom_theory.pdf\",\"bibtex\":\"@article{allwein19,\\n  title = {Information Flow and Homotopy Theory},\\n  author = {Allwein, Gerard and Harrison, William L.},\\n  journal = {Journal of Logical and Algebraic Methods in Programming (under submission)},\\n  year = {2019},\\n  numpages = {38},                \\n  abstract = {Simulation and bisimulation are used in many areas of security in Computing Science, however the methods used do not come with a supporting logic giving the regularities of information flow. We have developed Distributed Logic to represent regularities governing information flow between localities of a distributed system, each locality can be outfitted with its own notion of state and language. The flows, either internal to a locality or between localities, follow a connection structure specified by a graph in the logic and semantically by relations in a category. We use some basic homotopy notions for use in distributed systems by using the notions as a template for properties of (bi)simulations useful for security and other properties of distributed systems. The logic can express formulas whose validity is unwritten by the (bi)simulations. This presents new ways of formalizing and proving properties of distributed systems.},\\n  url_Paper = \\\"https://harrisonwl.github.io/assets/papers/dist_hom_theory.pdf\\\",\\n}\\n\\n\\n\",\"author_short\":[\"Allwein, G.\",\"Harrison, W. L.\"],\"key\":\"allwein19\",\"id\":\"allwein19\",\"bibbaseid\":\"allwein-harrison-informationflowandhomotopytheory-2019\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/dist_hom_theory.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Language Abstractions for Hardware-based Control-Flow Integrity Monitoring\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 2018 International Conference on Reconfigurable Computing and FPGAs\",\"year\":\"2018\",\"pages\":\"1-6\",\"abstract\":\"Control-Flow Integrity (CFI) is a software protection mechanism that detects a class of code reuse attacks by identifying anomalous control-flows within an executing program. Hardware-based CFI has the promise of the security benefits of CFI without the performance overhead and complexity of software-based CFI: generally speaking, hardware-based monitors are more difficult to bypass, offer lower performance overheads than software-based monitors, and, furthermore, hardware-based CFI can be performed without the necessity of altering application binaries or instrumenting language compilers. Although hardware-based CFI is an active area of research and there is a growing literature describing CFI strategies at a high-level, there is, to the authors' best knowledge, no work on languages specially tailored to the specification and implementation of CFI monitors. This article presents a proof-of-concept domain-specific language with built-in abstractions for expressing control-flow constraints along with a compiler that targets the functional hardware description language ReWire. While the case study is small, it indicates, we argue, an approach to rapid-prototyping hardware-based monitors enforcing CFI that is quick, flexible, and extensible as well as being amenable to formal verification. \",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/reconfig18.pdf\",\"url_code\":\"https://harrisonwl.github.io/assets/code/ReConFig18codebase.tar.gz\",\"bibtex\":\"@inproceedings{harrison18b,\\n  title = {Language Abstractions for Hardware-based Control-Flow Integrity Monitoring},\\n  author = {Harrison, William L. and Allwein, Gerard},\\n  booktitle = {Proceedings of the 2018 International Conference on Reconfigurable Computing and FPGAs},\\n  year = {2018},\\n  pages = {1-6},\\n  abstract = {Control-Flow Integrity (CFI) is a software protection mechanism that \\ndetects a class of code reuse attacks by identifying anomalous control-flows within an executing program. Hardware-based CFI has the promise of the security benefits of CFI without the performance overhead and complexity of software-based CFI: generally speaking, hardware-based monitors are more difficult to bypass, offer lower performance overheads than software-based monitors, and, furthermore, hardware-based CFI can be performed without the necessity of altering application binaries or instrumenting language compilers. Although hardware-based CFI is an active area of research and there is a growing literature describing CFI strategies at a high-level, there is, to the authors' best knowledge, no work on languages specially tailored to the specification and implementation of CFI monitors. This article presents a proof-of-concept domain-specific language with built-in abstractions for expressing control-flow constraints along with a compiler that targets the functional hardware description language ReWire. While the case study is small, it indicates, we argue, an approach to rapid-prototyping hardware-based monitors enforcing CFI that is quick, flexible, and extensible as well as being amenable to formal verification.\\n},\\n  url_Paper = \\\"https://harrisonwl.github.io/assets/papers/reconfig18.pdf\\\",\\n  url_Code  = \\\"https://harrisonwl.github.io/assets/code/ReConFig18codebase.tar.gz\\\",\\n}\\n\\n\",\"author_short\":[\"Harrison, W. L.\",\"Allwein, G.\"],\"key\":\"harrison18b\",\"id\":\"harrison18b\",\"bibbaseid\":\"harrison-allwein-languageabstractionsforhardwarebasedcontrolflowintegritymonitoring-2018\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/reconfig18.pdf\",\" code\":\"https://harrisonwl.github.io/assets/code/ReConFig18codebase.tar.gz\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Semantics-directed Prototyping of Hardware Runtime Monitors\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 29th International Symposium on Rapid System Prototyping (RSP)\",\"month\":\"October\",\"year\":\"2018\",\"abstract\":\"Building memory protection mechanisms into embedded hardware is attractive because it has the potential to neutralize a host of software-based attacks with relatively small performance overhead. A hardware monitor, being at the lowest level of the system stack, is more difficult to bypass than a software monitor and hardware-based protections are also potentially more fine-grained than is possible in software: an individual instruction executing on a processor may entail multiple memory accesses, all of which may be tracked in hardware. Finally, hardware-based protection can be performed without the necessity of altering application binaries. This article presents a proof-of-concept codesign of a small embedded processor with a hardware monitor protecting against ROP-style code reuse attacks. While the case study is small, it indicates, we argue, an approach to rapid-prototyping runtime monitors in hardware that is quick, flexible, and extensible as well as being amenable to formal verification.\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/rsp18.pdf\",\"bibtex\":\"@inproceedings{harrison18a,\\n  title = {Semantics-directed Prototyping of Hardware Runtime Monitors},\\n  author = {Harrison, William L. and Allwein, Gerard},\\n  booktitle = {Proceedings of the 29th International Symposium on Rapid System Prototyping (RSP)},\\n  month = Oct,\\n  year = {2018},\\n  abstract = {Building memory protection mechanisms into embedded hardware is attractive because it has the potential to neutralize a host of software-based attacks with relatively small performance overhead. A hardware monitor, being at the lowest level of the system stack, is more difficult to bypass than a software monitor and hardware-based protections are also potentially more fine-grained than is possible in software: an individual instruction executing on a processor may entail multiple memory accesses, all of which may be tracked in hardware. Finally, hardware-based protection can be performed without the necessity of altering application binaries. This article presents a proof-of-concept codesign of a small embedded processor with a hardware monitor protecting against ROP-style code reuse attacks. While the case study is small, it indicates, we argue, an approach to rapid-prototyping runtime monitors in hardware that is quick, flexible, and extensible as well as being amenable to formal verification.},\\n  url_Paper = \\\"https://harrisonwl.github.io/assets/papers/rsp18.pdf\\\",\\n}\\n\\n\\n\",\"author_short\":[\"Harrison, W. L.\",\"Allwein, G.\"],\"key\":\"harrison18a\",\"id\":\"harrison18a\",\"bibbaseid\":\"harrison-allwein-semanticsdirectedprototypingofhardwareruntimemonitors-2018\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/rsp18.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"A Core Calculus for Secure Hardware: Its Formal Semantics and Proof System\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Reynolds\"],\"firstnames\":[\"Thomas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Procter\"],\"firstnames\":[\"Adam\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 15th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE17)\",\"year\":\"2017\",\"abstract\":\"Constructing high assurance, secure hardware remains a challenge, because to do so relies on both a verifiable means of hardware description and implementation. However, production hardware description languages (HDL) lack the formal underpinnings required by formal methods in security. Still, there is no such thing as high assurance systems without high assurance hardware. We present a core calculus of secure hardware description with its formal semantics, security type system and mechanization in Coq. This calculus is the core of the functional HDL, ReWire, shown in previous work to have useful applications in reconfigurable computing. This work supports a full-fledged, formal methodology for producing high assurance hardware.\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/memocode17.pdf\",\"bibtex\":\"@inproceedings{reynolds17,\\n  title = {A Core Calculus for Secure Hardware: Its Formal Semantics and Proof System},\\n  author = {Reynolds, Thomas N. and Procter, Adam and Harrison, William L. and Allwein, Gerard},\\n  booktitle = {Proceedings of the 15th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE17)},\\n  year = {2017},\\n  abstract = {Constructing high assurance, secure hardware remains a challenge, because to do so relies on both a verifiable means of hardware description and implementation. However, production hardware description languages (HDL) lack the formal underpinnings required by formal methods in security. Still, there is no such thing as high assurance systems without high assurance hardware. We present a core calculus of secure hardware description with its formal semantics, security type system and mechanization in Coq. This calculus is the core of the functional HDL, ReWire, shown in previous work to have useful applications in reconfigurable computing. This work supports a full-fledged, formal methodology for producing high assurance hardware.},\\n  url_Paper = \\\"https://harrisonwl.github.io/assets/papers/memocode17.pdf\\\",\\n}\\n                  \\n\",\"author_short\":[\"Reynolds, T. N.\",\"Procter, A.\",\"Harrison, W. L.\",\"Allwein, G.\"],\"key\":\"reynolds17\",\"id\":\"reynolds17\",\"bibbaseid\":\"reynolds-procter-harrison-allwein-acorecalculusforsecurehardwareitsformalsemanticsandproofsystem-2017\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/memocode17.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Gerard\"],\"propositions\":[],\"lastnames\":[\"Allwein\"],\"suffixes\":[]},{\"firstnames\":[\"William\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Thomas\"],\"propositions\":[],\"lastnames\":[\"Reynolds\"],\"suffixes\":[]}],\"title\":\"Distributed Relation Logic\",\"journal\":\"Logic and Logical Philosophy\",\"volume\":\"26\",\"number\":\"1\",\"pages\":\"19-61\",\"year\":\"2017\",\"keywords\":\"relation algebra; multisorted algebra; distributed logic; Kripke frames; Kripke models\",\"abstract\":\"We extend the relational algebra of Chin and Tarski so that it is multisorted or, as we prefer, typed. Each type supports a local Boolean algebra outfitted with a converse operator. From Lyndon, we know that relation algebras cannot be represented as proper relation algebras where a proper relation algebra has binary relations as elements and the algebra is singly-typed. Here, the intensional conjunction, which was to represent relational composition in Chin and Tarski, spans three different local algebras, thus the term distributed in the title. Since we do not rely on proper relation algebras, we are free to re-express the algebras as typed. In doing so, we allow many different intensional conjunction operators.We construct a typed logic over these algebras, also known as heterogeneous algebras of Birkhoff and Lipson. The logic can be seen as a form of relevance logic with a classical negation connective where the Routley-Meyer star operator is reified as a converse connective in the logic. Relevance logic itself is not typed but our work shows how it can be made so. Some of the properties of classical relevance logic are weakened from Routley-Meyer’s version which is too strong for a logic over relation algebras.\",\"issn\":\"2300-9802\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/llp17.pdf\",\"bibtex\":\"@article{allwein17,\\n\\tauthor = {Gerard Allwein and William L. Harrison and Thomas Reynolds},\\n\\ttitle = {Distributed Relation Logic},\\n\\tjournal = {Logic and Logical Philosophy},\\n\\tvolume = {26},\\n\\tnumber = {1},\\n        pages = {19-61},          \\n\\tyear = {2017},\\n\\tkeywords = {relation algebra; multisorted algebra; distributed logic; Kripke frames; Kripke models},\\n\\tabstract = {We extend the relational algebra of Chin and Tarski so that it is multisorted or, as we prefer, typed. Each type supports a local Boolean algebra outfitted with a converse operator. From Lyndon, we know that relation algebras cannot be represented as proper relation algebras where a proper relation algebra has binary relations as elements and the algebra is singly-typed. Here, the intensional conjunction, which was to represent relational composition in Chin and Tarski, spans three different local algebras, thus the term distributed in the title. Since we do not rely on proper relation algebras, we are free to re-express the algebras as typed. In doing so, we allow many different intensional conjunction operators.We construct a typed logic over these algebras, also known as heterogeneous algebras of Birkhoff and Lipson. The logic can be seen as a form of relevance logic with a classical negation connective where the Routley-Meyer star operator is reified as a converse connective in the logic. Relevance logic itself is not typed but our work shows how it can be made so. Some of the properties of classical relevance logic are weakened from Routley-Meyer’s version which is too strong for a logic over relation algebras.},\\n\\tissn = {2300-9802},\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/llp17.pdf\\\",\\n\\n}\\n                  \\n\",\"author_short\":[\"Allwein, G.\",\"Harrison, W. L.\",\"Reynolds, T.\"],\"key\":\"allwein17\",\"id\":\"allwein17\",\"bibbaseid\":\"allwein-harrison-reynolds-distributedrelationlogic-2017\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/llp17.pdf\"},\"keyword\":[\"relation algebra; multisorted algebra; distributed logic; Kripke frames; Kripke models\"],\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Model-driven Design & Synthesis of the SHA-256 Cryptographic Hash Function in ReWire\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Procter\"],\"firstnames\":[\"Adam\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 27th International Symposium on Rapid System Prototyping (RSP)\",\"year\":\"2016\",\"pages\":\"1-7\",\"abstract\":\"There are many algorithms whose implementations can benefit both from hardware acceleration and formal verification and we would like to develop high assurance implementations as rapidly as possible. Critical computing infrastructure like cryptographic algorithms are prime candidates both for such acceleration and for formal verification. We show how to derive a verifiable, hardware-accelerated implementation of the SHA-256 cryptographic hash in the ReWire functional hardware description language in which the partitioning of the implementation between hardware and software is reflected in the type system itself. \",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/rsp16.pdf\",\"url_slides\":\"https://harrisonwl.github.io/assets/papers/slides-rsp16.pdf\",\"bibtex\":\"@inproceedings{harrison16a,\\n   title = {Model-driven Design \\\\& Synthesis of the SHA-256 Cryptographic Hash Function in ReWire},\\n   author = {Harrison, William L. and Procter, Adam and Allwein, Gerard},\\n   booktitle = {Proceedings of the 27th International Symposium on Rapid System Prototyping (RSP)},\\n   year = {2016},\\n   pages = {1-7},\\n   abstract = {There are many algorithms whose implementations can benefit both from hardware acceleration and formal verification and we would like to develop high assurance implementations as rapidly as possible. Critical computing infrastructure like cryptographic algorithms are prime candidates both for such acceleration and for formal verification. We show how to derive a verifiable, hardware-accelerated implementation of the SHA-256 cryptographic hash in the ReWire functional hardware description language in which the partitioning of the implementation between hardware and software is reflected in the type system itself.\\n},\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/rsp16.pdf\\\",\\n   url_Slides = \\\"https://harrisonwl.github.io/assets/papers/slides-rsp16.pdf\\\",\\n  }\\n                  \\n\",\"author_short\":[\"Harrison, W. L.\",\"Procter, A.\",\"Allwein, G.\"],\"key\":\"harrison16a\",\"id\":\"harrison16a\",\"bibbaseid\":\"harrison-procter-allwein-modeldrivendesignsynthesisofthesha256cryptographichashfunctioninrewire-2016\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/rsp16.pdf\",\" slides\":\"https://harrisonwl.github.io/assets/papers/slides-rsp16.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"incollection\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]}],\"editor\":[{\"propositions\":[],\"lastnames\":[\"Bimbó\"],\"firstnames\":[\"Katalin\"],\"suffixes\":[]}],\"title\":\"Distributed Modal Logic\",\"booktitle\":\"J. Michael Dunn on Information Based Logics\",\"year\":\"2016\",\"publisher\":\"Springer International Publishing\",\"pages\":\"331–362\",\"isbn\":\"978-3-319-29300-4\",\"url\":\"http://dx.doi.org/10.1007/978-3-319-29300-4_16\",\"bibtex\":\"@incollection{allwein2016a,\\nauthor = \\\"Allwein, Gerard and Harrison, William L.\\\",\\neditor = \\\"Bimb{\\\\'o}, Katalin\\\",\\ntitle = \\\"Distributed Modal Logic\\\",\\nbookTitle = \\\"J. Michael Dunn on Information Based Logics\\\",\\nyear = \\\"2016\\\",\\npublisher = \\\"Springer International Publishing\\\",\\npages = \\\"331--362\\\",\\nisbn = \\\"978-3-319-29300-4\\\",\\nurl=\\\"http://dx.doi.org/10.1007/978-3-319-29300-4_16\\\"\\n}\\n                  \\n\",\"author_short\":[\"Allwein, G.\",\"Harrison, W. L.\"],\"editor_short\":[\"Bimbó, K.\"],\"key\":\"allwein2016a\",\"id\":\"allwein2016a\",\"bibbaseid\":\"allwein-harrison-distributedmodallogic-2016\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://dx.doi.org/10.1007/978-3-319-29300-4_16\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"incollection\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]}],\"editor\":[{\"propositions\":[],\"lastnames\":[\"Bimbó\"],\"firstnames\":[\"Katalin\"],\"suffixes\":[]}],\"title\":\"Distributed Relation Algebra\",\"booktitle\":\"Relevance Logics and other Tools for Reasoning. Essays in Honor of J. Michael Dunn\",\"year\":\"2022\",\"publisher\":\"College Publications\",\"pages\":\"1-30\",\"isbn\":\"978-1-84890-395-1\",\"abstract\":\"We define some extra relation operators in Relation Algebras and examine the relationship between Relation Algebras and Relevance Logic. We then extract binary relations from Kripke models of Relation Algebras and extend those to Distributed Relation Algebras. The term distribution refers to using a multigraph of local logics connected by the relation operators. In the context of Kripke frames for Relation Algebras, the distribution refers to a multigraph of Stone spaces each supporting a local Kripke frame. There are then distributed Kripke relations connecting the local frames. Finally, we show the relationship between the relation operators and Kan extensions and lifts from category theory.\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/dist_rel_alg.pdf\",\"bibtex\":\"@incollection{allwein2022,\\nauthor = \\\"Allwein, Gerard and Harrison, William L.\\\",\\neditor = \\\"Bimb{\\\\'o}, Katalin\\\",\\ntitle = \\\"Distributed Relation Algebra\\\",\\nbookTitle = \\\"Relevance Logics and other Tools for Reasoning. Essays in Honor of J. Michael Dunn\\\",\\nyear = \\\"2022\\\",\\npublisher = \\\"College Publications\\\",\\npages = \\\"1-30\\\",\\nisbn = \\\"978-1-84890-395-1\\\",\\nabstract = {We define some extra relation operators in Relation Algebras and examine the relationship between Relation Algebras and Relevance Logic. We then extract binary relations from Kripke models of Relation Algebras and extend those to Distributed Relation Algebras. The term distribution refers to using a multigraph of local logics connected by the relation operators. In the context of Kripke frames for Relation Algebras, the distribution refers to a multigraph of Stone spaces each supporting a local Kripke frame. There are then distributed Kripke relations connecting the local frames. Finally, we show the relationship between the relation operators and Kan extensions and lifts from category theory.},\\n        url_Paper = \\\"https://harrisonwl.github.io/assets/papers/dist_rel_alg.pdf\\\",\\n}\\n\\n\",\"author_short\":[\"Allwein, G.\",\"Harrison, W. L.\"],\"editor_short\":[\"Bimbó, K.\"],\"key\":\"allwein2022\",\"id\":\"allwein2022\",\"bibbaseid\":\"allwein-harrison-distributedrelationalgebra-2022\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/dist_rel_alg.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Reynolds\"],\"firstnames\":[\"Thomas\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Procter\"],\"firstnames\":[\"Adam\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]}],\"title\":\"The Mechanized Marriage of Effects and Monads with Applications to High-assurance Hardware\",\"journal\":\"ACM Transactions on Embedded Computing Systems\",\"issue_date\":\"February 2019\",\"volume\":\"18\",\"number\":\"1\",\"month\":\"January\",\"year\":\"2019\",\"issn\":\"1539-9087\",\"pages\":\"6:1–6:26\",\"articleno\":\"6\",\"numpages\":\"26\",\"keywords\":\"High-level synthesis, hardware verification, security\",\"abstract\":\"Constructing high assurance, secure hardware remains a challenge, because to do so relies on both a verifiable means of hardware description and implementation. However, production hardware description languages (HDL) lack the formal underpinnings required by formal methods in security. Still, there is no such thing as high assurance systems without high assurance hardware. We present a core calculus of secure hardware description with its formal semantics, security type system and mechanization in Coq. This calculus is the core of the functional HDL, ReWire, shown in previous work to have useful applications in reconfigurable computing. This work supports a full-fledged, formal methodology for producing high assurance hardware. \",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/tecs18.pdf\",\"bibtex\":\"@article{reynolds19,\\n author = {Reynolds, Thomas N. and Procter, Adam and Harrison, William L. and Allwein, Gerard},\\n title = {The Mechanized Marriage of Effects and Monads with Applications to High-assurance Hardware},\\n journal = {ACM Transactions on Embedded Computing Systems},\\n issue_date = {February 2019},\\n volume = {18},\\n number = {1},\\n month = jan,\\n year = {2019},\\n issn = {1539-9087},\\n pages = {6:1--6:26},\\n articleno = {6},\\n numpages = {26},\\n keywords = {High-level synthesis, hardware verification, security},\\n\\tabstract = {\\n\\t\\tConstructing high assurance, secure hardware remains a challenge, because to do so relies on both a verifiable means of hardware description and implementation. \\n\\tHowever, production hardware description languages (HDL) lack the formal underpinnings required by formal methods in security.\\n\\tStill, there is no such thing as high assurance systems without high assurance hardware.\\n\\tWe present a core calculus of secure hardware description with its formal semantics, security type system and mechanization in Coq. \\n\\tThis calculus is the core of the functional HDL, ReWire, shown in previous work to have useful applications in reconfigurable computing.\\n\\tThis work supports a full-fledged, formal methodology for producing high assurance hardware.\\n},\\n        url_Paper = \\\"https://harrisonwl.github.io/assets/papers/tecs18.pdf\\\",\\n} \\n\\n \\n\\n\",\"author_short\":[\"Reynolds, T. N.\",\"Procter, A.\",\"Harrison, W. L.\",\"Allwein, G.\"],\"key\":\"reynolds19\",\"id\":\"reynolds19\",\"bibbaseid\":\"reynolds-procter-harrison-allwein-themechanizedmarriageofeffectsandmonadswithapplicationstohighassurancehardware-2019\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/tecs18.pdf\"},\"keyword\":[\"High-level synthesis\",\"hardware verification\",\"security\"],\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Procter\"],\"firstnames\":[\"Adam\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Graves\"],\"firstnames\":[\"Ian\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Becchi\"],\"firstnames\":[\"Michela\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]}],\"title\":\"A Principled Approach to Secure Multi-Core Processor Design with ReWire\",\"journal\":\"ACM Transactions on Embedded Computing Systems\",\"issue_date\":\"April 2017\",\"volume\":\"16\",\"number\":\"2\",\"month\":\"January\",\"year\":\"2017\",\"issn\":\"1539-9087\",\"pages\":\"33:1–33:25\",\"articleno\":\"33\",\"numpages\":\"25\",\"abstract\":\"There is no such thing as high assurance without high assurance hardware. High assurance hardware is essential, because any and all high assurance systems ultimately depend on hardware that conforms to, and does not undermine, critical system properties and invariants. And yet, high assurance hardware development is stymied by the conceptual gap between formal methods and hardware description languages used by engineers. This paper advocates a \\\\em semantics-directed approach to bridge this conceptual gap. We present a case study in the design of secure processors, which are formally derived via principled techniques grounded in functional programming and equational reasoning. The case study comprises the development of secure single- and dual-core variants of a single processor, both based on a common semantic specification of the ISA. We demonstrate via formal equational reasoning that the dual-core processor respects a ``no-write-down'' information flow policy. The semantics-directed approach enables a modular and extensible style of system design and verification. The secure processors require only a very small amount of additional code to specify and implement, and their security verification arguments are concise and readable. Our approach rests critically on ReWire, a functional programming language providing a suitable foundation for formal verification of hardware designs. This case study demonstrates both ReWire's expressiveness as a programming language and its power as a framework for formal, high-level reasoning about hardware systems. \",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/tecs16.pdf\",\"bibtex\":\"@article{procter16,                  \\n author = {Procter, Adam and Harrison, William L. and Graves, Ian and Becchi, Michela and Allwein, Gerard},\\n title = {A Principled Approach to Secure Multi-Core Processor Design with ReWire},\\n\\tjournal = {ACM Transactions on Embedded Computing Systems},\\n issue_date = {April 2017},\\n volume = {16},\\n number = {2},\\n month = jan,\\n year = {2017},\\n issn = {1539-9087},\\n pages = {33:1--33:25},\\n articleno = {33},\\n numpages = {25},\\n\\tabstract = {There is no such thing as high assurance without high assurance hardware. High assurance hardware is essential, because any and all high assurance systems ultimately depend on hardware that conforms to, and does not undermine, critical system properties and invariants. And yet, high assurance hardware development is stymied by the conceptual gap between formal methods and hardware description languages used by engineers. This paper advocates a {\\\\em semantics-directed} approach to bridge this conceptual gap. We present a case study in the design of secure processors, which are formally derived via principled techniques grounded in functional programming and equational reasoning. The case study comprises the development of secure single- and dual-core variants of a single processor, both based on a common semantic specification of the ISA. We demonstrate via formal equational reasoning that the dual-core processor respects a ``no-write-down'' information flow policy. The semantics-directed approach enables a modular and extensible style of system design and verification. The secure processors require only a very small amount of additional code to specify and implement, and their security verification arguments are concise and readable. Our approach rests critically on ReWire, a functional programming language providing a suitable foundation for formal verification of hardware designs. This case study demonstrates both ReWire's expressiveness as a programming language and its power as a framework for formal, high-level reasoning about hardware systems.\\n},\\n        url_Paper = \\\"https://harrisonwl.github.io/assets/papers/tecs16.pdf\\\",\\n}\\n\\n\\n\\n\",\"author_short\":[\"Procter, A.\",\"Harrison, W. L.\",\"Graves, I.\",\"Becchi, M.\",\"Allwein, G.\"],\"key\":\"procter16\",\"id\":\"procter16\",\"bibbaseid\":\"procter-harrison-graves-becchi-allwein-aprincipledapproachtosecuremulticoreprocessordesignwithrewire-2017\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/tecs16.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":5,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"A Programming Model for Reconfigurable Computing Based in Functional Concurrency\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Procter\"],\"firstnames\":[\"Adam\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Graves\"],\"firstnames\":[\"Ian\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Becchi\"],\"firstnames\":[\"Michela\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC 2016)\",\"year\":\"2016\",\"pages\":\"\",\"abstract\":\"FPGA programmability remains a concern with respect to the broad adoption of the technology. One reason for this is simple: FPGA applications are frequently implementations of concurrent algorithms that could be most directly rendered in concurrent languages, but there is little or no first-class support for concurrent applications in conventional hardware description languages. It stands to reason that FPGA programmability would be enhanced in a hardware description language with first-class concurrency. The starting point for this paper is a functional hardware description language with built-in support for concurrency called ReWire. Because it is a concurrent functional language, ReWire supports the elegant expression of common concurrency paradigms; we illustrate this with several case studies. \",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/recosoc16.pdf\",\"url_slides\":\"https://harrisonwl.github.io/assets/papers/slides-recosoc16.pdf\",\"bibtex\":\"@inproceedings{harrison16,\\n   title = {A Programming Model for Reconfigurable Computing Based in Functional Concurrency},\\n   author = {Harrison, William L. and Procter, Adam and Graves, Ian and Becchi, Michela and Allwein, Gerard},\\n   booktitle = {Proceedings of the 11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC 2016)},\\n   year = {2016},\\n   pages = {},\\n   abstract = {FPGA programmability remains a concern with respect to the broad adoption of the technology. One reason for this is simple: FPGA applications are frequently implementations of concurrent algorithms that could be most directly rendered in concurrent languages, but there is little or no first-class support for concurrent applications in conventional hardware description languages. It stands to reason that FPGA programmability would be enhanced in a hardware description language with first-class concurrency. The starting point for this paper is a functional hardware description language with built-in support for concurrency called ReWire. Because it is a concurrent functional language, ReWire supports the elegant expression of common concurrency paradigms; we illustrate this with several case studies. },                  \\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/recosoc16.pdf\\\",\\n   url_Slides = \\\"https://harrisonwl.github.io/assets/papers/slides-recosoc16.pdf\\\",\\n  }\\n\\n  \\n\",\"author_short\":[\"Harrison, W. L.\",\"Procter, A.\",\"Graves, I.\",\"Becchi, M.\",\"Allwein, G.\"],\"key\":\"harrison16\",\"id\":\"harrison16\",\"bibbaseid\":\"harrison-procter-graves-becchi-allwein-aprogrammingmodelforreconfigurablecomputingbasedinfunctionalconcurrency-2016\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/recosoc16.pdf\",\" slides\":\"https://harrisonwl.github.io/assets/papers/slides-recosoc16.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":5,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Graves\"],\"firstnames\":[\"Ian\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Procter\"],\"firstnames\":[\"Adam\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 2015 International Conference on Field-Programmable Technology (FPT '15)\",\"isbn\":\"978-1-4673-9091-0\",\"pages\":\"160-171\",\"publisher\":\"IEEE\",\"title\":\"Provably Correct Development of reconfigurable hardware designs via equational reasoning.\",\"year\":\"2015\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/fpt15.pdf\",\"url_slides\":\"https://harrisonwl.github.io/assets/papers/slides-fpt15.pdf\",\"bibtex\":\"@inproceedings{graves15a,\\n  author = {Graves, Ian and Procter, Adam M. and Harrison, William L. and Allwein, Gerard},\\n  booktitle = {Proceedings of the 2015 International Conference on\\nField-Programmable Technology (FPT '15)},\\n  isbn = {978-1-4673-9091-0},\\n  pages = {160-171},\\n  publisher = {IEEE},\\n  title = {Provably Correct Development of reconfigurable hardware designs via equational reasoning.},\\n  year = 2015,\\n  url_Paper = \\\"https://harrisonwl.github.io/assets/papers/fpt15.pdf\\\",\\n  url_Slides = \\\"https://harrisonwl.github.io/assets/papers/slides-fpt15.pdf\\\",\\n}\\n\\n\",\"author_short\":[\"Graves, I.\",\"Procter, A. M.\",\"Harrison, W. L.\",\"Allwein, G.\"],\"key\":\"graves15a\",\"id\":\"graves15a\",\"bibbaseid\":\"graves-procter-harrison-allwein-provablycorrectdevelopmentofreconfigurablehardwaredesignsviaequationalreasoning-2015\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/fpt15.pdf\",\" slides\":\"https://harrisonwl.github.io/assets/papers/slides-fpt15.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":10,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Procter\"],\"firstnames\":[\"Adam\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Graves\"],\"firstnames\":[\"Ian\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Becchi\"],\"firstnames\":[\"Michela\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]}],\"title\":\"Semantics Driven Hardware Design, Implementation, and Verification with ReWire\",\"booktitle\":\"Proceedings of the 16th ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2015 CD-ROM\",\"series\":\"LCTES'15\",\"year\":\"2015\",\"isbn\":\"978-1-4503-3257-6\",\"location\":\"Portland, OR, USA\",\"pages\":\"13:1–13:10\",\"articleno\":\"13\",\"numpages\":\"10\",\"abstract\":\"There is no such thing as high assurance without high assurance hardware. High assurance hardware is essential, because any and all high assurance systems ultimately depend on hardware that conforms to, and does not undermine, critical system properties and invariants. And yet, high assurance hardware development is stymied by the conceptual gap between formal methods and hardware description languages used by engineers. This paper presents ReWire, a functional programming language providing a suitable foundation for formal verification of hardware designs, and a compiler for that language that translates high-level, semantics-driven designs directly into working hardware. ReWire's design and implementation are presented, along with a case study in the design of a secure multicore processor, demonstrating both ReWire's expressiveness as a programming language and its power as a framework for formal, high-level reasoning about hardware systems.\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/lctes15.pdf\",\"bibtex\":\"@inproceedings{procter15,\\n author = {Procter, Adam and Harrison, William L. and Graves, Ian and Becchi, Michela and Allwein, Gerard},\\n title = {Semantics Driven Hardware Design, Implementation, and Verification with ReWire},\\n booktitle = {Proceedings of the 16th ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2015 CD-ROM},\\n series = {LCTES'15},\\n year = {2015},\\n isbn = {978-1-4503-3257-6},\\n location = {Portland, OR, USA},\\n pages = {13:1--13:10},\\n articleno = {13},\\n numpages = {10},\\n abstract = \\\"There is no such thing as high assurance without high assurance hardware. High assurance hardware is essential, because any and all high assurance systems ultimately depend on hardware that conforms to, and does not undermine, critical system properties and invariants. And yet, high assurance hardware development is stymied by the conceptual gap between formal methods and hardware description languages used by engineers. This paper presents ReWire, a functional programming language providing a suitable foundation for formal verification of hardware designs, and a compiler for that language that translates high-level, semantics-driven designs directly into working hardware. ReWire's design and implementation are presented, along with a case study in the design of a secure multicore processor, demonstrating both ReWire's expressiveness as a programming language and its power as a framework for formal, high-level reasoning about hardware systems.\\\",                 \\n url_Paper = {https://harrisonwl.github.io/assets/papers/lctes15.pdf},\\n} \\n\\n                  \\n\\n\",\"author_short\":[\"Procter, A.\",\"Harrison, W. L.\",\"Graves, I.\",\"Becchi, M.\",\"Allwein, G.\"],\"key\":\"procter15\",\"id\":\"procter15\",\"bibbaseid\":\"procter-harrison-graves-becchi-allwein-semanticsdrivenhardwaredesignimplementationandverificationwithrewire-2015\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/lctes15.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"incollection\",\"year\":\"2015\",\"booktitle\":\"Applied Reconfigurable Computing\",\"volume\":\"9040\",\"series\":\"Lecture Notes in Computer Science\",\"editor\":[{\"propositions\":[],\"lastnames\":[\"Sano\"],\"firstnames\":[\"Kentaro\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Soudris\"],\"firstnames\":[\"Dimitrios\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Huebner\"],\"firstnames\":[\"Michael\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diniz\"],\"firstnames\":[\"Pedro\",\"C.\"],\"suffixes\":[]}],\"title\":\"Hardware Synthesis from Functional Embedded Domain-Specific Languages: A Case Study in Regular Expression Compilation\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Graves\"],\"firstnames\":[\"Ian\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Procter\"],\"firstnames\":[\"Adam\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Becchi\"],\"firstnames\":[\"Michela\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Allwein\"],\"firstnames\":[\"Gerard\"],\"suffixes\":[]}],\"pages\":\"41-52\",\"abstract\":\"Although FPGAs have the potential to bring software-like flexibility and agility to the hardware world, designing for FPGAs remains a difficult task divorced from standard software engineering norms. A better programming flow would go far towards realizing the potential of widely deployed, programmable hardware. We propose a general methodology based on domain specific languages embedded in the functional language Haskell to bridge the gap between high level abstractions that support programmer productivity and the need for high performance in FPGA circuit implementations. We illustrate this methodology with a framework for regular expression to hardware compilers, written in Haskell, that supports high programmer productivity while producing circuits whose performance matches and, indeed, exceeds that of a state of the art, hand-optimized VHDL-based tool. For example, after applying a novel optimization pass, throughput increased an average of 28.3 percent over the state of the art tool for one set of benchmarks.\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/arc15.pdf\",\"bibtex\":\"@incollection{graves15,\\nyear={2015},\\nbooktitle={Applied Reconfigurable Computing},\\nvolume={9040},\\nseries={Lecture Notes in Computer Science},\\neditor={Sano, Kentaro and Soudris, Dimitrios and Huebner, Michael and Diniz, Pedro C.},\\ntitle={Hardware Synthesis from Functional Embedded Domain-Specific Languages: A Case Study in Regular Expression Compilation},\\nauthor={Graves, Ian and Procter, Adam and Harrison, William L. and Becchi, Michela and Allwein, Gerard},\\npages={41-52},\\nabstract = \\\"Although FPGAs have the potential to bring software-like flexibility and agility to the hardware world, designing for FPGAs remains a difficult task divorced from standard software engineering norms. A better programming flow would go far towards realizing the potential of widely deployed, programmable hardware. We propose a general methodology based on domain specific languages embedded in the functional language Haskell to bridge the gap between high level abstractions that support programmer productivity and the need for high performance in FPGA circuit implementations. We illustrate this methodology with a framework for regular expression to hardware compilers, written in Haskell, that supports high programmer productivity while producing circuits whose performance matches and, indeed, exceeds that of a state of the art, hand-optimized VHDL-based tool. For example, after applying a  novel optimization pass, throughput increased an average of 28.3 percent over the state of the art tool for one set of benchmarks.\\\",\\n url_Paper = \\\"https://harrisonwl.github.io/assets/papers/arc15.pdf\\\",\\n}\\n\\n\\n\",\"author_short\":[\"Graves, I.\",\"Procter, A.\",\"Harrison, W. L.\",\"Becchi, M.\",\"Allwein, G.\"],\"editor_short\":[\"Sano, K.\",\"Soudris, D.\",\"Huebner, M.\",\"Diniz, P. C.\"],\"key\":\"graves15\",\"id\":\"graves15\",\"bibbaseid\":\"graves-procter-harrison-becchi-allwein-hardwaresynthesisfromfunctionalembeddeddomainspecificlanguagesacasestudyinregularexpressioncompilation-2015\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/arc15.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"techreport\",\"type\":\"techreport\",\"author\":[{\"firstnames\":[\"Gerard\"],\"propositions\":[],\"lastnames\":[\"Allwein\"],\"suffixes\":[]},{\"firstnames\":[\"William\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"title\":\"Distributed Logics\",\"institution\":\"US Naval Research Laboratory\",\"number\":\"NRL/MR/5540-14-9565\",\"year\":\"2014\",\"htr\":\"yes\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/dist-logics-tech-report.pdf\",\"bibtex\":\"@TechReport{allwein14,\\n  author = \\t {Gerard Allwein and William L. Harrison},\\n  title = \\t {{Distributed Logics}},\\n  institution =  {US Naval Research Laboratory},\\n  number =       \\\"NRL/MR/5540-14-9565\\\",\\n  year = \\t 2014,\\n  htr =          \\\"yes\\\",\\n  url_Paper =    \\\"https://harrisonwl.github.io/assets/papers/dist-logics-tech-report.pdf\\\",\\n}\\n\\n\",\"author_short\":[\"Allwein, G.\",\"Harrison, W. L.\"],\"key\":\"allwein14\",\"id\":\"allwein14\",\"bibbaseid\":\"allwein-harrison-distributedlogics-2014\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/dist-logics-tech-report.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Semantics-directed Machine Architecture in ReWire\",\"booktitle\":\"Proceedings of the 2013 International Conference on Field Programmable Technology\",\"author\":[{\"firstnames\":[\"Adam\"],\"propositions\":[],\"lastnames\":[\"Procter\"],\"suffixes\":[]},{\"firstnames\":[\"William\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Ian\"],\"propositions\":[],\"lastnames\":[\"Graves\"],\"suffixes\":[]},{\"firstnames\":[\"Michela\"],\"propositions\":[],\"lastnames\":[\"Becchi\"],\"suffixes\":[]},{\"firstnames\":[\"Gerard\"],\"propositions\":[],\"lastnames\":[\"Allwein\"],\"suffixes\":[]}],\"year\":\"2013\",\"month\":\"Dec\",\"pages\":\"446-449\",\"abstract\":\"The functional programming community has developed a number of powerful abstractions for dealing with diverse programming models in a modular way. Beginning with a core of pure, side effect free computation, modular monadic semantics (MMS) allows designers to construct domain-specific languages by adding layers of semantic features, such as mutable state and I/O, in an a' la carte fashion. In the realm of interpreter and compiler construction, the benefits of this approach are manifold and well explored. This paper advocates bringing the tools of MMS to bear on hardware design and verification. In particular, we shall discuss a prototype compiler called ReWire which translates high-level MMS hardware specifications into working circuits on FPGAs. This enables designers to tackle the complexity of hardware design in a modular way, without compromising efficiency.\",\"keywords\":\"electronic engineering computing;field programmable gate arrays;formal verification;functional programming;program compilers;FPGA;MMS;ReWire;compiler construction;diverse programming models;domain-specific languages;functional programming;hardware design;modular monadic semantics;semantics-directed machine architecture;verification;Field programmable gate arrays;Hardware;Microcontrollers;Ports (Computers);Random access memory;Registers;Semantics\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/icfpt13.pdf\",\"bibtex\":\"@inproceedings{icfpt13,\\n   title = \\\"Semantics-directed Machine Architecture in ReWire\\\",\\n   booktitle = \\\"Proceedings of the 2013 International Conference on Field Programmable Technology\\\",\\n   author = \\\"Adam Procter and William L. Harrison and Ian Graves and Michela Becchi and Gerard Allwein\\\",\\n   year = 2013,\\nmonth={Dec}, \\npages={446-449}, \\nabstract={The functional programming community has developed a number of powerful abstractions for dealing with diverse programming models in a modular way. Beginning with a core of pure, side effect free computation, modular monadic semantics (MMS) allows designers to construct domain-specific languages by adding layers of semantic features, such as mutable state and I/O, in an a' la carte fashion. In the realm of interpreter and compiler construction, the benefits of this approach are manifold and well explored. This paper advocates bringing the tools of MMS to bear on hardware design and verification. In particular, we shall discuss a prototype compiler called ReWire which translates high-level MMS hardware specifications into working circuits on FPGAs. This enables designers to tackle the complexity of hardware design in a modular way, without compromising efficiency.}, \\nkeywords={electronic engineering computing;field programmable gate arrays;formal verification;functional programming;program compilers;FPGA;MMS;ReWire;compiler construction;diverse programming models;domain-specific languages;functional programming;hardware design;modular monadic semantics;semantics-directed machine architecture;verification;Field programmable gate arrays;Hardware;Microcontrollers;Ports (Computers);Random access memory;Registers;Semantics}, \\n    url_Paper = \\\"https://harrisonwl.github.io/assets/papers/icfpt13.pdf\\\",\\n}\\n\\n\",\"author_short\":[\"Procter, A.\",\"Harrison, W. L.\",\"Graves, I.\",\"Becchi, M.\",\"Allwein, G.\"],\"key\":\"icfpt13\",\"id\":\"icfpt13\",\"bibbaseid\":\"procter-harrison-graves-becchi-allwein-semanticsdirectedmachinearchitectureinrewire-2013\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/icfpt13.pdf\"},\"keyword\":[\"electronic engineering computing;field programmable gate arrays;formal verification;functional programming;program compilers;FPGA;MMS;ReWire;compiler construction;diverse programming models;domain-specific languages;functional programming;hardware design;modular monadic semantics;semantics-directed machine architecture;verification;Field programmable gate arrays;Hardware;Microcontrollers;Ports (Computers);Random access memory;Registers;Semantics\"],\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Quantitative Analysis of Error Injection Covert Channels\",\"booktitle\":\"Proceedings of the International Workshop on Quantitative Aspects in Security Assurance (QASA13)\",\"author\":[{\"firstnames\":[\"Robert\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"William\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"year\":\"2013\",\"abstract\":\"Covert channels are mechanisms for communication where a legitimate channel carries a hidden message, and where the hidden message is conveyed using legal operations of the legitimate channel. Quantitative modeling of the response of the covert channel to noise results in an enhanced understanding of the channel and delimits the range of conditions under which a covert channel can operate effectively. The analysis of two covert channels using the confusion matrix and noise models shows that the techniques presented in this paper are widely applicable to covert information flows in noisy channels.\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/interchannel.pdf\",\"bibtex\":\"@inproceedings{qasa13,\\n   title = \\\"Quantitative Analysis of Error Injection Covert Channels\\\",\\n   booktitle = \\\"Proceedings of the International Workshop on Quantitative Aspects in Security Assurance (QASA13)\\\",\\n   author = \\\"Robert Harrison and William L. Harrison\\\",\\n   year = 2013,\\n   abstract = \\\"Covert channels are mechanisms for communication where a legitimate channel carries a hidden message, and where the hidden message is conveyed using legal operations of the legitimate channel. Quantitative modeling of the response of the covert channel to noise results in an enhanced understanding of the channel and delimits the range of conditions under which a covert channel can operate effectively. The analysis of two covert channels using the confusion matrix and noise models shows that the techniques presented in this paper are widely applicable to covert information flows in noisy channels.\\\",               \\n    url_Paper = \\\"https://harrisonwl.github.io/assets/papers/interchannel.pdf\\\",\\n}\\n\\n\",\"author_short\":[\"Harrison, R.\",\"Harrison, W. L.\"],\"key\":\"qasa13\",\"id\":\"qasa13\",\"bibbaseid\":\"harrison-harrison-quantitativeanalysisoferrorinjectioncovertchannels-2013\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/interchannel.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Gerard\"],\"propositions\":[],\"lastnames\":[\"Allwein\"],\"suffixes\":[]},{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"David\"],\"propositions\":[],\"lastnames\":[\"Andrews\"],\"suffixes\":[]}],\"title\":\"Simulation logic\",\"journal\":\"Logic and Logical Philosophy\",\"volume\":\"23\",\"number\":\"3\",\"year\":\"2013\",\"month\":\"Sep.\",\"pages\":\"277–299\",\"keywords\":\"modal logic; simulations; Hilbert systems; Kripke; modal algebras\",\"abstract\":\"Simulation relations have been discovered in many areas: Computer Science, philosophical and modal logic, and set theory. However, the simulation condition is strictly a first-order logic statement. We extend modal logic with modalities and axioms, the latter's modeling conditions are the simulation conditions. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The simulations are considered arrows in a category where the objects are descriptive, general frames. One can augment the simulation modalities by axioms for requiring the underlying modeling simulations to be bisimulations or to be p-morphisms. The modal systems presented are multi-sorted and both sound and complete with respect to their algebraic and Kripke semantics.\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/llp2014.pdf\",\"bibtex\":\"@article{LLP13,\\n\\tauthor = {Gerard Allwein and William Harrison and David Andrews},\\n\\ttitle = {Simulation logic},\\n\\tjournal = {Logic and Logical Philosophy},\\n\\tvolume = {23},\\n\\tnumber = {3},\\n\\tyear = {2013},\\n        month={Sep.},\\n        pages={277–299},\\n\\tkeywords = {modal logic; simulations; Hilbert systems; Kripke; modal algebras},\\n\\tabstract = {Simulation relations have been discovered in many areas: Computer Science, philosophical and modal logic, and set theory. However, the simulation condition is strictly a first-order logic statement. We extend modal logic with modalities and axioms, the latter's modeling conditions are the simulation conditions. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The simulations are considered arrows in a category where the objects are descriptive, general frames. One can augment the simulation modalities by axioms for requiring the underlying modeling simulations to be bisimulations or to be p-morphisms. The modal systems presented are multi-sorted and both sound and complete with respect to their algebraic and Kripke semantics.},\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/llp2014.pdf\\\",\\n}\\n\\n\\n\",\"author_short\":[\"Allwein, G.\",\"Harrison, W.\",\"Andrews, D.\"],\"key\":\"LLP13\",\"id\":\"LLP13\",\"bibbaseid\":\"allwein-harrison-andrews-simulationlogic-2013\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/llp2014.pdf\"},\"keyword\":[\"modal logic; simulations; Hilbert systems; Kripke; modal algebras\"],\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"The Confinement Problem in the Presence of Faults\",\"booktitle\":\"Proceedings of the 2012 International Conference on Formal Engineering Methods\",\"author\":[{\"propositions\":[],\"lastnames\":[\"William\",\"L.\",\"Harrison\"],\"firstnames\":[\"Adam\",\"Procter\"],\"suffixes\":[]},{\"firstnames\":[\"Gerard\"],\"propositions\":[],\"lastnames\":[\"Allwein\"],\"suffixes\":[]}],\"year\":\"2012\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/icfem12.pdf\",\"abstract\":\"In this paper, we establish a semantic foundation for the safe execution of untrusted code. Our approach extends Moggi's computational $λ$-calculus in two dimensions with operations for asynchronous concurrency, shared state and software faults and with an effect type system $à$ la Wadler providing fine-grained control of effects. An equational system for fault isolation is exhibited and its soundness demonstrated with a semantics based on monad transformers. Our formalization of the equational system in the Coq theorem prover is discussed. We argue that the approach may be generalized to capture other safety properties, including information flow security.\",\"bibtex\":\"@inproceedings{ICFEM12,\\n   title = \\\"The Confinement Problem in the Presence of Faults\\\",\\n   booktitle = \\\"Proceedings of the 2012 International Conference on Formal Engineering Methods\\\",\\n   author = \\\"William L. Harrison, Adam Procter and Gerard Allwein\\\",\\n   year = 2012,\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/icfem12.pdf\\\",\\n  abstract = \\\"In this paper, we establish a semantic foundation for the safe\\nexecution of untrusted code. Our approach extends Moggi's computational $\\\\lambda$-calculus in two dimensions with operations for asynchronous concurrency, shared state and software faults and with an effect type system $\\\\grave{a}$ la Wadler providing fine-grained control of effects. An equational system for fault isolation is exhibited and its soundness demonstrated with a semantics based on monad transformers. Our formalization of the equational system in the Coq theorem prover is discussed. We argue that the approach may be generalized to capture other safety properties, including information flow security.\\\",\\n   }                  \\n                  \\n\",\"author_short\":[\"William L. Harrison, A. P.\",\"Allwein, G.\"],\"key\":\"ICFEM12\",\"id\":\"ICFEM12\",\"bibbaseid\":\"williamlharrison-allwein-theconfinementprobleminthepresenceoffaults-2012\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/icfem12.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Formal Semantics of Heterogeneous CUDA-C: A Modular Approach with Applications\",\"booktitle\":\"Proceedings of the 2012 Systems Software Verification Conference\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Chris\",\"Hathhorn\"],\"firstnames\":[\"Michela\",\"Becchi\"],\"suffixes\":[\"William\",\"L.\",\"Harrison\"]},{\"firstnames\":[\"Adam\"],\"propositions\":[],\"lastnames\":[\"Procter\"],\"suffixes\":[]}],\"year\":\"2012\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/ssv12.pdf\",\"abstract\":\"We extend an off-the-shelf, executable formal semantics of C (Ellison and Rosiu's K Framework semantics) with the core features of CUDA-C. The hybrid CPU/GPU computation model of CUDA-C presents challenges not just for programmers, but also for practitioners of formal methods. Our formal semantics helps expose and clarify these issues. We demonstrate the usefulness of our semantics by generating a tool from it capable of detecting some race conditions and deadlocks in CUDA-C programs. We discuss limitations of our model and argue that its extensibility can easily enable a wider range of verification tasks.\",\"bibtex\":\"@inproceedings{SSV12,\\n   title = \\\"Formal Semantics of Heterogeneous CUDA-C: A Modular Approach with Applications\\\",\\n   booktitle = \\\"Proceedings of the 2012 Systems Software Verification Conference\\\",\\n   author = \\\"Chris Hathhorn, Michela Becchi, William L. Harrison and Adam Procter\\\",\\n   year = 2012,\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/ssv12.pdf\\\",\\n  abstract = \\\"We extend an off-the-shelf, executable formal semantics of C (Ellison and Rosiu's K Framework semantics) with the core features of CUDA-C. The hybrid CPU/GPU computation model of CUDA-C presents challenges not just for programmers, but also for practitioners of formal methods. Our formal semantics helps expose and clarify these issues. We demonstrate the usefulness of our semantics by generating a tool from it\\ncapable of detecting some race conditions and deadlocks in CUDA-C programs. We discuss limitations of our model and argue that its extensibility can easily\\nenable a wider range of verification tasks.\\\",\\n   }                  \\n                  \\n\",\"author_short\":[\"Chris Hathhorn, M. B.\",\"Procter, A.\"],\"key\":\"SSV12\",\"id\":\"SSV12\",\"bibbaseid\":\"chrishathhorn-procter-formalsemanticsofheterogeneouscudacamodularapproachwithapplications-2012\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/ssv12.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Simulation Logic\",\"booktitle\":\"Proceedings of the 2012 Conference on Non-Classical Logics\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Gerard\",\"Allwein\"],\"firstnames\":[\"William\",\"L.\",\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"David\"],\"propositions\":[],\"lastnames\":[\"Andrews\"],\"suffixes\":[]}],\"year\":\"2012\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/ncl12.pdf\",\"abstract\":\"Simulation relations have been discovered in many areas: Computer Science, philosophical and modal logic, and set theory. However, the simulation condition is strictly a first-order logic statement. We extend modal logic with modalities and axioms, the latter's modeling conditions are the simulation conditions. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The simulations are considered arrows in a category where the objects are descriptive, general frames. One can augment the simulation modalities by axioms for requiring the underlying modeling simulations to be bisimulations or to be p-morphisms. The modal systems presented are multi-sorted and both sound and complete with respect to their algebraic and Kripke semantics.\",\"bibtex\":\"@inproceedings{NCL12,\\n   title = \\\"Simulation Logic\\\",\\n   booktitle = \\\"Proceedings of the 2012 Conference on Non-Classical Logics\\\",\\n   author = \\\"Gerard Allwein, William L. Harrison and David Andrews\\\",\\n   year = 2012,\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/ncl12.pdf\\\",\\n  abstract = \\\"Simulation relations have been discovered in many areas: Computer Science, philosophical and modal logic, and set theory. However, the simulation condition is strictly a first-order logic statement. We extend modal logic with modalities and axioms, the latter's modeling conditions are the simulation conditions. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The simulations are considered arrows in a category where the objects are descriptive, general frames. One can augment the simulation modalities by axioms for requiring the underlying modeling simulations to be bisimulations or to be p-morphisms. The modal systems presented are multi-sorted and both sound and complete with respect to their algebraic and Kripke semantics.\\\",\\n   }                  \\n                  \\n\",\"author_short\":[\"Gerard Allwein, W. L. H.\",\"Andrews, D.\"],\"key\":\"NCL12\",\"id\":\"NCL12\",\"bibbaseid\":\"gerardallwein-andrews-simulationlogic-2012\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/ncl12.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"The Design of a Practical Proof Checker for a Lazy Functional Language\",\"booktitle\":\"Proceedings of the 2012 Trends in Functional Programming Conference\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Adam\",\"Procter\"],\"firstnames\":[\"William\",\"L.\",\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Aaron\"],\"propositions\":[],\"lastnames\":[\"Stump\"],\"suffixes\":[]}],\"year\":\"2012\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/tfp12.pdf\",\"abstract\":\"Pure, lazy functional languages like Haskell provide a sound basis for formal reasoning about programs in an equational style. In practice, however, equational reasoning is underutilized. We suggest that part of the reason for this is the lack of accessible tools for developing machine-checked equational reasoning proofs. This paper outlines the design of MProver, a system which fills just that niche. MProver features first-class support for reasoning about potentially undefined computations (particularly important in a lazy setting), and an extended notion of Haskell-like type classes, enabling a highly modular style of program verification that closely follows familiar functional programming idioms.\",\"bibtex\":\"@inproceedings{TFP12,\\n   title = \\\"The Design of a Practical Proof Checker for a Lazy Functional Language\\\",\\n   booktitle = \\\"Proceedings of the 2012 Trends in Functional Programming Conference\\\",\\n   author = \\\"Adam Procter, William L. Harrison and Aaron Stump\\\",\\n   year = 2012,\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/tfp12.pdf\\\",\\n  abstract = \\\"Pure, lazy functional languages like Haskell provide a sound basis for formal reasoning about programs in an equational style. In\\npractice, however, equational reasoning is underutilized. We suggest that part\\nof the reason for this is the lack of accessible tools for developing\\nmachine-checked equational reasoning proofs. This paper outlines the design of\\nMProver, a system which fills just that niche. MProver features first-class\\nsupport for reasoning about potentially undefined computations (particularly\\nimportant in a lazy setting), and an extended notion of Haskell-like type\\nclasses, enabling a highly modular style of program verification that closely\\nfollows familiar functional programming idioms.\\\",\\n   }                  \\n                  \\n\",\"author_short\":[\"Adam Procter, W. L. H.\",\"Stump, A.\"],\"key\":\"TFP12\",\"id\":\"TFP12\",\"bibbaseid\":\"adamprocter-stump-thedesignofapracticalproofcheckerforalazyfunctionallanguage-2012\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/tfp12.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"A Channel Theoretic Account of Separation Security\",\"booktitle\":\"Proceedings of the 2011 International Conference on Engineering Reconfigurable Systems and Algorithms (ERSA11)\",\"author\":[{\"firstnames\":[\"Gerard\"],\"propositions\":[],\"lastnames\":[\"Allwein\"],\"suffixes\":[]},{\"firstnames\":[\"William\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"year\":\"2011\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/ersa2011a.pdf\",\"abstract\":\"It has long been held that information flow security models should be organized with respect to a theory of information, but typically they are not. The appeal of a information-theoretic foundation for information flow security seems natural, compelling and, indeed, almost tautological. This article illustrates how channel theory—a theory of information based in logic—can provide a basis for noninterference style security models. The evidence presented here suggests that channel theory is a useful organizing principle for information flow security.\",\"bibtex\":\"@inproceedings{ERSA2011a,\\n   title = \\\"A Channel Theoretic Account of Separation Security\\\",\\n   booktitle = \\\"Proceedings of the 2011 International Conference on Engineering Reconfigurable Systems and Algorithms (ERSA11)\\\",\\n   author = \\\"Gerard Allwein and William L. Harrison\\\",\\n   year = 2011,\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/ersa2011a.pdf\\\",\\n  abstract = \\\"It has long been held that information flow security models should be organized with respect to a theory of information, but typically they are not. The appeal of a information-theoretic foundation for information flow security seems natural, compelling and, indeed, almost tautological. This article illustrates how channel theory---a theory of information based in logic---can provide a basis for noninterference style security models. The evidence presented here suggests that channel theory is a useful organizing principle for information flow security.\\\",\\n   }\\n\\n\",\"author_short\":[\"Allwein, G.\",\"Harrison, W. L.\"],\"key\":\"ERSA2011a\",\"id\":\"ERSA2011a\",\"bibbaseid\":\"allwein-harrison-achanneltheoreticaccountofseparationsecurity-2011\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/ersa2011a.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Towards Semantics-directed System Design and Synthesis\",\"booktitle\":\"Proceedings of the 2011 International Conference on Engineering Reconfigurable Systems and Algorithms (ERSA11)\",\"author\":[{\"firstnames\":[\"William\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Benjamin\"],\"propositions\":[],\"lastnames\":[\"Schulz\"],\"suffixes\":[]},{\"firstnames\":[\"Adam\"],\"propositions\":[],\"lastnames\":[\"Procter\"],\"suffixes\":[]},{\"firstnames\":[\"Andrew\"],\"propositions\":[],\"lastnames\":[\"Lukefahr\"],\"suffixes\":[]},{\"firstnames\":[\"Gerard\"],\"propositions\":[],\"lastnames\":[\"Allwein\"],\"suffixes\":[]}],\"year\":\"2011\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/ersa2011b.pdf\",\"abstract\":\"High assurance systems have been defined as systems ``you would bet your life on.'' This article discusses the application of a form of functional programming—what we call ``monadic programming''—to the generation of high assurance and secure systems. Monadic programming languages leverage algebraic structures from denotational semantics and functional programming—monads—as a flexible, modular organizing principle for secure system design and implementation. Monadic programming languages are domain-specific functional languages that are both sufficiently expressive to express essential system behaviors and semantically straightforward to support formal verification.\",\"bibtex\":\"@inproceedings{ERSA2011b,\\n   title = \\\"Towards Semantics-directed System Design and Synthesis\\\",\\n   booktitle = \\\"Proceedings of the 2011 International Conference on Engineering Reconfigurable Systems and Algorithms (ERSA11)\\\",\\n   author = \\\"William L. Harrison and Benjamin Schulz and Adam Procter and Andrew Lukefahr and Gerard Allwein\\\",\\n   year = 2011,\\n      url_Paper = \\\"https://harrisonwl.github.io/assets/papers/ersa2011b.pdf\\\",\\n  abstract = \\\"High assurance systems have been defined as systems ``you would bet your life on.'' This article discusses the application of a form of functional programming---what we call ``monadic programming''---to the generation of high assurance and secure systems. Monadic programming languages leverage algebraic structures from denotational semantics and functional programming---monads---as a flexible, modular organizing principle for secure system design and implementation. Monadic programming languages are domain-specific functional languages that are both sufficiently expressive to express essential system behaviors and semantically straightforward to support formal verification.\\\",\\n   }   \\n\\n\",\"author_short\":[\"Harrison, W. L.\",\"Schulz, B.\",\"Procter, A.\",\"Lukefahr, A.\",\"Allwein, G.\"],\"key\":\"ERSA2011b\",\"id\":\"ERSA2011b\",\"bibbaseid\":\"harrison-schulz-procter-lukefahr-allwein-towardssemanticsdirectedsystemdesignandsynthesis-2011\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/ersa2011b.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Gerard\"],\"propositions\":[],\"lastnames\":[\"Allwein\"],\"suffixes\":[]},{\"firstnames\":[\"Yingrui\"],\"propositions\":[],\"lastnames\":[\"Yang\"],\"suffixes\":[]},{\"firstnames\":[\"William\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"title\":\"Qualitative Decision Theory via Channel Theory\",\"journal\":\"Logic and Logical Philosophy\",\"vol\":\"20\",\"year\":\"2011\",\"pages\":\"81-110\",\"note\":\"Extended version of i̧teAllweinYangHarrison:2010\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/llp2011.pdf\",\"abstract\":\"We recast parts of decision theory in terms of channel theory concentrating on qualitative issues. Channel theory allows one to move between model theoretic and language theoretic notions as is necessary for an adequate covering. Doing so clari?es decision theory and presents the opportunity to investigate alternative formulations. As an example, we take some of Savage's notions of decision theory and recast them within channel theory. In place of probabilities, we use a particular logic of preference. We introduce a logic for describing actions separate from the logic of preference over actions. The structures introduced by channel theory that represent the decision problems can be seen to be an abstract framework. This framework is very accommodating to changing the nature of the decision problems to handle different aspects or theories about decision making.\",\"bibtex\":\"@article{LLP10,\\n author = \\\"Gerard Allwein and Yingrui Yang and William L. Harrison\\\",\\n title  = \\\"Qualitative Decision Theory via Channel Theory\\\",\\n journal = \\\"Logic and Logical Philosophy\\\",\\n vol = 20,\\n year = 2011,\\n pages = {81-110},\\n note = {Extended version of \\\\cite{AllweinYangHarrison:2010}},\\n       url_Paper = \\\"https://harrisonwl.github.io/assets/papers/llp2011.pdf\\\",\\n  abstract = \\\"We recast parts of decision theory in terms of channel theory\\nconcentrating on qualitative issues. Channel theory allows one to move\\nbetween model theoretic and language theoretic notions as is necessary for\\nan adequate covering. Doing so clari?es decision theory and presents the\\nopportunity to investigate alternative formulations. As an example, we take\\nsome of Savage's notions of decision theory and recast them within channel\\ntheory. In place of probabilities, we use a particular logic of preference. We\\nintroduce a logic for describing actions separate from the logic of preference\\nover actions. The structures introduced by channel theory that represent\\nthe decision problems can be seen to be an abstract framework. This framework is very accommodating to changing the nature of the decision problems\\nto handle different aspects or theories about decision making.\\\",\\n}\\n\\n\",\"author_short\":[\"Allwein, G.\",\"Yang, Y.\",\"Harrison, W. L.\"],\"key\":\"LLP10\",\"id\":\"LLP10\",\"bibbaseid\":\"allwein-yang-harrison-qualitativedecisiontheoryviachanneltheory-2011\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/llp2011.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Gerard\"],\"propositions\":[],\"lastnames\":[\"Allwein\"],\"suffixes\":[]},{\"firstnames\":[\"Yingrui\"],\"propositions\":[],\"lastnames\":[\"Yang\"],\"suffixes\":[]},{\"firstnames\":[\"William\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"title\":\"Decision Theory via Channel Theory\",\"booktitle\":\"Proceedings of the Logic in Cognitive Science Conference, 2010, Logic and Logical Philosophy Journal\",\"publisher\":\"The Nicolaus Copernicus University Press\",\"year\":\"2010\",\"bibtex\":\"@inProceedings {AllweinYangHarrison:2010,\\nauthor    ={Gerard Allwein and Yingrui Yang and William S. Harrison},\\ntitle        ={Decision Theory via Channel Theory},\\nbooktitle    ={Proceedings of the Logic in Cognitive Science Conference, 2010, Logic and Logical Philosophy Journal},\\npublisher    ={The Nicolaus Copernicus University Press},\\nyear        ={2010},\\n}\\n\\n\",\"author_short\":[\"Allwein, G.\",\"Yang, Y.\",\"Harrison, W. S.\"],\"key\":\"AllweinYangHarrison:2010\",\"id\":\"AllweinYangHarrison:2010\",\"bibbaseid\":\"allwein-yang-harrison-decisiontheoryviachanneltheory-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Gerard\"],\"propositions\":[],\"lastnames\":[\"Allwein\"],\"suffixes\":[]},{\"firstnames\":[\"William\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"title\":\"Partially-ordered Modalities\",\"booktitle\":\"Advances in Modal Logic\",\"year\":\"2010\",\"pages\":\"1-21\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/aiml10.pdf\",\"abstract\":\"Modal logic is extended by partially ordering the modalities. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The partial order does not conflict with type of modality (K, S4, etc.) although this paper will concentrate on S4 since partially ordered S4 systems appear to be numerous. The partially-ordered normal modal systems considered are both sound and complete. Hilbert and Gentzen systems are given. A cut-elimination theorem holds (for partially ordered S4), and the Hilbert and Gentzen systems present the same logic. The partial order induces a 2-category structure on a coalgebraic formulation of descriptive frames. Channel theory is used to `move' modal logics when the source and target languages may be di\\u000berent. A particular partially ordered modal system is shown to be applicable to security properties\",\"bibtex\":\"@inproceedings{AiML10,\\n  author    = {Gerard Allwein and William L. Harrison},\\n  title     = {Partially-ordered Modalities},\\n  booktitle = {Advances in Modal Logic},\\n  year      = {2010},\\n  pages     = {1-21},\\n        url_Paper = \\\"https://harrisonwl.github.io/assets/papers/aiml10.pdf\\\",\\n  abstract = \\\"\\nModal logic is extended by partially ordering the modalities. The modalities are normal, i.e., commute\\nwith either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The partial\\norder does not conflict with type of modality (K, S4, etc.) although this paper will concentrate on S4\\nsince partially ordered S4 systems appear to be numerous. The partially-ordered normal modal systems\\nconsidered are both sound and complete. Hilbert and Gentzen systems are given. A cut-elimination theorem\\nholds (for partially ordered S4), and the Hilbert and Gentzen systems present the same logic. The partial\\norder induces a 2-category structure on a coalgebraic formulation of descriptive frames. Channel theory is\\nused to `move' modal logics when the source and target languages may be di\\u000berent. A particular partially\\nordered modal system is shown to be applicable to security properties\\\",\\n}\\n\\n\",\"author_short\":[\"Allwein, G.\",\"Harrison, W. L.\"],\"key\":\"AiML10\",\"id\":\"AiML10\",\"bibbaseid\":\"allwein-harrison-partiallyorderedmodalities-2010\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/aiml10.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"W.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Procter\"],\"suffixes\":[]},{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Agron\"],\"suffixes\":[]},{\"firstnames\":[\"G.\"],\"propositions\":[],\"lastnames\":[\"Kimmel\"],\"suffixes\":[]},{\"firstnames\":[\"G.\"],\"propositions\":[],\"lastnames\":[\"Allwein\"],\"suffixes\":[]}],\"title\":\"Model-Driven Engineering from Modular Monadic Semantics: Implementation Techniques Targeting Hardware and Software\",\"booktitle\":\"DSL '09: Proc. of the IFIP TC 2 Working Conference on Domain-Specific Languages\",\"year\":\"2009\",\"pages\":\"20–44\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/dsl09.pdf\",\"abstract\":\"Recent research has shown how the formal modeling of concurrent systems can benefit from monadic structuring. With this approach, a formal system model is really a program in a domain specific language defined by a monad for shared-state concurrency. Can these models be compiled into efficient implementations? This paper addresses this question and presents an overview of techniques for compiling monadic concurrency models directly into reasonably efficient software and hardware implementations. The implementation techniques described in this article form the basis of a semantics-directed approach to model-driven engineering.\",\"bibtex\":\"@inproceedings{dslwc09,\\nauthor = {W. Harrison and A. Procter and J. Agron and G. Kimmel and G. Allwein},\\n title = {Model-Driven Engineering from Modular Monadic Semantics: Implementation Techniques Targeting Hardware and Software},\\n booktitle = {DSL '09: Proc. of the IFIP TC 2 Working Conference on Domain-Specific Languages},\\n year = {2009},\\n pages = {20--44},\\n       url_Paper = \\\"https://harrisonwl.github.io/assets/papers/dsl09.pdf\\\",\\n  abstract = \\\"Recent research has shown how the formal modeling of concurrent systems can benefit from monadic structuring. With this approach, a formal system model is really a program in a domain specific language defined by a monad for shared-state concurrency. Can these models be compiled into efficient implementations?  This paper addresses this question and presents an overview of techniques for compiling monadic concurrency models directly into reasonably efficient software and hardware implementations. The implementation techniques described in this article form the basis of a semantics-directed approach to model-driven engineering.\\\",\\n } \\n\\n\\n\",\"author_short\":[\"Harrison, W.\",\"Procter, A.\",\"Agron, J.\",\"Kimmel, G.\",\"Allwein, G.\"],\"key\":\"dslwc09\",\"id\":\"dslwc09\",\"bibbaseid\":\"harrison-procter-agron-kimmel-allwein-modeldrivenengineeringfrommodularmonadicsemanticsimplementationtechniquestargetinghardwareandsoftware-2009\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/dsl09.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hook\"],\"firstnames\":[\"James\"],\"suffixes\":[]}],\"title\":\"Achieving information flow security through monadic control of effects\",\"journal\":\"J. Comput. Secur.\",\"volume\":\"17\",\"issue\":\"5\",\"month\":\"October\",\"year\":\"2009\",\"pages\":\"599–653\",\"numpages\":\"55\",\"publisher\":\"IOS Press\",\"address\":\"Amsterdam, The Netherlands, The Netherlands\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/jcs09.pdf\",\"abstract\":\"This paper advocates a novel approach to the construction of secure software: controlling information flow and maintaining integrity via monadic encapsulation of effects. This approach is \\\\em constructive, relying on properties of monads and monad transformers to build, verify, and extend secure software systems. We illustrate this approach by construction of abstract operating systems called \\\\em separation kernels. Starting from a mathematical model of shared-state concurrency based on monads of resumptions and state, we outline the development by stepwise refinements of separation kernels supporting Unix-like system calls, interdomain communication, and a formally verified security policy (domain separation). Because monads may be easily and safely represented within any pure, higher-order, typed functional language, the resulting system models may be directly realized within a language such as Haskell.\",\"bibtex\":\"@article{HarrisonHook09,\\n author = {Harrison, William L. and Hook, James},\\n title = {Achieving information flow security through monadic control of effects},\\n journal = {J. Comput. Secur.},\\n volume = {17},\\n issue = {5},\\n month = {October},\\n year = {2009},\\n pages = {599--653},\\n numpages = {55},\\n publisher = {IOS Press},\\n address = {Amsterdam, The Netherlands, The Netherlands},\\n       url_Paper = \\\"https://harrisonwl.github.io/assets/papers/jcs09.pdf\\\",\\n  abstract = \\\"This paper advocates a novel approach to the construction of secure\\nsoftware: controlling information flow and maintaining integrity via\\nmonadic encapsulation of effects. This approach is {\\\\em constructive},\\nrelying on properties of monads and monad transformers to build,\\nverify, and extend secure software systems. We illustrate this\\napproach by construction of abstract operating systems called {\\\\em\\n  separation kernels}. Starting from a mathematical model of\\nshared-state concurrency based on monads of resumptions and state, we\\noutline the development by stepwise refinements of separation kernels\\nsupporting Unix-like system calls, interdomain communication,  and a\\nformally verified security policy (domain separation). Because monads\\nmay be easily and safely represented within any pure, higher-order,\\ntyped functional language, the resulting system models may be directly\\nrealized within a language such as Haskell.\\\",\\n} \\n\\n\",\"author_short\":[\"Harrison, W. L.\",\"Hook, J.\"],\"key\":\"HarrisonHook09\",\"id\":\"HarrisonHook09\",\"bibbaseid\":\"harrison-hook-achievinginformationflowsecuritythroughmonadiccontrolofeffects-2009\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/jcs09.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"William\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Gerard\"],\"propositions\":[],\"lastnames\":[\"Allwein\"],\"suffixes\":[]},{\"firstnames\":[\"Andy\"],\"propositions\":[],\"lastnames\":[\"Gill\"],\"suffixes\":[]},{\"firstnames\":[\"Adam\"],\"propositions\":[],\"lastnames\":[\"Procter\"],\"suffixes\":[]}],\"title\":\"Asynchronous Exceptions as an Effect\",\"booktitle\":\"Proceedings of the Mathematics of Program Construction (MPC08)\",\"year\":\"2008\",\"pages\":\"153–176\",\"numpages\":\"24\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/mpc08.pdf\",\"abstract\":\"Asynchronous interrupts abound in computing systems, yet they remain a thorny concept for both programming and verification practice. The ubiquity of interrupts underscores the importance of developing programming models to aid the development and verification of interrupt-driven programs. The research reported here recognizes asynchronous interrupts as a computational effect and encapsulates them as a building block in modular monadic semantics. The resulting modular semantic model can serve as both a guide for functional programming with interrupts and as a formal basis for reasoning about interrupt-driven computation as well.\",\"bibtex\":\"@inproceedings{HarrisonAllwein08,\\nauthor = {William L. Harrison and Gerard Allwein and Andy Gill and Adam Procter},\\ntitle = {Asynchronous Exceptions as an Effect},\\nbooktitle = {Proceedings of the Mathematics of Program Construction (MPC08)},\\nyear = {2008},\\npages = {153--176},\\nnumpages = {24},\\n      url_Paper = \\\"https://harrisonwl.github.io/assets/papers/mpc08.pdf\\\",\\n  abstract = \\\"Asynchronous interrupts abound in computing systems, yet they remain a\\nthorny concept for both programming and verification practice.\\nThe ubiquity of interrupts underscores the importance of developing\\nprogramming models to aid the development and verification of\\ninterrupt-driven programs. \\nThe research reported here recognizes asynchronous interrupts as a\\ncomputational effect and encapsulates them as a building block in\\nmodular monadic semantics.\\nThe resulting modular semantic model can serve as both a guide for\\nfunctional programming with interrupts and as a formal basis for reasoning about\\ninterrupt-driven computation as well.\\\",\\n}\\n\\n\",\"author_short\":[\"Harrison, W. L.\",\"Allwein, G.\",\"Gill, A.\",\"Procter, A.\"],\"key\":\"HarrisonAllwein08\",\"id\":\"HarrisonAllwein08\",\"bibbaseid\":\"harrison-allwein-gill-procter-asynchronousexceptionsasaneffect-2008\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/mpc08.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Kariotis\"],\"firstnames\":[\"Pericles\",\"S.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Procter\"],\"firstnames\":[\"Adam\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Harrison\"],\"firstnames\":[\"William\",\"L.\"],\"suffixes\":[]}],\"title\":\"Making monads first-class with template haskell\",\"booktitle\":\"Proceedings of the first ACM SIGPLAN Symposium on Haskell\",\"series\":\"Haskell '08\",\"year\":\"2008\",\"location\":\"Victoria, BC, Canada\",\"pages\":\"99–110\",\"numpages\":\"12\",\"publisher\":\"ACM\",\"address\":\"New York, NY, USA\",\"keywords\":\"domain-specific languages, monads, staged programming\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/haskell08.pdf\",\"abstract\":\"Monads as an organizing principle for programming and semantics are notoriously difficult to grasp, yet they are a central and powerful abstraction in Haskell. This paper introduces a domain-specific language, MonadLab, that simplifies the construction of monads, and describes its implementation in Template Haskell. MonadLab makes monad construction truly first class, meaning that arcane theoretical issues with respect to monad transformers are completely hidden from the programmer. The motivation behind the design of MonadLab is to make monadic programming in Haskell simpler while providing a tool for non-Haskell experts that will assist them in understanding this powerful abstraction.\",\"bibtex\":\"@inproceedings{Haskell08,\\n author = {Kariotis, Pericles S. and Procter, Adam M. and Harrison, William L.},\\n title = {Making monads first-class with template haskell},\\n booktitle = {Proceedings of the first ACM SIGPLAN Symposium on Haskell},\\n series = {Haskell '08},\\n year = {2008},\\n location = {Victoria, BC, Canada},\\n pages = {99--110},\\n numpages = {12},\\n publisher = {ACM},\\n address = {New York, NY, USA},\\n keywords = {domain-specific languages, monads, staged programming},\\n       url_Paper = \\\"https://harrisonwl.github.io/assets/papers/haskell08.pdf\\\",\\n  abstract = \\\"Monads as an organizing principle for programming and semantics are notoriously difficult to grasp, yet they are a central and powerful abstraction in Haskell. This paper introduces a domain-specific language, MonadLab, that simplifies the construction of monads, and describes its implementation in Template Haskell. MonadLab makes monad construction truly first class, meaning that arcane theoretical issues with respect to monad transformers are completely hidden from the programmer. The motivation behind the design of MonadLab is to make monadic programming in Haskell simpler while providing a tool for non-Haskell experts that will assist them in understanding this powerful abstraction.\\\",\\n} \\n\\n\",\"author_short\":[\"Kariotis, P. S.\",\"Procter, A. M.\",\"Harrison, W. L.\"],\"key\":\"Haskell08\",\"id\":\"Haskell08\",\"bibbaseid\":\"kariotis-procter-harrison-makingmonadsfirstclasswithtemplatehaskell-2008\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/haskell08.pdf\"},\"keyword\":[\"domain-specific languages\",\"monads\",\"staged programming\"],\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"title\":\"Proof Abstraction for Imperative Languages\",\"year\":\"2006\",\"booktitle\":\"Proceedings of the 4th Asian Symposium on Programming Languages and Systems (APLAS06)\",\"pages\":\"97-113\",\"abstract\":\"Modularity in programming language semantics derives from abstracting over the structure of underlying denotations, yielding semantic descriptions that are more abstract and reusable. One such semantic framework is Liang's modular monadic semantics in which the underlying semantic structure is encapsulated with a monad. Such abstraction can be at odds with program verification, however, because program specifications require access to the (deliberately) hidden semantic representation. The techniques for reasoning about modular monadic definitions of imperative programs introduced here overcome this barrier. And, just like program definitions in modular monadic semantics, our program specifications and proofs are representation-independent and hold for whole classes of monads, thereby yielding proofs of great generality.\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/aplas06.pdf\",\"bibtex\":\"@InProceedings{APLAS06,\\n  author =       \\\"William Harrison\\\",\\n  title =        \\\"Proof Abstraction for Imperative Languages\\\",\\n  year =         \\\"2006\\\",\\n  booktitle = \\\"Proceedings of the 4th Asian Symposium\\n               on Programming Languages and Systems (APLAS06)\\\",\\n  pages     = {97-113}, \\n  abstract = \\\"Modularity in programming language semantics derives from abstracting over\\nthe structure of underlying denotations, yielding semantic descriptions that are more abstract and reusable. One such semantic framework is Liang's modular\\nmonadic semantics in which the underlying semantic structure is encapsulated with a monad. Such abstraction can be at odds with\\nprogram verification, however, because program specifications require access to the (deliberately) hidden semantic\\nrepresentation. The techniques for reasoning about modular monadic definitions of imperative programs introduced here overcome this barrier.\\nAnd, just like program definitions in modular monadic semantics, our program specifications and proofs are representation-independent\\nand hold for whole classes of monads, thereby yielding proofs of great generality.\\\",\\n  url_Paper = \\\"https://harrisonwl.github.io/assets/papers/aplas06.pdf\\\",\\n}\\n\\n\",\"author_short\":[\"Harrison, W.\"],\"key\":\"APLAS06\",\"id\":\"APLAS06\",\"bibbaseid\":\"harrison-proofabstractionforimperativelanguages-2006\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/aplas06.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"William\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"title\":\"The Essence of Multitasking\",\"booktitle\":\"11th International Conference on Algebraic Methodology and Software Technology (AMAST 2006)\",\"pages\":\"158-172\",\"month\":\"July\",\"year\":\"2006\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/amast06.pdf\",\"abstract\":\"This article demonstrates how a powerful and expressive abstraction from concurrency theory—monads of resumptions—plays a dual rôle as a programming tool for concurrent applications. The article demonstrates how a wide variety of typical OS behaviors may be specified in terms of resumption monads known heretofore exclusively in the literature of programming language semantics. We illustrate the expressiveness of the resumption monad with the construction of an exemplary multitasking kernel in the pure functional language Haskell. Code available at link.\",\"url_code\":\"https://harrisonwl.github.io/assets/code/EoMT.tar.gz\",\"bibtex\":\"@inproceedings{harrison06,\\n  author    = {William L. Harrison},\\n  title     = {The Essence of Multitasking},\\n  booktitle = {11th International Conference on Algebraic Methodology\\n                  and Software Technology {(AMAST 2006)}},\\n  pages     = {158-172},\\n  month     = {July},                  \\n  year      = {2006},\\n     url_Paper = \\\"https://harrisonwl.github.io/assets/papers/amast06.pdf\\\",\\n  abstract = \\\"This article demonstrates how a powerful and expressive abstraction from concurrency theory---monads of resumptions---plays a dual r\\\\^{o}le as a programming tool\\nfor concurrent applications.  \\nThe article demonstrates how a\\nwide variety of typical OS behaviors may be specified in terms of\\nresumption monads known heretofore exclusively in the literature of \\nprogramming language semantics. \\nWe illustrate the expressiveness of the resumption monad with the\\nconstruction of an exemplary \\nmultitasking kernel in the pure functional language\\nHaskell. Code available at link.\\\",\\n     url_Code = \\\"https://harrisonwl.github.io/assets/code/EoMT.tar.gz\\\",\\n}\\n\\n\\n\\n\",\"author_short\":[\"Harrison, W. L.\"],\"key\":\"harrison06\",\"id\":\"harrison06\",\"bibbaseid\":\"harrison-theessenceofmultitasking-2006\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/amast06.pdf\",\" code\":\"https://harrisonwl.github.io/assets/code/EoMT.tar.gz\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":6,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"X.\",\"Z.\"],\"propositions\":[],\"lastnames\":[\"Fu\"],\"suffixes\":[]},{\"firstnames\":[\"H.\"],\"propositions\":[],\"lastnames\":[\"Wang\"],\"suffixes\":[]},{\"firstnames\":[\"W.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"title\":\"RNA Pseudoknot Prediction Using Term Rewriting\",\"year\":\"2005\",\"journal\":\"International Journal of Data Mining and Bioinformatics\",\"abstract\":\"RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are functionally important and widely occurring structural motifs found in all types of RNA. Therefore predicting their structures is an important problem. In this paper, we present a new RNA pseudoknot structure prediction method based on term rewriting. The method is implemented using the Mfold RNA/DNA folding package and the term rewriting language Maude. In our method, RNA structures are treated as terms and rules are discovered for predicting pseudoknots. Our method was tested on 211 pseudoknots in PseudoBase and achieves an average accuracy of 74.085 percent compared to the experimentally determined structure. In fact, most pseudoknots discovered by our method achieve an accuracy of above 90 percent. These results indicate that term rewriting has a broad potential in RNA applications ranging from prediction of pseudoknots to discovery of higher level RNA structures involving complex RNA tertiary interactions.\",\"bibtex\":\"@article{ijdmb06,\\n\\tAuthor = {X. Z. Fu and H. Wang and W. Harrison and R. Harrison},\\n\\tTitle = {{RNA} Pseudoknot Prediction Using Term Rewriting},\\n\\tYear = 2005,\\n  journal =      \\\"International Journal of Data Mining and Bioinformatics\\\",\\n  abstract = \\\"RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are functionally important and widely occurring structural motifs found in all types of RNA. Therefore predicting their structures is an important problem. In this paper, we present a new RNA pseudoknot structure prediction method based on term rewriting. The method is implemented using the Mfold RNA/DNA folding package and the term rewriting language Maude. In our method, RNA structures are treated as terms and rules are discovered for predicting pseudoknots. Our method was tested on 211 pseudoknots in PseudoBase and achieves an average accuracy of 74.085 percent compared to the experimentally determined structure. In fact, most pseudoknots discovered by our method achieve an accuracy of above 90 percent. These results indicate that term rewriting has a broad potential in RNA applications ranging from prediction of pseudoknots to discovery of higher level RNA structures involving complex RNA tertiary interactions.\\\"\\n}\\n\\n                  \\n\",\"author_short\":[\"Fu, X. Z.\",\"Wang, H.\",\"Harrison, W.\",\"Harrison, R.\"],\"key\":\"ijdmb06\",\"id\":\"ijdmb06\",\"bibbaseid\":\"fu-wang-harrison-harrison-rnapseudoknotpredictionusingtermrewriting-2005\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"William\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Richard\",\"B.\"],\"propositions\":[],\"lastnames\":[\"Kieburtz\"],\"suffixes\":[]}],\"title\":\"The Logic of Demand in Haskell\",\"journal\":\"Journal of Functional Programming\",\"volume\":\"15\",\"number\":\"6\",\"year\":\"2005\",\"pages\":\"837-891\",\"hjournal\":\"yes\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/jfp05.pdf\",\"abstract\":\"Haskell is a functional programming language whose evaluation is lazy by default. However, Haskell also provides pattern matching facilities which add a modicum of eagerness to its otherwise lazy default evaluation. This mixed or \\\\emphnon-strict semantics can be quite difficult to reason with. This paper introduces a programming logic, P-Logic, which neatly formalizes the mixed evaluation in Haskell pattern-matching as a logic, thereby simplifying the task of specifying and verifying Haskell programs. In P-Logic, aspects of demand are reflected or represented within both the predicate language and its model theory, allowing for expressive and comprehensible program verification.\",\"bibtex\":\"@article{HK05,\\n  author =       \\\"William L. Harrison and Richard B. Kieburtz\\\",\\n  title =        \\\"The Logic of Demand in {H}askell\\\",\\n  journal =      \\\"Journal of Functional Programming\\\",\\n  volume  = 15,\\n  number = 6,\\n  year   = 2005,\\n  pages = {837-891},\\n  hjournal = \\\"yes\\\",\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/jfp05.pdf\\\",\\n  abstract = \\\"Haskell is a functional programming language whose\\n                  evaluation is lazy by default. However, Haskell also\\n                  provides pattern matching facilities which add a\\n                  modicum of eagerness to its otherwise lazy default\\n                  evaluation. This mixed or \\\\emph{non-strict}\\n                  semantics can be quite difficult to reason\\n                  with. This paper introduces a programming logic,\\n                  P-Logic, which neatly formalizes the mixed\\n                  evaluation in Haskell pattern-matching as a logic,\\n                  thereby simplifying the task of specifying and\\n                  verifying Haskell programs. In P-Logic, aspects of\\n                  demand are reflected or represented within both the\\n                  predicate language and its model theory, allowing\\n                  for expressive and comprehensible program\\n                  verification.\\\", \\n}\\n\\n\",\"author_short\":[\"Harrison, W. L.\",\"Kieburtz, R. B.\"],\"key\":\"HK05\",\"id\":\"HK05\",\"bibbaseid\":\"harrison-kieburtz-thelogicofdemandinhaskell-2005\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/jfp05.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"title\":\"A Simple Semantics for Polymorphic Recursion\",\"booktitle\":\"Proceedings of the 3rd Asian Symposium on Programming Languages and Systems (APLAS05)\",\"pages\":\"37-51\",\"month\":\"November\",\"year\":\"2005\",\"address\":\"Tsukuba, Japan\",\"hconf\":\"yes\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/aplas05.pdf\",\"abstract\":\"Polymorphic recursion is a useful extension of Hindley- Milner typing and has been incorporated in the functional programming language Haskell. It allows the expression of efficient algorithms that take advantage of non-uniform data structures and provides key support for generic programming. However, polymorphic recursion is, perhaps, not as broadly understood as it could be and this, in part, motivates the denotational semantics presented here. The semantics reported here also contributes an essential building block to any semantics of Haskell: a model for first-order polymorphic recursion. Furthermore, Haskell-style type classes may be described within this semantic framework in a straightforward and intuitively appealing manner.\",\"bibtex\":\"@inproceedings{APLAS05,\\n     author = \\\"William Harrison\\\",\\n     title  = \\\"A Simple Semantics for Polymorphic\\n                  Recursion\\\",\\n     booktitle = \\\"Proceedings of the 3rd Asian Symposium\\n                  on Programming Languages and Systems (APLAS05)\\\",\\n     pages     = {37-51}, \\n     month = \\\"November\\\",\\n     year = 2005,\\n     address = \\\"Tsukuba, Japan\\\",\\n     hconf = \\\"yes\\\",\\n      url_Paper = \\\"https://harrisonwl.github.io/assets/papers/aplas05.pdf\\\",\\n     abstract = \\\"Polymorphic recursion is a useful extension of Hindley-\\nMilner typing and has been incorporated in the functional programming\\nlanguage Haskell. It allows the expression of efficient algorithms\\nthat take advantage of non-uniform data structures and provides key\\nsupport for generic programming. However, polymorphic recursion is,\\nperhaps, not as broadly understood as it could be and this, in part,\\nmotivates the denotational semantics presented here. The semantics reported\\nhere also contributes an essential building block to any semantics\\nof Haskell: a model for first-order polymorphic recursion. Furthermore,\\nHaskell-style type classes may be described within this semantic framework\\nin a straightforward and intuitively appealing manner.\\\"\\n}\\n\\n\\n\",\"author_short\":[\"Harrison, W.\"],\"key\":\"APLAS05\",\"id\":\"APLAS05\",\"bibbaseid\":\"harrison-asimplesemanticsforpolymorphicrecursion-2005\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/aplas05.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"X.\",\"Z.\"],\"propositions\":[],\"lastnames\":[\"Fu\"],\"suffixes\":[]},{\"firstnames\":[\"H.\"],\"propositions\":[],\"lastnames\":[\"Wang\"],\"suffixes\":[]},{\"firstnames\":[\"W.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of IEEE Fifth Symposium on Bioinformatics and Bioengineering (BIBE05)\",\"month\":\"October\",\"title\":\"RNA Pseudoknot Prediction Using Term Rewriting\",\"year\":\"2005\",\"address\":\"Minneapolis, MN\",\"pages\":\"169-176\",\"hconf\":\"yes\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/bibe05.pdf\",\"abstract\":\"RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural motifs found in all types of RNA and are also functionally important. Therefore predicting their structures is an important problem. In this paper, we present a new RNA pseudoknot prediction model based on term rewriting rather than on dynamic programming, comparative sequence analysis, or context-free grammars. The model we describe is implemented using the Mfold RNA/DNA folding package and the term rewriting language Maude. Our model was tested on 211 pseudoknots in PseudoBase and achieves an average accuracy of 74.085% compared to the experimentally determined structure. In fact, most pseudoknots discovered by our method achieve an accuracy of above 90%. These results indicate that term rewriting has a broad potential in RNA applications from prediction of pseudoknots to higher level RNA structures involving complex RNA tertiary interactions.\",\"bibtex\":\"@inproceedings{BIBE05,\\n\\tAuthor = {X. Z. Fu and H. Wang and W. Harrison and R. Harrison},\\n\\tBooktitle = {Proceedings of IEEE Fifth Symposium on Bioinformatics and\\n  Bioengineering (BIBE05)},\\n\\tMonth = {October},\\n\\tTitle = {{RNA} Pseudoknot Prediction Using Term Rewriting},\\n\\tYear = {2005},\\n\\taddress = \\\"Minneapolis, MN\\\",\\n\\tpages = {169-176},\\n        hconf = \\\"yes\\\",\\n         url_Paper = \\\"https://harrisonwl.github.io/assets/papers/bibe05.pdf\\\",\\t\\n\\tabstract = \\\"RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural  motifs found in all types of RNA and are also functionally important. Therefore predicting their structures is an important problem. In this paper, we present a new RNA pseudoknot prediction model based on term rewriting rather than on dynamic programming, comparative sequence analysis, or context-free grammars. The model we describe is implemented using the Mfold RNA/DNA folding package and the term rewriting language Maude. Our model was tested on 211 pseudoknots in PseudoBase and achieves an average accuracy of 74.085% compared to the experimentally determined structure. In fact, most pseudoknots discovered by our method achieve an accuracy of above 90%. These results indicate that term rewriting has a broad potential in RNA applications from prediction of pseudoknots to higher level RNA structures involving complex RNA tertiary interactions.\\\",\\n}\\n\\n\",\"author_short\":[\"Fu, X. Z.\",\"Wang, H.\",\"Harrison, W.\",\"Harrison, R.\"],\"key\":\"BIBE05\",\"id\":\"BIBE05\",\"bibbaseid\":\"fu-wang-harrison-harrison-rnapseudoknotpredictionusingtermrewriting-2005\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/bibe05.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"James\"],\"propositions\":[],\"lastnames\":[\"Hook\"],\"suffixes\":[]}],\"booktitle\":\"18th IEEE Computer Security Foundations Workshop (CSFW05)\",\"month\":\"June\",\"title\":\"Achieving Information Flow Security Through Precise Control of Effects\",\"year\":\"2005\",\"address\":\"Aix-en-Provence, France\",\"pages\":\"16-30\",\"hconf\":\"yes\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/csfw05.pdf\",\"abstract\":\"This paper advocates controlling information flow and maintaining integrity via monadic encapsulation of effects. This approach is constructive, relying on properties of monads and monad transformers to build, verify, and extend secure software systems. We illustrate this approach by construction of abstract operating systems called separation kernels.\",\"bibtex\":\"@inproceedings{CSFW05,\\n\\tAuthor = {William Harrison and James Hook},\\n\\tBooktitle = {18th IEEE Computer Security Foundations Workshop (CSFW05)},\\n\\tMonth = {June},\\n\\tTitle = {Achieving Information Flow Security Through Precise Control of Effects},\\n\\tYear = {2005},\\n\\taddress = \\\"Aix-en-Provence, France\\\",\\n\\tpages = {16-30},\\n        hconf = \\\"yes\\\",\\n         url_Paper = \\\"https://harrisonwl.github.io/assets/papers/csfw05.pdf\\\",\\t\\n\\tabstract = \\\"This paper advocates controlling information flow and maintaining integrity via monadic encapsulation of effects. This approach is constructive, relying on properties of monads and monad transformers to build, verify, and extend secure software systems. We illustrate this approach by construction of abstract operating systems called separation kernels.\\\",\\n}\\n\\n\\n\\n\",\"author_short\":[\"Harrison, W.\",\"Hook, J.\"],\"key\":\"CSFW05\",\"id\":\"CSFW05\",\"bibbaseid\":\"harrison-hook-achievinginformationflowsecuritythroughprecisecontrolofeffects-2005\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/csfw05.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"William\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Robert\",\"W.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"title\":\"Domain Specific Languages for Cellular Interactions\",\"booktitle\":\"Proceedings of the 26th Annual IEEE International Conference on Engineering in Medicine and Biology (EMBC04)\",\"month\":\"September\",\"year\":\"2004\",\"hconf\":\"yes\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/embc04.pdf\",\"abstract\":\"Bioinformatics is the application of Computer Science techniques to problems in Biology, and this paper explores one such application with great potential: the modeling of life cycles of autonomous, intercommunicating cellular systems using domain-specific programming languages (DSLs). We illustrate this approach for the simple photo-synthetic bacterium \\\\emphR. Sphaeroides with a DSL called CellSys embedded in the programming language Haskell.\",\"bibtex\":\"@InProceedings{HarrisonHarrison04,\\n  author =       \\\"William L. Harrison and Robert W. Harrison\\\",\\n  title =        \\\"Domain Specific Languages for Cellular Interactions\\\",\\n  booktitle =    \\\"Proceedings of the 26th Annual IEEE International Conference on Engineering in Medicine and Biology (EMBC04)\\\",\\n  month =        \\\"September\\\",\\n  year =         \\\"2004\\\",\\n  hconf = \\\"yes\\\",\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/embc04.pdf\\\",\\n  abstract = \\\"Bioinformatics is the application of Computer Science techniques to problems in Biology, and this paper explores one such application with great potential: the modeling of life cycles of autonomous, intercommunicating cellular systems using domain-specific programming languages (DSLs). We illustrate this approach for the simple photo-synthetic bacterium \\\\emph{R. Sphaeroides} with a DSL called CellSys embedded in the programming language Haskell.\\\"\\n}\\n\\n\\n\",\"author_short\":[\"Harrison, W. L.\",\"Harrison, R. W.\"],\"key\":\"HarrisonHarrison04\",\"id\":\"HarrisonHarrison04\",\"bibbaseid\":\"harrison-harrison-domainspecificlanguagesforcellularinteractions-2004\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/embc04.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Mark\"],\"propositions\":[],\"lastnames\":[\"Tullsen\"],\"suffixes\":[]},{\"firstnames\":[\"James\"],\"propositions\":[],\"lastnames\":[\"Hook\"],\"suffixes\":[]}],\"title\":\"Domain Separation by Construction\",\"booktitle\":\"LICS03 Satellite Workshop on Foundations of Computer Security (FCS03)\",\"month\":\"June\",\"year\":\"2003\",\"note\":\"21 pages\",\"hconf\":\"yes\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/fcs03.pdf\",\"abstract\":\"This paper advocates a novel approach to language-based security: by structuring software with monads (a form of abstract data type for effects), we are able to maintain separation of effects by construction. The thesis of this work is that well-understood properties of monads and monad transformers aid in the construction and verification of secure software. We introduce a formulation of non-interference based on monads rather than the typical trace-based formulation. Using this formulation, we prove a non-interference style property for a simple instance of our system model. Because monads may be easily and safely represented within any pure, higher-order, typed functional language, the resulting system models may be directly realized within such a language.\",\"bibtex\":\"@InProceedings{DomSep03,\\n  author =       \\\"William Harrison and Mark Tullsen and James Hook\\\",\\n  title =        \\\"Domain Separation by Construction\\\",\\n  booktitle =    \\\"LICS03 Satellite Workshop on Foundations of Computer Security (FCS03)\\\",\\n  month =        \\\"June\\\",\\n  year =         \\\"2003\\\",\\n  note = \\\"21 pages\\\",\\n  hconf = \\\"yes\\\",\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/fcs03.pdf\\\",\\n  abstract = \\\"This paper advocates a novel approach to language-based security: by structuring software with monads (a form of abstract data type for effects), we are able to maintain separation of effects by construction. The thesis of this work is that well-understood properties of monads and monad transformers aid in the construction and verification of secure software. We introduce a formulation of non-interference based on monads rather than the typical trace-based formulation. Using this formulation, we prove a non-interference style property for a simple instance of our system model. Because monads may be easily and safely represented within any pure, higher-order, typed functional language, the resulting system models may be directly realized within such a language.\\\",\\n}\\n\\n\\n\",\"author_short\":[\"Harrison, W.\",\"Tullsen, M.\",\"Hook, J.\"],\"key\":\"DomSep03\",\"id\":\"DomSep03\",\"bibbaseid\":\"harrison-tullsen-hook-domainseparationbyconstruction-2003\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/fcs03.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Richard\"],\"propositions\":[],\"lastnames\":[\"Kieburtz\"],\"suffixes\":[]}],\"title\":\"Pattern-driven Reduction in Haskell\",\"booktitle\":\"2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS02)\",\"address\":\"Copenhagen, Denmark\",\"year\":\"2002\",\"hconf\":\"yes\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/wrs02.pdf\",\"abstract\":\"Haskell is a functional programming language with nominally non-strict semantics, implying that evaluation of a Haskell expression proceeds by demand-driven reduction. However, Haskell also provides pattern matching on arguments of functions, in \\\\bf let expressions and in the match clauses of \\\\bf case expressions. Pattern-matching requires data-driven reduction to the extent necessary to evaluate a pattern match or to bind variables introduced in a pattern. In this paper we provide both an abstract semantics and a logical characterization of pattern-matching in Haskell and the reduction order that it entails.\",\"bibtex\":\"@InProceedings{HK02,\\n   author = \\\"William Harrison and Richard Kieburtz\\\",\\n   title  = \\\"Pattern-driven Reduction in Haskell\\\",\\n   booktitle = \\\"2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS02)\\\",\\n   address = \\\"Copenhagen, Denmark\\\",\\n   year  = \\\"2002\\\",\\n   hconf = \\\"yes\\\",\\n    url_Paper = \\\"https://harrisonwl.github.io/assets/papers/wrs02.pdf\\\",\\n   abstract = \\\"Haskell is a functional programming language with nominally non-strict\\nsemantics, implying that evaluation of a Haskell expression proceeds by\\ndemand-driven reduction.  However, Haskell also provides pattern \\nmatching\\non arguments of functions, in {\\\\bf let} expressions and in the match\\nclauses of {\\\\bf case} expressions.  Pattern-matching requires\\ndata-driven reduction to the extent necessary to\\nevaluate a pattern match or to bind variables introduced in a pattern.\\nIn this paper we\\nprovide both an abstract semantics and a logical characterization of\\npattern-matching in Haskell and the reduction order that it entails.\\\",\\n}\\n\\n\\n\\n\",\"author_short\":[\"Harrison, W.\",\"Kieburtz, R.\"],\"key\":\"HK02\",\"id\":\"HK02\",\"bibbaseid\":\"harrison-kieburtz-patterndrivenreductioninhaskell-2002\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/wrs02.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Timothy\"],\"propositions\":[],\"lastnames\":[\"Sheard\"],\"suffixes\":[]},{\"firstnames\":[\"James\"],\"propositions\":[],\"lastnames\":[\"Hook\"],\"suffixes\":[]}],\"title\":\"Fine Control of Demand in Haskell\",\"booktitle\":\"6th International Conference on the Mathematics of Program Construction (MPC02), Dagstuhl, Germany\",\"year\":\"2002\",\"publisher\":\"Springer-Verlag\",\"volume\":\"2386\",\"pages\":\"68–93\",\"series\":\"Lecture Notes in Computer Science\",\"hconf\":\"yes\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/mpc02.pdf\",\"url_slides\":\"https://harrisonwl.github.io/assets/papers/slides-mpc02.pdf\",\"abstract\":\"Functional languages have the lambda calculus at their core, but then depart from this firm foundation by including features that alter their default evaluation order. The resulting mixed evaluation—partly lazy and partly strict—complicates the formal semantics of these languages. The functional language Haskell is such a language, with features such as pattern-matching, case expressions with guards, etc., introducing a modicum of strictness into the otherwise lazy language. But just how does Haskell differ from the lazy lambda calculus? We answer this question by introducing a calculational semantics for Haskell that exposes the interaction of its strict features with its default laziness. In the semantics, features perturbing Haskell's standard lazy evaluation order are specified computationally (i.e., monadically) rather than as pure values (i.e., functions, scalars, etc.).\",\"bibtex\":\"@InProceedings{FCDH2002,\\n  author =       \\\"William Harrison and Timothy Sheard and James Hook\\\",\\n  title =        \\\"Fine Control of Demand in {Haskell}\\\",\\n  booktitle =    \\\"6th International Conference on the Mathematics of\\n                 Program Construction (MPC02),\\n                 Dagstuhl, Germany\\\",\\n  year =         \\\"2002\\\",\\n  publisher =    \\\"Springer-Verlag\\\",\\n  volume =       \\\"2386\\\",\\n  pages =        \\\"68--93\\\",\\n  series =       \\\"Lecture Notes in Computer Science\\\",\\n  hconf = \\\"yes\\\",\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/mpc02.pdf\\\",\\n   url_Slides = \\\"https://harrisonwl.github.io/assets/papers/slides-mpc02.pdf\\\",\\n  abstract = \\\"Functional languages have the lambda calculus at their core, but then depart from this firm foundation by including features that alter their default evaluation order. The resulting mixed evaluation---partly lazy and partly strict---complicates the formal semantics of these languages. The functional language Haskell is such a language, with features such as pattern-matching, case expressions with guards, etc., introducing a modicum of strictness into the otherwise lazy language. But just how does Haskell differ from the lazy lambda calculus? We answer this question by introducing a calculational semantics for Haskell that exposes the interaction of its strict features with its default laziness. In the semantics, features perturbing Haskell's standard lazy evaluation order are specified computationally (i.e., monadically) rather than as pure values (i.e., functions, scalars, etc.).\\\"\\n}\\n\\n\\n\\n\",\"author_short\":[\"Harrison, W.\",\"Sheard, T.\",\"Hook, J.\"],\"key\":\"FCDH2002\",\"id\":\"FCDH2002\",\"bibbaseid\":\"harrison-sheard-hook-finecontrolofdemandinhaskell-2002\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/mpc02.pdf\",\" slides\":\"https://harrisonwl.github.io/assets/papers/slides-mpc02.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Bill\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Tim\"],\"propositions\":[],\"lastnames\":[\"Sheard\"],\"suffixes\":[]}],\"title\":\"Dynamically Adaptable Software with Metacomputations in a Staged Language\",\"journal\":\"Lecture Notes in Computer Science\",\"booktitle\":\"Proceedings of the Second International Workshop on Semantics, Applications, and Implementation of Program Generation (SAIG)\",\"address\":\"Florence, Italy\",\"volume\":\"2196\",\"pages\":\"163–182\",\"publisher\":\"Springer-Verlag\",\"series\":\"Lecture Notes in Computer Science\",\"year\":\"2001\",\"hconf\":\"yes\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/saig01.pdf\",\"abstract\":\"Profile-driven compiler optimizations take advantage of information gathered at runtime to re-compile programs into more efficient code. Such optimizations appear to be more easily incorporated within a semantics-directed compiler structure than within traditional compiler structure. We present a case study in which a metacomputation-based reference compiler for a small imperative language converts easily into a compiler which performs a particular profile-driven optimization: local register allocation. Our reference compiler is implemented in the staged, functional language MetaML and takes full advantage of the synergy between metacomputation-style language definitions and the staging constructs of MetaML. We believe that the approach to implementing profile-driven optimizations presented here suggests a useful, formal model for dynamically adaptable software.\",\"bibtex\":\"@InProceedings{HarrisonSheard2001,\\n  author =       \\\"Bill Harrison and Tim Sheard\\\",\\n  title =        \\\"Dynamically Adaptable Software with Metacomputations in a Staged Language\\\",\\n  journal =      \\\"Lecture Notes in Computer Science\\\",\\n  booktitle =    \\\"Proceedings of the Second International Workshop on\\n                  Semantics, Applications, and Implementation of Program Generation (SAIG)\\\",\\n  address =      \\\"Florence, Italy\\\", \\n  volume =       \\\"2196\\\",\\n  pages =        \\\"163--182\\\",\\n  publisher =    \\\"Springer-Verlag\\\",\\n  series =       \\\"Lecture Notes in Computer Science\\\",\\n  year =         \\\"2001\\\",\\n  hconf = \\\"yes\\\",\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/saig01.pdf\\\",\\n  abstract = \\\"Profile-driven compiler optimizations take advantage of information gathered at runtime to re-compile programs into more efficient code. Such optimizations appear to be more easily incorporated within a semantics-directed compiler structure than within traditional compiler structure. We present a case study in which a metacomputation-based reference compiler for a small imperative language converts easily into a compiler which performs a particular profile-driven optimization: local register allocation. Our reference compiler is implemented in the staged, functional language MetaML and takes full advantage of the synergy between metacomputation-style language definitions and the staging constructs of MetaML. We believe that the approach to implementing profile-driven optimizations presented here suggests a useful, formal model for dynamically adaptable software.\\\",\\n}\\n\\n\",\"author_short\":[\"Harrison, B.\",\"Sheard, T.\"],\"key\":\"HarrisonSheard2001\",\"id\":\"HarrisonSheard2001\",\"bibbaseid\":\"harrison-sheard-dynamicallyadaptablesoftwarewithmetacomputationsinastagedlanguage-2001\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/saig01.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"phdthesis\",\"type\":\"phdthesis\",\"author\":[{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"title\":\"Modular Compilers and Their Correctness Proofs\",\"year\":\"2001\",\"school\":\"University of Illinois at Urbana-Champaign\",\"hthesis\":\"yes\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/dissertation.pdf\",\"abstract\":\"This thesis explores the construction and correctness of modular compilers. Modular compilation is a compiler construction technique allowing the construction of compilers for high-level programming languages from reusable compiler building blocks. Modular compilers are defined in terms of denotational semantics based on monads, monad transformers, and a new model of staged computation called metacomputations. A novel form of denotational specification called observational program specification and related proof techniques are developed to assist in modular compiler verification. It will be demonstrated that the modular compilation framework provides both a level of modularity in compiler proofs as well as a useful organizing principle for such proofs.\",\"bibtex\":\"@PhdThesis{Harrison2001,\\n  author =       \\\"William Harrison\\\",\\n  title =        \\\"Modular Compilers and Their Correctness Proofs\\\",\\n  year =         \\\"2001\\\",\\n  school =       \\\"University of Illinois at Urbana-Champaign\\\",\\n  hthesis = \\\"yes\\\",\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/dissertation.pdf\\\",\\n  abstract = \\\"This thesis explores the construction and correctness of modular compilers. Modular compilation is a compiler construction technique allowing the construction of compilers for high-level programming languages from reusable compiler building blocks. Modular compilers are defined in terms of denotational semantics based on monads, monad transformers, and a new model of staged computation called metacomputations. A novel form of denotational specification called observational program specification and related proof techniques are developed to assist in modular compiler verification. It will be demonstrated that the modular compilation framework provides both a level of modularity in compiler proofs as well as a useful organizing principle for such proofs.\\\",\\n}\\n\\n\\n\\n\\n\\n\",\"author_short\":[\"Harrison, W.\"],\"key\":\"Harrison2001\",\"id\":\"Harrison2001\",\"bibbaseid\":\"harrison-modularcompilersandtheircorrectnessproofs-2001\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/dissertation.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Samuel\"],\"propositions\":[],\"lastnames\":[\"Kamin\"],\"suffixes\":[]}],\"title\":\"Metacomputation-based Compiler Architecture\",\"booktitle\":\"5th International Conference on the Mathematics of Program Construction, Ponte de Lima, Portugal\",\"year\":\"2000\",\"publisher\":\"Springer-Verlag\",\"volume\":\"1837\",\"pages\":\"213–229\",\"series\":\"Lecture Notes in Computer Science\",\"hconf\":\"yes\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/mpc00.pdf\",\"abstract\":\"This paper presents a modular and extensible style of language specification based on metacomputations. This style uses two monads to factor the static and dynamic parts of the specification, thereby staging the specification and achieving strong binding-time separation. Because metacomputations are defined in terms of monads, they can be constructed modularly and extensibly using monad transformers. Consequently, metacomputation-style specifications are modular and extensible. A number of language constructs are specified: expressions, control-flow, imperative features, block structure, and higher-order functions and recursive bindings. Because of the strong binding-time separation, metacomputation-style specification lends itself to semantics-directed compilation, which we demonstrate by creating a modular compiler for a block-structured imperative, while language.\",\"bibtex\":\"@InProceedings{HarrisonKamin2000,\\n  author =       \\\"William Harrison and Samuel Kamin\\\",\\n  title =        \\\"Metacomputation-based Compiler Architecture\\\",\\n  booktitle =    \\\"5th International Conference on the Mathematics of\\n                 Program Construction,\\n                 Ponte de Lima, Portugal\\\",\\n  year =         \\\"2000\\\",\\n  publisher =    \\\"Springer-Verlag\\\",\\n  volume =       \\\"1837\\\",\\n  pages =        \\\"213--229\\\",\\n  series =       \\\"Lecture Notes in Computer Science\\\",\\n  hconf = \\\"yes\\\",\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/mpc00.pdf\\\",\\n  abstract = \\\"This paper presents a modular and extensible style of language specification based on metacomputations. This style uses two monads to factor the static and dynamic parts of the specification, thereby staging the specification and achieving strong binding-time separation. Because metacomputations are defined in terms of monads, they can be constructed modularly and extensibly using monad transformers. Consequently, metacomputation-style specifications are modular and extensible. A number of language constructs are specified: expressions, control-flow, imperative features, block structure, and higher-order functions and recursive bindings. Because of the strong binding-time separation, metacomputation-style specification lends itself to semantics-directed compilation, which we demonstrate by creating a modular compiler for a block-structured imperative, while language.\\\",\\n}\\n\\n\\n\",\"author_short\":[\"Harrison, W.\",\"Kamin, S.\"],\"key\":\"HarrisonKamin2000\",\"id\":\"HarrisonKamin2000\",\"bibbaseid\":\"harrison-kamin-metacomputationbasedcompilerarchitecture-2000\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/mpc00.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"William\",\"L.\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Samuel\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Kamin\"],\"suffixes\":[]}],\"title\":\"Modular Compilers Based on Monad Transformers\",\"booktitle\":\"Proceedings of the 1998 International Conference on Computer Languages\",\"publisher\":\"IEEE Computer Society Press\",\"year\":\"1998\",\"isbn\":\"0-780-35005-7, 0-8186-8454-2, 0-8186-8456-9\",\"pages\":\"122–131\",\"hconf\":\"yes\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/iccl98.pdf\",\"abstract\":\"The monadic style of language specification has the advantages of modularity and extensibility: it is simple to add or change features in an interpreter to re ect modifications in the source language. It has proven difficult to extend the method to compilation. We demonstrate that by introducing machine-like stores (code and data) into the monadic semantics and then partially evaluating the resulting semantic expressions, we can achieve many of the same advantages for a compiler as for an interpreter. A number of language constructs and features are compiled: expressions, CBV and CBN evaluation of $λ$-expressions, dynamic scoping, and various imperative features. The treatment of recursive procedures is outlined as well. The resulting method allows compilers to be constructed in a mix-and-match fashion just as in a monad-structured interpreter.\",\"bibtex\":\"@InProceedings{HarrisonKamin1998,\\n  author =       \\\"William L. Harrison and Samuel N. Kamin\\\",\\n  title =        \\\"Modular Compilers Based on Monad Transformers\\\",\\n  booktitle =    \\\"Proceedings of the 1998 International Conference on\\n                 Computer Languages\\\",\\n  publisher =    \\\"IEEE Computer Society Press\\\",\\n  year =         \\\"1998\\\",\\n  ISBN =         \\\"0-780-35005-7, 0-8186-8454-2, 0-8186-8456-9\\\",\\n  pages =        \\\"122--131\\\",\\n  hconf = \\\"yes\\\",\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/iccl98.pdf\\\",\\n  abstract =     \\\"The monadic style of language specification has the\\n                 advantages of modularity and extensibility: it is\\n                 simple to add or change features in an interpreter to\\n                 re ect modifications in the source language. It has\\n                 proven difficult to extend the method to compilation.\\n                 We demonstrate that by introducing machine-like stores\\n                 (code and data) into the monadic semantics and then\\n                 partially evaluating the resulting semantic\\n                 expressions, we can achieve many of the same advantages\\n                 for a compiler as for an interpreter. A number of\\n                 language constructs and features are compiled:\\n                 expressions, CBV and CBN evaluation of\\n                 $\\\\lambda$-expressions, dynamic scoping, and various\\n                 imperative features. The treatment of recursive\\n                 procedures is outlined as well. The resulting method\\n                 allows compilers to be constructed in a mix-and-match\\n                 fashion just as in a monad-structured interpreter.\\\",\\n}\\n\\n\",\"author_short\":[\"Harrison, W. L.\",\"Kamin, S. N.\"],\"key\":\"HarrisonKamin1998\",\"id\":\"HarrisonKamin1998\",\"bibbaseid\":\"harrison-kamin-modularcompilersbasedonmonadtransformers-1998\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/iccl98.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"mastersthesis\",\"type\":\"mastersthesis\",\"author\":[{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"title\":\"Mechanizing the Axiomatic Semantics for a Programming Language with Asynchronous Send and Receive in HOL\",\"year\":\"1992\",\"school\":\"University of California, Davis\",\"hthesis\":\"yes\",\"url_paper\":\"https://harrisonwl.github.io/assets/papers/masters-thesis.pdf\",\"abstract\":\"This thesis presents the axiomatic semantics for a simple distributed language and its mechanization in HOL. The constructs of this language include asynchronous send and synchronous receive statements as well as those basic to a sequential programming language. The language has the appearance of a system programming language that supports sequential execution extended with message-passing, and would be a suitable basis for coding distributed operating systems. Included in the mechanization are functions which generate the goals associated with the verification of simple statements in the language.\",\"bibtex\":\"@MastersThesis{Harrison1992,\\n  author =       \\\"William Harrison\\\",\\n  title =        \\\"Mechanizing the Axiomatic Semantics for a Programming Language with Asynchronous Send and Receive in HOL\\\",\\n  year =         \\\"1992\\\",\\n  school =       \\\"University of California, Davis\\\",\\n  hthesis = \\\"yes\\\",\\n   url_Paper = \\\"https://harrisonwl.github.io/assets/papers/masters-thesis.pdf\\\",\\n  abstract = \\\"This thesis presents the axiomatic semantics for a simple distributed language and its mechanization in HOL. The constructs of this language include asynchronous send and synchronous receive statements as well as those basic to a sequential programming language. The language has the appearance of a system programming language that supports sequential execution extended with message-passing, and would be a suitable basis for coding distributed operating systems. Included in the mechanization are functions which generate the goals associated with the verification of simple statements in the language.\\\",\\n}\\n\\n  \\n\\n\\n\",\"author_short\":[\"Harrison, W.\"],\"key\":\"Harrison1992\",\"id\":\"Harrison1992\",\"bibbaseid\":\"harrison-mechanizingtheaxiomaticsemanticsforaprogramminglanguagewithasynchronoussendandreceiveinhol-1992\",\"role\":\"author\",\"urls\":{\" paper\":\"https://harrisonwl.github.io/assets/papers/masters-thesis.pdf\"},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Karl\"],\"propositions\":[],\"lastnames\":[\"Levitt\"],\"suffixes\":[]},{\"firstnames\":[\"Myla\"],\"propositions\":[],\"lastnames\":[\"Archer\"],\"suffixes\":[]}],\"title\":\"An HOL Mechanization of the Axiomatic Semantics of a Simple Distributed Programming Language\",\"booktitle\":\"Proceedings of the International Workshop on Higher-Order Logic Theorem Proving and Its Applications\",\"month\":\"September\",\"address\":\"Leuven, Belgium\",\"year\":\"1992\",\"pages\":\"347-358\",\"hconf\":\"yes\",\"abstract\":\"\",\"bibtex\":\"@InProceedings{harrison92,\\n  author =       \\\"William Harrison and Karl Levitt and Myla Archer\\\",\\n  title =        \\\"An HOL Mechanization of the Axiomatic Semantics of a Simple\\nDistributed Programming Language\\\",\\n  booktitle =    \\\"Proceedings of the International Workshop on Higher-Order Logic\\n  Theorem Proving and Its Applications\\\",\\n  month = \\\"September\\\",\\n  address = \\\"Leuven, Belgium\\\",\\n  year =         \\\"1992\\\",\\n  pages =        \\\"347-358\\\",\\n  hconf = \\\"yes\\\",\\n  abstract = \\\"\\\",\\n}\\n\\n\\n\",\"author_short\":[\"Harrison, W.\",\"Levitt, K.\",\"Archer, M.\"],\"key\":\"harrison92\",\"id\":\"harrison92\",\"bibbaseid\":\"harrison-levitt-archer-anholmechanizationoftheaxiomaticsemanticsofasimpledistributedprogramminglanguage-1992\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Karl\"],\"propositions\":[],\"lastnames\":[\"Levitt\"],\"suffixes\":[]}],\"title\":\"Mechanizing Security in HOL\",\"booktitle\":\"Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and its Applications\",\"publisher\":\"IEEE Computer Society Press\",\"year\":\"1991\",\"pages\":\"63–66\",\"address\":\"Davis, California\",\"hconf\":\"yes\",\"abstract\":\"\",\"bibtex\":\"@INPROCEEDINGS{MeSeHOL,\\n  AUTHOR = {William Harrison and Karl Levitt},\\n  TITLE = {Mechanizing Security in {HOL}},\\n  BOOKTITLE = {Proceedings of the 1991 International Workshop\\n            on the {HOL} Theorem Proving System and its Applications},\\n  PUBLISHER = {IEEE Computer Society Press},\\n  YEAR = {1991},\\n  PAGES = {63--66},\\n  address = \\\"Davis, California\\\",\\n  hconf = \\\"yes\\\",\\n  abstract = \\\"\\\",\\n}\\n\\n\\n\",\"author_short\":[\"Harrison, W.\",\"Levitt, K.\"],\"key\":\"MeSeHOL\",\"id\":\"MeSeHOL\",\"bibbaseid\":\"harrison-levitt-mechanizingsecurityinhol-1991\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"techreport\",\"type\":\"techreport\",\"author\":[{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]},{\"firstnames\":[\"Karl\"],\"propositions\":[],\"lastnames\":[\"Levitt\"],\"suffixes\":[]},{\"firstnames\":[\"Myla\"],\"propositions\":[],\"lastnames\":[\"Archer\"],\"suffixes\":[]}],\"title\":\"Towards a Verified Code Basis for a Secure Distributed Operating System\",\"institution\":\"University of California at Davis\",\"number\":\"CSE-92-19\",\"year\":\"1992\",\"htr\":\"yes\",\"bibtex\":\"@TechReport{tr92a,\\n  author = \\t {William Harrison and Karl Levitt and Myla Archer},\\n  title = \\t {{Towards a Verified Code Basis for a Secure Distributed Operating System}},\\n  institution =  {University of California at Davis},\\n  number =       \\\"CSE-92-19\\\",\\n  year = \\t 1992,\\n  htr =          \\\"yes\\\",\\n}\\n\\n\",\"author_short\":[\"Harrison, W.\",\"Levitt, K.\",\"Archer, M.\"],\"key\":\"tr92a\",\"id\":\"tr92a\",\"bibbaseid\":\"harrison-levitt-archer-towardsaverifiedcodebasisforasecuredistributedoperatingsystem-1992\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"techreport\",\"type\":\"techreport\",\"author\":[{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Harrison\"],\"suffixes\":[]}],\"title\":\"Mechanizing the Axiomatic Semantics for a Programming Language with Asynchronous Send and Receive in HOL\",\"institution\":\"University of California at Davis\",\"number\":\"CSE-92-20\",\"year\":\"1992\",\"htr\":\"yes\",\"bibtex\":\"@TechReport{tr92b,\\n  author = \\t {William Harrison},\\n  title = \\t {{Mechanizing the Axiomatic Semantics for a Programming Language with Asynchronous Send and Receive in HOL}},\\n  institution =  {University of California at Davis},\\n  number =       \\\"CSE-92-20\\\",\\n  year = \\t 1992,\\n  htr =          \\\"yes\\\",\\n}\\n\",\"author_short\":[\"Harrison, W.\"],\"key\":\"tr92b\",\"id\":\"tr92b\",\"bibbaseid\":\"harrison-mechanizingtheaxiomaticsemanticsforaprogramminglanguagewithasynchronoussendandreceiveinhol-1992\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\"downloads\":1,\"html\":\"\"}],\n      metadata: {\"owner\":\"harrison, w\",\"authorlinks\":{\"harrison, w\":\"https://harrisonwl.github.io/etc/publications.html\"}},\n      ownerID: \"iCiuqX2A39oLpzRv9\"\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=\"harrison.bib\" href=\"data:text/bibtex;base64,@article{CheapThreads,
  author =       "William L. Harrison and Adam Procter",
  title =        "Cheap (But Functional) Threads",
  journal =      "Higher Order and Symbolic Computation (accepted for publication)",
  note = {Draft version},
  year = 2015,                  
  abstract = "This article demonstrates how a powerful and expressive abstraction 
from concurrency theory plays a dual role as a programming tool 
for concurrent applications and as a foundation for their verification.
This abstraction---monads of resumptions expressed using monad 
transformers---is \emph{cheap}: it is easy to understand, easy to 
implement, and easy to reason about.
We illustrate the expressiveness of the resumption monad with the 
construction of an exemplary multitasking operating system kernel 
with process forking, preemption, message passing, and 
synchronization constructs in the pure functional programming 
language Haskell.
Because resumption computations are stream-like structures, reasoning 
about this kernel may be posed as reasoning about streams, a problem 
which is well-understood. And, as an example, this article 
illustrates how a liveness property---fairness---is proven and 
especially how the resumption-monadic structure promotes such 
verifications.",
  url_Paper = "https://harrisonwl.github.io/assets/papers/hosc-cheapthreads.pdf",
}



@inproceedings{harrison23,
  title = {Formalized High Level Synthesis with Applications to Cryptographic Hardware},
  author = {Harrison, William L. and Blumenfeld, Ian and Bond, Eric and Hathhorn, Chris and Li, Paul and Torrence, May and Ziegler, Jared},
  booktitle = {NASA Formal Methods Symposium (NFM23)},
  year = {2023},
  abstract = {
  Verification of hardware-based cryptographic accelerators connects a low-level RTL implementation to the abstract algorithm itself; generally, 
the more optimized for performance an accelerator is, the more challenging its verification. This paper introduces a verification methodology, \emph{model validation}, that uses a formalized high-level synthesis language (FHLS) as an intermediary between algorithm specification and hardware implementation. The foundation of our approach to model validation is a mechanized denotational semantics for the ReWire HLS language. Model validation proves the faithfulness of FHLS models to the RTL implementation and we summarize a model validation case study for a suite of pipelined Barrett multipliers.
},
  url_Paper = "https://harrisonwl.github.io/assets/papers/nfm23.pdf",
}



@inproceedings{harrison24,
  title = {Temporal Staging for Correct-by-Construction Cryptographic Hardware},
  author = {Forman, Yakir and Harrison, William L.},
  booktitle = {Rapid Systems Prototyping (RSP24)},
  year = {2024},
  abstract = {
 There is a conceptual divide between the ways cryptographic algorithms are defined (i.e., informal imperative pseudocode) and commodity hardware design languages (e.g., Verilog). How does one even begin to compare a pseudocode to an HDL design that purports to implement it in hardware? Bridging this divide requires substantial manual intervention and, consequently, ``shrinking the divide'' can drastically reduce the cost of high-assurance cryptographic hardware by reducing the cost of formal verification. We present a correct-by-construction methodology for the functional hardware design language, ReWire, in which a reference cryptographic algorithm is transformed into a provably correct hardware design with a program transformation called temporal staging. We illustrate this methodology with case studies including one for the BLAKE2b cryptographic hash function. Because the reference algorithm, the temporal staging transformation, and the resulting implementation are all expressed in ReWire, formal verification can proceed immediately via a published ReWire semantics.
},
  url_Paper = "https://harrisonwl.github.io/assets/papers/rsp24.pdf",
}

                  


@inproceedings{harrison21,
  title = {A Mechanized Semantic Metalanguage for High Level Synthesis},
  author = {Harrison, William L. and Hathhorn, Chris and Allwein, Gerard},
  booktitle = {23rd International Symposium on Principles and Practice of Declarative Programming (PPDP 2021)},
  year = {2021},
  abstract = {High-level synthesis (HLS) seeks to make hardware development more like software development by adapting ideas from programming languages to hardware description and HLS from functional languages is usually motivated as a means of bringing software-like productivity to hardware development. Formalized semantics support a range of important capabilities in software languages (e.g., compositionality, comprehensibility, interoperability, formal methods, and security) that are desirable in hardware languages as well. This paper considers the formalized semantics of the Device Calculus, a typed lambda-calculus with operators for constructing Mealy machines that forms a semantic substratum suitable for high-level synthesis and we demonstrate the utility of the Device Calculus as a foundation for formal methods in functional HLS with a case study specifying the semantics of an idealized subset of the FIRRTL language. FIRRTL  (``Flexible Internal Representation for RTL'') is an open-source hardware intermediate representation targeted by the Chisel hardware construction language and the semantics we present is also a starting point for exploring formal methods and security within both the Chisel toolchain and any other high-level synthesis flows that target FIRRTL.
},
  url_Paper = "https://harrisonwl.github.io/assets/papers/ppdp21.pdf",
}



@inproceedings{harrison20,
  title = {Verifiable Security Templates for Hardware},
  author = {Harrison, William L. and Allwein, Gerard},
  booktitle = {Proceedings of the Design, Automation, and Test Europe (DATE) Conference},
  year = {2020},
  abstract = {High-level synthesis (HLS) research generally focuses on transferring ``software engineering virtues'' (e.g., modularity, abstraction, extensibility, etc.) to hardware development with the ultimate goal of making hardware development as agile as software development. And recent HLS research has focused on transferring ideas and techniques from high assurance software formal methods to hardware development. Just as it has introduced software engineering virtues, we believe HLS can also become a vector for adapting software formal methods to the challenge of high assurance security in hardware. This paper introduces the Device Calculus and its mechanization in the Agda proof checking system. The Device Calculus is a starting point for exploring the formal methods and security of high-level synthesis flows. We illustrate the Device Calculus with a number of examples of formally verifiable security templates---i.e., functions in the Device Calculus that express common security structures at a high-level of abstraction.
},
  url_Paper = "https://harrisonwl.github.io/assets/papers/date20.pdf",
}



@inproceedings{reynolds20,
  title = {Strongly Bounded Termination with Applications to Security and Hardware Synthesis},
  author = {Reynolds, Thomas and Chadha, Rohit and Harrison, William L. and Allwein, Gerard},
  booktitle = {ACM Workshop on Type Driven Development (TyDe)},
  year = {2020},
  abstract = {Termination checking is a classic static analysis, and, within this focus, there are type-based approaches that formalize termination analysis as type systems (i.e., so that all well-typed programs terminate). But there are situations where a stronger termination property (which we call strongly- bounded termination) must be determined and, accordingly, we explore this property via a variant of the simply-typed λ-calculus called the bounded-time lambda calculus (BTC). This paper presents the BTC and its semantics and metatheory through a Coq formalization. Important examples (e.g., hardware synthesis from functional languages and detection of covert timing channels) motivating strongly-bounded termination and BTC are described as well.},
  url_Paper = "https://harrisonwl.github.io/assets/papers/tyde20.pdf",
  }



@article{allwein19,
  title = {Information Flow and Homotopy Theory},
  author = {Allwein, Gerard and Harrison, William L.},
  journal = {Journal of Logical and Algebraic Methods in Programming (under submission)},
  year = {2019},
  numpages = {38},                
  abstract = {Simulation and bisimulation are used in many areas of security in Computing Science, however the methods used do not come with a supporting logic giving the regularities of information flow. We have developed Distributed Logic to represent regularities governing information flow between localities of a distributed system, each locality can be outfitted with its own notion of state and language. The flows, either internal to a locality or between localities, follow a connection structure specified by a graph in the logic and semantically by relations in a category. We use some basic homotopy notions for use in distributed systems by using the notions as a template for properties of (bi)simulations useful for security and other properties of distributed systems. The logic can express formulas whose validity is unwritten by the (bi)simulations. This presents new ways of formalizing and proving properties of distributed systems.},
  url_Paper = "https://harrisonwl.github.io/assets/papers/dist_hom_theory.pdf",
}




@inproceedings{harrison18b,
  title = {Language Abstractions for Hardware-based Control-Flow Integrity Monitoring},
  author = {Harrison, William L. and Allwein, Gerard},
  booktitle = {Proceedings of the 2018 International Conference on Reconfigurable Computing and FPGAs},
  year = {2018},
  pages = {1-6},
  abstract = {Control-Flow Integrity (CFI) is a software protection mechanism that 
detects a class of code reuse attacks by identifying anomalous control-flows within an executing program. Hardware-based CFI has the promise of the security benefits of CFI without the performance overhead and complexity of software-based CFI: generally speaking, hardware-based monitors are more difficult to bypass, offer lower performance overheads than software-based monitors, and, furthermore, hardware-based CFI can be performed without the necessity of altering application binaries or instrumenting language compilers. Although hardware-based CFI is an active area of research and there is a growing literature describing CFI strategies at a high-level, there is, to the authors' best knowledge, no work on languages specially tailored to the specification and implementation of CFI monitors. This article presents a proof-of-concept domain-specific language with built-in abstractions for expressing control-flow constraints along with a compiler that targets the functional hardware description language ReWire. While the case study is small, it indicates, we argue, an approach to rapid-prototyping hardware-based monitors enforcing CFI that is quick, flexible, and extensible as well as being amenable to formal verification.
},
  url_Paper = "https://harrisonwl.github.io/assets/papers/reconfig18.pdf",
  url_Code  = "https://harrisonwl.github.io/assets/code/ReConFig18codebase.tar.gz",
}



@inproceedings{harrison18a,
  title = {Semantics-directed Prototyping of Hardware Runtime Monitors},
  author = {Harrison, William L. and Allwein, Gerard},
  booktitle = {Proceedings of the 29th International Symposium on Rapid System Prototyping (RSP)},
  month = Oct,
  year = {2018},
  abstract = {Building memory protection mechanisms into embedded hardware is attractive because it has the potential to neutralize a host of software-based attacks with relatively small performance overhead. A hardware monitor, being at the lowest level of the system stack, is more difficult to bypass than a software monitor and hardware-based protections are also potentially more fine-grained than is possible in software: an individual instruction executing on a processor may entail multiple memory accesses, all of which may be tracked in hardware. Finally, hardware-based protection can be performed without the necessity of altering application binaries. This article presents a proof-of-concept codesign of a small embedded processor with a hardware monitor protecting against ROP-style code reuse attacks. While the case study is small, it indicates, we argue, an approach to rapid-prototyping runtime monitors in hardware that is quick, flexible, and extensible as well as being amenable to formal verification.},
  url_Paper = "https://harrisonwl.github.io/assets/papers/rsp18.pdf",
}




@inproceedings{reynolds17,
  title = {A Core Calculus for Secure Hardware: Its Formal Semantics and Proof System},
  author = {Reynolds, Thomas N. and Procter, Adam and Harrison, William L. and Allwein, Gerard},
  booktitle = {Proceedings of the 15th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE17)},
  year = {2017},
  abstract = {Constructing high assurance, secure hardware remains a challenge, because to do so relies on both a verifiable means of hardware description and implementation. However, production hardware description languages (HDL) lack the formal underpinnings required by formal methods in security. Still, there is no such thing as high assurance systems without high assurance hardware. We present a core calculus of secure hardware description with its formal semantics, security type system and mechanization in Coq. This calculus is the core of the functional HDL, ReWire, shown in previous work to have useful applications in reconfigurable computing. This work supports a full-fledged, formal methodology for producing high assurance hardware.},
  url_Paper = "https://harrisonwl.github.io/assets/papers/memocode17.pdf",
}
                  


@article{allwein17,
	author = {Gerard Allwein and William L. Harrison and Thomas Reynolds},
	title = {Distributed Relation Logic},
	journal = {Logic and Logical Philosophy},
	volume = {26},
	number = {1},
        pages = {19-61},          
	year = {2017},
	keywords = {relation algebra; multisorted algebra; distributed logic; Kripke frames; Kripke models},
	abstract = {We extend the relational algebra of Chin and Tarski so that it is multisorted or, as we prefer, typed. Each type supports a local Boolean algebra outfitted with a converse operator. From Lyndon, we know that relation algebras cannot be represented as proper relation algebras where a proper relation algebra has binary relations as elements and the algebra is singly-typed. Here, the intensional conjunction, which was to represent relational composition in Chin and Tarski, spans three different local algebras, thus the term distributed in the title. Since we do not rely on proper relation algebras, we are free to re-express the algebras as typed. In doing so, we allow many different intensional conjunction operators.We construct a typed logic over these algebras, also known as heterogeneous algebras of Birkhoff and Lipson. The logic can be seen as a form of relevance logic with a classical negation connective where the Routley-Meyer star operator is reified as a converse connective in the logic. Relevance logic itself is not typed but our work shows how it can be made so. Some of the properties of classical relevance logic are weakened from Routley-Meyer’s version which is too strong for a logic over relation algebras.},
	issn = {2300-9802},
   url_Paper = "https://harrisonwl.github.io/assets/papers/llp17.pdf",

}
                  


@inproceedings{harrison16a,
   title = {Model-driven Design \& Synthesis of the SHA-256 Cryptographic Hash Function in ReWire},
   author = {Harrison, William L. and Procter, Adam and Allwein, Gerard},
   booktitle = {Proceedings of the 27th International Symposium on Rapid System Prototyping (RSP)},
   year = {2016},
   pages = {1-7},
   abstract = {There are many algorithms whose implementations can benefit both from hardware acceleration and formal verification and we would like to develop high assurance implementations as rapidly as possible. Critical computing infrastructure like cryptographic algorithms are prime candidates both for such acceleration and for formal verification. We show how to derive a verifiable, hardware-accelerated implementation of the SHA-256 cryptographic hash in the ReWire functional hardware description language in which the partitioning of the implementation between hardware and software is reflected in the type system itself.
},
   url_Paper = "https://harrisonwl.github.io/assets/papers/rsp16.pdf",
   url_Slides = "https://harrisonwl.github.io/assets/papers/slides-rsp16.pdf",
  }
                  


@incollection{allwein2016a,
author = "Allwein, Gerard and Harrison, William L.",
editor = "Bimb{\'o}, Katalin",
title = "Distributed Modal Logic",
bookTitle = "J. Michael Dunn on Information Based Logics",
year = "2016",
publisher = "Springer International Publishing",
pages = "331--362",
isbn = "978-3-319-29300-4",
url="http://dx.doi.org/10.1007/978-3-319-29300-4_16"
}
                  


@incollection{allwein2022,
author = "Allwein, Gerard and Harrison, William L.",
editor = "Bimb{\'o}, Katalin",
title = "Distributed Relation Algebra",
bookTitle = "Relevance Logics and other Tools for Reasoning. Essays in Honor of J. Michael Dunn",
year = "2022",
publisher = "College Publications",
pages = "1-30",
isbn = "978-1-84890-395-1",
abstract = {We define some extra relation operators in Relation Algebras and examine the relationship between Relation Algebras and Relevance Logic. We then extract binary relations from Kripke models of Relation Algebras and extend those to Distributed Relation Algebras. The term distribution refers to using a multigraph of local logics connected by the relation operators. In the context of Kripke frames for Relation Algebras, the distribution refers to a multigraph of Stone spaces each supporting a local Kripke frame. There are then distributed Kripke relations connecting the local frames. Finally, we show the relationship between the relation operators and Kan extensions and lifts from category theory.},
        url_Paper = "https://harrisonwl.github.io/assets/papers/dist_rel_alg.pdf",
}



@article{reynolds19,
 author = {Reynolds, Thomas N. and Procter, Adam and Harrison, William L. and Allwein, Gerard},
 title = {The Mechanized Marriage of Effects and Monads with Applications to High-assurance Hardware},
 journal = {ACM Transactions on Embedded Computing Systems},
 issue_date = {February 2019},
 volume = {18},
 number = {1},
 month = jan,
 year = {2019},
 issn = {1539-9087},
 pages = {6:1--6:26},
 articleno = {6},
 numpages = {26},
 keywords = {High-level synthesis, hardware verification, security},
	abstract = {
		Constructing high assurance, secure hardware remains a challenge, because to do so relies on both a verifiable means of hardware description and implementation. 
	However, production hardware description languages (HDL) lack the formal underpinnings required by formal methods in security.
	Still, there is no such thing as high assurance systems without high assurance hardware.
	We present a core calculus of secure hardware description with its formal semantics, security type system and mechanization in Coq. 
	This calculus is the core of the functional HDL, ReWire, shown in previous work to have useful applications in reconfigurable computing.
	This work supports a full-fledged, formal methodology for producing high assurance hardware.
},
        url_Paper = "https://harrisonwl.github.io/assets/papers/tecs18.pdf",
} 

 



@article{procter16,                  
 author = {Procter, Adam and Harrison, William L. and Graves, Ian and Becchi, Michela and Allwein, Gerard},
 title = {A Principled Approach to Secure Multi-Core Processor Design with ReWire},
	journal = {ACM Transactions on Embedded Computing Systems},
 issue_date = {April 2017},
 volume = {16},
 number = {2},
 month = jan,
 year = {2017},
 issn = {1539-9087},
 pages = {33:1--33:25},
 articleno = {33},
 numpages = {25},
	abstract = {There is no such thing as high assurance without high assurance hardware. High assurance hardware is essential, because any and all high assurance systems ultimately depend on hardware that conforms to, and does not undermine, critical system properties and invariants. And yet, high assurance hardware development is stymied by the conceptual gap between formal methods and hardware description languages used by engineers. This paper advocates a {\em semantics-directed} approach to bridge this conceptual gap. We present a case study in the design of secure processors, which are formally derived via principled techniques grounded in functional programming and equational reasoning. The case study comprises the development of secure single- and dual-core variants of a single processor, both based on a common semantic specification of the ISA. We demonstrate via formal equational reasoning that the dual-core processor respects a ``no-write-down'' information flow policy. The semantics-directed approach enables a modular and extensible style of system design and verification. The secure processors require only a very small amount of additional code to specify and implement, and their security verification arguments are concise and readable. Our approach rests critically on ReWire, a functional programming language providing a suitable foundation for formal verification of hardware designs. This case study demonstrates both ReWire's expressiveness as a programming language and its power as a framework for formal, high-level reasoning about hardware systems.
},
        url_Paper = "https://harrisonwl.github.io/assets/papers/tecs16.pdf",
}





@inproceedings{harrison16,
   title = {A Programming Model for Reconfigurable Computing Based in Functional Concurrency},
   author = {Harrison, William L. and Procter, Adam and Graves, Ian and Becchi, Michela and Allwein, Gerard},
   booktitle = {Proceedings of the 11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC 2016)},
   year = {2016},
   pages = {},
   abstract = {FPGA programmability remains a concern with respect to the broad adoption of the technology. One reason for this is simple: FPGA applications are frequently implementations of concurrent algorithms that could be most directly rendered in concurrent languages, but there is little or no first-class support for concurrent applications in conventional hardware description languages. It stands to reason that FPGA programmability would be enhanced in a hardware description language with first-class concurrency. The starting point for this paper is a functional hardware description language with built-in support for concurrency called ReWire. Because it is a concurrent functional language, ReWire supports the elegant expression of common concurrency paradigms; we illustrate this with several case studies. },                  
   url_Paper = "https://harrisonwl.github.io/assets/papers/recosoc16.pdf",
   url_Slides = "https://harrisonwl.github.io/assets/papers/slides-recosoc16.pdf",
  }

  


@inproceedings{graves15a,
  author = {Graves, Ian and Procter, Adam M. and Harrison, William L. and Allwein, Gerard},
  booktitle = {Proceedings of the 2015 International Conference on
Field-Programmable Technology (FPT '15)},
  isbn = {978-1-4673-9091-0},
  pages = {160-171},
  publisher = {IEEE},
  title = {Provably Correct Development of reconfigurable hardware designs via equational reasoning.},
  year = 2015,
  url_Paper = "https://harrisonwl.github.io/assets/papers/fpt15.pdf",
  url_Slides = "https://harrisonwl.github.io/assets/papers/slides-fpt15.pdf",
}



@inproceedings{procter15,
 author = {Procter, Adam and Harrison, William L. and Graves, Ian and Becchi, Michela and Allwein, Gerard},
 title = {Semantics Driven Hardware Design, Implementation, and Verification with ReWire},
 booktitle = {Proceedings of the 16th ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2015 CD-ROM},
 series = {LCTES'15},
 year = {2015},
 isbn = {978-1-4503-3257-6},
 location = {Portland, OR, USA},
 pages = {13:1--13:10},
 articleno = {13},
 numpages = {10},
 abstract = "There is no such thing as high assurance without high assurance hardware. High assurance hardware is essential, because any and all high assurance systems ultimately depend on hardware that conforms to, and does not undermine, critical system properties and invariants. And yet, high assurance hardware development is stymied by the conceptual gap between formal methods and hardware description languages used by engineers. This paper presents ReWire, a functional programming language providing a suitable foundation for formal verification of hardware designs, and a compiler for that language that translates high-level, semantics-driven designs directly into working hardware. ReWire's design and implementation are presented, along with a case study in the design of a secure multicore processor, demonstrating both ReWire's expressiveness as a programming language and its power as a framework for formal, high-level reasoning about hardware systems.",                 
 url_Paper = {https://harrisonwl.github.io/assets/papers/lctes15.pdf},
} 

                  



@incollection{graves15,
year={2015},
booktitle={Applied Reconfigurable Computing},
volume={9040},
series={Lecture Notes in Computer Science},
editor={Sano, Kentaro and Soudris, Dimitrios and Huebner, Michael and Diniz, Pedro C.},
title={Hardware Synthesis from Functional Embedded Domain-Specific Languages: A Case Study in Regular Expression Compilation},
author={Graves, Ian and Procter, Adam and Harrison, William L. and Becchi, Michela and Allwein, Gerard},
pages={41-52},
abstract = "Although FPGAs have the potential to bring software-like flexibility and agility to the hardware world, designing for FPGAs remains a difficult task divorced from standard software engineering norms. A better programming flow would go far towards realizing the potential of widely deployed, programmable hardware. We propose a general methodology based on domain specific languages embedded in the functional language Haskell to bridge the gap between high level abstractions that support programmer productivity and the need for high performance in FPGA circuit implementations. We illustrate this methodology with a framework for regular expression to hardware compilers, written in Haskell, that supports high programmer productivity while producing circuits whose performance matches and, indeed, exceeds that of a state of the art, hand-optimized VHDL-based tool. For example, after applying a  novel optimization pass, throughput increased an average of 28.3 percent over the state of the art tool for one set of benchmarks.",
 url_Paper = "https://harrisonwl.github.io/assets/papers/arc15.pdf",
}




@TechReport{allwein14,
  author = 	 {Gerard Allwein and William L. Harrison},
  title = 	 {{Distributed Logics}},
  institution =  {US Naval Research Laboratory},
  number =       "NRL/MR/5540-14-9565",
  year = 	 2014,
  htr =          "yes",
  url_Paper =    "https://harrisonwl.github.io/assets/papers/dist-logics-tech-report.pdf",
}



@inproceedings{icfpt13,
   title = "Semantics-directed Machine Architecture in ReWire",
   booktitle = "Proceedings of the 2013 International Conference on Field Programmable Technology",
   author = "Adam Procter and William L. Harrison and Ian Graves and Michela Becchi and Gerard Allwein",
   year = 2013,
month={Dec}, 
pages={446-449}, 
abstract={The functional programming community has developed a number of powerful abstractions for dealing with diverse programming models in a modular way. Beginning with a core of pure, side effect free computation, modular monadic semantics (MMS) allows designers to construct domain-specific languages by adding layers of semantic features, such as mutable state and I/O, in an a' la carte fashion. In the realm of interpreter and compiler construction, the benefits of this approach are manifold and well explored. This paper advocates bringing the tools of MMS to bear on hardware design and verification. In particular, we shall discuss a prototype compiler called ReWire which translates high-level MMS hardware specifications into working circuits on FPGAs. This enables designers to tackle the complexity of hardware design in a modular way, without compromising efficiency.}, 
keywords={electronic engineering computing;field programmable gate arrays;formal verification;functional programming;program compilers;FPGA;MMS;ReWire;compiler construction;diverse programming models;domain-specific languages;functional programming;hardware design;modular monadic semantics;semantics-directed machine architecture;verification;Field programmable gate arrays;Hardware;Microcontrollers;Ports (Computers);Random access memory;Registers;Semantics}, 
    url_Paper = "https://harrisonwl.github.io/assets/papers/icfpt13.pdf",
}



@inproceedings{qasa13,
   title = "Quantitative Analysis of Error Injection Covert Channels",
   booktitle = "Proceedings of the International Workshop on Quantitative Aspects in Security Assurance (QASA13)",
   author = "Robert Harrison and William L. Harrison",
   year = 2013,
   abstract = "Covert channels are mechanisms for communication where a legitimate channel carries a hidden message, and where the hidden message is conveyed using legal operations of the legitimate channel. Quantitative modeling of the response of the covert channel to noise results in an enhanced understanding of the channel and delimits the range of conditions under which a covert channel can operate effectively. The analysis of two covert channels using the confusion matrix and noise models shows that the techniques presented in this paper are widely applicable to covert information flows in noisy channels.",               
    url_Paper = "https://harrisonwl.github.io/assets/papers/interchannel.pdf",
}



@article{LLP13,
	author = {Gerard Allwein and William Harrison and David Andrews},
	title = {Simulation logic},
	journal = {Logic and Logical Philosophy},
	volume = {23},
	number = {3},
	year = {2013},
        month={Sep.},
        pages={277–299},
	keywords = {modal logic; simulations; Hilbert systems; Kripke; modal algebras},
	abstract = {Simulation relations have been discovered in many areas: Computer Science, philosophical and modal logic, and set theory. However, the simulation condition is strictly a first-order logic statement. We extend modal logic with modalities and axioms, the latter's modeling conditions are the simulation conditions. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The simulations are considered arrows in a category where the objects are descriptive, general frames. One can augment the simulation modalities by axioms for requiring the underlying modeling simulations to be bisimulations or to be p-morphisms. The modal systems presented are multi-sorted and both sound and complete with respect to their algebraic and Kripke semantics.},
   url_Paper = "https://harrisonwl.github.io/assets/papers/llp2014.pdf",
}




@inproceedings{ICFEM12,
   title = "The Confinement Problem in the Presence of Faults",
   booktitle = "Proceedings of the 2012 International Conference on Formal Engineering Methods",
   author = "William L. Harrison, Adam Procter and Gerard Allwein",
   year = 2012,
   url_Paper = "https://harrisonwl.github.io/assets/papers/icfem12.pdf",
  abstract = "In this paper, we establish a semantic foundation for the safe
execution of untrusted code. Our approach extends Moggi's computational $\lambda$-calculus in two dimensions with operations for asynchronous concurrency, shared state and software faults and with an effect type system $\grave{a}$ la Wadler providing fine-grained control of effects. An equational system for fault isolation is exhibited and its soundness demonstrated with a semantics based on monad transformers. Our formalization of the equational system in the Coq theorem prover is discussed. We argue that the approach may be generalized to capture other safety properties, including information flow security.",
   }                  
                  


@inproceedings{SSV12,
   title = "Formal Semantics of Heterogeneous CUDA-C: A Modular Approach with Applications",
   booktitle = "Proceedings of the 2012 Systems Software Verification Conference",
   author = "Chris Hathhorn, Michela Becchi, William L. Harrison and Adam Procter",
   year = 2012,
   url_Paper = "https://harrisonwl.github.io/assets/papers/ssv12.pdf",
  abstract = "We extend an off-the-shelf, executable formal semantics of C (Ellison and Rosiu's K Framework semantics) with the core features of CUDA-C. The hybrid CPU/GPU computation model of CUDA-C presents challenges not just for programmers, but also for practitioners of formal methods. Our formal semantics helps expose and clarify these issues. We demonstrate the usefulness of our semantics by generating a tool from it
capable of detecting some race conditions and deadlocks in CUDA-C programs. We discuss limitations of our model and argue that its extensibility can easily
enable a wider range of verification tasks.",
   }                  
                  


@inproceedings{NCL12,
   title = "Simulation Logic",
   booktitle = "Proceedings of the 2012 Conference on Non-Classical Logics",
   author = "Gerard Allwein, William L. Harrison and David Andrews",
   year = 2012,
   url_Paper = "https://harrisonwl.github.io/assets/papers/ncl12.pdf",
  abstract = "Simulation relations have been discovered in many areas: Computer Science, philosophical and modal logic, and set theory. However, the simulation condition is strictly a first-order logic statement. We extend modal logic with modalities and axioms, the latter's modeling conditions are the simulation conditions. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The simulations are considered arrows in a category where the objects are descriptive, general frames. One can augment the simulation modalities by axioms for requiring the underlying modeling simulations to be bisimulations or to be p-morphisms. The modal systems presented are multi-sorted and both sound and complete with respect to their algebraic and Kripke semantics.",
   }                  
                  


@inproceedings{TFP12,
   title = "The Design of a Practical Proof Checker for a Lazy Functional Language",
   booktitle = "Proceedings of the 2012 Trends in Functional Programming Conference",
   author = "Adam Procter, William L. Harrison and Aaron Stump",
   year = 2012,
   url_Paper = "https://harrisonwl.github.io/assets/papers/tfp12.pdf",
  abstract = "Pure, lazy functional languages like Haskell provide a sound basis for formal reasoning about programs in an equational style. In
practice, however, equational reasoning is underutilized. We suggest that part
of the reason for this is the lack of accessible tools for developing
machine-checked equational reasoning proofs. This paper outlines the design of
MProver, a system which fills just that niche. MProver features first-class
support for reasoning about potentially undefined computations (particularly
important in a lazy setting), and an extended notion of Haskell-like type
classes, enabling a highly modular style of program verification that closely
follows familiar functional programming idioms.",
   }                  
                  


@inproceedings{ERSA2011a,
   title = "A Channel Theoretic Account of Separation Security",
   booktitle = "Proceedings of the 2011 International Conference on Engineering Reconfigurable Systems and Algorithms (ERSA11)",
   author = "Gerard Allwein and William L. Harrison",
   year = 2011,
   url_Paper = "https://harrisonwl.github.io/assets/papers/ersa2011a.pdf",
  abstract = "It has long been held that information flow security models should be organized with respect to a theory of information, but typically they are not. The appeal of a information-theoretic foundation for information flow security seems natural, compelling and, indeed, almost tautological. This article illustrates how channel theory---a theory of information based in logic---can provide a basis for noninterference style security models. The evidence presented here suggests that channel theory is a useful organizing principle for information flow security.",
   }



@inproceedings{ERSA2011b,
   title = "Towards Semantics-directed System Design and Synthesis",
   booktitle = "Proceedings of the 2011 International Conference on Engineering Reconfigurable Systems and Algorithms (ERSA11)",
   author = "William L. Harrison and Benjamin Schulz and Adam Procter and Andrew Lukefahr and Gerard Allwein",
   year = 2011,
      url_Paper = "https://harrisonwl.github.io/assets/papers/ersa2011b.pdf",
  abstract = "High assurance systems have been defined as systems ``you would bet your life on.'' This article discusses the application of a form of functional programming---what we call ``monadic programming''---to the generation of high assurance and secure systems. Monadic programming languages leverage algebraic structures from denotational semantics and functional programming---monads---as a flexible, modular organizing principle for secure system design and implementation. Monadic programming languages are domain-specific functional languages that are both sufficiently expressive to express essential system behaviors and semantically straightforward to support formal verification.",
   }   



@article{LLP10,
 author = "Gerard Allwein and Yingrui Yang and William L. Harrison",
 title  = "Qualitative Decision Theory via Channel Theory",
 journal = "Logic and Logical Philosophy",
 vol = 20,
 year = 2011,
 pages = {81-110},
 note = {Extended version of \cite{AllweinYangHarrison:2010}},
       url_Paper = "https://harrisonwl.github.io/assets/papers/llp2011.pdf",
  abstract = "We recast parts of decision theory in terms of channel theory
concentrating on qualitative issues. Channel theory allows one to move
between model theoretic and language theoretic notions as is necessary for
an adequate covering. Doing so clari?es decision theory and presents the
opportunity to investigate alternative formulations. As an example, we take
some of Savage's notions of decision theory and recast them within channel
theory. In place of probabilities, we use a particular logic of preference. We
introduce a logic for describing actions separate from the logic of preference
over actions. The structures introduced by channel theory that represent
the decision problems can be seen to be an abstract framework. This framework is very accommodating to changing the nature of the decision problems
to handle different aspects or theories about decision making.",
}



@inProceedings {AllweinYangHarrison:2010,
author    ={Gerard Allwein and Yingrui Yang and William S. Harrison},
title        ={Decision Theory via Channel Theory},
booktitle    ={Proceedings of the Logic in Cognitive Science Conference, 2010, Logic and Logical Philosophy Journal},
publisher    ={The Nicolaus Copernicus University Press},
year        ={2010},
}



@inproceedings{AiML10,
  author    = {Gerard Allwein and William L. Harrison},
  title     = {Partially-ordered Modalities},
  booktitle = {Advances in Modal Logic},
  year      = {2010},
  pages     = {1-21},
        url_Paper = "https://harrisonwl.github.io/assets/papers/aiml10.pdf",
  abstract = "
Modal logic is extended by partially ordering the modalities. The modalities are normal, i.e., commute
with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The partial
order does not conflict with type of modality (K, S4, etc.) although this paper will concentrate on S4
since partially ordered S4 systems appear to be numerous. The partially-ordered normal modal systems
considered are both sound and complete. Hilbert and Gentzen systems are given. A cut-elimination theorem
holds (for partially ordered S4), and the Hilbert and Gentzen systems present the same logic. The partial
order induces a 2-category structure on a coalgebraic formulation of descriptive frames. Channel theory is
used to `move' modal logics when the source and target languages may be dierent. A particular partially
ordered modal system is shown to be applicable to security properties",
}



@inproceedings{dslwc09,
author = {W. Harrison and A. Procter and J. Agron and G. Kimmel and G. Allwein},
 title = {Model-Driven Engineering from Modular Monadic Semantics: Implementation Techniques Targeting Hardware and Software},
 booktitle = {DSL '09: Proc. of the IFIP TC 2 Working Conference on Domain-Specific Languages},
 year = {2009},
 pages = {20--44},
       url_Paper = "https://harrisonwl.github.io/assets/papers/dsl09.pdf",
  abstract = "Recent research has shown how the formal modeling of concurrent systems can benefit from monadic structuring. With this approach, a formal system model is really a program in a domain specific language defined by a monad for shared-state concurrency. Can these models be compiled into efficient implementations?  This paper addresses this question and presents an overview of techniques for compiling monadic concurrency models directly into reasonably efficient software and hardware implementations. The implementation techniques described in this article form the basis of a semantics-directed approach to model-driven engineering.",
 } 




@article{HarrisonHook09,
 author = {Harrison, William L. and Hook, James},
 title = {Achieving information flow security through monadic control of effects},
 journal = {J. Comput. Secur.},
 volume = {17},
 issue = {5},
 month = {October},
 year = {2009},
 pages = {599--653},
 numpages = {55},
 publisher = {IOS Press},
 address = {Amsterdam, The Netherlands, The Netherlands},
       url_Paper = "https://harrisonwl.github.io/assets/papers/jcs09.pdf",
  abstract = "This paper advocates a novel approach to the construction of secure
software: controlling information flow and maintaining integrity via
monadic encapsulation of effects. This approach is {\em constructive},
relying on properties of monads and monad transformers to build,
verify, and extend secure software systems. We illustrate this
approach by construction of abstract operating systems called {\em
  separation kernels}. Starting from a mathematical model of
shared-state concurrency based on monads of resumptions and state, we
outline the development by stepwise refinements of separation kernels
supporting Unix-like system calls, interdomain communication,  and a
formally verified security policy (domain separation). Because monads
may be easily and safely represented within any pure, higher-order,
typed functional language, the resulting system models may be directly
realized within a language such as Haskell.",
} 



@inproceedings{HarrisonAllwein08,
author = {William L. Harrison and Gerard Allwein and Andy Gill and Adam Procter},
title = {Asynchronous Exceptions as an Effect},
booktitle = {Proceedings of the Mathematics of Program Construction (MPC08)},
year = {2008},
pages = {153--176},
numpages = {24},
      url_Paper = "https://harrisonwl.github.io/assets/papers/mpc08.pdf",
  abstract = "Asynchronous interrupts abound in computing systems, yet they remain a
thorny concept for both programming and verification practice.
The ubiquity of interrupts underscores the importance of developing
programming models to aid the development and verification of
interrupt-driven programs. 
The research reported here recognizes asynchronous interrupts as a
computational effect and encapsulates them as a building block in
modular monadic semantics.
The resulting modular semantic model can serve as both a guide for
functional programming with interrupts and as a formal basis for reasoning about
interrupt-driven computation as well.",
}



@inproceedings{Haskell08,
 author = {Kariotis, Pericles S. and Procter, Adam M. and Harrison, William L.},
 title = {Making monads first-class with template haskell},
 booktitle = {Proceedings of the first ACM SIGPLAN Symposium on Haskell},
 series = {Haskell '08},
 year = {2008},
 location = {Victoria, BC, Canada},
 pages = {99--110},
 numpages = {12},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {domain-specific languages, monads, staged programming},
       url_Paper = "https://harrisonwl.github.io/assets/papers/haskell08.pdf",
  abstract = "Monads as an organizing principle for programming and semantics are notoriously difficult to grasp, yet they are a central and powerful abstraction in Haskell. This paper introduces a domain-specific language, MonadLab, that simplifies the construction of monads, and describes its implementation in Template Haskell. MonadLab makes monad construction truly first class, meaning that arcane theoretical issues with respect to monad transformers are completely hidden from the programmer. The motivation behind the design of MonadLab is to make monadic programming in Haskell simpler while providing a tool for non-Haskell experts that will assist them in understanding this powerful abstraction.",
} 



@InProceedings{APLAS06,
  author =       "William Harrison",
  title =        "Proof Abstraction for Imperative Languages",
  year =         "2006",
  booktitle = "Proceedings of the 4th Asian Symposium
               on Programming Languages and Systems (APLAS06)",
  pages     = {97-113}, 
  abstract = "Modularity in programming language semantics derives from abstracting over
the structure of underlying denotations, yielding semantic descriptions that are more abstract and reusable. One such semantic framework is Liang's modular
monadic semantics in which the underlying semantic structure is encapsulated with a monad. Such abstraction can be at odds with
program verification, however, because program specifications require access to the (deliberately) hidden semantic
representation. The techniques for reasoning about modular monadic definitions of imperative programs introduced here overcome this barrier.
And, just like program definitions in modular monadic semantics, our program specifications and proofs are representation-independent
and hold for whole classes of monads, thereby yielding proofs of great generality.",
  url_Paper = "https://harrisonwl.github.io/assets/papers/aplas06.pdf",
}



@inproceedings{harrison06,
  author    = {William L. Harrison},
  title     = {The Essence of Multitasking},
  booktitle = {11th International Conference on Algebraic Methodology
                  and Software Technology {(AMAST 2006)}},
  pages     = {158-172},
  month     = {July},                  
  year      = {2006},
     url_Paper = "https://harrisonwl.github.io/assets/papers/amast06.pdf",
  abstract = "This article demonstrates how a powerful and expressive abstraction from concurrency theory---monads of resumptions---plays a dual r\^{o}le as a programming tool
for concurrent applications.  
The article demonstrates how a
wide variety of typical OS behaviors may be specified in terms of
resumption monads known heretofore exclusively in the literature of 
programming language semantics. 
We illustrate the expressiveness of the resumption monad with the
construction of an exemplary 
multitasking kernel in the pure functional language
Haskell. Code available at link.",
     url_Code = "https://harrisonwl.github.io/assets/code/EoMT.tar.gz",
}





@article{ijdmb06,
	Author = {X. Z. Fu and H. Wang and W. Harrison and R. Harrison},
	Title = {{RNA} Pseudoknot Prediction Using Term Rewriting},
	Year = 2005,
  journal =      "International Journal of Data Mining and Bioinformatics",
  abstract = "RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are functionally important and widely occurring structural motifs found in all types of RNA. Therefore predicting their structures is an important problem. In this paper, we present a new RNA pseudoknot structure prediction method based on term rewriting. The method is implemented using the Mfold RNA/DNA folding package and the term rewriting language Maude. In our method, RNA structures are treated as terms and rules are discovered for predicting pseudoknots. Our method was tested on 211 pseudoknots in PseudoBase and achieves an average accuracy of 74.085 percent compared to the experimentally determined structure. In fact, most pseudoknots discovered by our method achieve an accuracy of above 90 percent. These results indicate that term rewriting has a broad potential in RNA applications ranging from prediction of pseudoknots to discovery of higher level RNA structures involving complex RNA tertiary interactions."
}

                  


@article{HK05,
  author =       "William L. Harrison and Richard B. Kieburtz",
  title =        "The Logic of Demand in {H}askell",
  journal =      "Journal of Functional Programming",
  volume  = 15,
  number = 6,
  year   = 2005,
  pages = {837-891},
  hjournal = "yes",
   url_Paper = "https://harrisonwl.github.io/assets/papers/jfp05.pdf",
  abstract = "Haskell is a functional programming language whose
                  evaluation is lazy by default. However, Haskell also
                  provides pattern matching facilities which add a
                  modicum of eagerness to its otherwise lazy default
                  evaluation. This mixed or \emph{non-strict}
                  semantics can be quite difficult to reason
                  with. This paper introduces a programming logic,
                  P-Logic, which neatly formalizes the mixed
                  evaluation in Haskell pattern-matching as a logic,
                  thereby simplifying the task of specifying and
                  verifying Haskell programs. In P-Logic, aspects of
                  demand are reflected or represented within both the
                  predicate language and its model theory, allowing
                  for expressive and comprehensible program
                  verification.", 
}



@inproceedings{APLAS05,
     author = "William Harrison",
     title  = "A Simple Semantics for Polymorphic
                  Recursion",
     booktitle = "Proceedings of the 3rd Asian Symposium
                  on Programming Languages and Systems (APLAS05)",
     pages     = {37-51}, 
     month = "November",
     year = 2005,
     address = "Tsukuba, Japan",
     hconf = "yes",
      url_Paper = "https://harrisonwl.github.io/assets/papers/aplas05.pdf",
     abstract = "Polymorphic recursion is a useful extension of Hindley-
Milner typing and has been incorporated in the functional programming
language Haskell. It allows the expression of efficient algorithms
that take advantage of non-uniform data structures and provides key
support for generic programming. However, polymorphic recursion is,
perhaps, not as broadly understood as it could be and this, in part,
motivates the denotational semantics presented here. The semantics reported
here also contributes an essential building block to any semantics
of Haskell: a model for first-order polymorphic recursion. Furthermore,
Haskell-style type classes may be described within this semantic framework
in a straightforward and intuitively appealing manner."
}




@inproceedings{BIBE05,
	Author = {X. Z. Fu and H. Wang and W. Harrison and R. Harrison},
	Booktitle = {Proceedings of IEEE Fifth Symposium on Bioinformatics and
  Bioengineering (BIBE05)},
	Month = {October},
	Title = {{RNA} Pseudoknot Prediction Using Term Rewriting},
	Year = {2005},
	address = "Minneapolis, MN",
	pages = {169-176},
        hconf = "yes",
         url_Paper = "https://harrisonwl.github.io/assets/papers/bibe05.pdf",	
	abstract = "RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural  motifs found in all types of RNA and are also functionally important. Therefore predicting their structures is an important problem. In this paper, we present a new RNA pseudoknot prediction model based on term rewriting rather than on dynamic programming, comparative sequence analysis, or context-free grammars. The model we describe is implemented using the Mfold RNA/DNA folding package and the term rewriting language Maude. Our model was tested on 211 pseudoknots in PseudoBase and achieves an average accuracy of 74.085% compared to the experimentally determined structure. In fact, most pseudoknots discovered by our method achieve an accuracy of above 90%. These results indicate that term rewriting has a broad potential in RNA applications from prediction of pseudoknots to higher level RNA structures involving complex RNA tertiary interactions.",
}



@inproceedings{CSFW05,
	Author = {William Harrison and James Hook},
	Booktitle = {18th IEEE Computer Security Foundations Workshop (CSFW05)},
	Month = {June},
	Title = {Achieving Information Flow Security Through Precise Control of Effects},
	Year = {2005},
	address = "Aix-en-Provence, France",
	pages = {16-30},
        hconf = "yes",
         url_Paper = "https://harrisonwl.github.io/assets/papers/csfw05.pdf",	
	abstract = "This paper advocates controlling information flow and maintaining integrity via monadic encapsulation of effects. This approach is constructive, relying on properties of monads and monad transformers to build, verify, and extend secure software systems. We illustrate this approach by construction of abstract operating systems called separation kernels.",
}





@InProceedings{HarrisonHarrison04,
  author =       "William L. Harrison and Robert W. Harrison",
  title =        "Domain Specific Languages for Cellular Interactions",
  booktitle =    "Proceedings of the 26th Annual IEEE International Conference on Engineering in Medicine and Biology (EMBC04)",
  month =        "September",
  year =         "2004",
  hconf = "yes",
   url_Paper = "https://harrisonwl.github.io/assets/papers/embc04.pdf",
  abstract = "Bioinformatics is the application of Computer Science techniques to problems in Biology, and this paper explores one such application with great potential: the modeling of life cycles of autonomous, intercommunicating cellular systems using domain-specific programming languages (DSLs). We illustrate this approach for the simple photo-synthetic bacterium \emph{R. Sphaeroides} with a DSL called CellSys embedded in the programming language Haskell."
}




@InProceedings{DomSep03,
  author =       "William Harrison and Mark Tullsen and James Hook",
  title =        "Domain Separation by Construction",
  booktitle =    "LICS03 Satellite Workshop on Foundations of Computer Security (FCS03)",
  month =        "June",
  year =         "2003",
  note = "21 pages",
  hconf = "yes",
   url_Paper = "https://harrisonwl.github.io/assets/papers/fcs03.pdf",
  abstract = "This paper advocates a novel approach to language-based security: by structuring software with monads (a form of abstract data type for effects), we are able to maintain separation of effects by construction. The thesis of this work is that well-understood properties of monads and monad transformers aid in the construction and verification of secure software. We introduce a formulation of non-interference based on monads rather than the typical trace-based formulation. Using this formulation, we prove a non-interference style property for a simple instance of our system model. Because monads may be easily and safely represented within any pure, higher-order, typed functional language, the resulting system models may be directly realized within such a language.",
}




@InProceedings{HK02,
   author = "William Harrison and Richard Kieburtz",
   title  = "Pattern-driven Reduction in Haskell",
   booktitle = "2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS02)",
   address = "Copenhagen, Denmark",
   year  = "2002",
   hconf = "yes",
    url_Paper = "https://harrisonwl.github.io/assets/papers/wrs02.pdf",
   abstract = "Haskell is a functional programming language with nominally non-strict
semantics, implying that evaluation of a Haskell expression proceeds by
demand-driven reduction.  However, Haskell also provides pattern 
matching
on arguments of functions, in {\bf let} expressions and in the match
clauses of {\bf case} expressions.  Pattern-matching requires
data-driven reduction to the extent necessary to
evaluate a pattern match or to bind variables introduced in a pattern.
In this paper we
provide both an abstract semantics and a logical characterization of
pattern-matching in Haskell and the reduction order that it entails.",
}





@InProceedings{FCDH2002,
  author =       "William Harrison and Timothy Sheard and James Hook",
  title =        "Fine Control of Demand in {Haskell}",
  booktitle =    "6th International Conference on the Mathematics of
                 Program Construction (MPC02),
                 Dagstuhl, Germany",
  year =         "2002",
  publisher =    "Springer-Verlag",
  volume =       "2386",
  pages =        "68--93",
  series =       "Lecture Notes in Computer Science",
  hconf = "yes",
   url_Paper = "https://harrisonwl.github.io/assets/papers/mpc02.pdf",
   url_Slides = "https://harrisonwl.github.io/assets/papers/slides-mpc02.pdf",
  abstract = "Functional languages have the lambda calculus at their core, but then depart from this firm foundation by including features that alter their default evaluation order. The resulting mixed evaluation---partly lazy and partly strict---complicates the formal semantics of these languages. The functional language Haskell is such a language, with features such as pattern-matching, case expressions with guards, etc., introducing a modicum of strictness into the otherwise lazy language. But just how does Haskell differ from the lazy lambda calculus? We answer this question by introducing a calculational semantics for Haskell that exposes the interaction of its strict features with its default laziness. In the semantics, features perturbing Haskell's standard lazy evaluation order are specified computationally (i.e., monadically) rather than as pure values (i.e., functions, scalars, etc.)."
}





@InProceedings{HarrisonSheard2001,
  author =       "Bill Harrison and Tim Sheard",
  title =        "Dynamically Adaptable Software with Metacomputations in a Staged Language",
  journal =      "Lecture Notes in Computer Science",
  booktitle =    "Proceedings of the Second International Workshop on
                  Semantics, Applications, and Implementation of Program Generation (SAIG)",
  address =      "Florence, Italy", 
  volume =       "2196",
  pages =        "163--182",
  publisher =    "Springer-Verlag",
  series =       "Lecture Notes in Computer Science",
  year =         "2001",
  hconf = "yes",
   url_Paper = "https://harrisonwl.github.io/assets/papers/saig01.pdf",
  abstract = "Profile-driven compiler optimizations take advantage of information gathered at runtime to re-compile programs into more efficient code. Such optimizations appear to be more easily incorporated within a semantics-directed compiler structure than within traditional compiler structure. We present a case study in which a metacomputation-based reference compiler for a small imperative language converts easily into a compiler which performs a particular profile-driven optimization: local register allocation. Our reference compiler is implemented in the staged, functional language MetaML and takes full advantage of the synergy between metacomputation-style language definitions and the staging constructs of MetaML. We believe that the approach to implementing profile-driven optimizations presented here suggests a useful, formal model for dynamically adaptable software.",
}



@PhdThesis{Harrison2001,
  author =       "William Harrison",
  title =        "Modular Compilers and Their Correctness Proofs",
  year =         "2001",
  school =       "University of Illinois at Urbana-Champaign",
  hthesis = "yes",
   url_Paper = "https://harrisonwl.github.io/assets/papers/dissertation.pdf",
  abstract = "This thesis explores the construction and correctness of modular compilers. Modular compilation is a compiler construction technique allowing the construction of compilers for high-level programming languages from reusable compiler building blocks. Modular compilers are defined in terms of denotational semantics based on monads, monad transformers, and a new model of staged computation called metacomputations. A novel form of denotational specification called observational program specification and related proof techniques are developed to assist in modular compiler verification. It will be demonstrated that the modular compilation framework provides both a level of modularity in compiler proofs as well as a useful organizing principle for such proofs.",
}







@InProceedings{HarrisonKamin2000,
  author =       "William Harrison and Samuel Kamin",
  title =        "Metacomputation-based Compiler Architecture",
  booktitle =    "5th International Conference on the Mathematics of
                 Program Construction,
                 Ponte de Lima, Portugal",
  year =         "2000",
  publisher =    "Springer-Verlag",
  volume =       "1837",
  pages =        "213--229",
  series =       "Lecture Notes in Computer Science",
  hconf = "yes",
   url_Paper = "https://harrisonwl.github.io/assets/papers/mpc00.pdf",
  abstract = "This paper presents a modular and extensible style of language specification based on metacomputations. This style uses two monads to factor the static and dynamic parts of the specification, thereby staging the specification and achieving strong binding-time separation. Because metacomputations are defined in terms of monads, they can be constructed modularly and extensibly using monad transformers. Consequently, metacomputation-style specifications are modular and extensible. A number of language constructs are specified: expressions, control-flow, imperative features, block structure, and higher-order functions and recursive bindings. Because of the strong binding-time separation, metacomputation-style specification lends itself to semantics-directed compilation, which we demonstrate by creating a modular compiler for a block-structured imperative, while language.",
}




@InProceedings{HarrisonKamin1998,
  author =       "William L. Harrison and Samuel N. Kamin",
  title =        "Modular Compilers Based on Monad Transformers",
  booktitle =    "Proceedings of the 1998 International Conference on
                 Computer Languages",
  publisher =    "IEEE Computer Society Press",
  year =         "1998",
  ISBN =         "0-780-35005-7, 0-8186-8454-2, 0-8186-8456-9",
  pages =        "122--131",
  hconf = "yes",
   url_Paper = "https://harrisonwl.github.io/assets/papers/iccl98.pdf",
  abstract =     "The monadic style of language specification has the
                 advantages of modularity and extensibility: it is
                 simple to add or change features in an interpreter to
                 re ect modifications in the source language. It has
                 proven difficult to extend the method to compilation.
                 We demonstrate that by introducing machine-like stores
                 (code and data) into the monadic semantics and then
                 partially evaluating the resulting semantic
                 expressions, we can achieve many of the same advantages
                 for a compiler as for an interpreter. A number of
                 language constructs and features are compiled:
                 expressions, CBV and CBN evaluation of
                 $\lambda$-expressions, dynamic scoping, and various
                 imperative features. The treatment of recursive
                 procedures is outlined as well. The resulting method
                 allows compilers to be constructed in a mix-and-match
                 fashion just as in a monad-structured interpreter.",
}



@MastersThesis{Harrison1992,
  author =       "William Harrison",
  title =        "Mechanizing the Axiomatic Semantics for a Programming Language with Asynchronous Send and Receive in HOL",
  year =         "1992",
  school =       "University of California, Davis",
  hthesis = "yes",
   url_Paper = "https://harrisonwl.github.io/assets/papers/masters-thesis.pdf",
  abstract = "This thesis presents the axiomatic semantics for a simple distributed language and its mechanization in HOL. The constructs of this language include asynchronous send and synchronous receive statements as well as those basic to a sequential programming language. The language has the appearance of a system programming language that supports sequential execution extended with message-passing, and would be a suitable basis for coding distributed operating systems. Included in the mechanization are functions which generate the goals associated with the verification of simple statements in the language.",
}

  




@InProceedings{harrison92,
  author =       "William Harrison and Karl Levitt and Myla Archer",
  title =        "An HOL Mechanization of the Axiomatic Semantics of a Simple
Distributed Programming Language",
  booktitle =    "Proceedings of the International Workshop on Higher-Order Logic
  Theorem Proving and Its Applications",
  month = "September",
  address = "Leuven, Belgium",
  year =         "1992",
  pages =        "347-358",
  hconf = "yes",
  abstract = "",
}




@INPROCEEDINGS{MeSeHOL,
  AUTHOR = {William Harrison and Karl Levitt},
  TITLE = {Mechanizing Security in {HOL}},
  BOOKTITLE = {Proceedings of the 1991 International Workshop
            on the {HOL} Theorem Proving System and its Applications},
  PUBLISHER = {IEEE Computer Society Press},
  YEAR = {1991},
  PAGES = {63--66},
  address = "Davis, California",
  hconf = "yes",
  abstract = "",
}




@TechReport{tr92a,
  author = 	 {William Harrison and Karl Levitt and Myla Archer},
  title = 	 {{Towards a Verified Code Basis for a Secure Distributed Operating System}},
  institution =  {University of California at Davis},
  number =       "CSE-92-19",
  year = 	 1992,
  htr =          "yes",
}



@TechReport{tr92b,
  author = 	 {William Harrison},
  title = 	 {{Mechanizing the Axiomatic Semantics for a Programming Language with Asynchronous Send and Receive in HOL}},
  institution =  {University of California at Davis},
  number =       "CSE-92-20",
  year = 	 1992,
  htr =          "yes",
}
\">\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://harrisonwl.github.io/assets/bibliography/harrison.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://harrisonwl.github.io/assets/bibliography/harrison.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%2Fharrisonwl.github.io%2Fassets%2Fbibliography%2Fharrison.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%2Fharrisonwl.github.io%2Fassets%2Fbibliography%2Fharrison.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%2Fharrisonwl.github.io%2Fassets%2Fbibliography%2Fharrison.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        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"forman-harrison-temporalstagingforcorrectbyconstructioncryptographichardware-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/rsp24.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'forman-harrison-temporalstagingforcorrectbyconstructioncryptographichardware-2024', 'https://harrisonwl.github.io/assets/papers/rsp24.pdf', event);\">\n    Temporal Staging for Correct-by-Construction Cryptographic Hardware.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Forman, Y.;  and <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Rapid Systems Prototyping (RSP24)</i>,  2024. \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://harrisonwl.github.io/assets/papers/rsp24.pdf\"\n     onclick=\"log_download('forman-harrison-temporalstagingforcorrectbyconstructioncryptographichardware-2024', 'https://harrisonwl.github.io/assets/papers/rsp24.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Temporal Staging for Correct-by-Construction Cryptographic Hardware [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/forman-harrison-temporalstagingforcorrectbyconstructioncryptographichardware-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>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('forman-harrison-temporalstagingforcorrectbyconstructioncryptographichardware-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{harrison24,\n  title = {Temporal Staging for Correct-by-Construction Cryptographic Hardware},\n  author = {Forman, Yakir and Harrison, William L.},\n  booktitle = {Rapid Systems Prototyping (RSP24)},\n  year = {2024},\n  abstract = {\n There is a conceptual divide between the ways cryptographic algorithms are defined (i.e., informal imperative pseudocode) and commodity hardware design languages (e.g., Verilog). How does one even begin to compare a pseudocode to an HDL design that purports to implement it in hardware? Bridging this divide requires substantial manual intervention and, consequently, &#x60;&#x60;shrinking the divide&#x27;&#x27; can drastically reduce the cost of high-assurance cryptographic hardware by reducing the cost of formal verification. We present a correct-by-construction methodology for the functional hardware design language, ReWire, in which a reference cryptographic algorithm is transformed into a provably correct hardware design with a program transformation called temporal staging. We illustrate this methodology with case studies including one for the BLAKE2b cryptographic hash function. Because the reference algorithm, the temporal staging transformation, and the resulting implementation are all expressed in ReWire, formal verification can proceed immediately via a published ReWire semantics.\n},\n  url_Paper = &quot;https://harrisonwl.github.io/assets/papers/rsp24.pdf&quot;,\n}\n\n                  \n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  There is a conceptual divide between the ways cryptographic algorithms are defined (i.e., informal imperative pseudocode) and commodity hardware design languages (e.g., Verilog). How does one even begin to compare a pseudocode to an HDL design that purports to implement it in hardware? Bridging this divide requires substantial manual intervention and, consequently, ``shrinking the divide'' can drastically reduce the cost of high-assurance cryptographic hardware by reducing the cost of formal verification. We present a correct-by-construction methodology for the functional hardware design language, ReWire, in which a reference cryptographic algorithm is transformed into a provably correct hardware design with a program transformation called temporal staging. We illustrate this methodology with case studies including one for the BLAKE2b cryptographic hash function. Because the reference algorithm, the temporal staging transformation, and the resulting implementation are all expressed in ReWire, formal verification can proceed immediately via a published ReWire semantics. \n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2023\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2023')\"\n      onkeypress=\"toggleGroup('group_2023')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2023</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=\"harrison-blumenfeld-bond-hathhorn-li-torrence-ziegler-formalizedhighlevelsynthesiswithapplicationstocryptographichardware-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/nfm23.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-blumenfeld-bond-hathhorn-li-torrence-ziegler-formalizedhighlevelsynthesiswithapplicationstocryptographichardware-2023', 'https://harrisonwl.github.io/assets/papers/nfm23.pdf', event);\">\n    Formalized High Level Synthesis with Applications to Cryptographic Hardware.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>; Blumenfeld, I.; Bond, E.; Hathhorn, C.; Li, P.; Torrence, M.;  and Ziegler, J.\n</span>\n\n  \n\n</span>\n\n  In <i>NASA Formal Methods Symposium (NFM23)</i>,  2023. \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://harrisonwl.github.io/assets/papers/nfm23.pdf\"\n     onclick=\"log_download('harrison-blumenfeld-bond-hathhorn-li-torrence-ziegler-formalizedhighlevelsynthesiswithapplicationstocryptographichardware-2023', 'https://harrisonwl.github.io/assets/papers/nfm23.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Formalized High Level Synthesis with Applications to Cryptographic Hardware [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-blumenfeld-bond-hathhorn-li-torrence-ziegler-formalizedhighlevelsynthesiswithapplicationstocryptographichardware-2023\"\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>5 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('harrison-blumenfeld-bond-hathhorn-li-torrence-ziegler-formalizedhighlevelsynthesiswithapplicationstocryptographichardware-2023')\" -->\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{harrison23,\n  title = {Formalized High Level Synthesis with Applications to Cryptographic Hardware},\n  author = {Harrison, William L. and Blumenfeld, Ian and Bond, Eric and Hathhorn, Chris and Li, Paul and Torrence, May and Ziegler, Jared},\n  booktitle = {NASA Formal Methods Symposium (NFM23)},\n  year = {2023},\n  abstract = {\n  Verification of hardware-based cryptographic accelerators connects a low-level RTL implementation to the abstract algorithm itself; generally, \nthe more optimized for performance an accelerator is, the more challenging its verification. This paper introduces a verification methodology, \\emph{model validation}, that uses a formalized high-level synthesis language (FHLS) as an intermediary between algorithm specification and hardware implementation. The foundation of our approach to model validation is a mechanized denotational semantics for the ReWire HLS language. Model validation proves the faithfulness of FHLS models to the RTL implementation and we summarize a model validation case study for a suite of pipelined Barrett multipliers.\n},\n  url_Paper = &quot;https://harrisonwl.github.io/assets/papers/nfm23.pdf&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Verification of hardware-based cryptographic accelerators connects a low-level RTL implementation to the abstract algorithm itself; generally, the more optimized for performance an accelerator is, the more challenging its verification. This paper introduces a verification methodology, \\emphmodel validation, that uses a formalized high-level synthesis language (FHLS) as an intermediary between algorithm specification and hardware implementation. The foundation of our approach to model validation is a mechanized denotational semantics for the ReWire HLS language. Model validation proves the faithfulness of FHLS models to the RTL implementation and we summarize a model validation case study for a suite of pipelined Barrett multipliers. \n</div>\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=\"allwein-harrison-distributedrelationalgebra-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/dist_rel_alg.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'allwein-harrison-distributedrelationalgebra-2022', 'https://harrisonwl.github.io/assets/papers/dist_rel_alg.pdf', event);\">\n    Distributed Relation Algebra.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Allwein, G.;  and <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>\n</span>\n\n  \n\n</span>\n\n  In Bimbó, K., editor(s), <i>Relevance Logics and other Tools for Reasoning. Essays in Honor of J. Michael Dunn</i>, pages 1-30. College Publications,  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://harrisonwl.github.io/assets/papers/dist_rel_alg.pdf\"\n     onclick=\"log_download('allwein-harrison-distributedrelationalgebra-2022', 'https://harrisonwl.github.io/assets/papers/dist_rel_alg.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Distributed Relation Algebra [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/allwein-harrison-distributedrelationalgebra-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  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('allwein-harrison-distributedrelationalgebra-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</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{allwein2022,\nauthor = &quot;Allwein, Gerard and Harrison, William L.&quot;,\neditor = &quot;Bimb{\\&#x27;o}, Katalin&quot;,\ntitle = &quot;Distributed Relation Algebra&quot;,\nbookTitle = &quot;Relevance Logics and other Tools for Reasoning. Essays in Honor of J. Michael Dunn&quot;,\nyear = &quot;2022&quot;,\npublisher = &quot;College Publications&quot;,\npages = &quot;1-30&quot;,\nisbn = &quot;978-1-84890-395-1&quot;,\nabstract = {We define some extra relation operators in Relation Algebras and examine the relationship between Relation Algebras and Relevance Logic. We then extract binary relations from Kripke models of Relation Algebras and extend those to Distributed Relation Algebras. The term distribution refers to using a multigraph of local logics connected by the relation operators. In the context of Kripke frames for Relation Algebras, the distribution refers to a multigraph of Stone spaces each supporting a local Kripke frame. There are then distributed Kripke relations connecting the local frames. Finally, we show the relationship between the relation operators and Kan extensions and lifts from category theory.},\n        url_Paper = &quot;https://harrisonwl.github.io/assets/papers/dist_rel_alg.pdf&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We define some extra relation operators in Relation Algebras and examine the relationship between Relation Algebras and Relevance Logic. We then extract binary relations from Kripke models of Relation Algebras and extend those to Distributed Relation Algebras. The term distribution refers to using a multigraph of local logics connected by the relation operators. In the context of Kripke frames for Relation Algebras, the distribution refers to a multigraph of Stone spaces each supporting a local Kripke frame. There are then distributed Kripke relations connecting the local frames. Finally, we show the relationship between the relation operators and Kan extensions and lifts from category theory.\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=\"harrison-hathhorn-allwein-amechanizedsemanticmetalanguageforhighlevelsynthesis-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/ppdp21.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-hathhorn-allwein-amechanizedsemanticmetalanguageforhighlevelsynthesis-2021', 'https://harrisonwl.github.io/assets/papers/ppdp21.pdf', event);\">\n    A Mechanized Semantic Metalanguage for High Level Synthesis.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>; Hathhorn, C.;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In <i>23rd International Symposium on Principles and Practice of Declarative Programming (PPDP 2021)</i>,  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://harrisonwl.github.io/assets/papers/ppdp21.pdf\"\n     onclick=\"log_download('harrison-hathhorn-allwein-amechanizedsemanticmetalanguageforhighlevelsynthesis-2021', 'https://harrisonwl.github.io/assets/papers/ppdp21.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Mechanized Semantic Metalanguage for High Level Synthesis [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-hathhorn-allwein-amechanizedsemanticmetalanguageforhighlevelsynthesis-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  &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>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('harrison-hathhorn-allwein-amechanizedsemanticmetalanguageforhighlevelsynthesis-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</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{harrison21,\n  title = {A Mechanized Semantic Metalanguage for High Level Synthesis},\n  author = {Harrison, William L. and Hathhorn, Chris and Allwein, Gerard},\n  booktitle = {23rd International Symposium on Principles and Practice of Declarative Programming (PPDP 2021)},\n  year = {2021},\n  abstract = {High-level synthesis (HLS) seeks to make hardware development more like software development by adapting ideas from programming languages to hardware description and HLS from functional languages is usually motivated as a means of bringing software-like productivity to hardware development. Formalized semantics support a range of important capabilities in software languages (e.g., compositionality, comprehensibility, interoperability, formal methods, and security) that are desirable in hardware languages as well. This paper considers the formalized semantics of the Device Calculus, a typed lambda-calculus with operators for constructing Mealy machines that forms a semantic substratum suitable for high-level synthesis and we demonstrate the utility of the Device Calculus as a foundation for formal methods in functional HLS with a case study specifying the semantics of an idealized subset of the FIRRTL language. FIRRTL  (&#x60;&#x60;Flexible Internal Representation for RTL&#x27;&#x27;) is an open-source hardware intermediate representation targeted by the Chisel hardware construction language and the semantics we present is also a starting point for exploring formal methods and security within both the Chisel toolchain and any other high-level synthesis flows that target FIRRTL.\n},\n  url_Paper = &quot;https://harrisonwl.github.io/assets/papers/ppdp21.pdf&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  High-level synthesis (HLS) seeks to make hardware development more like software development by adapting ideas from programming languages to hardware description and HLS from functional languages is usually motivated as a means of bringing software-like productivity to hardware development. Formalized semantics support a range of important capabilities in software languages (e.g., compositionality, comprehensibility, interoperability, formal methods, and security) that are desirable in hardware languages as well. This paper considers the formalized semantics of the Device Calculus, a typed lambda-calculus with operators for constructing Mealy machines that forms a semantic substratum suitable for high-level synthesis and we demonstrate the utility of the Device Calculus as a foundation for formal methods in functional HLS with a case study specifying the semantics of an idealized subset of the FIRRTL language. FIRRTL (``Flexible Internal Representation for RTL'') is an open-source hardware intermediate representation targeted by the Chisel hardware construction language and the semantics we present is also a starting point for exploring formal methods and security within both the Chisel toolchain and any other high-level synthesis flows that target FIRRTL. \n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</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=\"harrison-allwein-verifiablesecuritytemplatesforhardware-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/date20.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-allwein-verifiablesecuritytemplatesforhardware-2020', 'https://harrisonwl.github.io/assets/papers/date20.pdf', event);\">\n    Verifiable Security Templates for Hardware.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the Design, Automation, and Test Europe (DATE) Conference</i>,  2020. \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://harrisonwl.github.io/assets/papers/date20.pdf\"\n     onclick=\"log_download('harrison-allwein-verifiablesecuritytemplatesforhardware-2020', 'https://harrisonwl.github.io/assets/papers/date20.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Verifiable Security Templates for Hardware [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-allwein-verifiablesecuritytemplatesforhardware-2020\"\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>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('harrison-allwein-verifiablesecuritytemplatesforhardware-2020')\" -->\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{harrison20,\n  title = {Verifiable Security Templates for Hardware},\n  author = {Harrison, William L. and Allwein, Gerard},\n  booktitle = {Proceedings of the Design, Automation, and Test Europe (DATE) Conference},\n  year = {2020},\n  abstract = {High-level synthesis (HLS) research generally focuses on transferring &#x60;&#x60;software engineering virtues&#x27;&#x27; (e.g., modularity, abstraction, extensibility, etc.) to hardware development with the ultimate goal of making hardware development as agile as software development. And recent HLS research has focused on transferring ideas and techniques from high assurance software formal methods to hardware development. Just as it has introduced software engineering virtues, we believe HLS can also become a vector for adapting software formal methods to the challenge of high assurance security in hardware. This paper introduces the Device Calculus and its mechanization in the Agda proof checking system. The Device Calculus is a starting point for exploring the formal methods and security of high-level synthesis flows. We illustrate the Device Calculus with a number of examples of formally verifiable security templates---i.e., functions in the Device Calculus that express common security structures at a high-level of abstraction.\n},\n  url_Paper = &quot;https://harrisonwl.github.io/assets/papers/date20.pdf&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  High-level synthesis (HLS) research generally focuses on transferring ``software engineering virtues'' (e.g., modularity, abstraction, extensibility, etc.) to hardware development with the ultimate goal of making hardware development as agile as software development. And recent HLS research has focused on transferring ideas and techniques from high assurance software formal methods to hardware development. Just as it has introduced software engineering virtues, we believe HLS can also become a vector for adapting software formal methods to the challenge of high assurance security in hardware. This paper introduces the Device Calculus and its mechanization in the Agda proof checking system. The Device Calculus is a starting point for exploring the formal methods and security of high-level synthesis flows. We illustrate the Device Calculus with a number of examples of formally verifiable security templates—i.e., functions in the Device Calculus that express common security structures at a high-level of abstraction. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"reynolds-chadha-harrison-allwein-stronglyboundedterminationwithapplicationstosecurityandhardwaresynthesis-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/tyde20.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'reynolds-chadha-harrison-allwein-stronglyboundedterminationwithapplicationstosecurityandhardwaresynthesis-2020', 'https://harrisonwl.github.io/assets/papers/tyde20.pdf', event);\">\n    Strongly Bounded Termination with Applications to Security and Hardware Synthesis.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Reynolds, T.; Chadha, R.; <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In <i>ACM Workshop on Type Driven Development (TyDe)</i>,  2020. \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://harrisonwl.github.io/assets/papers/tyde20.pdf\"\n     onclick=\"log_download('reynolds-chadha-harrison-allwein-stronglyboundedterminationwithapplicationstosecurityandhardwaresynthesis-2020', 'https://harrisonwl.github.io/assets/papers/tyde20.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Strongly Bounded Termination with Applications to Security and Hardware Synthesis [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/reynolds-chadha-harrison-allwein-stronglyboundedterminationwithapplicationstosecurityandhardwaresynthesis-2020\"\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('reynolds-chadha-harrison-allwein-stronglyboundedterminationwithapplicationstosecurityandhardwaresynthesis-2020')\" -->\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{reynolds20,\n  title = {Strongly Bounded Termination with Applications to Security and Hardware Synthesis},\n  author = {Reynolds, Thomas and Chadha, Rohit and Harrison, William L. and Allwein, Gerard},\n  booktitle = {ACM Workshop on Type Driven Development (TyDe)},\n  year = {2020},\n  abstract = {Termination checking is a classic static analysis, and, within this focus, there are type-based approaches that formalize termination analysis as type systems (i.e., so that all well-typed programs terminate). But there are situations where a stronger termination property (which we call strongly- bounded termination) must be determined and, accordingly, we explore this property via a variant of the simply-typed λ-calculus called the bounded-time lambda calculus (BTC). This paper presents the BTC and its semantics and metatheory through a Coq formalization. Important examples (e.g., hardware synthesis from functional languages and detection of covert timing channels) motivating strongly-bounded termination and BTC are described as well.},\n  url_Paper = &quot;https://harrisonwl.github.io/assets/papers/tyde20.pdf&quot;,\n  }\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Termination checking is a classic static analysis, and, within this focus, there are type-based approaches that formalize termination analysis as type systems (i.e., so that all well-typed programs terminate). But there are situations where a stronger termination property (which we call strongly- bounded termination) must be determined and, accordingly, we explore this property via a variant of the simply-typed λ-calculus called the bounded-time lambda calculus (BTC). This paper presents the BTC and its semantics and metatheory through a Coq formalization. Important examples (e.g., hardware synthesis from functional languages and detection of covert timing channels) motivating strongly-bounded termination and BTC are described as well.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2019\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2019')\"\n      onkeypress=\"toggleGroup('group_2019')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2019</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=\"allwein-harrison-informationflowandhomotopytheory-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/dist_hom_theory.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'allwein-harrison-informationflowandhomotopytheory-2019', 'https://harrisonwl.github.io/assets/papers/dist_hom_theory.pdf', event);\">\n    Information Flow and Homotopy Theory.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Allwein, G.;  and <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Journal of Logical and Algebraic Methods in Programming (under submission)</i>.  2019.\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://harrisonwl.github.io/assets/papers/dist_hom_theory.pdf\"\n     onclick=\"log_download('allwein-harrison-informationflowandhomotopytheory-2019', 'https://harrisonwl.github.io/assets/papers/dist_hom_theory.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Information Flow and Homotopy Theory [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/allwein-harrison-informationflowandhomotopytheory-2019\"\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>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('allwein-harrison-informationflowandhomotopytheory-2019')\" -->\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{allwein19,\n  title = {Information Flow and Homotopy Theory},\n  author = {Allwein, Gerard and Harrison, William L.},\n  journal = {Journal of Logical and Algebraic Methods in Programming (under submission)},\n  year = {2019},\n  numpages = {38},                \n  abstract = {Simulation and bisimulation are used in many areas of security in Computing Science, however the methods used do not come with a supporting logic giving the regularities of information flow. We have developed Distributed Logic to represent regularities governing information flow between localities of a distributed system, each locality can be outfitted with its own notion of state and language. The flows, either internal to a locality or between localities, follow a connection structure specified by a graph in the logic and semantically by relations in a category. We use some basic homotopy notions for use in distributed systems by using the notions as a template for properties of (bi)simulations useful for security and other properties of distributed systems. The logic can express formulas whose validity is unwritten by the (bi)simulations. This presents new ways of formalizing and proving properties of distributed systems.},\n  url_Paper = &quot;https://harrisonwl.github.io/assets/papers/dist_hom_theory.pdf&quot;,\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Simulation and bisimulation are used in many areas of security in Computing Science, however the methods used do not come with a supporting logic giving the regularities of information flow. We have developed Distributed Logic to represent regularities governing information flow between localities of a distributed system, each locality can be outfitted with its own notion of state and language. The flows, either internal to a locality or between localities, follow a connection structure specified by a graph in the logic and semantically by relations in a category. We use some basic homotopy notions for use in distributed systems by using the notions as a template for properties of (bi)simulations useful for security and other properties of distributed systems. The logic can express formulas whose validity is unwritten by the (bi)simulations. This presents new ways of formalizing and proving properties of distributed systems.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"reynolds-procter-harrison-allwein-themechanizedmarriageofeffectsandmonadswithapplicationstohighassurancehardware-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/tecs18.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'reynolds-procter-harrison-allwein-themechanizedmarriageofeffectsandmonadswithapplicationstohighassurancehardware-2019', 'https://harrisonwl.github.io/assets/papers/tecs18.pdf', event);\">\n    The Mechanized Marriage of Effects and Monads with Applications to High-assurance Hardware.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Reynolds, T. N.; Procter, A.; <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  <i>ACM Transactions on Embedded Computing Systems</i>, 18(1): 6:1–6:26. January 2019.\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://harrisonwl.github.io/assets/papers/tecs18.pdf\"\n     onclick=\"log_download('reynolds-procter-harrison-allwein-themechanizedmarriageofeffectsandmonadswithapplicationstohighassurancehardware-2019', 'https://harrisonwl.github.io/assets/papers/tecs18.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Mechanized Marriage of Effects and Monads with Applications to High-assurance Hardware [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/reynolds-procter-harrison-allwein-themechanizedmarriageofeffectsandmonadswithapplicationstohighassurancehardware-2019\"\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('reynolds-procter-harrison-allwein-themechanizedmarriageofeffectsandmonadswithapplicationstohighassurancehardware-2019')\" -->\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{reynolds19,\n author = {Reynolds, Thomas N. and Procter, Adam and Harrison, William L. and Allwein, Gerard},\n title = {The Mechanized Marriage of Effects and Monads with Applications to High-assurance Hardware},\n journal = {ACM Transactions on Embedded Computing Systems},\n issue_date = {February 2019},\n volume = {18},\n number = {1},\n month = jan,\n year = {2019},\n issn = {1539-9087},\n pages = {6:1--6:26},\n articleno = {6},\n numpages = {26},\n keywords = {High-level synthesis, hardware verification, security},\n\tabstract = {\n\t\tConstructing high assurance, secure hardware remains a challenge, because to do so relies on both a verifiable means of hardware description and implementation. \n\tHowever, production hardware description languages (HDL) lack the formal underpinnings required by formal methods in security.\n\tStill, there is no such thing as high assurance systems without high assurance hardware.\n\tWe present a core calculus of secure hardware description with its formal semantics, security type system and mechanization in Coq. \n\tThis calculus is the core of the functional HDL, ReWire, shown in previous work to have useful applications in reconfigurable computing.\n\tThis work supports a full-fledged, formal methodology for producing high assurance hardware.\n},\n        url_Paper = &quot;https://harrisonwl.github.io/assets/papers/tecs18.pdf&quot;,\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  Constructing high assurance, secure hardware remains a challenge, because to do so relies on both a verifiable means of hardware description and implementation. However, production hardware description languages (HDL) lack the formal underpinnings required by formal methods in security. Still, there is no such thing as high assurance systems without high assurance hardware. We present a core calculus of secure hardware description with its formal semantics, security type system and mechanization in Coq. This calculus is the core of the functional HDL, ReWire, shown in previous work to have useful applications in reconfigurable computing. This work supports a full-fledged, formal methodology for producing high assurance hardware. \n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2018\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2018')\"\n      onkeypress=\"toggleGroup('group_2018')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2018</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=\"harrison-allwein-languageabstractionsforhardwarebasedcontrolflowintegritymonitoring-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/reconfig18.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-allwein-languageabstractionsforhardwarebasedcontrolflowintegritymonitoring-2018', 'https://harrisonwl.github.io/assets/papers/reconfig18.pdf', event);\">\n    Language Abstractions for Hardware-based Control-Flow Integrity Monitoring.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2018 International Conference on Reconfigurable Computing and FPGAs</i>, pages 1-6,  2018. \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://harrisonwl.github.io/assets/papers/reconfig18.pdf\"\n     onclick=\"log_download('harrison-allwein-languageabstractionsforhardwarebasedcontrolflowintegritymonitoring-2018', 'https://harrisonwl.github.io/assets/papers/reconfig18.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Language Abstractions for Hardware-based Control-Flow Integrity Monitoring [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://harrisonwl.github.io/assets/code/ReConFig18codebase.tar.gz\"\n     onclick=\"log_download('harrison-allwein-languageabstractionsforhardwarebasedcontrolflowintegritymonitoring-2018', 'https://harrisonwl.github.io/assets/code/ReConFig18codebase.tar.gz', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Language Abstractions for Hardware-based Control-Flow Integrity Monitoring [link]\"\n       title=\" code\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> code</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-allwein-languageabstractionsforhardwarebasedcontrolflowintegritymonitoring-2018\"\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('harrison-allwein-languageabstractionsforhardwarebasedcontrolflowintegritymonitoring-2018')\" -->\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{harrison18b,\n  title = {Language Abstractions for Hardware-based Control-Flow Integrity Monitoring},\n  author = {Harrison, William L. and Allwein, Gerard},\n  booktitle = {Proceedings of the 2018 International Conference on Reconfigurable Computing and FPGAs},\n  year = {2018},\n  pages = {1-6},\n  abstract = {Control-Flow Integrity (CFI) is a software protection mechanism that \ndetects a class of code reuse attacks by identifying anomalous control-flows within an executing program. Hardware-based CFI has the promise of the security benefits of CFI without the performance overhead and complexity of software-based CFI: generally speaking, hardware-based monitors are more difficult to bypass, offer lower performance overheads than software-based monitors, and, furthermore, hardware-based CFI can be performed without the necessity of altering application binaries or instrumenting language compilers. Although hardware-based CFI is an active area of research and there is a growing literature describing CFI strategies at a high-level, there is, to the authors&#x27; best knowledge, no work on languages specially tailored to the specification and implementation of CFI monitors. This article presents a proof-of-concept domain-specific language with built-in abstractions for expressing control-flow constraints along with a compiler that targets the functional hardware description language ReWire. While the case study is small, it indicates, we argue, an approach to rapid-prototyping hardware-based monitors enforcing CFI that is quick, flexible, and extensible as well as being amenable to formal verification.\n},\n  url_Paper = &quot;https://harrisonwl.github.io/assets/papers/reconfig18.pdf&quot;,\n  url_Code  = &quot;https://harrisonwl.github.io/assets/code/ReConFig18codebase.tar.gz&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Control-Flow Integrity (CFI) is a software protection mechanism that detects a class of code reuse attacks by identifying anomalous control-flows within an executing program. Hardware-based CFI has the promise of the security benefits of CFI without the performance overhead and complexity of software-based CFI: generally speaking, hardware-based monitors are more difficult to bypass, offer lower performance overheads than software-based monitors, and, furthermore, hardware-based CFI can be performed without the necessity of altering application binaries or instrumenting language compilers. Although hardware-based CFI is an active area of research and there is a growing literature describing CFI strategies at a high-level, there is, to the authors' best knowledge, no work on languages specially tailored to the specification and implementation of CFI monitors. This article presents a proof-of-concept domain-specific language with built-in abstractions for expressing control-flow constraints along with a compiler that targets the functional hardware description language ReWire. While the case study is small, it indicates, we argue, an approach to rapid-prototyping hardware-based monitors enforcing CFI that is quick, flexible, and extensible as well as being amenable to formal verification. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"harrison-allwein-semanticsdirectedprototypingofhardwareruntimemonitors-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/rsp18.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-allwein-semanticsdirectedprototypingofhardwareruntimemonitors-2018', 'https://harrisonwl.github.io/assets/papers/rsp18.pdf', event);\">\n    Semantics-directed Prototyping of Hardware Runtime Monitors.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 29th International Symposium on Rapid System Prototyping (RSP)</i>, October 2018. \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://harrisonwl.github.io/assets/papers/rsp18.pdf\"\n     onclick=\"log_download('harrison-allwein-semanticsdirectedprototypingofhardwareruntimemonitors-2018', 'https://harrisonwl.github.io/assets/papers/rsp18.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Semantics-directed Prototyping of Hardware Runtime Monitors [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-allwein-semanticsdirectedprototypingofhardwareruntimemonitors-2018\"\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>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('harrison-allwein-semanticsdirectedprototypingofhardwareruntimemonitors-2018')\" -->\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{harrison18a,\n  title = {Semantics-directed Prototyping of Hardware Runtime Monitors},\n  author = {Harrison, William L. and Allwein, Gerard},\n  booktitle = {Proceedings of the 29th International Symposium on Rapid System Prototyping (RSP)},\n  month = Oct,\n  year = {2018},\n  abstract = {Building memory protection mechanisms into embedded hardware is attractive because it has the potential to neutralize a host of software-based attacks with relatively small performance overhead. A hardware monitor, being at the lowest level of the system stack, is more difficult to bypass than a software monitor and hardware-based protections are also potentially more fine-grained than is possible in software: an individual instruction executing on a processor may entail multiple memory accesses, all of which may be tracked in hardware. Finally, hardware-based protection can be performed without the necessity of altering application binaries. This article presents a proof-of-concept codesign of a small embedded processor with a hardware monitor protecting against ROP-style code reuse attacks. While the case study is small, it indicates, we argue, an approach to rapid-prototyping runtime monitors in hardware that is quick, flexible, and extensible as well as being amenable to formal verification.},\n  url_Paper = &quot;https://harrisonwl.github.io/assets/papers/rsp18.pdf&quot;,\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Building memory protection mechanisms into embedded hardware is attractive because it has the potential to neutralize a host of software-based attacks with relatively small performance overhead. A hardware monitor, being at the lowest level of the system stack, is more difficult to bypass than a software monitor and hardware-based protections are also potentially more fine-grained than is possible in software: an individual instruction executing on a processor may entail multiple memory accesses, all of which may be tracked in hardware. Finally, hardware-based protection can be performed without the necessity of altering application binaries. This article presents a proof-of-concept codesign of a small embedded processor with a hardware monitor protecting against ROP-style code reuse attacks. While the case study is small, it indicates, we argue, an approach to rapid-prototyping runtime monitors in hardware that is quick, flexible, and extensible as well as being amenable to formal verification.\n</div>\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        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"reynolds-procter-harrison-allwein-acorecalculusforsecurehardwareitsformalsemanticsandproofsystem-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/memocode17.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'reynolds-procter-harrison-allwein-acorecalculusforsecurehardwareitsformalsemanticsandproofsystem-2017', 'https://harrisonwl.github.io/assets/papers/memocode17.pdf', event);\">\n    A Core Calculus for Secure Hardware: Its Formal Semantics and Proof System.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Reynolds, T. N.; Procter, A.; <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 15th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE17)</i>,  2017. \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://harrisonwl.github.io/assets/papers/memocode17.pdf\"\n     onclick=\"log_download('reynolds-procter-harrison-allwein-acorecalculusforsecurehardwareitsformalsemanticsandproofsystem-2017', 'https://harrisonwl.github.io/assets/papers/memocode17.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Core Calculus for Secure Hardware: Its Formal Semantics and Proof System [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/reynolds-procter-harrison-allwein-acorecalculusforsecurehardwareitsformalsemanticsandproofsystem-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  &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('reynolds-procter-harrison-allwein-acorecalculusforsecurehardwareitsformalsemanticsandproofsystem-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</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{reynolds17,\n  title = {A Core Calculus for Secure Hardware: Its Formal Semantics and Proof System},\n  author = {Reynolds, Thomas N. and Procter, Adam and Harrison, William L. and Allwein, Gerard},\n  booktitle = {Proceedings of the 15th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE17)},\n  year = {2017},\n  abstract = {Constructing high assurance, secure hardware remains a challenge, because to do so relies on both a verifiable means of hardware description and implementation. However, production hardware description languages (HDL) lack the formal underpinnings required by formal methods in security. Still, there is no such thing as high assurance systems without high assurance hardware. We present a core calculus of secure hardware description with its formal semantics, security type system and mechanization in Coq. This calculus is the core of the functional HDL, ReWire, shown in previous work to have useful applications in reconfigurable computing. This work supports a full-fledged, formal methodology for producing high assurance hardware.},\n  url_Paper = &quot;https://harrisonwl.github.io/assets/papers/memocode17.pdf&quot;,\n}\n                  \n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Constructing high assurance, secure hardware remains a challenge, because to do so relies on both a verifiable means of hardware description and implementation. However, production hardware description languages (HDL) lack the formal underpinnings required by formal methods in security. Still, there is no such thing as high assurance systems without high assurance hardware. We present a core calculus of secure hardware description with its formal semantics, security type system and mechanization in Coq. This calculus is the core of the functional HDL, ReWire, shown in previous work to have useful applications in reconfigurable computing. This work supports a full-fledged, formal methodology for producing high assurance hardware.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"allwein-harrison-reynolds-distributedrelationlogic-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/llp17.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'allwein-harrison-reynolds-distributedrelationlogic-2017', 'https://harrisonwl.github.io/assets/papers/llp17.pdf', event);\">\n    Distributed Relation Logic.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Allwein, G.; <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>;  and Reynolds, T.\n</span>\n\n  \n\n</span>\n\n  <i>Logic and Logical Philosophy</i>, 26(1): 19-61.  2017.\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://harrisonwl.github.io/assets/papers/llp17.pdf\"\n     onclick=\"log_download('allwein-harrison-reynolds-distributedrelationlogic-2017', 'https://harrisonwl.github.io/assets/papers/llp17.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Distributed Relation Logic [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/allwein-harrison-reynolds-distributedrelationlogic-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('allwein-harrison-reynolds-distributedrelationlogic-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</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{allwein17,\n\tauthor = {Gerard Allwein and William L. Harrison and Thomas Reynolds},\n\ttitle = {Distributed Relation Logic},\n\tjournal = {Logic and Logical Philosophy},\n\tvolume = {26},\n\tnumber = {1},\n        pages = {19-61},          \n\tyear = {2017},\n\tkeywords = {relation algebra; multisorted algebra; distributed logic; Kripke frames; Kripke models},\n\tabstract = {We extend the relational algebra of Chin and Tarski so that it is multisorted or, as we prefer, typed. Each type supports a local Boolean algebra outfitted with a converse operator. From Lyndon, we know that relation algebras cannot be represented as proper relation algebras where a proper relation algebra has binary relations as elements and the algebra is singly-typed. Here, the intensional conjunction, which was to represent relational composition in Chin and Tarski, spans three different local algebras, thus the term distributed in the title. Since we do not rely on proper relation algebras, we are free to re-express the algebras as typed. In doing so, we allow many different intensional conjunction operators.We construct a typed logic over these algebras, also known as heterogeneous algebras of Birkhoff and Lipson. The logic can be seen as a form of relevance logic with a classical negation connective where the Routley-Meyer star operator is reified as a converse connective in the logic. Relevance logic itself is not typed but our work shows how it can be made so. Some of the properties of classical relevance logic are weakened from Routley-Meyer’s version which is too strong for a logic over relation algebras.},\n\tissn = {2300-9802},\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/llp17.pdf&quot;,\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 extend the relational algebra of Chin and Tarski so that it is multisorted or, as we prefer, typed. Each type supports a local Boolean algebra outfitted with a converse operator. From Lyndon, we know that relation algebras cannot be represented as proper relation algebras where a proper relation algebra has binary relations as elements and the algebra is singly-typed. Here, the intensional conjunction, which was to represent relational composition in Chin and Tarski, spans three different local algebras, thus the term distributed in the title. Since we do not rely on proper relation algebras, we are free to re-express the algebras as typed. In doing so, we allow many different intensional conjunction operators.We construct a typed logic over these algebras, also known as heterogeneous algebras of Birkhoff and Lipson. The logic can be seen as a form of relevance logic with a classical negation connective where the Routley-Meyer star operator is reified as a converse connective in the logic. Relevance logic itself is not typed but our work shows how it can be made so. Some of the properties of classical relevance logic are weakened from Routley-Meyer’s version which is too strong for a logic over relation algebras.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"procter-harrison-graves-becchi-allwein-aprincipledapproachtosecuremulticoreprocessordesignwithrewire-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/tecs16.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'procter-harrison-graves-becchi-allwein-aprincipledapproachtosecuremulticoreprocessordesignwithrewire-2017', 'https://harrisonwl.github.io/assets/papers/tecs16.pdf', event);\">\n    A Principled Approach to Secure Multi-Core Processor Design with ReWire.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Procter, A.; <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>; Graves, I.; Becchi, M.;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  <i>ACM Transactions on Embedded Computing Systems</i>, 16(2): 33:1–33:25. January 2017.\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://harrisonwl.github.io/assets/papers/tecs16.pdf\"\n     onclick=\"log_download('procter-harrison-graves-becchi-allwein-aprincipledapproachtosecuremulticoreprocessordesignwithrewire-2017', 'https://harrisonwl.github.io/assets/papers/tecs16.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Principled Approach to Secure Multi-Core Processor Design with ReWire [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/procter-harrison-graves-becchi-allwein-aprincipledapproachtosecuremulticoreprocessordesignwithrewire-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  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>5 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('procter-harrison-graves-becchi-allwein-aprincipledapproachtosecuremulticoreprocessordesignwithrewire-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</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{procter16,                  \n author = {Procter, Adam and Harrison, William L. and Graves, Ian and Becchi, Michela and Allwein, Gerard},\n title = {A Principled Approach to Secure Multi-Core Processor Design with ReWire},\n\tjournal = {ACM Transactions on Embedded Computing Systems},\n issue_date = {April 2017},\n volume = {16},\n number = {2},\n month = jan,\n year = {2017},\n issn = {1539-9087},\n pages = {33:1--33:25},\n articleno = {33},\n numpages = {25},\n\tabstract = {There is no such thing as high assurance without high assurance hardware. High assurance hardware is essential, because any and all high assurance systems ultimately depend on hardware that conforms to, and does not undermine, critical system properties and invariants. And yet, high assurance hardware development is stymied by the conceptual gap between formal methods and hardware description languages used by engineers. This paper advocates a {\\em semantics-directed} approach to bridge this conceptual gap. We present a case study in the design of secure processors, which are formally derived via principled techniques grounded in functional programming and equational reasoning. The case study comprises the development of secure single- and dual-core variants of a single processor, both based on a common semantic specification of the ISA. We demonstrate via formal equational reasoning that the dual-core processor respects a &#x60;&#x60;no-write-down&#x27;&#x27; information flow policy. The semantics-directed approach enables a modular and extensible style of system design and verification. The secure processors require only a very small amount of additional code to specify and implement, and their security verification arguments are concise and readable. Our approach rests critically on ReWire, a functional programming language providing a suitable foundation for formal verification of hardware designs. This case study demonstrates both ReWire&#x27;s expressiveness as a programming language and its power as a framework for formal, high-level reasoning about hardware systems.\n},\n        url_Paper = &quot;https://harrisonwl.github.io/assets/papers/tecs16.pdf&quot;,\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  There is no such thing as high assurance without high assurance hardware. High assurance hardware is essential, because any and all high assurance systems ultimately depend on hardware that conforms to, and does not undermine, critical system properties and invariants. And yet, high assurance hardware development is stymied by the conceptual gap between formal methods and hardware description languages used by engineers. This paper advocates a \\em semantics-directed approach to bridge this conceptual gap. We present a case study in the design of secure processors, which are formally derived via principled techniques grounded in functional programming and equational reasoning. The case study comprises the development of secure single- and dual-core variants of a single processor, both based on a common semantic specification of the ISA. We demonstrate via formal equational reasoning that the dual-core processor respects a ``no-write-down'' information flow policy. The semantics-directed approach enables a modular and extensible style of system design and verification. The secure processors require only a very small amount of additional code to specify and implement, and their security verification arguments are concise and readable. Our approach rests critically on ReWire, a functional programming language providing a suitable foundation for formal verification of hardware designs. This case study demonstrates both ReWire's expressiveness as a programming language and its power as a framework for formal, high-level reasoning about hardware 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_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        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"harrison-procter-allwein-modeldrivendesignsynthesisofthesha256cryptographichashfunctioninrewire-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/rsp16.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-procter-allwein-modeldrivendesignsynthesisofthesha256cryptographichashfunctioninrewire-2016', 'https://harrisonwl.github.io/assets/papers/rsp16.pdf', event);\">\n    Model-driven Design & Synthesis of the SHA-256 Cryptographic Hash Function in ReWire.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>; Procter, A.;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 27th International Symposium on Rapid System Prototyping (RSP)</i>, pages 1-7,  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://harrisonwl.github.io/assets/papers/rsp16.pdf\"\n     onclick=\"log_download('harrison-procter-allwein-modeldrivendesignsynthesisofthesha256cryptographichashfunctioninrewire-2016', 'https://harrisonwl.github.io/assets/papers/rsp16.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Model-driven Design &amp; Synthesis of the SHA-256 Cryptographic Hash Function in ReWire [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/slides-rsp16.pdf\"\n     onclick=\"log_download('harrison-procter-allwein-modeldrivendesignsynthesisofthesha256cryptographichashfunctioninrewire-2016', 'https://harrisonwl.github.io/assets/papers/slides-rsp16.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Model-driven Design &amp; Synthesis of the SHA-256 Cryptographic Hash Function in ReWire [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-procter-allwein-modeldrivendesignsynthesisofthesha256cryptographichashfunctioninrewire-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  &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>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('harrison-procter-allwein-modeldrivendesignsynthesisofthesha256cryptographichashfunctioninrewire-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;\">@inproceedings{harrison16a,\n   title = {Model-driven Design \\&amp; Synthesis of the SHA-256 Cryptographic Hash Function in ReWire},\n   author = {Harrison, William L. and Procter, Adam and Allwein, Gerard},\n   booktitle = {Proceedings of the 27th International Symposium on Rapid System Prototyping (RSP)},\n   year = {2016},\n   pages = {1-7},\n   abstract = {There are many algorithms whose implementations can benefit both from hardware acceleration and formal verification and we would like to develop high assurance implementations as rapidly as possible. Critical computing infrastructure like cryptographic algorithms are prime candidates both for such acceleration and for formal verification. We show how to derive a verifiable, hardware-accelerated implementation of the SHA-256 cryptographic hash in the ReWire functional hardware description language in which the partitioning of the implementation between hardware and software is reflected in the type system itself.\n},\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/rsp16.pdf&quot;,\n   url_Slides = &quot;https://harrisonwl.github.io/assets/papers/slides-rsp16.pdf&quot;,\n  }\n                  \n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  There are many algorithms whose implementations can benefit both from hardware acceleration and formal verification and we would like to develop high assurance implementations as rapidly as possible. Critical computing infrastructure like cryptographic algorithms are prime candidates both for such acceleration and for formal verification. We show how to derive a verifiable, hardware-accelerated implementation of the SHA-256 cryptographic hash in the ReWire functional hardware description language in which the partitioning of the implementation between hardware and software is reflected in the type system itself. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"allwein-harrison-distributedmodallogic-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://dx.doi.org/10.1007/978-3-319-29300-4_16\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'allwein-harrison-distributedmodallogic-2016', 'http://dx.doi.org/10.1007/978-3-319-29300-4_16', event);\">\n    Distributed Modal Logic.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Allwein, G.;  and <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>\n</span>\n\n  \n\n</span>\n\n  In Bimbó, K., editor(s), <i>J. Michael Dunn on Information Based Logics</i>, pages 331–362. Springer International Publishing,  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=\"http://dx.doi.org/10.1007/978-3-319-29300-4_16\"\n     onclick=\"log_download('allwein-harrison-distributedmodallogic-2016', 'http://dx.doi.org/10.1007/978-3-319-29300-4_16', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Distributed Modal Logic [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/allwein-harrison-distributedmodallogic-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  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('allwein-harrison-distributedmodallogic-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;\">@incollection{allwein2016a,\nauthor = &quot;Allwein, Gerard and Harrison, William L.&quot;,\neditor = &quot;Bimb{\\&#x27;o}, Katalin&quot;,\ntitle = &quot;Distributed Modal Logic&quot;,\nbookTitle = &quot;J. Michael Dunn on Information Based Logics&quot;,\nyear = &quot;2016&quot;,\npublisher = &quot;Springer International Publishing&quot;,\npages = &quot;331--362&quot;,\nisbn = &quot;978-3-319-29300-4&quot;,\nurl=&quot;http://dx.doi.org/10.1007/978-3-319-29300-4_16&quot;\n}\n                  \n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"harrison-procter-graves-becchi-allwein-aprogrammingmodelforreconfigurablecomputingbasedinfunctionalconcurrency-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/recosoc16.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-procter-graves-becchi-allwein-aprogrammingmodelforreconfigurablecomputingbasedinfunctionalconcurrency-2016', 'https://harrisonwl.github.io/assets/papers/recosoc16.pdf', event);\">\n    A Programming Model for Reconfigurable Computing Based in Functional Concurrency.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>; Procter, A.; Graves, I.; Becchi, M.;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC 2016)</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://harrisonwl.github.io/assets/papers/recosoc16.pdf\"\n     onclick=\"log_download('harrison-procter-graves-becchi-allwein-aprogrammingmodelforreconfigurablecomputingbasedinfunctionalconcurrency-2016', 'https://harrisonwl.github.io/assets/papers/recosoc16.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Programming Model for Reconfigurable Computing Based in Functional Concurrency [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/slides-recosoc16.pdf\"\n     onclick=\"log_download('harrison-procter-graves-becchi-allwein-aprogrammingmodelforreconfigurablecomputingbasedinfunctionalconcurrency-2016', 'https://harrisonwl.github.io/assets/papers/slides-recosoc16.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Programming Model for Reconfigurable Computing Based in Functional Concurrency [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-procter-graves-becchi-allwein-aprogrammingmodelforreconfigurablecomputingbasedinfunctionalconcurrency-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  &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>5 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('harrison-procter-graves-becchi-allwein-aprogrammingmodelforreconfigurablecomputingbasedinfunctionalconcurrency-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;\">@inproceedings{harrison16,\n   title = {A Programming Model for Reconfigurable Computing Based in Functional Concurrency},\n   author = {Harrison, William L. and Procter, Adam and Graves, Ian and Becchi, Michela and Allwein, Gerard},\n   booktitle = {Proceedings of the 11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC 2016)},\n   year = {2016},\n   pages = {},\n   abstract = {FPGA programmability remains a concern with respect to the broad adoption of the technology. One reason for this is simple: FPGA applications are frequently implementations of concurrent algorithms that could be most directly rendered in concurrent languages, but there is little or no first-class support for concurrent applications in conventional hardware description languages. It stands to reason that FPGA programmability would be enhanced in a hardware description language with first-class concurrency. The starting point for this paper is a functional hardware description language with built-in support for concurrency called ReWire. Because it is a concurrent functional language, ReWire supports the elegant expression of common concurrency paradigms; we illustrate this with several case studies. },                  \n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/recosoc16.pdf&quot;,\n   url_Slides = &quot;https://harrisonwl.github.io/assets/papers/slides-recosoc16.pdf&quot;,\n  }\n\n  \n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  FPGA programmability remains a concern with respect to the broad adoption of the technology. One reason for this is simple: FPGA applications are frequently implementations of concurrent algorithms that could be most directly rendered in concurrent languages, but there is little or no first-class support for concurrent applications in conventional hardware description languages. It stands to reason that FPGA programmability would be enhanced in a hardware description language with first-class concurrency. The starting point for this paper is a functional hardware description language with built-in support for concurrency called ReWire. Because it is a concurrent functional language, ReWire supports the elegant expression of common concurrency paradigms; we illustrate this with several case studies. \n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2015\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2015')\"\n      onkeypress=\"toggleGroup('group_2015')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2015</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"harrison-procter-cheapbutfunctionalthreads-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/hosc-cheapthreads.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-procter-cheapbutfunctionalthreads-2015', 'https://harrisonwl.github.io/assets/papers/hosc-cheapthreads.pdf', event);\">\n    Cheap (But Functional) Threads.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>;  and Procter, A.\n</span>\n\n  \n\n</span>\n\n  <i>Higher Order and Symbolic Computation (accepted for publication)</i>.  2015.\n  <span class=\"note\">Draft version</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://harrisonwl.github.io/assets/papers/hosc-cheapthreads.pdf\"\n     onclick=\"log_download('harrison-procter-cheapbutfunctionalthreads-2015', 'https://harrisonwl.github.io/assets/papers/hosc-cheapthreads.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Cheap (But Functional) Threads [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-procter-cheapbutfunctionalthreads-2015\"\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>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('harrison-procter-cheapbutfunctionalthreads-2015')\" -->\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{CheapThreads,\n  author =       &quot;William L. Harrison and Adam Procter&quot;,\n  title =        &quot;Cheap (But Functional) Threads&quot;,\n  journal =      &quot;Higher Order and Symbolic Computation (accepted for publication)&quot;,\n  note = {Draft version},\n  year = 2015,                  \n  abstract = &quot;This article demonstrates how a powerful and expressive abstraction \nfrom concurrency theory plays a dual role as a programming tool \nfor concurrent applications and as a foundation for their verification.\nThis abstraction---monads of resumptions expressed using monad \ntransformers---is \\emph{cheap}: it is easy to understand, easy to \nimplement, and easy to reason about.\nWe illustrate the expressiveness of the resumption monad with the \nconstruction of an exemplary multitasking operating system kernel \nwith process forking, preemption, message passing, and \nsynchronization constructs in the pure functional programming \nlanguage Haskell.\nBecause resumption computations are stream-like structures, reasoning \nabout this kernel may be posed as reasoning about streams, a problem \nwhich is well-understood. And, as an example, this article \nillustrates how a liveness property---fairness---is proven and \nespecially how the resumption-monadic structure promotes such \nverifications.&quot;,\n  url_Paper = &quot;https://harrisonwl.github.io/assets/papers/hosc-cheapthreads.pdf&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This article demonstrates how a powerful and expressive abstraction from concurrency theory plays a dual role as a programming tool for concurrent applications and as a foundation for their verification. This abstraction—monads of resumptions expressed using monad transformers—is \\emphcheap: it is easy to understand, easy to implement, and easy to reason about. We illustrate the expressiveness of the resumption monad with the construction of an exemplary multitasking operating system kernel with process forking, preemption, message passing, and synchronization constructs in the pure functional programming language Haskell. Because resumption computations are stream-like structures, reasoning about this kernel may be posed as reasoning about streams, a problem which is well-understood. And, as an example, this article illustrates how a liveness property—fairness—is proven and especially how the resumption-monadic structure promotes such verifications.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"graves-procter-harrison-allwein-provablycorrectdevelopmentofreconfigurablehardwaredesignsviaequationalreasoning-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/fpt15.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'graves-procter-harrison-allwein-provablycorrectdevelopmentofreconfigurablehardwaredesignsviaequationalreasoning-2015', 'https://harrisonwl.github.io/assets/papers/fpt15.pdf', event);\">\n    Provably Correct Development of reconfigurable hardware designs via equational reasoning.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Graves, I.; Procter, A. M.; <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2015 International Conference on Field-Programmable Technology (FPT '15)</i>, pages 160-171,  2015. IEEE\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://harrisonwl.github.io/assets/papers/fpt15.pdf\"\n     onclick=\"log_download('graves-procter-harrison-allwein-provablycorrectdevelopmentofreconfigurablehardwaredesignsviaequationalreasoning-2015', 'https://harrisonwl.github.io/assets/papers/fpt15.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Provably Correct Development of reconfigurable hardware designs via equational reasoning. [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/slides-fpt15.pdf\"\n     onclick=\"log_download('graves-procter-harrison-allwein-provablycorrectdevelopmentofreconfigurablehardwaredesignsviaequationalreasoning-2015', 'https://harrisonwl.github.io/assets/papers/slides-fpt15.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Provably Correct Development of reconfigurable hardware designs via equational reasoning. [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/graves-procter-harrison-allwein-provablycorrectdevelopmentofreconfigurablehardwaredesignsviaequationalreasoning-2015\"\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  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>10 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('graves-procter-harrison-allwein-provablycorrectdevelopmentofreconfigurablehardwaredesignsviaequationalreasoning-2015')\" -->\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{graves15a,\n  author = {Graves, Ian and Procter, Adam M. and Harrison, William L. and Allwein, Gerard},\n  booktitle = {Proceedings of the 2015 International Conference on\nField-Programmable Technology (FPT &#x27;15)},\n  isbn = {978-1-4673-9091-0},\n  pages = {160-171},\n  publisher = {IEEE},\n  title = {Provably Correct Development of reconfigurable hardware designs via equational reasoning.},\n  year = 2015,\n  url_Paper = &quot;https://harrisonwl.github.io/assets/papers/fpt15.pdf&quot;,\n  url_Slides = &quot;https://harrisonwl.github.io/assets/papers/slides-fpt15.pdf&quot;,\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"procter-harrison-graves-becchi-allwein-semanticsdrivenhardwaredesignimplementationandverificationwithrewire-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/lctes15.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'procter-harrison-graves-becchi-allwein-semanticsdrivenhardwaredesignimplementationandverificationwithrewire-2015', 'https://harrisonwl.github.io/assets/papers/lctes15.pdf', event);\">\n    Semantics Driven Hardware Design, Implementation, and Verification with ReWire.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Procter, A.; <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>; Graves, I.; Becchi, M.;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 16th ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2015 CD-ROM</i>, of <i>LCTES'15</i>, pages 13:1–13:10,  2015. \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://harrisonwl.github.io/assets/papers/lctes15.pdf\"\n     onclick=\"log_download('procter-harrison-graves-becchi-allwein-semanticsdrivenhardwaredesignimplementationandverificationwithrewire-2015', 'https://harrisonwl.github.io/assets/papers/lctes15.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Semantics Driven Hardware Design, Implementation, and Verification with ReWire [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/procter-harrison-graves-becchi-allwein-semanticsdrivenhardwaredesignimplementationandverificationwithrewire-2015\"\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>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('procter-harrison-graves-becchi-allwein-semanticsdrivenhardwaredesignimplementationandverificationwithrewire-2015')\" -->\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{procter15,\n author = {Procter, Adam and Harrison, William L. and Graves, Ian and Becchi, Michela and Allwein, Gerard},\n title = {Semantics Driven Hardware Design, Implementation, and Verification with ReWire},\n booktitle = {Proceedings of the 16th ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2015 CD-ROM},\n series = {LCTES&#x27;15},\n year = {2015},\n isbn = {978-1-4503-3257-6},\n location = {Portland, OR, USA},\n pages = {13:1--13:10},\n articleno = {13},\n numpages = {10},\n abstract = &quot;There is no such thing as high assurance without high assurance hardware. High assurance hardware is essential, because any and all high assurance systems ultimately depend on hardware that conforms to, and does not undermine, critical system properties and invariants. And yet, high assurance hardware development is stymied by the conceptual gap between formal methods and hardware description languages used by engineers. This paper presents ReWire, a functional programming language providing a suitable foundation for formal verification of hardware designs, and a compiler for that language that translates high-level, semantics-driven designs directly into working hardware. ReWire&#x27;s design and implementation are presented, along with a case study in the design of a secure multicore processor, demonstrating both ReWire&#x27;s expressiveness as a programming language and its power as a framework for formal, high-level reasoning about hardware systems.&quot;,                 \n url_Paper = {https://harrisonwl.github.io/assets/papers/lctes15.pdf},\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  There is no such thing as high assurance without high assurance hardware. High assurance hardware is essential, because any and all high assurance systems ultimately depend on hardware that conforms to, and does not undermine, critical system properties and invariants. And yet, high assurance hardware development is stymied by the conceptual gap between formal methods and hardware description languages used by engineers. This paper presents ReWire, a functional programming language providing a suitable foundation for formal verification of hardware designs, and a compiler for that language that translates high-level, semantics-driven designs directly into working hardware. ReWire's design and implementation are presented, along with a case study in the design of a secure multicore processor, demonstrating both ReWire's expressiveness as a programming language and its power as a framework for formal, high-level reasoning about hardware systems.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"graves-procter-harrison-becchi-allwein-hardwaresynthesisfromfunctionalembeddeddomainspecificlanguagesacasestudyinregularexpressioncompilation-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/arc15.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'graves-procter-harrison-becchi-allwein-hardwaresynthesisfromfunctionalembeddeddomainspecificlanguagesacasestudyinregularexpressioncompilation-2015', 'https://harrisonwl.github.io/assets/papers/arc15.pdf', event);\">\n    Hardware Synthesis from Functional Embedded Domain-Specific Languages: A Case Study in Regular Expression Compilation.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Graves, I.; Procter, A.; <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>; Becchi, M.;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In Sano, K.; Soudris, D.; Huebner, M.;  and Diniz, P. C., editor(s), <i>Applied Reconfigurable Computing</i>, volume 9040, of Lecture Notes in Computer Science, pages 41-52.  2015.\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://harrisonwl.github.io/assets/papers/arc15.pdf\"\n     onclick=\"log_download('graves-procter-harrison-becchi-allwein-hardwaresynthesisfromfunctionalembeddeddomainspecificlanguagesacasestudyinregularexpressioncompilation-2015', 'https://harrisonwl.github.io/assets/papers/arc15.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Hardware Synthesis from Functional Embedded Domain-Specific Languages: A Case Study in Regular Expression Compilation [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/graves-procter-harrison-becchi-allwein-hardwaresynthesisfromfunctionalembeddeddomainspecificlanguagesacasestudyinregularexpressioncompilation-2015\"\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>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('graves-procter-harrison-becchi-allwein-hardwaresynthesisfromfunctionalembeddeddomainspecificlanguagesacasestudyinregularexpressioncompilation-2015')\" -->\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;\">@incollection{graves15,\nyear={2015},\nbooktitle={Applied Reconfigurable Computing},\nvolume={9040},\nseries={Lecture Notes in Computer Science},\neditor={Sano, Kentaro and Soudris, Dimitrios and Huebner, Michael and Diniz, Pedro C.},\ntitle={Hardware Synthesis from Functional Embedded Domain-Specific Languages: A Case Study in Regular Expression Compilation},\nauthor={Graves, Ian and Procter, Adam and Harrison, William L. and Becchi, Michela and Allwein, Gerard},\npages={41-52},\nabstract = &quot;Although FPGAs have the potential to bring software-like flexibility and agility to the hardware world, designing for FPGAs remains a difficult task divorced from standard software engineering norms. A better programming flow would go far towards realizing the potential of widely deployed, programmable hardware. We propose a general methodology based on domain specific languages embedded in the functional language Haskell to bridge the gap between high level abstractions that support programmer productivity and the need for high performance in FPGA circuit implementations. We illustrate this methodology with a framework for regular expression to hardware compilers, written in Haskell, that supports high programmer productivity while producing circuits whose performance matches and, indeed, exceeds that of a state of the art, hand-optimized VHDL-based tool. For example, after applying a  novel optimization pass, throughput increased an average of 28.3 percent over the state of the art tool for one set of benchmarks.&quot;,\n url_Paper = &quot;https://harrisonwl.github.io/assets/papers/arc15.pdf&quot;,\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Although FPGAs have the potential to bring software-like flexibility and agility to the hardware world, designing for FPGAs remains a difficult task divorced from standard software engineering norms. A better programming flow would go far towards realizing the potential of widely deployed, programmable hardware. We propose a general methodology based on domain specific languages embedded in the functional language Haskell to bridge the gap between high level abstractions that support programmer productivity and the need for high performance in FPGA circuit implementations. We illustrate this methodology with a framework for regular expression to hardware compilers, written in Haskell, that supports high programmer productivity while producing circuits whose performance matches and, indeed, exceeds that of a state of the art, hand-optimized VHDL-based tool. For example, after applying a novel optimization pass, throughput increased an average of 28.3 percent over the state of the art tool for one set of benchmarks.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2014\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2014')\"\n      onkeypress=\"toggleGroup('group_2014')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2014</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=\"allwein-harrison-distributedlogics-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/dist-logics-tech-report.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'allwein-harrison-distributedlogics-2014', 'https://harrisonwl.github.io/assets/papers/dist-logics-tech-report.pdf', event);\">\n    Distributed Logics.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Allwein, G.;  and <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>\n</span>\n\n  \n\n</span>\n\n  Technical Report NRL/MR/5540-14-9565, US Naval Research Laboratory,  2014.\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://harrisonwl.github.io/assets/papers/dist-logics-tech-report.pdf\"\n     onclick=\"log_download('allwein-harrison-distributedlogics-2014', 'https://harrisonwl.github.io/assets/papers/dist-logics-tech-report.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Distributed Logics [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/allwein-harrison-distributedlogics-2014\"\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  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('allwein-harrison-distributedlogics-2014')\" -->\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;\">@TechReport{allwein14,\n  author = \t {Gerard Allwein and William L. Harrison},\n  title = \t {{Distributed Logics}},\n  institution =  {US Naval Research Laboratory},\n  number =       &quot;NRL/MR/5540-14-9565&quot;,\n  year = \t 2014,\n  htr =          &quot;yes&quot;,\n  url_Paper =    &quot;https://harrisonwl.github.io/assets/papers/dist-logics-tech-report.pdf&quot;,\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        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"procter-harrison-graves-becchi-allwein-semanticsdirectedmachinearchitectureinrewire-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/icfpt13.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'procter-harrison-graves-becchi-allwein-semanticsdirectedmachinearchitectureinrewire-2013', 'https://harrisonwl.github.io/assets/papers/icfpt13.pdf', event);\">\n    Semantics-directed Machine Architecture in ReWire.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Procter, A.; <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>; Graves, I.; Becchi, M.;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2013 International Conference on Field Programmable Technology</i>, pages 446-449, Dec 2013. \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://harrisonwl.github.io/assets/papers/icfpt13.pdf\"\n     onclick=\"log_download('procter-harrison-graves-becchi-allwein-semanticsdirectedmachinearchitectureinrewire-2013', 'https://harrisonwl.github.io/assets/papers/icfpt13.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Semantics-directed Machine Architecture in ReWire [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/procter-harrison-graves-becchi-allwein-semanticsdirectedmachinearchitectureinrewire-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  &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('procter-harrison-graves-becchi-allwein-semanticsdirectedmachinearchitectureinrewire-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  \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{icfpt13,\n   title = &quot;Semantics-directed Machine Architecture in ReWire&quot;,\n   booktitle = &quot;Proceedings of the 2013 International Conference on Field Programmable Technology&quot;,\n   author = &quot;Adam Procter and William L. Harrison and Ian Graves and Michela Becchi and Gerard Allwein&quot;,\n   year = 2013,\nmonth={Dec}, \npages={446-449}, \nabstract={The functional programming community has developed a number of powerful abstractions for dealing with diverse programming models in a modular way. Beginning with a core of pure, side effect free computation, modular monadic semantics (MMS) allows designers to construct domain-specific languages by adding layers of semantic features, such as mutable state and I/O, in an a&#x27; la carte fashion. In the realm of interpreter and compiler construction, the benefits of this approach are manifold and well explored. This paper advocates bringing the tools of MMS to bear on hardware design and verification. In particular, we shall discuss a prototype compiler called ReWire which translates high-level MMS hardware specifications into working circuits on FPGAs. This enables designers to tackle the complexity of hardware design in a modular way, without compromising efficiency.}, \nkeywords={electronic engineering computing;field programmable gate arrays;formal verification;functional programming;program compilers;FPGA;MMS;ReWire;compiler construction;diverse programming models;domain-specific languages;functional programming;hardware design;modular monadic semantics;semantics-directed machine architecture;verification;Field programmable gate arrays;Hardware;Microcontrollers;Ports (Computers);Random access memory;Registers;Semantics}, \n    url_Paper = &quot;https://harrisonwl.github.io/assets/papers/icfpt13.pdf&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The functional programming community has developed a number of powerful abstractions for dealing with diverse programming models in a modular way. Beginning with a core of pure, side effect free computation, modular monadic semantics (MMS) allows designers to construct domain-specific languages by adding layers of semantic features, such as mutable state and I/O, in an a' la carte fashion. In the realm of interpreter and compiler construction, the benefits of this approach are manifold and well explored. This paper advocates bringing the tools of MMS to bear on hardware design and verification. In particular, we shall discuss a prototype compiler called ReWire which translates high-level MMS hardware specifications into working circuits on FPGAs. This enables designers to tackle the complexity of hardware design in a modular way, without compromising efficiency.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"harrison-harrison-quantitativeanalysisoferrorinjectioncovertchannels-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/interchannel.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-harrison-quantitativeanalysisoferrorinjectioncovertchannels-2013', 'https://harrisonwl.github.io/assets/papers/interchannel.pdf', event);\">\n    Quantitative Analysis of Error Injection Covert Channels.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Harrison, R.;  and <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the International Workshop on Quantitative Aspects in Security Assurance (QASA13)</i>,  2013. \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://harrisonwl.github.io/assets/papers/interchannel.pdf\"\n     onclick=\"log_download('harrison-harrison-quantitativeanalysisoferrorinjectioncovertchannels-2013', 'https://harrisonwl.github.io/assets/papers/interchannel.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Quantitative Analysis of Error Injection Covert Channels [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-harrison-quantitativeanalysisoferrorinjectioncovertchannels-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  &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('harrison-harrison-quantitativeanalysisoferrorinjectioncovertchannels-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{qasa13,\n   title = &quot;Quantitative Analysis of Error Injection Covert Channels&quot;,\n   booktitle = &quot;Proceedings of the International Workshop on Quantitative Aspects in Security Assurance (QASA13)&quot;,\n   author = &quot;Robert Harrison and William L. Harrison&quot;,\n   year = 2013,\n   abstract = &quot;Covert channels are mechanisms for communication where a legitimate channel carries a hidden message, and where the hidden message is conveyed using legal operations of the legitimate channel. Quantitative modeling of the response of the covert channel to noise results in an enhanced understanding of the channel and delimits the range of conditions under which a covert channel can operate effectively. The analysis of two covert channels using the confusion matrix and noise models shows that the techniques presented in this paper are widely applicable to covert information flows in noisy channels.&quot;,               \n    url_Paper = &quot;https://harrisonwl.github.io/assets/papers/interchannel.pdf&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Covert channels are mechanisms for communication where a legitimate channel carries a hidden message, and where the hidden message is conveyed using legal operations of the legitimate channel. Quantitative modeling of the response of the covert channel to noise results in an enhanced understanding of the channel and delimits the range of conditions under which a covert channel can operate effectively. The analysis of two covert channels using the confusion matrix and noise models shows that the techniques presented in this paper are widely applicable to covert information flows in noisy channels.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"allwein-harrison-andrews-simulationlogic-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/llp2014.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'allwein-harrison-andrews-simulationlogic-2013', 'https://harrisonwl.github.io/assets/papers/llp2014.pdf', event);\">\n    Simulation logic.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Allwein, G.; <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>;  and Andrews, D.\n</span>\n\n  \n\n</span>\n\n  <i>Logic and Logical Philosophy</i>, 23(3): 277–299. Sep. 2013.\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://harrisonwl.github.io/assets/papers/llp2014.pdf\"\n     onclick=\"log_download('allwein-harrison-andrews-simulationlogic-2013', 'https://harrisonwl.github.io/assets/papers/llp2014.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Simulation logic [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/allwein-harrison-andrews-simulationlogic-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  &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>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('allwein-harrison-andrews-simulationlogic-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  \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{LLP13,\n\tauthor = {Gerard Allwein and William Harrison and David Andrews},\n\ttitle = {Simulation logic},\n\tjournal = {Logic and Logical Philosophy},\n\tvolume = {23},\n\tnumber = {3},\n\tyear = {2013},\n        month={Sep.},\n        pages={277–299},\n\tkeywords = {modal logic; simulations; Hilbert systems; Kripke; modal algebras},\n\tabstract = {Simulation relations have been discovered in many areas: Computer Science, philosophical and modal logic, and set theory. However, the simulation condition is strictly a first-order logic statement. We extend modal logic with modalities and axioms, the latter&#x27;s modeling conditions are the simulation conditions. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The simulations are considered arrows in a category where the objects are descriptive, general frames. One can augment the simulation modalities by axioms for requiring the underlying modeling simulations to be bisimulations or to be p-morphisms. The modal systems presented are multi-sorted and both sound and complete with respect to their algebraic and Kripke semantics.},\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/llp2014.pdf&quot;,\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Simulation relations have been discovered in many areas: Computer Science, philosophical and modal logic, and set theory. However, the simulation condition is strictly a first-order logic statement. We extend modal logic with modalities and axioms, the latter's modeling conditions are the simulation conditions. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The simulations are considered arrows in a category where the objects are descriptive, general frames. One can augment the simulation modalities by axioms for requiring the underlying modeling simulations to be bisimulations or to be p-morphisms. The modal systems presented are multi-sorted and both sound and complete with respect to their algebraic and Kripke semantics.\n</div>\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        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"williamlharrison-allwein-theconfinementprobleminthepresenceoffaults-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/icfem12.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'williamlharrison-allwein-theconfinementprobleminthepresenceoffaults-2012', 'https://harrisonwl.github.io/assets/papers/icfem12.pdf', event);\">\n    The Confinement Problem in the Presence of Faults.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  William L. Harrison, A. P.;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2012 International Conference on Formal Engineering Methods</i>,  2012. \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://harrisonwl.github.io/assets/papers/icfem12.pdf\"\n     onclick=\"log_download('williamlharrison-allwein-theconfinementprobleminthepresenceoffaults-2012', 'https://harrisonwl.github.io/assets/papers/icfem12.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Confinement Problem in the Presence of Faults [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/williamlharrison-allwein-theconfinementprobleminthepresenceoffaults-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('williamlharrison-allwein-theconfinementprobleminthepresenceoffaults-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{ICFEM12,\n   title = &quot;The Confinement Problem in the Presence of Faults&quot;,\n   booktitle = &quot;Proceedings of the 2012 International Conference on Formal Engineering Methods&quot;,\n   author = &quot;William L. Harrison, Adam Procter and Gerard Allwein&quot;,\n   year = 2012,\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/icfem12.pdf&quot;,\n  abstract = &quot;In this paper, we establish a semantic foundation for the safe\nexecution of untrusted code. Our approach extends Moggi&#x27;s computational $\\lambda$-calculus in two dimensions with operations for asynchronous concurrency, shared state and software faults and with an effect type system $\\grave{a}$ la Wadler providing fine-grained control of effects. An equational system for fault isolation is exhibited and its soundness demonstrated with a semantics based on monad transformers. Our formalization of the equational system in the Coq theorem prover is discussed. We argue that the approach may be generalized to capture other safety properties, including information flow security.&quot;,\n   }                  \n                  \n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we establish a semantic foundation for the safe execution of untrusted code. Our approach extends Moggi's computational $λ$-calculus in two dimensions with operations for asynchronous concurrency, shared state and software faults and with an effect type system $à$ la Wadler providing fine-grained control of effects. An equational system for fault isolation is exhibited and its soundness demonstrated with a semantics based on monad transformers. Our formalization of the equational system in the Coq theorem prover is discussed. We argue that the approach may be generalized to capture other safety properties, including information flow security.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"chrishathhorn-procter-formalsemanticsofheterogeneouscudacamodularapproachwithapplications-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/ssv12.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'chrishathhorn-procter-formalsemanticsofheterogeneouscudacamodularapproachwithapplications-2012', 'https://harrisonwl.github.io/assets/papers/ssv12.pdf', event);\">\n    Formal Semantics of Heterogeneous CUDA-C: A Modular Approach with Applications.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Chris Hathhorn, M. B.;  and Procter, A.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2012 Systems Software Verification Conference</i>,  2012. \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://harrisonwl.github.io/assets/papers/ssv12.pdf\"\n     onclick=\"log_download('chrishathhorn-procter-formalsemanticsofheterogeneouscudacamodularapproachwithapplications-2012', 'https://harrisonwl.github.io/assets/papers/ssv12.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Formal Semantics of Heterogeneous CUDA-C: A Modular Approach with Applications [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/chrishathhorn-procter-formalsemanticsofheterogeneouscudacamodularapproachwithapplications-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  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('chrishathhorn-procter-formalsemanticsofheterogeneouscudacamodularapproachwithapplications-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{SSV12,\n   title = &quot;Formal Semantics of Heterogeneous CUDA-C: A Modular Approach with Applications&quot;,\n   booktitle = &quot;Proceedings of the 2012 Systems Software Verification Conference&quot;,\n   author = &quot;Chris Hathhorn, Michela Becchi, William L. Harrison and Adam Procter&quot;,\n   year = 2012,\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/ssv12.pdf&quot;,\n  abstract = &quot;We extend an off-the-shelf, executable formal semantics of C (Ellison and Rosiu&#x27;s K Framework semantics) with the core features of CUDA-C. The hybrid CPU/GPU computation model of CUDA-C presents challenges not just for programmers, but also for practitioners of formal methods. Our formal semantics helps expose and clarify these issues. We demonstrate the usefulness of our semantics by generating a tool from it\ncapable of detecting some race conditions and deadlocks in CUDA-C programs. We discuss limitations of our model and argue that its extensibility can easily\nenable a wider range of verification tasks.&quot;,\n   }                  \n                  \n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We extend an off-the-shelf, executable formal semantics of C (Ellison and Rosiu's K Framework semantics) with the core features of CUDA-C. The hybrid CPU/GPU computation model of CUDA-C presents challenges not just for programmers, but also for practitioners of formal methods. Our formal semantics helps expose and clarify these issues. We demonstrate the usefulness of our semantics by generating a tool from it capable of detecting some race conditions and deadlocks in CUDA-C programs. We discuss limitations of our model and argue that its extensibility can easily enable a wider range of verification tasks.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gerardallwein-andrews-simulationlogic-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/ncl12.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'gerardallwein-andrews-simulationlogic-2012', 'https://harrisonwl.github.io/assets/papers/ncl12.pdf', event);\">\n    Simulation Logic.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gerard Allwein, W. L. H.;  and Andrews, D.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2012 Conference on Non-Classical Logics</i>,  2012. \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://harrisonwl.github.io/assets/papers/ncl12.pdf\"\n     onclick=\"log_download('gerardallwein-andrews-simulationlogic-2012', 'https://harrisonwl.github.io/assets/papers/ncl12.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Simulation Logic [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gerardallwein-andrews-simulationlogic-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  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gerardallwein-andrews-simulationlogic-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{NCL12,\n   title = &quot;Simulation Logic&quot;,\n   booktitle = &quot;Proceedings of the 2012 Conference on Non-Classical Logics&quot;,\n   author = &quot;Gerard Allwein, William L. Harrison and David Andrews&quot;,\n   year = 2012,\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/ncl12.pdf&quot;,\n  abstract = &quot;Simulation relations have been discovered in many areas: Computer Science, philosophical and modal logic, and set theory. However, the simulation condition is strictly a first-order logic statement. We extend modal logic with modalities and axioms, the latter&#x27;s modeling conditions are the simulation conditions. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The simulations are considered arrows in a category where the objects are descriptive, general frames. One can augment the simulation modalities by axioms for requiring the underlying modeling simulations to be bisimulations or to be p-morphisms. The modal systems presented are multi-sorted and both sound and complete with respect to their algebraic and Kripke semantics.&quot;,\n   }                  \n                  \n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Simulation relations have been discovered in many areas: Computer Science, philosophical and modal logic, and set theory. However, the simulation condition is strictly a first-order logic statement. We extend modal logic with modalities and axioms, the latter's modeling conditions are the simulation conditions. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The simulations are considered arrows in a category where the objects are descriptive, general frames. One can augment the simulation modalities by axioms for requiring the underlying modeling simulations to be bisimulations or to be p-morphisms. The modal systems presented are multi-sorted and both sound and complete with respect to their algebraic and Kripke semantics.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"adamprocter-stump-thedesignofapracticalproofcheckerforalazyfunctionallanguage-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/tfp12.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'adamprocter-stump-thedesignofapracticalproofcheckerforalazyfunctionallanguage-2012', 'https://harrisonwl.github.io/assets/papers/tfp12.pdf', event);\">\n    The Design of a Practical Proof Checker for a Lazy Functional Language.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Adam Procter, W. L. H.;  and Stump, A.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2012 Trends in Functional Programming Conference</i>,  2012. \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://harrisonwl.github.io/assets/papers/tfp12.pdf\"\n     onclick=\"log_download('adamprocter-stump-thedesignofapracticalproofcheckerforalazyfunctionallanguage-2012', 'https://harrisonwl.github.io/assets/papers/tfp12.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Design of a Practical Proof Checker for a Lazy Functional Language [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/adamprocter-stump-thedesignofapracticalproofcheckerforalazyfunctionallanguage-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('adamprocter-stump-thedesignofapracticalproofcheckerforalazyfunctionallanguage-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{TFP12,\n   title = &quot;The Design of a Practical Proof Checker for a Lazy Functional Language&quot;,\n   booktitle = &quot;Proceedings of the 2012 Trends in Functional Programming Conference&quot;,\n   author = &quot;Adam Procter, William L. Harrison and Aaron Stump&quot;,\n   year = 2012,\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/tfp12.pdf&quot;,\n  abstract = &quot;Pure, lazy functional languages like Haskell provide a sound basis for formal reasoning about programs in an equational style. In\npractice, however, equational reasoning is underutilized. We suggest that part\nof the reason for this is the lack of accessible tools for developing\nmachine-checked equational reasoning proofs. This paper outlines the design of\nMProver, a system which fills just that niche. MProver features first-class\nsupport for reasoning about potentially undefined computations (particularly\nimportant in a lazy setting), and an extended notion of Haskell-like type\nclasses, enabling a highly modular style of program verification that closely\nfollows familiar functional programming idioms.&quot;,\n   }                  \n                  \n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Pure, lazy functional languages like Haskell provide a sound basis for formal reasoning about programs in an equational style. In practice, however, equational reasoning is underutilized. We suggest that part of the reason for this is the lack of accessible tools for developing machine-checked equational reasoning proofs. This paper outlines the design of MProver, a system which fills just that niche. MProver features first-class support for reasoning about potentially undefined computations (particularly important in a lazy setting), and an extended notion of Haskell-like type classes, enabling a highly modular style of program verification that closely follows familiar functional programming idioms.\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=\"allwein-harrison-achanneltheoreticaccountofseparationsecurity-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/ersa2011a.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'allwein-harrison-achanneltheoreticaccountofseparationsecurity-2011', 'https://harrisonwl.github.io/assets/papers/ersa2011a.pdf', event);\">\n    A Channel Theoretic Account of Separation Security.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Allwein, G.;  and <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2011 International Conference on Engineering Reconfigurable Systems and Algorithms (ERSA11)</i>,  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://harrisonwl.github.io/assets/papers/ersa2011a.pdf\"\n     onclick=\"log_download('allwein-harrison-achanneltheoreticaccountofseparationsecurity-2011', 'https://harrisonwl.github.io/assets/papers/ersa2011a.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Channel Theoretic Account of Separation Security [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/allwein-harrison-achanneltheoreticaccountofseparationsecurity-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('allwein-harrison-achanneltheoreticaccountofseparationsecurity-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;\">@inproceedings{ERSA2011a,\n   title = &quot;A Channel Theoretic Account of Separation Security&quot;,\n   booktitle = &quot;Proceedings of the 2011 International Conference on Engineering Reconfigurable Systems and Algorithms (ERSA11)&quot;,\n   author = &quot;Gerard Allwein and William L. Harrison&quot;,\n   year = 2011,\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/ersa2011a.pdf&quot;,\n  abstract = &quot;It has long been held that information flow security models should be organized with respect to a theory of information, but typically they are not. The appeal of a information-theoretic foundation for information flow security seems natural, compelling and, indeed, almost tautological. This article illustrates how channel theory---a theory of information based in logic---can provide a basis for noninterference style security models. The evidence presented here suggests that channel theory is a useful organizing principle for information flow security.&quot;,\n   }\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  It has long been held that information flow security models should be organized with respect to a theory of information, but typically they are not. The appeal of a information-theoretic foundation for information flow security seems natural, compelling and, indeed, almost tautological. This article illustrates how channel theory—a theory of information based in logic—can provide a basis for noninterference style security models. The evidence presented here suggests that channel theory is a useful organizing principle for information flow security.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"harrison-schulz-procter-lukefahr-allwein-towardssemanticsdirectedsystemdesignandsynthesis-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/ersa2011b.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-schulz-procter-lukefahr-allwein-towardssemanticsdirectedsystemdesignandsynthesis-2011', 'https://harrisonwl.github.io/assets/papers/ersa2011b.pdf', event);\">\n    Towards Semantics-directed System Design and Synthesis.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>; Schulz, B.; Procter, A.; Lukefahr, A.;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2011 International Conference on Engineering Reconfigurable Systems and Algorithms (ERSA11)</i>,  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://harrisonwl.github.io/assets/papers/ersa2011b.pdf\"\n     onclick=\"log_download('harrison-schulz-procter-lukefahr-allwein-towardssemanticsdirectedsystemdesignandsynthesis-2011', 'https://harrisonwl.github.io/assets/papers/ersa2011b.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Towards Semantics-directed System Design and Synthesis [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-schulz-procter-lukefahr-allwein-towardssemanticsdirectedsystemdesignandsynthesis-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('harrison-schulz-procter-lukefahr-allwein-towardssemanticsdirectedsystemdesignandsynthesis-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;\">@inproceedings{ERSA2011b,\n   title = &quot;Towards Semantics-directed System Design and Synthesis&quot;,\n   booktitle = &quot;Proceedings of the 2011 International Conference on Engineering Reconfigurable Systems and Algorithms (ERSA11)&quot;,\n   author = &quot;William L. Harrison and Benjamin Schulz and Adam Procter and Andrew Lukefahr and Gerard Allwein&quot;,\n   year = 2011,\n      url_Paper = &quot;https://harrisonwl.github.io/assets/papers/ersa2011b.pdf&quot;,\n  abstract = &quot;High assurance systems have been defined as systems &#x60;&#x60;you would bet your life on.&#x27;&#x27; This article discusses the application of a form of functional programming---what we call &#x60;&#x60;monadic programming&#x27;&#x27;---to the generation of high assurance and secure systems. Monadic programming languages leverage algebraic structures from denotational semantics and functional programming---monads---as a flexible, modular organizing principle for secure system design and implementation. Monadic programming languages are domain-specific functional languages that are both sufficiently expressive to express essential system behaviors and semantically straightforward to support formal verification.&quot;,\n   }   \n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  High assurance systems have been defined as systems ``you would bet your life on.'' This article discusses the application of a form of functional programming—what we call ``monadic programming''—to the generation of high assurance and secure systems. Monadic programming languages leverage algebraic structures from denotational semantics and functional programming—monads—as a flexible, modular organizing principle for secure system design and implementation. Monadic programming languages are domain-specific functional languages that are both sufficiently expressive to express essential system behaviors and semantically straightforward to support formal verification.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"allwein-yang-harrison-qualitativedecisiontheoryviachanneltheory-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/llp2011.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'allwein-yang-harrison-qualitativedecisiontheoryviachanneltheory-2011', 'https://harrisonwl.github.io/assets/papers/llp2011.pdf', event);\">\n    Qualitative Decision Theory via Channel Theory.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Allwein, G.; Yang, Y.;  and <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Logic and Logical Philosophy</i>,81-110.  2011.\n  <span class=\"note\">Extended version of i̧teAllweinYangHarrison:2010</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://harrisonwl.github.io/assets/papers/llp2011.pdf\"\n     onclick=\"log_download('allwein-yang-harrison-qualitativedecisiontheoryviachanneltheory-2011', 'https://harrisonwl.github.io/assets/papers/llp2011.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Qualitative Decision Theory via Channel Theory [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/allwein-yang-harrison-qualitativedecisiontheoryviachanneltheory-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('allwein-yang-harrison-qualitativedecisiontheoryviachanneltheory-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{LLP10,\n author = &quot;Gerard Allwein and Yingrui Yang and William L. Harrison&quot;,\n title  = &quot;Qualitative Decision Theory via Channel Theory&quot;,\n journal = &quot;Logic and Logical Philosophy&quot;,\n vol = 20,\n year = 2011,\n pages = {81-110},\n note = {Extended version of \\cite{AllweinYangHarrison:2010}},\n       url_Paper = &quot;https://harrisonwl.github.io/assets/papers/llp2011.pdf&quot;,\n  abstract = &quot;We recast parts of decision theory in terms of channel theory\nconcentrating on qualitative issues. Channel theory allows one to move\nbetween model theoretic and language theoretic notions as is necessary for\nan adequate covering. Doing so clari?es decision theory and presents the\nopportunity to investigate alternative formulations. As an example, we take\nsome of Savage&#x27;s notions of decision theory and recast them within channel\ntheory. In place of probabilities, we use a particular logic of preference. We\nintroduce a logic for describing actions separate from the logic of preference\nover actions. The structures introduced by channel theory that represent\nthe decision problems can be seen to be an abstract framework. This framework is very accommodating to changing the nature of the decision problems\nto handle different aspects or theories about decision making.&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We recast parts of decision theory in terms of channel theory concentrating on qualitative issues. Channel theory allows one to move between model theoretic and language theoretic notions as is necessary for an adequate covering. Doing so clari?es decision theory and presents the opportunity to investigate alternative formulations. As an example, we take some of Savage's notions of decision theory and recast them within channel theory. In place of probabilities, we use a particular logic of preference. We introduce a logic for describing actions separate from the logic of preference over actions. The structures introduced by channel theory that represent the decision problems can be seen to be an abstract framework. This framework is very accommodating to changing the nature of the decision problems to handle different aspects or theories about decision making.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2010\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2010')\"\n      onkeypress=\"toggleGroup('group_2010')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2010</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=\"allwein-yang-harrison-decisiontheoryviachanneltheory-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Decision Theory via Channel Theory.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Allwein, G.; Yang, Y.;  and <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. S.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the Logic in Cognitive Science Conference, 2010, Logic and Logical Philosophy Journal</i>,  2010. The Nicolaus Copernicus University Press\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/allwein-yang-harrison-decisiontheoryviachanneltheory-2010\"\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('allwein-yang-harrison-decisiontheoryviachanneltheory-2010')\" -->\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 {AllweinYangHarrison:2010,\nauthor    ={Gerard Allwein and Yingrui Yang and William S. Harrison},\ntitle        ={Decision Theory via Channel Theory},\nbooktitle    ={Proceedings of the Logic in Cognitive Science Conference, 2010, Logic and Logical Philosophy Journal},\npublisher    ={The Nicolaus Copernicus University Press},\nyear        ={2010},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"allwein-harrison-partiallyorderedmodalities-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/aiml10.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'allwein-harrison-partiallyorderedmodalities-2010', 'https://harrisonwl.github.io/assets/papers/aiml10.pdf', event);\">\n    Partially-ordered Modalities.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Allwein, G.;  and <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Advances in Modal Logic</i>, pages 1-21,  2010. \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://harrisonwl.github.io/assets/papers/aiml10.pdf\"\n     onclick=\"log_download('allwein-harrison-partiallyorderedmodalities-2010', 'https://harrisonwl.github.io/assets/papers/aiml10.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Partially-ordered Modalities [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/allwein-harrison-partiallyorderedmodalities-2010\"\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('allwein-harrison-partiallyorderedmodalities-2010')\" -->\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{AiML10,\n  author    = {Gerard Allwein and William L. Harrison},\n  title     = {Partially-ordered Modalities},\n  booktitle = {Advances in Modal Logic},\n  year      = {2010},\n  pages     = {1-21},\n        url_Paper = &quot;https://harrisonwl.github.io/assets/papers/aiml10.pdf&quot;,\n  abstract = &quot;\nModal logic is extended by partially ordering the modalities. The modalities are normal, i.e., commute\nwith either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The partial\norder does not conflict with type of modality (K, S4, etc.) although this paper will concentrate on S4\nsince partially ordered S4 systems appear to be numerous. The partially-ordered normal modal systems\nconsidered are both sound and complete. Hilbert and Gentzen systems are given. A cut-elimination theorem\nholds (for partially ordered S4), and the Hilbert and Gentzen systems present the same logic. The partial\norder induces a 2-category structure on a coalgebraic formulation of descriptive frames. Channel theory is\nused to &#x60;move&#x27; modal logics when the source and target languages may be di\u000berent. A particular partially\nordered modal system is shown to be applicable to security properties&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Modal logic is extended by partially ordering the modalities. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The partial order does not conflict with type of modality (K, S4, etc.) although this paper will concentrate on S4 since partially ordered S4 systems appear to be numerous. The partially-ordered normal modal systems considered are both sound and complete. Hilbert and Gentzen systems are given. A cut-elimination theorem holds (for partially ordered S4), and the Hilbert and Gentzen systems present the same logic. The partial order induces a 2-category structure on a coalgebraic formulation of descriptive frames. Channel theory is used to `move' modal logics when the source and target languages may be di\u000berent. A particular partially ordered modal system is shown to be applicable to security 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_2009\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2009')\"\n      onkeypress=\"toggleGroup('group_2009')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2009</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=\"harrison-procter-agron-kimmel-allwein-modeldrivenengineeringfrommodularmonadicsemanticsimplementationtechniquestargetinghardwareandsoftware-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/dsl09.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-procter-agron-kimmel-allwein-modeldrivenengineeringfrommodularmonadicsemanticsimplementationtechniquestargetinghardwareandsoftware-2009', 'https://harrisonwl.github.io/assets/papers/dsl09.pdf', event);\">\n    Model-Driven Engineering from Modular Monadic Semantics: Implementation Techniques Targeting Hardware and Software.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>; Procter, A.; Agron, J.; Kimmel, G.;  and Allwein, G.\n</span>\n\n  \n\n</span>\n\n  In <i>DSL '09: Proc. of the IFIP TC 2 Working Conference on Domain-Specific Languages</i>, pages 20–44,  2009. \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://harrisonwl.github.io/assets/papers/dsl09.pdf\"\n     onclick=\"log_download('harrison-procter-agron-kimmel-allwein-modeldrivenengineeringfrommodularmonadicsemanticsimplementationtechniquestargetinghardwareandsoftware-2009', 'https://harrisonwl.github.io/assets/papers/dsl09.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Model-Driven Engineering from Modular Monadic Semantics: Implementation Techniques Targeting Hardware and Software [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-procter-agron-kimmel-allwein-modeldrivenengineeringfrommodularmonadicsemanticsimplementationtechniquestargetinghardwareandsoftware-2009\"\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('harrison-procter-agron-kimmel-allwein-modeldrivenengineeringfrommodularmonadicsemanticsimplementationtechniquestargetinghardwareandsoftware-2009')\" -->\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{dslwc09,\nauthor = {W. Harrison and A. Procter and J. Agron and G. Kimmel and G. Allwein},\n title = {Model-Driven Engineering from Modular Monadic Semantics: Implementation Techniques Targeting Hardware and Software},\n booktitle = {DSL &#x27;09: Proc. of the IFIP TC 2 Working Conference on Domain-Specific Languages},\n year = {2009},\n pages = {20--44},\n       url_Paper = &quot;https://harrisonwl.github.io/assets/papers/dsl09.pdf&quot;,\n  abstract = &quot;Recent research has shown how the formal modeling of concurrent systems can benefit from monadic structuring. With this approach, a formal system model is really a program in a domain specific language defined by a monad for shared-state concurrency. Can these models be compiled into efficient implementations?  This paper addresses this question and presents an overview of techniques for compiling monadic concurrency models directly into reasonably efficient software and hardware implementations. The implementation techniques described in this article form the basis of a semantics-directed approach to model-driven engineering.&quot;,\n } \n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Recent research has shown how the formal modeling of concurrent systems can benefit from monadic structuring. With this approach, a formal system model is really a program in a domain specific language defined by a monad for shared-state concurrency. Can these models be compiled into efficient implementations? This paper addresses this question and presents an overview of techniques for compiling monadic concurrency models directly into reasonably efficient software and hardware implementations. The implementation techniques described in this article form the basis of a semantics-directed approach to model-driven engineering.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"harrison-hook-achievinginformationflowsecuritythroughmonadiccontrolofeffects-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/jcs09.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-hook-achievinginformationflowsecuritythroughmonadiccontrolofeffects-2009', 'https://harrisonwl.github.io/assets/papers/jcs09.pdf', event);\">\n    Achieving information flow security through monadic control of effects.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>;  and Hook, J.\n</span>\n\n  \n\n</span>\n\n  <i>J. Comput. Secur.</i>, 17: 599–653. October 2009.\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://harrisonwl.github.io/assets/papers/jcs09.pdf\"\n     onclick=\"log_download('harrison-hook-achievinginformationflowsecuritythroughmonadiccontrolofeffects-2009', 'https://harrisonwl.github.io/assets/papers/jcs09.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Achieving information flow security through monadic control of effects [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-hook-achievinginformationflowsecuritythroughmonadiccontrolofeffects-2009\"\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('harrison-hook-achievinginformationflowsecuritythroughmonadiccontrolofeffects-2009')\" -->\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{HarrisonHook09,\n author = {Harrison, William L. and Hook, James},\n title = {Achieving information flow security through monadic control of effects},\n journal = {J. Comput. Secur.},\n volume = {17},\n issue = {5},\n month = {October},\n year = {2009},\n pages = {599--653},\n numpages = {55},\n publisher = {IOS Press},\n address = {Amsterdam, The Netherlands, The Netherlands},\n       url_Paper = &quot;https://harrisonwl.github.io/assets/papers/jcs09.pdf&quot;,\n  abstract = &quot;This paper advocates a novel approach to the construction of secure\nsoftware: controlling information flow and maintaining integrity via\nmonadic encapsulation of effects. This approach is {\\em constructive},\nrelying on properties of monads and monad transformers to build,\nverify, and extend secure software systems. We illustrate this\napproach by construction of abstract operating systems called {\\em\n  separation kernels}. Starting from a mathematical model of\nshared-state concurrency based on monads of resumptions and state, we\noutline the development by stepwise refinements of separation kernels\nsupporting Unix-like system calls, interdomain communication,  and a\nformally verified security policy (domain separation). Because monads\nmay be easily and safely represented within any pure, higher-order,\ntyped functional language, the resulting system models may be directly\nrealized within a language such as Haskell.&quot;,\n} \n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper advocates a novel approach to the construction of secure software: controlling information flow and maintaining integrity via monadic encapsulation of effects. This approach is \\em constructive, relying on properties of monads and monad transformers to build, verify, and extend secure software systems. We illustrate this approach by construction of abstract operating systems called \\em separation kernels. Starting from a mathematical model of shared-state concurrency based on monads of resumptions and state, we outline the development by stepwise refinements of separation kernels supporting Unix-like system calls, interdomain communication, and a formally verified security policy (domain separation). Because monads may be easily and safely represented within any pure, higher-order, typed functional language, the resulting system models may be directly realized within a language such as Haskell.\n</div>\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        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"harrison-allwein-gill-procter-asynchronousexceptionsasaneffect-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/mpc08.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-allwein-gill-procter-asynchronousexceptionsasaneffect-2008', 'https://harrisonwl.github.io/assets/papers/mpc08.pdf', event);\">\n    Asynchronous Exceptions as an Effect.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>; Allwein, G.; Gill, A.;  and Procter, A.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the Mathematics of Program Construction (MPC08)</i>, pages 153–176,  2008. \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://harrisonwl.github.io/assets/papers/mpc08.pdf\"\n     onclick=\"log_download('harrison-allwein-gill-procter-asynchronousexceptionsasaneffect-2008', 'https://harrisonwl.github.io/assets/papers/mpc08.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Asynchronous Exceptions as an Effect [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-allwein-gill-procter-asynchronousexceptionsasaneffect-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('harrison-allwein-gill-procter-asynchronousexceptionsasaneffect-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{HarrisonAllwein08,\nauthor = {William L. Harrison and Gerard Allwein and Andy Gill and Adam Procter},\ntitle = {Asynchronous Exceptions as an Effect},\nbooktitle = {Proceedings of the Mathematics of Program Construction (MPC08)},\nyear = {2008},\npages = {153--176},\nnumpages = {24},\n      url_Paper = &quot;https://harrisonwl.github.io/assets/papers/mpc08.pdf&quot;,\n  abstract = &quot;Asynchronous interrupts abound in computing systems, yet they remain a\nthorny concept for both programming and verification practice.\nThe ubiquity of interrupts underscores the importance of developing\nprogramming models to aid the development and verification of\ninterrupt-driven programs. \nThe research reported here recognizes asynchronous interrupts as a\ncomputational effect and encapsulates them as a building block in\nmodular monadic semantics.\nThe resulting modular semantic model can serve as both a guide for\nfunctional programming with interrupts and as a formal basis for reasoning about\ninterrupt-driven computation as well.&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Asynchronous interrupts abound in computing systems, yet they remain a thorny concept for both programming and verification practice. The ubiquity of interrupts underscores the importance of developing programming models to aid the development and verification of interrupt-driven programs. The research reported here recognizes asynchronous interrupts as a computational effect and encapsulates them as a building block in modular monadic semantics. The resulting modular semantic model can serve as both a guide for functional programming with interrupts and as a formal basis for reasoning about interrupt-driven computation as well.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"kariotis-procter-harrison-makingmonadsfirstclasswithtemplatehaskell-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/haskell08.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'kariotis-procter-harrison-makingmonadsfirstclasswithtemplatehaskell-2008', 'https://harrisonwl.github.io/assets/papers/haskell08.pdf', event);\">\n    Making monads first-class with template haskell.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Kariotis, P. S.; Procter, A. M.;  and <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the first ACM SIGPLAN Symposium on Haskell</i>, of <i>Haskell '08</i>, pages 99–110, New York, NY, USA,  2008. ACM\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://harrisonwl.github.io/assets/papers/haskell08.pdf\"\n     onclick=\"log_download('kariotis-procter-harrison-makingmonadsfirstclasswithtemplatehaskell-2008', 'https://harrisonwl.github.io/assets/papers/haskell08.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Making monads first-class with template haskell [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/kariotis-procter-harrison-makingmonadsfirstclasswithtemplatehaskell-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  &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('kariotis-procter-harrison-makingmonadsfirstclasswithtemplatehaskell-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  \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{Haskell08,\n author = {Kariotis, Pericles S. and Procter, Adam M. and Harrison, William L.},\n title = {Making monads first-class with template haskell},\n booktitle = {Proceedings of the first ACM SIGPLAN Symposium on Haskell},\n series = {Haskell &#x27;08},\n year = {2008},\n location = {Victoria, BC, Canada},\n pages = {99--110},\n numpages = {12},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {domain-specific languages, monads, staged programming},\n       url_Paper = &quot;https://harrisonwl.github.io/assets/papers/haskell08.pdf&quot;,\n  abstract = &quot;Monads as an organizing principle for programming and semantics are notoriously difficult to grasp, yet they are a central and powerful abstraction in Haskell. This paper introduces a domain-specific language, MonadLab, that simplifies the construction of monads, and describes its implementation in Template Haskell. MonadLab makes monad construction truly first class, meaning that arcane theoretical issues with respect to monad transformers are completely hidden from the programmer. The motivation behind the design of MonadLab is to make monadic programming in Haskell simpler while providing a tool for non-Haskell experts that will assist them in understanding this powerful abstraction.&quot;,\n} \n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Monads as an organizing principle for programming and semantics are notoriously difficult to grasp, yet they are a central and powerful abstraction in Haskell. This paper introduces a domain-specific language, MonadLab, that simplifies the construction of monads, and describes its implementation in Template Haskell. MonadLab makes monad construction truly first class, meaning that arcane theoretical issues with respect to monad transformers are completely hidden from the programmer. The motivation behind the design of MonadLab is to make monadic programming in Haskell simpler while providing a tool for non-Haskell experts that will assist them in understanding this powerful abstraction.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2006\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2006')\"\n      onkeypress=\"toggleGroup('group_2006')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2006</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=\"harrison-proofabstractionforimperativelanguages-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/aplas06.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-proofabstractionforimperativelanguages-2006', 'https://harrisonwl.github.io/assets/papers/aplas06.pdf', event);\">\n    Proof Abstraction for Imperative Languages.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 4th Asian Symposium on Programming Languages and Systems (APLAS06)</i>, pages 97-113,  2006. \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://harrisonwl.github.io/assets/papers/aplas06.pdf\"\n     onclick=\"log_download('harrison-proofabstractionforimperativelanguages-2006', 'https://harrisonwl.github.io/assets/papers/aplas06.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Proof Abstraction for Imperative Languages [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-proofabstractionforimperativelanguages-2006\"\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('harrison-proofabstractionforimperativelanguages-2006')\" -->\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{APLAS06,\n  author =       &quot;William Harrison&quot;,\n  title =        &quot;Proof Abstraction for Imperative Languages&quot;,\n  year =         &quot;2006&quot;,\n  booktitle = &quot;Proceedings of the 4th Asian Symposium\n               on Programming Languages and Systems (APLAS06)&quot;,\n  pages     = {97-113}, \n  abstract = &quot;Modularity in programming language semantics derives from abstracting over\nthe structure of underlying denotations, yielding semantic descriptions that are more abstract and reusable. One such semantic framework is Liang&#x27;s modular\nmonadic semantics in which the underlying semantic structure is encapsulated with a monad. Such abstraction can be at odds with\nprogram verification, however, because program specifications require access to the (deliberately) hidden semantic\nrepresentation. The techniques for reasoning about modular monadic definitions of imperative programs introduced here overcome this barrier.\nAnd, just like program definitions in modular monadic semantics, our program specifications and proofs are representation-independent\nand hold for whole classes of monads, thereby yielding proofs of great generality.&quot;,\n  url_Paper = &quot;https://harrisonwl.github.io/assets/papers/aplas06.pdf&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Modularity in programming language semantics derives from abstracting over the structure of underlying denotations, yielding semantic descriptions that are more abstract and reusable. One such semantic framework is Liang's modular monadic semantics in which the underlying semantic structure is encapsulated with a monad. Such abstraction can be at odds with program verification, however, because program specifications require access to the (deliberately) hidden semantic representation. The techniques for reasoning about modular monadic definitions of imperative programs introduced here overcome this barrier. And, just like program definitions in modular monadic semantics, our program specifications and proofs are representation-independent and hold for whole classes of monads, thereby yielding proofs of great generality.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"harrison-theessenceofmultitasking-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/amast06.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-theessenceofmultitasking-2006', 'https://harrisonwl.github.io/assets/papers/amast06.pdf', event);\">\n    The Essence of Multitasking.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>11th International Conference on Algebraic Methodology and Software Technology (AMAST 2006)</i>, pages 158-172, July 2006. \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://harrisonwl.github.io/assets/papers/amast06.pdf\"\n     onclick=\"log_download('harrison-theessenceofmultitasking-2006', 'https://harrisonwl.github.io/assets/papers/amast06.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Essence of Multitasking [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://harrisonwl.github.io/assets/code/EoMT.tar.gz\"\n     onclick=\"log_download('harrison-theessenceofmultitasking-2006', 'https://harrisonwl.github.io/assets/code/EoMT.tar.gz', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The Essence of Multitasking [link]\"\n       title=\" code\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> code</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-theessenceofmultitasking-2006\"\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>6 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('harrison-theessenceofmultitasking-2006')\" -->\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{harrison06,\n  author    = {William L. Harrison},\n  title     = {The Essence of Multitasking},\n  booktitle = {11th International Conference on Algebraic Methodology\n                  and Software Technology {(AMAST 2006)}},\n  pages     = {158-172},\n  month     = {July},                  \n  year      = {2006},\n     url_Paper = &quot;https://harrisonwl.github.io/assets/papers/amast06.pdf&quot;,\n  abstract = &quot;This article demonstrates how a powerful and expressive abstraction from concurrency theory---monads of resumptions---plays a dual r\\^{o}le as a programming tool\nfor concurrent applications.  \nThe article demonstrates how a\nwide variety of typical OS behaviors may be specified in terms of\nresumption monads known heretofore exclusively in the literature of \nprogramming language semantics. \nWe illustrate the expressiveness of the resumption monad with the\nconstruction of an exemplary \nmultitasking kernel in the pure functional language\nHaskell. Code available at link.&quot;,\n     url_Code = &quot;https://harrisonwl.github.io/assets/code/EoMT.tar.gz&quot;,\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  This article demonstrates how a powerful and expressive abstraction from concurrency theory—monads of resumptions—plays a dual rôle as a programming tool for concurrent applications. The article demonstrates how a wide variety of typical OS behaviors may be specified in terms of resumption monads known heretofore exclusively in the literature of programming language semantics. We illustrate the expressiveness of the resumption monad with the construction of an exemplary multitasking kernel in the pure functional language Haskell. Code available at link.\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        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"fu-wang-harrison-harrison-rnapseudoknotpredictionusingtermrewriting-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  RNA Pseudoknot Prediction Using Term Rewriting.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Fu, X. Z.; Wang, H.; <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>;  and Harrison, R.\n</span>\n\n  \n\n</span>\n\n  <i>International Journal of Data Mining and Bioinformatics</i>.  2005.\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/fu-wang-harrison-harrison-rnapseudoknotpredictionusingtermrewriting-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('fu-wang-harrison-harrison-rnapseudoknotpredictionusingtermrewriting-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</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ijdmb06,\n\tAuthor = {X. Z. Fu and H. Wang and W. Harrison and R. Harrison},\n\tTitle = {{RNA} Pseudoknot Prediction Using Term Rewriting},\n\tYear = 2005,\n  journal =      &quot;International Journal of Data Mining and Bioinformatics&quot;,\n  abstract = &quot;RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are functionally important and widely occurring structural motifs found in all types of RNA. Therefore predicting their structures is an important problem. In this paper, we present a new RNA pseudoknot structure prediction method based on term rewriting. The method is implemented using the Mfold RNA/DNA folding package and the term rewriting language Maude. In our method, RNA structures are treated as terms and rules are discovered for predicting pseudoknots. Our method was tested on 211 pseudoknots in PseudoBase and achieves an average accuracy of 74.085 percent compared to the experimentally determined structure. In fact, most pseudoknots discovered by our method achieve an accuracy of above 90 percent. These results indicate that term rewriting has a broad potential in RNA applications ranging from prediction of pseudoknots to discovery of higher level RNA structures involving complex RNA tertiary interactions.&quot;\n}\n\n                  \n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are functionally important and widely occurring structural motifs found in all types of RNA. Therefore predicting their structures is an important problem. In this paper, we present a new RNA pseudoknot structure prediction method based on term rewriting. The method is implemented using the Mfold RNA/DNA folding package and the term rewriting language Maude. In our method, RNA structures are treated as terms and rules are discovered for predicting pseudoknots. Our method was tested on 211 pseudoknots in PseudoBase and achieves an average accuracy of 74.085 percent compared to the experimentally determined structure. In fact, most pseudoknots discovered by our method achieve an accuracy of above 90 percent. These results indicate that term rewriting has a broad potential in RNA applications ranging from prediction of pseudoknots to discovery of higher level RNA structures involving complex RNA tertiary interactions.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"harrison-kieburtz-thelogicofdemandinhaskell-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/jfp05.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-kieburtz-thelogicofdemandinhaskell-2005', 'https://harrisonwl.github.io/assets/papers/jfp05.pdf', event);\">\n    The Logic of Demand in Haskell.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>;  and Kieburtz, R. B.\n</span>\n\n  \n\n</span>\n\n  <i>Journal of Functional Programming</i>, 15(6): 837-891.  2005.\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://harrisonwl.github.io/assets/papers/jfp05.pdf\"\n     onclick=\"log_download('harrison-kieburtz-thelogicofdemandinhaskell-2005', 'https://harrisonwl.github.io/assets/papers/jfp05.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Logic of Demand in Haskell [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-kieburtz-thelogicofdemandinhaskell-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  &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('harrison-kieburtz-thelogicofdemandinhaskell-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</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{HK05,\n  author =       &quot;William L. Harrison and Richard B. Kieburtz&quot;,\n  title =        &quot;The Logic of Demand in {H}askell&quot;,\n  journal =      &quot;Journal of Functional Programming&quot;,\n  volume  = 15,\n  number = 6,\n  year   = 2005,\n  pages = {837-891},\n  hjournal = &quot;yes&quot;,\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/jfp05.pdf&quot;,\n  abstract = &quot;Haskell is a functional programming language whose\n                  evaluation is lazy by default. However, Haskell also\n                  provides pattern matching facilities which add a\n                  modicum of eagerness to its otherwise lazy default\n                  evaluation. This mixed or \\emph{non-strict}\n                  semantics can be quite difficult to reason\n                  with. This paper introduces a programming logic,\n                  P-Logic, which neatly formalizes the mixed\n                  evaluation in Haskell pattern-matching as a logic,\n                  thereby simplifying the task of specifying and\n                  verifying Haskell programs. In P-Logic, aspects of\n                  demand are reflected or represented within both the\n                  predicate language and its model theory, allowing\n                  for expressive and comprehensible program\n                  verification.&quot;, \n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Haskell is a functional programming language whose evaluation is lazy by default. However, Haskell also provides pattern matching facilities which add a modicum of eagerness to its otherwise lazy default evaluation. This mixed or \\emphnon-strict semantics can be quite difficult to reason with. This paper introduces a programming logic, P-Logic, which neatly formalizes the mixed evaluation in Haskell pattern-matching as a logic, thereby simplifying the task of specifying and verifying Haskell programs. In P-Logic, aspects of demand are reflected or represented within both the predicate language and its model theory, allowing for expressive and comprehensible program verification.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"harrison-asimplesemanticsforpolymorphicrecursion-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/aplas05.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-asimplesemanticsforpolymorphicrecursion-2005', 'https://harrisonwl.github.io/assets/papers/aplas05.pdf', event);\">\n    A Simple Semantics for Polymorphic Recursion.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 3rd Asian Symposium on Programming Languages and Systems (APLAS05)</i>, pages 37-51, Tsukuba, Japan, November 2005. \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://harrisonwl.github.io/assets/papers/aplas05.pdf\"\n     onclick=\"log_download('harrison-asimplesemanticsforpolymorphicrecursion-2005', 'https://harrisonwl.github.io/assets/papers/aplas05.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Simple Semantics for Polymorphic Recursion [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-asimplesemanticsforpolymorphicrecursion-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('harrison-asimplesemanticsforpolymorphicrecursion-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</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{APLAS05,\n     author = &quot;William Harrison&quot;,\n     title  = &quot;A Simple Semantics for Polymorphic\n                  Recursion&quot;,\n     booktitle = &quot;Proceedings of the 3rd Asian Symposium\n                  on Programming Languages and Systems (APLAS05)&quot;,\n     pages     = {37-51}, \n     month = &quot;November&quot;,\n     year = 2005,\n     address = &quot;Tsukuba, Japan&quot;,\n     hconf = &quot;yes&quot;,\n      url_Paper = &quot;https://harrisonwl.github.io/assets/papers/aplas05.pdf&quot;,\n     abstract = &quot;Polymorphic recursion is a useful extension of Hindley-\nMilner typing and has been incorporated in the functional programming\nlanguage Haskell. It allows the expression of efficient algorithms\nthat take advantage of non-uniform data structures and provides key\nsupport for generic programming. However, polymorphic recursion is,\nperhaps, not as broadly understood as it could be and this, in part,\nmotivates the denotational semantics presented here. The semantics reported\nhere also contributes an essential building block to any semantics\nof Haskell: a model for first-order polymorphic recursion. Furthermore,\nHaskell-style type classes may be described within this semantic framework\nin a straightforward and intuitively appealing manner.&quot;\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Polymorphic recursion is a useful extension of Hindley- Milner typing and has been incorporated in the functional programming language Haskell. It allows the expression of efficient algorithms that take advantage of non-uniform data structures and provides key support for generic programming. However, polymorphic recursion is, perhaps, not as broadly understood as it could be and this, in part, motivates the denotational semantics presented here. The semantics reported here also contributes an essential building block to any semantics of Haskell: a model for first-order polymorphic recursion. Furthermore, Haskell-style type classes may be described within this semantic framework in a straightforward and intuitively appealing manner.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"fu-wang-harrison-harrison-rnapseudoknotpredictionusingtermrewriting-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/bibe05.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'fu-wang-harrison-harrison-rnapseudoknotpredictionusingtermrewriting-2005', 'https://harrisonwl.github.io/assets/papers/bibe05.pdf', event);\">\n    RNA Pseudoknot Prediction Using Term Rewriting.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Fu, X. Z.; Wang, H.; <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>;  and Harrison, R.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of IEEE Fifth Symposium on Bioinformatics and Bioengineering (BIBE05)</i>, pages 169-176, Minneapolis, MN, October 2005. \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://harrisonwl.github.io/assets/papers/bibe05.pdf\"\n     onclick=\"log_download('fu-wang-harrison-harrison-rnapseudoknotpredictionusingtermrewriting-2005', 'https://harrisonwl.github.io/assets/papers/bibe05.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"RNA Pseudoknot Prediction Using Term Rewriting [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/fu-wang-harrison-harrison-rnapseudoknotpredictionusingtermrewriting-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('fu-wang-harrison-harrison-rnapseudoknotpredictionusingtermrewriting-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</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{BIBE05,\n\tAuthor = {X. Z. Fu and H. Wang and W. Harrison and R. Harrison},\n\tBooktitle = {Proceedings of IEEE Fifth Symposium on Bioinformatics and\n  Bioengineering (BIBE05)},\n\tMonth = {October},\n\tTitle = {{RNA} Pseudoknot Prediction Using Term Rewriting},\n\tYear = {2005},\n\taddress = &quot;Minneapolis, MN&quot;,\n\tpages = {169-176},\n        hconf = &quot;yes&quot;,\n         url_Paper = &quot;https://harrisonwl.github.io/assets/papers/bibe05.pdf&quot;,\t\n\tabstract = &quot;RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural  motifs found in all types of RNA and are also functionally important. Therefore predicting their structures is an important problem. In this paper, we present a new RNA pseudoknot prediction model based on term rewriting rather than on dynamic programming, comparative sequence analysis, or context-free grammars. The model we describe is implemented using the Mfold RNA/DNA folding package and the term rewriting language Maude. Our model was tested on 211 pseudoknots in PseudoBase and achieves an average accuracy of 74.085% compared to the experimentally determined structure. In fact, most pseudoknots discovered by our method achieve an accuracy of above 90%. These results indicate that term rewriting has a broad potential in RNA applications from prediction of pseudoknots to higher level RNA structures involving complex RNA tertiary interactions.&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural motifs found in all types of RNA and are also functionally important. Therefore predicting their structures is an important problem. In this paper, we present a new RNA pseudoknot prediction model based on term rewriting rather than on dynamic programming, comparative sequence analysis, or context-free grammars. The model we describe is implemented using the Mfold RNA/DNA folding package and the term rewriting language Maude. Our model was tested on 211 pseudoknots in PseudoBase and achieves an average accuracy of 74.085% compared to the experimentally determined structure. In fact, most pseudoknots discovered by our method achieve an accuracy of above 90%. These results indicate that term rewriting has a broad potential in RNA applications from prediction of pseudoknots to higher level RNA structures involving complex RNA tertiary interactions.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"harrison-hook-achievinginformationflowsecuritythroughprecisecontrolofeffects-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/csfw05.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-hook-achievinginformationflowsecuritythroughprecisecontrolofeffects-2005', 'https://harrisonwl.github.io/assets/papers/csfw05.pdf', event);\">\n    Achieving Information Flow Security Through Precise Control of Effects.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>;  and Hook, J.\n</span>\n\n  \n\n</span>\n\n  In <i>18th IEEE Computer Security Foundations Workshop (CSFW05)</i>, pages 16-30, Aix-en-Provence, France, June 2005. \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://harrisonwl.github.io/assets/papers/csfw05.pdf\"\n     onclick=\"log_download('harrison-hook-achievinginformationflowsecuritythroughprecisecontrolofeffects-2005', 'https://harrisonwl.github.io/assets/papers/csfw05.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Achieving Information Flow Security Through Precise Control of Effects [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-hook-achievinginformationflowsecuritythroughprecisecontrolofeffects-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('harrison-hook-achievinginformationflowsecuritythroughprecisecontrolofeffects-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</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{CSFW05,\n\tAuthor = {William Harrison and James Hook},\n\tBooktitle = {18th IEEE Computer Security Foundations Workshop (CSFW05)},\n\tMonth = {June},\n\tTitle = {Achieving Information Flow Security Through Precise Control of Effects},\n\tYear = {2005},\n\taddress = &quot;Aix-en-Provence, France&quot;,\n\tpages = {16-30},\n        hconf = &quot;yes&quot;,\n         url_Paper = &quot;https://harrisonwl.github.io/assets/papers/csfw05.pdf&quot;,\t\n\tabstract = &quot;This paper advocates controlling information flow and maintaining integrity via monadic encapsulation of effects. This approach is constructive, relying on properties of monads and monad transformers to build, verify, and extend secure software systems. We illustrate this approach by construction of abstract operating systems called separation kernels.&quot;,\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  This paper advocates controlling information flow and maintaining integrity via monadic encapsulation of effects. This approach is constructive, relying on properties of monads and monad transformers to build, verify, and extend secure software systems. We illustrate this approach by construction of abstract operating systems called separation kernels.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2004\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2004')\"\n      onkeypress=\"toggleGroup('group_2004')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2004</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=\"harrison-harrison-domainspecificlanguagesforcellularinteractions-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/embc04.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-harrison-domainspecificlanguagesforcellularinteractions-2004', 'https://harrisonwl.github.io/assets/papers/embc04.pdf', event);\">\n    Domain Specific Languages for Cellular Interactions.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>;  and Harrison, R. W.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 26th Annual IEEE International Conference on Engineering in Medicine and Biology (EMBC04)</i>, September 2004. \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://harrisonwl.github.io/assets/papers/embc04.pdf\"\n     onclick=\"log_download('harrison-harrison-domainspecificlanguagesforcellularinteractions-2004', 'https://harrisonwl.github.io/assets/papers/embc04.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Domain Specific Languages for Cellular Interactions [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-harrison-domainspecificlanguagesforcellularinteractions-2004\"\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('harrison-harrison-domainspecificlanguagesforcellularinteractions-2004')\" -->\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{HarrisonHarrison04,\n  author =       &quot;William L. Harrison and Robert W. Harrison&quot;,\n  title =        &quot;Domain Specific Languages for Cellular Interactions&quot;,\n  booktitle =    &quot;Proceedings of the 26th Annual IEEE International Conference on Engineering in Medicine and Biology (EMBC04)&quot;,\n  month =        &quot;September&quot;,\n  year =         &quot;2004&quot;,\n  hconf = &quot;yes&quot;,\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/embc04.pdf&quot;,\n  abstract = &quot;Bioinformatics is the application of Computer Science techniques to problems in Biology, and this paper explores one such application with great potential: the modeling of life cycles of autonomous, intercommunicating cellular systems using domain-specific programming languages (DSLs). We illustrate this approach for the simple photo-synthetic bacterium \\emph{R. Sphaeroides} with a DSL called CellSys embedded in the programming language Haskell.&quot;\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Bioinformatics is the application of Computer Science techniques to problems in Biology, and this paper explores one such application with great potential: the modeling of life cycles of autonomous, intercommunicating cellular systems using domain-specific programming languages (DSLs). We illustrate this approach for the simple photo-synthetic bacterium \\emphR. Sphaeroides with a DSL called CellSys embedded in the programming language Haskell.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2003\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2003')\"\n      onkeypress=\"toggleGroup('group_2003')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2003</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=\"harrison-tullsen-hook-domainseparationbyconstruction-2003\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/fcs03.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-tullsen-hook-domainseparationbyconstruction-2003', 'https://harrisonwl.github.io/assets/papers/fcs03.pdf', event);\">\n    Domain Separation by Construction.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>; Tullsen, M.;  and Hook, J.\n</span>\n\n  \n\n</span>\n\n  In <i>LICS03 Satellite Workshop on Foundations of Computer Security (FCS03)</i>, June 2003. \n  <span class=\"note\">21 pages</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://harrisonwl.github.io/assets/papers/fcs03.pdf\"\n     onclick=\"log_download('harrison-tullsen-hook-domainseparationbyconstruction-2003', 'https://harrisonwl.github.io/assets/papers/fcs03.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Domain Separation by Construction [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-tullsen-hook-domainseparationbyconstruction-2003\"\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('harrison-tullsen-hook-domainseparationbyconstruction-2003')\" -->\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{DomSep03,\n  author =       &quot;William Harrison and Mark Tullsen and James Hook&quot;,\n  title =        &quot;Domain Separation by Construction&quot;,\n  booktitle =    &quot;LICS03 Satellite Workshop on Foundations of Computer Security (FCS03)&quot;,\n  month =        &quot;June&quot;,\n  year =         &quot;2003&quot;,\n  note = &quot;21 pages&quot;,\n  hconf = &quot;yes&quot;,\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/fcs03.pdf&quot;,\n  abstract = &quot;This paper advocates a novel approach to language-based security: by structuring software with monads (a form of abstract data type for effects), we are able to maintain separation of effects by construction. The thesis of this work is that well-understood properties of monads and monad transformers aid in the construction and verification of secure software. We introduce a formulation of non-interference based on monads rather than the typical trace-based formulation. Using this formulation, we prove a non-interference style property for a simple instance of our system model. Because monads may be easily and safely represented within any pure, higher-order, typed functional language, the resulting system models may be directly realized within such a language.&quot;,\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper advocates a novel approach to language-based security: by structuring software with monads (a form of abstract data type for effects), we are able to maintain separation of effects by construction. The thesis of this work is that well-understood properties of monads and monad transformers aid in the construction and verification of secure software. We introduce a formulation of non-interference based on monads rather than the typical trace-based formulation. Using this formulation, we prove a non-interference style property for a simple instance of our system model. Because monads may be easily and safely represented within any pure, higher-order, typed functional language, the resulting system models may be directly realized within such a language.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2002\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2002')\"\n      onkeypress=\"toggleGroup('group_2002')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2002</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=\"harrison-kieburtz-patterndrivenreductioninhaskell-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/wrs02.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-kieburtz-patterndrivenreductioninhaskell-2002', 'https://harrisonwl.github.io/assets/papers/wrs02.pdf', event);\">\n    Pattern-driven Reduction in Haskell.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>;  and Kieburtz, R.\n</span>\n\n  \n\n</span>\n\n  In <i>2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS02)</i>, Copenhagen, Denmark,  2002. \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://harrisonwl.github.io/assets/papers/wrs02.pdf\"\n     onclick=\"log_download('harrison-kieburtz-patterndrivenreductioninhaskell-2002', 'https://harrisonwl.github.io/assets/papers/wrs02.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Pattern-driven Reduction in Haskell [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-kieburtz-patterndrivenreductioninhaskell-2002\"\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('harrison-kieburtz-patterndrivenreductioninhaskell-2002')\" -->\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{HK02,\n   author = &quot;William Harrison and Richard Kieburtz&quot;,\n   title  = &quot;Pattern-driven Reduction in Haskell&quot;,\n   booktitle = &quot;2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS02)&quot;,\n   address = &quot;Copenhagen, Denmark&quot;,\n   year  = &quot;2002&quot;,\n   hconf = &quot;yes&quot;,\n    url_Paper = &quot;https://harrisonwl.github.io/assets/papers/wrs02.pdf&quot;,\n   abstract = &quot;Haskell is a functional programming language with nominally non-strict\nsemantics, implying that evaluation of a Haskell expression proceeds by\ndemand-driven reduction.  However, Haskell also provides pattern \nmatching\non arguments of functions, in {\\bf let} expressions and in the match\nclauses of {\\bf case} expressions.  Pattern-matching requires\ndata-driven reduction to the extent necessary to\nevaluate a pattern match or to bind variables introduced in a pattern.\nIn this paper we\nprovide both an abstract semantics and a logical characterization of\npattern-matching in Haskell and the reduction order that it entails.&quot;,\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  Haskell is a functional programming language with nominally non-strict semantics, implying that evaluation of a Haskell expression proceeds by demand-driven reduction. However, Haskell also provides pattern matching on arguments of functions, in \\bf let expressions and in the match clauses of \\bf case expressions. Pattern-matching requires data-driven reduction to the extent necessary to evaluate a pattern match or to bind variables introduced in a pattern. In this paper we provide both an abstract semantics and a logical characterization of pattern-matching in Haskell and the reduction order that it entails.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"harrison-sheard-hook-finecontrolofdemandinhaskell-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/mpc02.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-sheard-hook-finecontrolofdemandinhaskell-2002', 'https://harrisonwl.github.io/assets/papers/mpc02.pdf', event);\">\n    Fine Control of Demand in Haskell.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>; Sheard, T.;  and Hook, J.\n</span>\n\n  \n\n</span>\n\n  In <i>6th International Conference on the Mathematics of Program Construction (MPC02), Dagstuhl, Germany</i>, volume 2386, of <i>Lecture Notes in Computer Science</i>, pages 68–93,  2002. Springer-Verlag\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://harrisonwl.github.io/assets/papers/mpc02.pdf\"\n     onclick=\"log_download('harrison-sheard-hook-finecontrolofdemandinhaskell-2002', 'https://harrisonwl.github.io/assets/papers/mpc02.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Fine Control of Demand in Haskell [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/slides-mpc02.pdf\"\n     onclick=\"log_download('harrison-sheard-hook-finecontrolofdemandinhaskell-2002', 'https://harrisonwl.github.io/assets/papers/slides-mpc02.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Fine Control of Demand in Haskell [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-sheard-hook-finecontrolofdemandinhaskell-2002\"\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('harrison-sheard-hook-finecontrolofdemandinhaskell-2002')\" -->\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{FCDH2002,\n  author =       &quot;William Harrison and Timothy Sheard and James Hook&quot;,\n  title =        &quot;Fine Control of Demand in {Haskell}&quot;,\n  booktitle =    &quot;6th International Conference on the Mathematics of\n                 Program Construction (MPC02),\n                 Dagstuhl, Germany&quot;,\n  year =         &quot;2002&quot;,\n  publisher =    &quot;Springer-Verlag&quot;,\n  volume =       &quot;2386&quot;,\n  pages =        &quot;68--93&quot;,\n  series =       &quot;Lecture Notes in Computer Science&quot;,\n  hconf = &quot;yes&quot;,\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/mpc02.pdf&quot;,\n   url_Slides = &quot;https://harrisonwl.github.io/assets/papers/slides-mpc02.pdf&quot;,\n  abstract = &quot;Functional languages have the lambda calculus at their core, but then depart from this firm foundation by including features that alter their default evaluation order. The resulting mixed evaluation---partly lazy and partly strict---complicates the formal semantics of these languages. The functional language Haskell is such a language, with features such as pattern-matching, case expressions with guards, etc., introducing a modicum of strictness into the otherwise lazy language. But just how does Haskell differ from the lazy lambda calculus? We answer this question by introducing a calculational semantics for Haskell that exposes the interaction of its strict features with its default laziness. In the semantics, features perturbing Haskell&#x27;s standard lazy evaluation order are specified computationally (i.e., monadically) rather than as pure values (i.e., functions, scalars, etc.).&quot;\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  Functional languages have the lambda calculus at their core, but then depart from this firm foundation by including features that alter their default evaluation order. The resulting mixed evaluation—partly lazy and partly strict—complicates the formal semantics of these languages. The functional language Haskell is such a language, with features such as pattern-matching, case expressions with guards, etc., introducing a modicum of strictness into the otherwise lazy language. But just how does Haskell differ from the lazy lambda calculus? We answer this question by introducing a calculational semantics for Haskell that exposes the interaction of its strict features with its default laziness. In the semantics, features perturbing Haskell's standard lazy evaluation order are specified computationally (i.e., monadically) rather than as pure values (i.e., functions, scalars, etc.).\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2001\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2001')\"\n      onkeypress=\"toggleGroup('group_2001')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2001</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=\"harrison-sheard-dynamicallyadaptablesoftwarewithmetacomputationsinastagedlanguage-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/saig01.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-sheard-dynamicallyadaptablesoftwarewithmetacomputationsinastagedlanguage-2001', 'https://harrisonwl.github.io/assets/papers/saig01.pdf', event);\">\n    Dynamically Adaptable Software with Metacomputations in a Staged Language.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Harrison, B.;  and Sheard, T.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the Second International Workshop on Semantics, Applications, and Implementation of Program Generation (SAIG)</i>, volume 2196, of <i>Lecture Notes in Computer Science</i>, pages 163–182, Florence, Italy,  2001. Springer-Verlag\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://harrisonwl.github.io/assets/papers/saig01.pdf\"\n     onclick=\"log_download('harrison-sheard-dynamicallyadaptablesoftwarewithmetacomputationsinastagedlanguage-2001', 'https://harrisonwl.github.io/assets/papers/saig01.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Dynamically Adaptable Software with Metacomputations in a Staged Language [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-sheard-dynamicallyadaptablesoftwarewithmetacomputationsinastagedlanguage-2001\"\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('harrison-sheard-dynamicallyadaptablesoftwarewithmetacomputationsinastagedlanguage-2001')\" -->\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{HarrisonSheard2001,\n  author =       &quot;Bill Harrison and Tim Sheard&quot;,\n  title =        &quot;Dynamically Adaptable Software with Metacomputations in a Staged Language&quot;,\n  journal =      &quot;Lecture Notes in Computer Science&quot;,\n  booktitle =    &quot;Proceedings of the Second International Workshop on\n                  Semantics, Applications, and Implementation of Program Generation (SAIG)&quot;,\n  address =      &quot;Florence, Italy&quot;, \n  volume =       &quot;2196&quot;,\n  pages =        &quot;163--182&quot;,\n  publisher =    &quot;Springer-Verlag&quot;,\n  series =       &quot;Lecture Notes in Computer Science&quot;,\n  year =         &quot;2001&quot;,\n  hconf = &quot;yes&quot;,\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/saig01.pdf&quot;,\n  abstract = &quot;Profile-driven compiler optimizations take advantage of information gathered at runtime to re-compile programs into more efficient code. Such optimizations appear to be more easily incorporated within a semantics-directed compiler structure than within traditional compiler structure. We present a case study in which a metacomputation-based reference compiler for a small imperative language converts easily into a compiler which performs a particular profile-driven optimization: local register allocation. Our reference compiler is implemented in the staged, functional language MetaML and takes full advantage of the synergy between metacomputation-style language definitions and the staging constructs of MetaML. We believe that the approach to implementing profile-driven optimizations presented here suggests a useful, formal model for dynamically adaptable software.&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Profile-driven compiler optimizations take advantage of information gathered at runtime to re-compile programs into more efficient code. Such optimizations appear to be more easily incorporated within a semantics-directed compiler structure than within traditional compiler structure. We present a case study in which a metacomputation-based reference compiler for a small imperative language converts easily into a compiler which performs a particular profile-driven optimization: local register allocation. Our reference compiler is implemented in the staged, functional language MetaML and takes full advantage of the synergy between metacomputation-style language definitions and the staging constructs of MetaML. We believe that the approach to implementing profile-driven optimizations presented here suggests a useful, formal model for dynamically adaptable software.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"harrison-modularcompilersandtheircorrectnessproofs-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/dissertation.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-modularcompilersandtheircorrectnessproofs-2001', 'https://harrisonwl.github.io/assets/papers/dissertation.pdf', event);\">\n    Modular Compilers and Their Correctness Proofs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>\n</span>\n\n  \n\n</span>\n\n  Ph.D. Thesis, University of Illinois at Urbana-Champaign,  2001.\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://harrisonwl.github.io/assets/papers/dissertation.pdf\"\n     onclick=\"log_download('harrison-modularcompilersandtheircorrectnessproofs-2001', 'https://harrisonwl.github.io/assets/papers/dissertation.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Modular Compilers and Their Correctness Proofs [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-modularcompilersandtheircorrectnessproofs-2001\"\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>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('harrison-modularcompilersandtheircorrectnessproofs-2001')\" -->\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;\">@PhdThesis{Harrison2001,\n  author =       &quot;William Harrison&quot;,\n  title =        &quot;Modular Compilers and Their Correctness Proofs&quot;,\n  year =         &quot;2001&quot;,\n  school =       &quot;University of Illinois at Urbana-Champaign&quot;,\n  hthesis = &quot;yes&quot;,\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/dissertation.pdf&quot;,\n  abstract = &quot;This thesis explores the construction and correctness of modular compilers. Modular compilation is a compiler construction technique allowing the construction of compilers for high-level programming languages from reusable compiler building blocks. Modular compilers are defined in terms of denotational semantics based on monads, monad transformers, and a new model of staged computation called metacomputations. A novel form of denotational specification called observational program specification and related proof techniques are developed to assist in modular compiler verification. It will be demonstrated that the modular compilation framework provides both a level of modularity in compiler proofs as well as a useful organizing principle for such proofs.&quot;,\n}\n\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  This thesis explores the construction and correctness of modular compilers. Modular compilation is a compiler construction technique allowing the construction of compilers for high-level programming languages from reusable compiler building blocks. Modular compilers are defined in terms of denotational semantics based on monads, monad transformers, and a new model of staged computation called metacomputations. A novel form of denotational specification called observational program specification and related proof techniques are developed to assist in modular compiler verification. It will be demonstrated that the modular compilation framework provides both a level of modularity in compiler proofs as well as a useful organizing principle for such proofs.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2000\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2000')\"\n      onkeypress=\"toggleGroup('group_2000')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2000</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=\"harrison-kamin-metacomputationbasedcompilerarchitecture-2000\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/mpc00.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-kamin-metacomputationbasedcompilerarchitecture-2000', 'https://harrisonwl.github.io/assets/papers/mpc00.pdf', event);\">\n    Metacomputation-based Compiler Architecture.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>;  and Kamin, S.\n</span>\n\n  \n\n</span>\n\n  In <i>5th International Conference on the Mathematics of Program Construction, Ponte de Lima, Portugal</i>, volume 1837, of <i>Lecture Notes in Computer Science</i>, pages 213–229,  2000. Springer-Verlag\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://harrisonwl.github.io/assets/papers/mpc00.pdf\"\n     onclick=\"log_download('harrison-kamin-metacomputationbasedcompilerarchitecture-2000', 'https://harrisonwl.github.io/assets/papers/mpc00.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Metacomputation-based Compiler Architecture [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-kamin-metacomputationbasedcompilerarchitecture-2000\"\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('harrison-kamin-metacomputationbasedcompilerarchitecture-2000')\" -->\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{HarrisonKamin2000,\n  author =       &quot;William Harrison and Samuel Kamin&quot;,\n  title =        &quot;Metacomputation-based Compiler Architecture&quot;,\n  booktitle =    &quot;5th International Conference on the Mathematics of\n                 Program Construction,\n                 Ponte de Lima, Portugal&quot;,\n  year =         &quot;2000&quot;,\n  publisher =    &quot;Springer-Verlag&quot;,\n  volume =       &quot;1837&quot;,\n  pages =        &quot;213--229&quot;,\n  series =       &quot;Lecture Notes in Computer Science&quot;,\n  hconf = &quot;yes&quot;,\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/mpc00.pdf&quot;,\n  abstract = &quot;This paper presents a modular and extensible style of language specification based on metacomputations. This style uses two monads to factor the static and dynamic parts of the specification, thereby staging the specification and achieving strong binding-time separation. Because metacomputations are defined in terms of monads, they can be constructed modularly and extensibly using monad transformers. Consequently, metacomputation-style specifications are modular and extensible. A number of language constructs are specified: expressions, control-flow, imperative features, block structure, and higher-order functions and recursive bindings. Because of the strong binding-time separation, metacomputation-style specification lends itself to semantics-directed compilation, which we demonstrate by creating a modular compiler for a block-structured imperative, while language.&quot;,\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper presents a modular and extensible style of language specification based on metacomputations. This style uses two monads to factor the static and dynamic parts of the specification, thereby staging the specification and achieving strong binding-time separation. Because metacomputations are defined in terms of monads, they can be constructed modularly and extensibly using monad transformers. Consequently, metacomputation-style specifications are modular and extensible. A number of language constructs are specified: expressions, control-flow, imperative features, block structure, and higher-order functions and recursive bindings. Because of the strong binding-time separation, metacomputation-style specification lends itself to semantics-directed compilation, which we demonstrate by creating a modular compiler for a block-structured imperative, while language.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1998\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1998')\"\n      onkeypress=\"toggleGroup('group_1998')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1998</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=\"harrison-kamin-modularcompilersbasedonmonadtransformers-1998\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/iccl98.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-kamin-modularcompilersbasedonmonadtransformers-1998', 'https://harrisonwl.github.io/assets/papers/iccl98.pdf', event);\">\n    Modular Compilers Based on Monad Transformers.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W. L.</a>;  and Kamin, S. N.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 1998 International Conference on Computer Languages</i>, pages 122–131,  1998. IEEE Computer Society Press\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://harrisonwl.github.io/assets/papers/iccl98.pdf\"\n     onclick=\"log_download('harrison-kamin-modularcompilersbasedonmonadtransformers-1998', 'https://harrisonwl.github.io/assets/papers/iccl98.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Modular Compilers Based on Monad Transformers [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-kamin-modularcompilersbasedonmonadtransformers-1998\"\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('harrison-kamin-modularcompilersbasedonmonadtransformers-1998')\" -->\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{HarrisonKamin1998,\n  author =       &quot;William L. Harrison and Samuel N. Kamin&quot;,\n  title =        &quot;Modular Compilers Based on Monad Transformers&quot;,\n  booktitle =    &quot;Proceedings of the 1998 International Conference on\n                 Computer Languages&quot;,\n  publisher =    &quot;IEEE Computer Society Press&quot;,\n  year =         &quot;1998&quot;,\n  ISBN =         &quot;0-780-35005-7, 0-8186-8454-2, 0-8186-8456-9&quot;,\n  pages =        &quot;122--131&quot;,\n  hconf = &quot;yes&quot;,\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/iccl98.pdf&quot;,\n  abstract =     &quot;The monadic style of language specification has the\n                 advantages of modularity and extensibility: it is\n                 simple to add or change features in an interpreter to\n                 re ect modifications in the source language. It has\n                 proven difficult to extend the method to compilation.\n                 We demonstrate that by introducing machine-like stores\n                 (code and data) into the monadic semantics and then\n                 partially evaluating the resulting semantic\n                 expressions, we can achieve many of the same advantages\n                 for a compiler as for an interpreter. A number of\n                 language constructs and features are compiled:\n                 expressions, CBV and CBN evaluation of\n                 $\\lambda$-expressions, dynamic scoping, and various\n                 imperative features. The treatment of recursive\n                 procedures is outlined as well. The resulting method\n                 allows compilers to be constructed in a mix-and-match\n                 fashion just as in a monad-structured interpreter.&quot;,\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The monadic style of language specification has the advantages of modularity and extensibility: it is simple to add or change features in an interpreter to re ect modifications in the source language. It has proven difficult to extend the method to compilation. We demonstrate that by introducing machine-like stores (code and data) into the monadic semantics and then partially evaluating the resulting semantic expressions, we can achieve many of the same advantages for a compiler as for an interpreter. A number of language constructs and features are compiled: expressions, CBV and CBN evaluation of $λ$-expressions, dynamic scoping, and various imperative features. The treatment of recursive procedures is outlined as well. The resulting method allows compilers to be constructed in a mix-and-match fashion just as in a monad-structured interpreter.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1992\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1992')\"\n      onkeypress=\"toggleGroup('group_1992')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1992</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"harrison-mechanizingtheaxiomaticsemanticsforaprogramminglanguagewithasynchronoussendandreceiveinhol-1992\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://harrisonwl.github.io/assets/papers/masters-thesis.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'harrison-mechanizingtheaxiomaticsemanticsforaprogramminglanguagewithasynchronoussendandreceiveinhol-1992', 'https://harrisonwl.github.io/assets/papers/masters-thesis.pdf', event);\">\n    Mechanizing the Axiomatic Semantics for a Programming Language with Asynchronous Send and Receive in HOL.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>\n</span>\n\n  \n\n</span>\n\n  Master's thesis, University of California, Davis,  1992.\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://harrisonwl.github.io/assets/papers/masters-thesis.pdf\"\n     onclick=\"log_download('harrison-mechanizingtheaxiomaticsemanticsforaprogramminglanguagewithasynchronoussendandreceiveinhol-1992', 'https://harrisonwl.github.io/assets/papers/masters-thesis.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Mechanizing the Axiomatic Semantics for a Programming Language with Asynchronous Send and Receive in HOL [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/harrison-mechanizingtheaxiomaticsemanticsforaprogramminglanguagewithasynchronoussendandreceiveinhol-1992\"\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('harrison-mechanizingtheaxiomaticsemanticsforaprogramminglanguagewithasynchronoussendandreceiveinhol-1992')\" -->\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;\">@MastersThesis{Harrison1992,\n  author =       &quot;William Harrison&quot;,\n  title =        &quot;Mechanizing the Axiomatic Semantics for a Programming Language with Asynchronous Send and Receive in HOL&quot;,\n  year =         &quot;1992&quot;,\n  school =       &quot;University of California, Davis&quot;,\n  hthesis = &quot;yes&quot;,\n   url_Paper = &quot;https://harrisonwl.github.io/assets/papers/masters-thesis.pdf&quot;,\n  abstract = &quot;This thesis presents the axiomatic semantics for a simple distributed language and its mechanization in HOL. The constructs of this language include asynchronous send and synchronous receive statements as well as those basic to a sequential programming language. The language has the appearance of a system programming language that supports sequential execution extended with message-passing, and would be a suitable basis for coding distributed operating systems. Included in the mechanization are functions which generate the goals associated with the verification of simple statements in the language.&quot;,\n}\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  This thesis presents the axiomatic semantics for a simple distributed language and its mechanization in HOL. The constructs of this language include asynchronous send and synchronous receive statements as well as those basic to a sequential programming language. The language has the appearance of a system programming language that supports sequential execution extended with message-passing, and would be a suitable basis for coding distributed operating systems. Included in the mechanization are functions which generate the goals associated with the verification of simple statements in the language.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"harrison-levitt-archer-anholmechanizationoftheaxiomaticsemanticsofasimpledistributedprogramminglanguage-1992\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An HOL Mechanization of the Axiomatic Semantics of a Simple Distributed Programming Language.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>; Levitt, K.;  and Archer, M.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the International Workshop on Higher-Order Logic Theorem Proving and Its Applications</i>, pages 347-358, Leuven, Belgium, September 1992. \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/harrison-levitt-archer-anholmechanizationoftheaxiomaticsemanticsofasimpledistributedprogramminglanguage-1992\"\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('harrison-levitt-archer-anholmechanizationoftheaxiomaticsemanticsofasimpledistributedprogramminglanguage-1992')\" -->\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{harrison92,\n  author =       &quot;William Harrison and Karl Levitt and Myla Archer&quot;,\n  title =        &quot;An HOL Mechanization of the Axiomatic Semantics of a Simple\nDistributed Programming Language&quot;,\n  booktitle =    &quot;Proceedings of the International Workshop on Higher-Order Logic\n  Theorem Proving and Its Applications&quot;,\n  month = &quot;September&quot;,\n  address = &quot;Leuven, Belgium&quot;,\n  year =         &quot;1992&quot;,\n  pages =        &quot;347-358&quot;,\n  hconf = &quot;yes&quot;,\n  abstract = &quot;&quot;,\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"harrison-levitt-archer-towardsaverifiedcodebasisforasecuredistributedoperatingsystem-1992\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Towards a Verified Code Basis for a Secure Distributed Operating System.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>; Levitt, K.;  and Archer, M.\n</span>\n\n  \n\n</span>\n\n  Technical Report CSE-92-19, University of California at Davis,  1992.\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/harrison-levitt-archer-towardsaverifiedcodebasisforasecuredistributedoperatingsystem-1992\"\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('harrison-levitt-archer-towardsaverifiedcodebasisforasecuredistributedoperatingsystem-1992')\" -->\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;\">@TechReport{tr92a,\n  author = \t {William Harrison and Karl Levitt and Myla Archer},\n  title = \t {{Towards a Verified Code Basis for a Secure Distributed Operating System}},\n  institution =  {University of California at Davis},\n  number =       &quot;CSE-92-19&quot;,\n  year = \t 1992,\n  htr =          &quot;yes&quot;,\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"harrison-mechanizingtheaxiomaticsemanticsforaprogramminglanguagewithasynchronoussendandreceiveinhol-1992\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Mechanizing the Axiomatic Semantics for a Programming Language with Asynchronous Send and Receive in HOL.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>\n</span>\n\n  \n\n</span>\n\n  Technical Report CSE-92-20, University of California at Davis,  1992.\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/harrison-mechanizingtheaxiomaticsemanticsforaprogramminglanguagewithasynchronoussendandreceiveinhol-1992\"\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  &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('harrison-mechanizingtheaxiomaticsemanticsforaprogramminglanguagewithasynchronoussendandreceiveinhol-1992')\" -->\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;\">@TechReport{tr92b,\n  author = \t {William Harrison},\n  title = \t {{Mechanizing the Axiomatic Semantics for a Programming Language with Asynchronous Send and Receive in HOL}},\n  institution =  {University of California at Davis},\n  number =       &quot;CSE-92-20&quot;,\n  year = \t 1992,\n  htr =          &quot;yes&quot;,\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_1991\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1991')\"\n      onkeypress=\"toggleGroup('group_1991')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1991</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=\"harrison-levitt-mechanizingsecurityinhol-1991\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Mechanizing Security in HOL.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://harrisonwl.github.io/etc/publications.html\">Harrison, W.</a>;  and Levitt, K.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and its Applications</i>, pages 63–66, Davis, California,  1991. IEEE Computer Society Press\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/harrison-levitt-mechanizingsecurityinhol-1991\"\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('harrison-levitt-mechanizingsecurityinhol-1991')\" -->\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{MeSeHOL,\n  AUTHOR = {William Harrison and Karl Levitt},\n  TITLE = {Mechanizing Security in {HOL}},\n  BOOKTITLE = {Proceedings of the 1991 International Workshop\n            on the {HOL} Theorem Proving System and its Applications},\n  PUBLISHER = {IEEE Computer Society Press},\n  YEAR = {1991},\n  PAGES = {63--66},\n  address = &quot;Davis, California&quot;,\n  hconf = &quot;yes&quot;,\n  abstract = &quot;&quot;,\n}\n\n\n</pre>\n</div>\n\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);