List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Partial bounding for recursive function synthesis Formal Methods in System Design | 2024-11-04 | Paper |
| Automated hypersafety verification Computer Aided Verification | 2024-02-16 | Paper |
| Commutativity for concurrent program termination proofs | 2024-02-01 | Paper |
| A pragmatic approach to stateful partial order reduction Lecture Notes in Computer Science | 2023-08-17 | Paper |
| Counterexample-guided partial bounding for recursive function synthesis | 2022-03-25 | Paper |
| Root causing linearizability violations | 2021-02-04 | Paper |
| On atomicity in presence of non-atomic writes | 2019-09-17 | Paper |
| Proving liveness of parameterized programs Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| Proof spaces for unbounded parallelism Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
| Automated program verification Language and Automata Theory and Applications | 2016-04-08 | Paper |
| Verification of parameterized concurrent programs by modular reasoning about data and control Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-09-11 | Paper |
| Inductive data flow graphs Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
| Consistency analysis of decision-making programs Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
| Proofs that count Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
| Partial order reduction for rewriting semantics of programming languages Electronic Notes in Theoretical Computer Science | 2014-01-24 | Paper |
| Compositional Bitvector Analysis for Concurrent Programs with Nested Locks Static Analysis | 2010-10-01 | Paper |
| Meta-analysis for Atomicity Violations under Nested Locking Computer Aided Verification | 2009-06-30 | Paper |
| State Space Reduction of Rewrite Theories Using Invisible Transitions Algebraic Methodology and Software Technology | 2009-04-28 | Paper |
| Learning Minimal Separating DFA’s for Compositional Verification Tools and Algorithms for the Construction and Analysis of Systems | 2009-03-31 | Paper |
| The Complexity of Predicting Atomicity Violations Tools and Algorithms for the Construction and Analysis of Systems | 2009-03-31 | Paper |
| Monitoring Atomicity in Concurrent Programs Computer Aided Verification | 2008-07-15 | Paper |
| Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages Tools and Algorithms for the Construction and Analysis of Systems | 2008-04-11 | Paper |
| Causal Atomicity Computer Aided Verification | 2007-09-05 | Paper |
| Causal Dataflow Analysis for Concurrent Programs Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
| Computer Aided Verification Lecture Notes in Computer Science | 2005-08-25 | Paper |
| Algebraic Methodology and Software Technology Lecture Notes in Computer Science | 2005-08-25 | Paper |
Research outcomes over time
This page was built for person: Azadeh Farzan
