Aleksandar Chakarov

According to our database1, Aleksandar Chakarov authored at least 18 papers between 2009 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Better Counterexamples for Dafny.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

2021
Contemporary COBOL: Developers' Perspectives on Defects and Defect Location.
Proceedings of the IEEE International Conference on Software Maintenance and Evolution, 2021

2018
Towards J.A.R.V.I.S. for Software Engineering: Lessons Learned in Implementing a Natural Language Chat Interface.
Proceedings of the Workshops of the The Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Abstracting Event-Driven Systems with Lifestate Rules.
CoRR, 2017

2016
Recurrent Partial Words and Representable Sets.
J. Autom. Lang. Comb., 2016

Debugging Machine Learning Tasks.
CoRR, 2016

Deductive Proofs of Almost Sure Persistence and Recurrence Properties.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Uncertainty Propagation Using Probabilistic Affine Forms and Concentration of Measure Inequalities.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

2014
Expectation Invariants for Probabilistic Program Loops as Fixed Points.
Proceedings of the Static Analysis - 21st International Symposium, 2014

2013
Static analysis for probabilistic programs: inferring whole program properties from finitely many paths.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2013

Exploring the internal state of user interfaces by combining computer vision techniques with grammatical inference.
Proceedings of the 35th International Conference on Software Engineering, 2013

Probabilistic Program Analysis with Martingales.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012
Constructing partial words with subword complexities not achievable by full words.
Theor. Comput. Sci., 2012

Number of holes in unavoidable sets of partial words I.
J. Discrete Algorithms, 2012

2011
Recurrent Partial Words
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Combining Time and Frequency Domain Specifications for Periodic Signals.
Proceedings of the Runtime Verification - Second International Conference, 2011

2010
Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009
Tricolorable torus knots are NP-complete.
Proceedings of the 47th Annual Southeast Regional Conference, 2009


  Loading...