| Sigma* symbolic learning of input-output specifications M Botinčan, D Babić ACM SIGPLAN Notices 48 (1), 443-456, 2013 | 73 | 2013 |
| Separation logic verification of C programs with an SMT solver M Botinčan, M Parkinson, W Schulte Electronic Notes in Theoretical Computer Science 254, 5-23, 2009 | 54 | 2009 |
| coreStar: The core of jStar M Botincan, D Distefano, M Dodds, R Grigore, D Naudziuniene, ... Proc. 1st BOOGIE, 2011 | 32 | 2011 |
| Proof-directed parallelization synthesis by separation logic M Botinčan, M Dodds, S Jagannathan ACM Transactions on Programming Languages and Systems (TOPLAS) 35 (2), 1-60, 2013 | 16 | 2013 |
| Resource-sensitive synchronization inference by abduction M Botincan, M Dodds, S Jagannathan ACM SIGPLAN Notices 47 (1), 309-322, 2012 | 13 | 2012 |
| Verification of causality requirements in Java memory model is undecidable M Botinčan, P Glavan, D Runje International Conference on Parallel Processing and Applied Mathematics, 62-67, 2009 | 8 | 2009 |
| jStar-Eclipse: an IDE for automated verification of Java programs D Naudziuniene, M Botincan, D Distefano, M Dodds, R Grigore, ... Proceedings of the 19th ACM SIGSOFT symposium and the 13th European …, 2011 | 5 | 2011 |
| Model-based testing of the conference protocol with spec explorer M Botincan, V Novakovic 2007 9th International Conference on Telecommunications, 131-138, 2007 | 5 | 2007 |
| Refining existential properties in separation logic analyses M Dodds, S Magill arXiv preprint arXiv:1504.08309, 2015 | 4 | 2015 |
| Safe asynchronous multicore memory operations M Botinčan, M Dodds, AF Donaldson, MJ Parkinson 2011 26th IEEE/ACM International Conference on Automated Software …, 2011 | 4 | 2011 |
| Automatic safety proofs for asynchronous memory operations M Botincan, M Dodds, AF Donaldson, MJ Parkinson ACM SIGPLAN Notices 46 (8), 313-314, 2011 | 4 | 2011 |
| Distributed Algorithms. A Case Study of the Java Memory Model M Botincan, P Glavan, D Runje Proc. of the 14th Int. ASM Workshop, 2007 | 4 | 2007 |
| AsmL specification and verification of Lamport’s bakery algorithm M Botinčan Journal of computing and information technology 13 (4), 313-319, 2005 | 3 | 2005 |
| Kombinatorne igre M Botinčan Math. e 6, 2005 | 3 | 2005 |
| Futures and the lazy task creation for. NET M Botincan, D Runje, A Vucinovic 2007 15th International Conference on Software, Telecommunications and …, 2007 | 2 | 2007 |
| Lock-Free Stack and Queue: Java vs. NET M Botincan, D Runje 2007 29th International Conference on Information Technology Interfaces, 741-746, 2007 | 1 | 2007 |
| A generic C++ library for solving path problems M Botinčan Journal of computing and information technology 12 (2), 167-173, 2004 | 1 | 2004 |
| Formal verification-driven parallelisation synthesis M Botinčan University of Cambridge, Computer Laboratory, 2018 | | 2018 |
| An Enhancement of Futures Runtime in Presence of Cache Memory Hierarchy M Botincan, D Runje Journal of computing and information technology 16 (4), 339-344, 2008 | | 2008 |
| Anomalies in Distributed Branch-and-Cut Solving of the CVRP with Different Search Strategies M Botinčan, N Goranka Nepoznat skup, 47-56, 2008 | | 2008 |
