Thread-Modular Verification Is Cartesian Abstract Interpretation. - Alexander Malkis; Andreas Podelski; Andrey Rybalchenko (ICTAC, 2006)

Precise Thread-Modular Verification. - Alexander Malkis; Andreas Podelski; Andrey Rybalchenko (SAS, 2007)

A Practical Generic Privacy Language. - Moritz Y. Becker; Alexander Malkis; Laurent Bussard (ICISS, 2010)

Thread-Modular Counterexample-Guided Abstraction Refinement. - Alexander Malkis; Andreas Podelski; Andrey Rybalchenko (SAS, 2010)

Abstract Threads. - Shuvendu K. Lahiri; Alexander Malkis; Shaz Qadeer (VMCAI, 2010)

Cartesian abstraction and verification of multithreaded programs. - Alexander Malkis (2010)

On the Strength of Owicki-Gries for Resources. - Alexander Malkis; Laurent Mauborgne (APLAS, 2011)

Verification of software barriers. - Alexander Malkis; Anindya Banerjee 001 (PPoPP, 2012)

On Automation in the Verification of Software Barriers: Experience Report. - Alexander Malkis; Anindya Banerjee 001 (J. Autom. Reason., 2014)

Multithreaded-Cartesian Abstract Interpretation of Multithreaded Recursive Programs Is Polynomial. - Alexander Malkis (RP, 2015)

A Model of Service-Oriented Architectures. - Alexander Malkis; Diego Marmsoler (SBCARS, 2015)

A Model of Layered Architectures. - Diego Marmsoler; Alexander Malkis; Jonas Eckhardt (FESCA, 2015)

Reachability in Binary Multithreaded Programs Is Polynomial. - Alexander Malkis; Steffen Borgwardt (ICDCS, 2017)

Reachability in Multithreaded Programs Is Polynomial in the Number of Threads. - Alexander Malkis (PDCAT, 2019)

Formal Methods: From Academia to Industrial Practice. A Travel Guide. - Marieke Huisman; Dilian Gurov; Alexander Malkis (CoRR, 2020)

Reachability in parallel programs is polynomial in the number of threads. - Alexander Malkis (J. Parallel Distributed Comput., 2022)