The following pages link to Alwen Tiu (Q1687746):
Displaying 50 items.
- Proof tactics for assertions in separation logic (Q1687747) (← links)
- Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus (Q1941882) (← links)
- Cut elimination for a logic with induction and co-induction (Q1948276) (← links)
- Compositional reasoning for shared-variable concurrent programs (Q2024370) (← links)
- An Isabelle/HOL formalisation of the SPARC instruction set architecture and the TSO memory model (Q2031429) (← links)
- Combining proverif and automated theorem provers for security protocol verification (Q2305427) (← links)
- Verification of clock synchronization algorithms: experiments on a combination of deductive tools (Q2642981) (← links)
- On the Role of Names in Reasoning about λ-tree Syntax Specifications (Q2804945) (← links)
- (Q2848670) (← links)
- A Labelled Sequent Calculus for BBI: Proof Theory and Proof Search (Q2851943) (← links)
- (Q2863855) (← links)
- (Q2871856) (← links)
- (Q2904053) (← links)
- Stratification in Logics of Definitions (Q2908525) (← links)
- Extracting Proofs from Tabled Proof Search (Q2938048) (← links)
- Proof search specifications of bisimulation and modal logics for the π-calculus (Q2946601) (← links)
- (Q2958523) (← links)
- A Local System for Classical Logic (Q2996175) (← links)
- On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics (Q3003326) (← links)
- A Hypersequent System for Gödel-Dummett Logic with Non-constant Domains (Q3010373) (← links)
- (Q3086939) (← links)
- Completeness for a First-Order Abstract Separation Logic (Q3179309) (← links)
- Formalising Observer Theory for Environment-Sensitive Bisimulation (Q3183528) (← links)
- From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic (Q3190166) (← links)
- CSimpl: A Rely-Guarantee-Based Framework for Verifying Concurrent Programs (Q3303910) (← links)
- A First-Order Policy Language for History-Based Transaction Monitoring (Q3393401) (← links)
- Automated Theorem Proving for Assertions in Separation Logic with All Connectives (Q3454118) (← links)
- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract (Q3498447) (← links)
- Matching Trace Patterns with Regular Policies (Q3618572) (← links)
- Taming Displayed Tense Logics Using Nested Sequents with Deep Inference (Q3648731) (← links)
- (Q4415240) (← links)
- Modular Labelled Sequent Calculi for Abstract Separation Logics (Q4579962) (← links)
- Semantics for Specialising Attack Trees based on Linear Logic (Q4599815) (← links)
- (Q4608683) (← links)
- A labelled sequent calculus for BBI: proof theory and proof search (Q4612426) (← links)
- De Morgan Dual Nominal Quantifiers Modelling Private Names in Non-Commutative Logic (Q4972161) (← links)
- Display to Labeled Proofs and Back Again for Tense Logics (Q5034228) (← links)
- Divergence and unique solution of equations (Q5111619) (← links)
- Quasi-Open Bisimilarity with Mismatch is Intuitionistic (Q5145273) (← links)
- (Q5155663) (← links)
- Abella: A System for Reasoning about Relational Specifications (Q5195258) (← links)
- Trace-Length Independent Runtime Monitoring of Quantitative Policies in LTL (Q5206953) (← links)
- Constructing weak simulations from linear implications for processes with private names (Q5236556) (← links)
- A proof theory for generic judgments (Q5277739) (← links)
- A System of Interaction and Structure II: The Need for Deep Inference (Q5310657) (← links)
- A Local System for Intuitionistic Logic (Q5387896) (← links)
- Proof search for propositional abstract separation logics via labelled sequents (Q5408442) (← links)
- (Q5419898) (← links)
- Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5 (Q5427256) (← links)
- Types for Proofs and Programs (Q5712312) (← links)
