On verifying causal consistency A Bouajjani, C Enea, R Guerraoui, J Hamza Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming …, 2017 | 68 | 2017 |
Verifying eventual consistency of optimistic replication systems A Bouajjani, C Enea, J Hamza Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of …, 2014 | 66 | 2014 |
Tractable refinement checking for concurrent objects A Bouajjani, M Emmi, C Enea, J Hamza Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2015 | 60 | 2015 |
Verifying concurrent programs against sequential specifications A Bouajjani, M Emmi, C Enea, J Hamza Programming Languages and Systems: 22nd European Symposium on Programming …, 2013 | 54 | 2013 |
On the completeness of verifying message passing programs under bounded asynchrony A Bouajjani, C Enea, K Ji, S Qadeer Computer Aided Verification: 30th International Conference, CAV 2018, Held …, 2018 | 53 | 2018 |
A logic-based framework for reasoning about composite data structures A Bouajjani, C Drăgoi, C Enea, M Sighireanu CONCUR 2009-Concurrency Theory: 20th International Conference, CONCUR 2009 …, 2009 | 53 | 2009 |
Compositional entailment checking for a fragment of separation logic C Enea, O Lengál, M Sighireanu, T Vojnar Formal Methods in System Design 51, 575-607, 2017 | 52 | 2017 |
On reducing linearizability to state reachability A Bouajjani, M Emmi, C Enea, J Hamza Information and Computation 261, 383-400, 2018 | 48 | 2018 |
An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking DP Guelev, C Dima, C Enea Journal of Applied Non-Classical Logics 21 (1), 93-131, 2011 | 48 | 2011 |
Abstract domains for automated reasoning about list-manipulating programs with infinite data A Bouajjani, C Drăgoi, C Enea, M Sighireanu International Workshop on Verification, Model Checking, and Abstract …, 2012 | 44 | 2012 |
On automated lemma generation for separation logic with inductive definitions C Enea, M Sighireanu, Z Wu Automated Technology for Verification and Analysis: 13th International …, 2015 | 43 | 2015 |
Decidability and complexity results for security protocols FL Tiplea, C Enea, CV Bîrjoveanu VISSAS 1, 185-211, 2005 | 43 | 2005 |
Accurate invariant checking for programs manipulating lists and arrays with infinite data A Bouajjani, C Drăgoi, C Enea, M Sighireanu International Symposium on Automated Technology for Verification and …, 2012 | 42 | 2012 |
On inter-procedural analysis of programs with lists and data A Bouajjani, C Drăgoi, C Enea, M Sighireanu ACM SIGPLAN Notices 46 (6), 578-589, 2011 | 42 | 2011 |
On the complexity of checking transactional consistency R Biswas, C Enea Proceedings of the ACM on Programming Languages 3 (OOPSLA), 1-28, 2019 | 41 | 2019 |
Proving linearizability using forward simulations A Bouajjani, M Emmi, C Enea, SO Mutluergil Computer Aided Verification: 29th International Conference, CAV 2017 …, 2017 | 39 | 2017 |
Robustness against transactional causal consistency SM Beillahi, A Bouajjani, C Enea Logical Methods in Computer Science 17, 2021 | 34 | 2021 |
Inductive sequentialization of asynchronous programs B Kragl, C Enea, TA Henzinger, SO Mutluergil, S Qadeer Proceedings of the 41st ACM SIGPLAN Conference on Programming Language …, 2020 | 33 | 2020 |
Model-checking an alternating-time temporal logic with knowledge, imperfect information, perfect recall and communicating coalitions C Dima, C Enea, D Guelev arXiv preprint arXiv:1006.1414, 2010 | 33 | 2010 |
A generic framework for reasoning about dynamic networks of infinite-state processes A Bouajjani, C Dragoi, C Enea, Y Jurski, M Sighireanu Logical Methods in Computer Science 5, 2009 | 33 | 2009 |