( en | de | ru )

 

Disambiguation of "Tiu, Alwen"

Author of the publication

copydeleteadd this publication to your clipboard
Compositional Reasoning for Shared-Variable Concurrent Programs.

, , , , , , and . FM, volume 10951 of Lecture Notes in Computer Science, page 523-541. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

George Christian Tiurbe

Willi Alwens

Payvand Tiurchy

 

Other publications of authors with the same name

A Local System for Intuitionistic Logic.. LPAR, volume 4246 of Lecture Notes in Computer Science, page 242-256. Springer, (2006)On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics, , and . Logical Methods in Computer Science, (2011)Constructing weak simulations from linear implications for processes with private names., and . Math. Struct. Comput. Sci., 29 (8): 1275-1308 (2019)Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures., , and . Advances in Modal Logic, page 516-537. College Publications, (2012)Compositional Reasoning for Shared-Variable Concurrent Programs., , , , , , and . FM, volume 10951 of Lecture Notes in Computer Science, page 523-541. Springer, (2018)Extracting Proofs from Tabled Proof Search., and . CPP, volume 8307 of Lecture Notes in Computer Science, page 194-210. Springer, (2013)Dagster: Parallel Structured Search with Case Studies., , , , , and . PRICAI (1), volume 13629 of Lecture Notes in Computer Science, page 75-89. Springer, (2022)A Proof Theoretic Analysis of Intruder Theories., and . RTA, volume 5595 of Lecture Notes in Computer Science, page 103-117. Springer, (2009)A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract.. APLAS, volume 4807 of Lecture Notes in Computer Science, page 367-382. Springer, (2007)Completeness for a First-Order Abstract Separation Logic., and . APLAS, volume 10017 of Lecture Notes in Computer Science, page 444-463. (2016)