Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Chakarov, Aleksandar"'
Mainframe systems are facing a critical shortage of developer workforce as the current generation of COBOL developers retires. Furthermore, due to the limited availability of public COBOL resources, entry-level developers, who assume the mantle of le
Externí odkaz:
http://arxiv.org/abs/2105.01830
Autor:
Chakarov, Aleksandar Nevenov
The focus of this dissertation is the analysis of and verification of discrete time stochastic systems using martingales. Martingale theory yields a powerful set of tools that have recently been used to prove quantitative properties of stochastic sys
Externí odkaz:
http://pqdtopen.proquest.com/#viewpdf?dispub=10151160
We present lifestate rules--an approach for abstracting event-driven object protocols. Developing applications against event-driven software frameworks is notoriously difficult. One reason why is that to create functioning applications, developers mu
Externí odkaz:
http://arxiv.org/abs/1701.00161
Unlike traditional programs (such as operating systems or word processors) which have large amounts of code, machine learning tasks use programs with relatively small amounts of code (written in machine learning libraries), but voluminous amounts of
Externí odkaz:
http://arxiv.org/abs/1603.07292
Autor:
Blanchet-Sadri, Francine, Chakarov, Aleksandar, Manuelli, Lucas, Schwartz, Jarett, Stich, Slater
Publikováno v:
EPTCS 63, 2011, pp. 71-82
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite partial wor
Externí odkaz:
http://arxiv.org/abs/1108.3623
Publikováno v:
In Journal of Discrete Algorithms July 2012 14:55-64
Publikováno v:
In Theoretical Computer Science 11 May 2012 432:21-27
Autor:
Blanchet-Sadri, Francine, Chakarov, Aleksandar, Chen, Bob, Manuelli, Lucas, Munteanu, Sinziana, Schwartz, Jarett, Stich, Slater
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be total words (or simply words). Given an infinite partial wo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32b068b6d31b6919cc631a901b3452f9
Publikováno v:
Tools & Algorithms for the Construction & Analysis of Systems (9783662496732); 2016, p260-279, 20p