Tiu, Alwen - Research School of Information Sciences and Engineering, Australian National University

• Taming Displayed Tense Logics Using Nested Sequents With Deep Inference
• Formalization of a Generalized Protocol for Clock Synchronization in Isabelle/HOL
• Matching Trace Patterns With Regular Policies Franz Baader1
• An Extension of L Unification Computer Science and Engineering Department, 220 Pond Lab,
• On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
• On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
• Cut-elimination and Proof Search for Bi-Intuitionistic Tense Logic
• Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
• Cut-elimination and Proof-search for Bi-Intuitionistic Logic Using Nested Se-
• Master Thesis Properties of a Logical System
• Master Thesis Properties of a Logical System
• Model Checking for -Calculus Using Proof INRIA Lorraine
• FGUC 2004 Preliminary Version A Proof Search Specification of the -Calculus
• Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference
• Cut Elimination for a Logic with Induction and Co-induction Logic and Computation Group
• An Extension of L~ Unification ? Alwen Tiu
• A Local System for Intuitionistic Logic Australian National University and National ICT Australia
• Induction and Co-induction in Sequent Calculus Alberto Momigliano1,2 and Alwen Tiu3,4
• Proof Search Specifications of Bisimulation and Modal Logics for the -calculus
• Formalising Observer Theory for Environment-Sensitive Bisimulation
• A Proof Theoretic Analysis of Intruder Theories Alwen Tiu and Rajeev Gore
• A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
• Under consideration for publication in Formal Aspects of Computing Verification of Clock Synchronization
• A Logic for Reasoning about Generic Judgments Australian National University and National ICT Australia
• Expressiveness + Automation + Soundness: Towards Combining SMT Solvers
• Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
• Model Checking for -Calculus Using Proof INRIA Lorraine
• A Proof Search Specification of the -Calculus DRAFT: April 19, 2004
• A Local System for Classical Logic Kai Brunnler1
• The Pennsylvania State University The Graduate School
• A Logic for Reasoning about Generic Australian National University and National ICT Australia
• A Local System for Intuitionistic Logic Australian National University and National ICT Australia
• A Proof Theoretic Analysis of Intruder Theories Alwen Tiu, Rajeev Gore, and Jeremy Dawson
• Master Thesis on
• Automating Open Bisimulation Checking for the Spi Calculus Logic and Computation Group
• A Hypersequent System for Godel-Dummett Logic with Non-Constant Domains
• SPEC 0.1: A User Manual Research School of Computer Science