Konstantinos Mamouras Research | Publications | Other | Teaching
niagara

Konstantinos Mamouras

mamouras [at] seas [dot] upenn [dot] edu

Department of Computer and Information Science
University of Pennsylvania
Office 223, Towne Hall
Philadelphia, PA, 19104
USA

I am a postdoctoral researcher in the Department of Computer and Information Science at the University of Pennsylvania. My advisor is Rajeev Alur. Before joining Penn, I was a Ph.D student at the Computer Science department of Cornell University advised by Dexter Kozen. I finished the MSc in Advanced Computing program at Imperial College London, and the Electrical and Computer Engineering undergraduate program at the National Technical University of Athens.

Research Interests

I am currently working on the design of programming abstractions for processing data streams. Several real-time decision making applications rely on the computation of quantitative summaries of very large streams of data. We have proposed StreamQRE, a declarative query language that combines regular expressions, quantitative aggregation, and relational features. A compilation algorithm translates the high-level query into a streaming algorithm with precise guarantees for resource usage.

I am also interested in program semantics and logics for program verification. In particular, this includes equational theories of programs based on the framework of Kleene Algebra with Tests.

Publications

ICALP '17 Automata-based Stream Processing.
Rajeev Alur, Konstantinos Mamouras, and Caleb Stanford.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP). Warsaw, Poland, July 2017.
[pdf] [link]
PLDI '17 StreamQRE: Modular Specification and Efficient Evaluation of Quantitative Queries over Streaming Data.
Konstantinos Mamouras, Mukund Raghothaman, Rajeev Alur, Zachary G. Ives, and Sanjeev Khanna.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). Barcelona, Spain, June 2017.
[pdf] [link]
FoSSaCS '17 Equational Theories of Abnormal Termination Based on Kleene Algebra.
Konstantinos Mamouras.
Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS). Uppsala, Sweden, April 2017.
[pdf] [link]
LMCS '16 Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism.
Konstantinos Mamouras.
Logical Methods in Computer Science, 2016.
Special Issue: 18th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2015).
[pdf] [link]
TOCL '16 The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes.
Konstantinos Mamouras.
ACM Transactions on Computational Logic, 2016.
Revised and expanded version of CSL-LICS 2014 paper.
[pdf] [link]
ESOP '16 Probabilistic NetKAT.
Nate Foster, Dexter Kozen, Konstantinos Mamouras, Mark Reitblatt, and Alexandra Silva.
Proceedings of the 25th European Symposium on Programming (ESOP). Eindhoven, The Netherlands, April 2016.
[pdf] [link]
RAMiCS '15 Completeness and Incompleteness in Nominal Kleene Algebra.
Dexter Kozen, Konstantinos Mamouras, and Alexandra Silva.
Proceedings of the 15th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS). Braga, Portugal, September 2015.
[pdf] [link] [tech report]
ICALP '15 Nominal Kleene Coalgebra.
Dexter Kozen, Konstantinos Mamouras, Daniela Petrişan, and Alexandra Silva.
Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP). Kyoto, Japan, July 2015.
[pdf] [link] [tech report]
FoSSaCS '15 Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism.
Konstantinos Mamouras.
Proceedings of the 18th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS). London, UK, April 2015.
ETAPS Best Theory Paper Award.
[pdf] [link]
CSL-LICS '14 On the Hoare Theory of Monadic Recursion Schemes.
Konstantinos Mamouras.
Proceedings of the 23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Vienna, Austria, July 2014.
[pdf] [link]
ICALP '14 Kleene Algebra with Equations.
Dexter Kozen, and Konstantinos Mamouras.
Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP). Copenhagen, Denmark, July 2014.
[pdf] [link] [tech report]
CSL-LICS '14 KAT + B!.
Niels Bjørn Bugge Grathwohl, Dexter Kozen, and Konstantinos Mamouras.
Proceedings of the 23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Vienna, Austria, July 2014.
[pdf] [link] [tech report]
CSL '13 Kleene Algebra with Products and Iteration Theories.
Dexter Kozen, and Konstantinos Mamouras.
Proceedings of the 22nd EACSL Annual Conference on Computer Science Logic (CSL). Torino, Italy, September 2013.
[pdf] [link] [tech report]
VLDB '12 The Complexity of Social Coordination.
Konstantinos Mamouras, Sigal Oren, Lior Seeman, Lucja Kot, and Johannes Gehrke.
Proceedings of the VLDB Endowment (PVLDB). Volume 5(11), pages 1172-1183, 2012.
[pdf]

Other

Extensions of Kleene Algebra for Program Verification.
Konstantinos Mamouras.
PhD thesis. Cornell University, Ithaca, NY, August 2015.
Thesis committee: Dexter Kozen (chair), Robert Constable, Richard Shore.
[link]
Canonical Progress Measures for Parity Games.
Konstantinos Mamouras.
Short presentation at the 27th Annual IEEE Symposium on Logic in Computer Science (LICS '12). Dubrovnik, Croatia, June 2012.
[pdf]
First-order Temporal Logic with Fixpoint Operators over the Natural Numbers.
Konstantinos Mamouras.
Distinguished MSc Project. Imperial College, London, 2009.
[pdf] [link]

Teaching Experience

I have been a teaching assistant at Cornell University for: