HOWARD-60: Author Index| Author | Papers |
|---|
| A | | Abraham, Michael | The Handling of Loops in Talmudic Logic, with Application to Odd and Even Loops in Argumentation | | Armstrong, Philip | Model checking Timed CSP | | B | | Birtwistle, Graham | A Design Space and its Patterns: Modelling 2phase Asynchronous Pipelines | | Bowman, Howard | Cognition, Concurrency Theory and Reverberations in the Brain: in Search of a Calculus of Communicating (Recurrent) Neural Systems | | D | | Dixon, Clare | On and On the Temporal Way | | F | | Falcone, Ylies | On the Expressiveness of some Runtime Validation Techniques | | Fernandez, Jean-Claude | On the Expressiveness of some Runtime Validation Techniques | | Fisher, Michael | On and On the Temporal Way | | Freitas, Leo | Can a system learn from interactive proofs? | | G | | Gabbay, Dov | The Handling of Loops in Talmudic Logic, with Application to Odd and Even Loops in Argumentation | | Gabbay, Michael | A simple and complete model theory for intensional and extensional untyped λ-equality | | Gabbay, Murdoch | Stone duality for first-order logic: a nominal approach to logic and topology | | H | | Havelund, Klaus | Howard Barringer: the Man who Invented the Past
Closing the Gap Between Specification and Programming: VDM++ and Scala | | Hinrichs, Timothy | Model Check What You Can, Runtime Verify the Rest | | Huizing, Cornelis | Pandora's Box | | J | | Jones, Cliff | Can a system learn from interactive proofs? | | K | | Kuiper, Ruurd | Pandora's Box | | Kwiatkowska, Marta | On Incremental Quantitative Verification for Probabilistic Systems | | L | | Lowe, Gavin | Model checking Timed CSP | | Luit, Erik J. | Pandora's Box | | M | | Middelkoop, Ronald | Pandora's Box | | Mounier, Laurent | On the Expressiveness of some Runtime Validation Techniques | | O | | Ouaknine, Joel | Model checking Timed CSP | | P | | Parker, David | On Incremental Quantitative Verification for Probabilistic Systems | | Peled, Doron | Distributed Control Synthesis | | Q | | Qu, Hongyang | On Incremental Quantitative Verification for Probabilistic Systems | | R | | Roscoe, Bill | Model checking Timed CSP | | Rydeheard, David | A note on first-order reasoning for minimum models | | S | | Sanchez, Jesus Hector Dominguez | A note on first-order reasoning for minimum models | | Schewe, Sven | Distributed Control Synthesis | | Schild, Uri J. | The Handling of Loops in Talmudic Logic, with Application to Odd and Even Loops in Argumentation | | Sistla, A. Prasad | Model Check What You Can, Runtime Verify the Rest | | Stevens, Ken | A Design Space and its Patterns: Modelling 2phase Asynchronous Pipelines | | Stirling, Colin | A Tableau Proof System with Names for Modal Mu-calculus | | Su, Li | Cognition, Concurrency Theory and Reverberations in the Brain: in Search of a Calculus of Communicating (Recurrent) Neural Systems | | T | | Thompson, Simon | Extended Abstract: Getting Engaged | | U | | Ujma, Mateusz | On Incremental Quantitative Verification for Probabilistic Systems | | V | | Velykis, Andrius | Can a system learn from interactive proofs? | | Z | | Zuck, Lenore | Model Check What You Can, Runtime Verify the Rest |
|
|
