Searching for authors named "James Brotherston" – sorted by Relevance.
10 documents found, showing 1 through 10.
-
Formalised inductive reasoning in the logic of bunched implications
- …Formalised Inductive Reasoning in the Logic of Bunched Implications James Brotherston ⋆ Dept…
- Cited by 2 (2 self) – Add To MetaCart
-
Complete sequent calculi for induction and infinite descent
- …Complete Sequent Calculi for Induction and Infinite Descent James Brotherston ∗ Dept. of Computing…
- Cited by 5 (5 self) – Add To MetaCart
-
Cyclic proofs for first-order logic with inductive definitions
- …Cyclic Proofs for First-Order Logic with Inductive Definitions James Brotherston 1 Laboratory…
- Cited by 6 (5 self) – Add To MetaCart
-
Boolean BI is Decidable (via Display Logic)
- …Boolean BI is Decidable (via Display Logic) James Brotherston ∗ Dept. of Computing Imperial…
- Add To MetaCart
-
Cyclic proofs of program termination in separation logic. Forthcoming
- …Cyclic Proofs of Program Termination in Separation Logic ∗ James Brotherston Imperial College…
- Cited by 3 (2 self) – Add To MetaCart
-
Implementing Invariant Search via Temporal Resolution
- …Implementing Invariant Search via Temporal Resolution ? Alexei Lisitsa 1 and James Brotherston…
- Add To MetaCart
-
Classical BI (A Logic for Reasoning about Dualising Resources)
- …Classical BI (A Logic for Reasoning about Dualising Resources) James Brotherston ∗ Cristiano…
- Cited by 1 (1 self) – Add To MetaCart
-
Algebraic models and complete proof calculi for classical BI
- …Algebraic Models and Complete Proof Calculi for Classical BI James Brotherston and Cristiano…
- Cited by 2 (2 self) – Add To MetaCart
-
Classical logic of bunched implications
- …Classical Logic of Bunched Implications James Brotherston and Cristiano Calcagno ⋆ Dept…
- Cited by 2 (2 self) – Add To MetaCart
-
Searching for Invariants using Temporal Resolution
- …Searching for Invariants Using Temporal Resolution ⋆ James Brotherston 1 , Anatoli Degtyarev 2…
- Cited by 2 (2 self) – Add To MetaCart
Showing 1 through 10.
