Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Aleksandar Chakarov"'
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030995232
Dafny is a verification-aware programming language used at Amazon Web Services to develop critical components of their access management, storage, and cryptography infrastructures. The Dafny toolchain provides a verifier that can prove an implementat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd292d6c6c87b471face4249e70553fb
https://doi.org/10.1007/978-3-030-99524-9_23
https://doi.org/10.1007/978-3-030-99524-9_23
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 63, Iss Proc. WORDS 2011, Pp 71-82 (2011)
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:
https://doaj.org/article/735957ca5ddd489d95b6f6fbfe17b48a
Publikováno v:
ICSME
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5eb73e74a4aa86e4bcd48d288f427796
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2016. Lecture Notes in Computer Science
Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2016. Lecture Notes in Computer Science, Apr 2016, Eindhoven, Netherlands. pp.225-243, ⟨10.1007/978-3-662-49674-9_13⟩
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783662496732
TACAS
Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2016. Lecture Notes in Computer Science, Apr 2016, Eindhoven, Netherlands. pp.225-243, ⟨10.1007/978-3-662-49674-9_13⟩
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783662496732
TACAS
Conference of 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2016 and held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016 ; Conference Date: 2 April
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12ca30d10cda48128066c583c05e0048
https://hal-cea.archives-ouvertes.fr/cea-01834974
https://hal-cea.archives-ouvertes.fr/cea-01834974
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783662496732
TACAS
TACAS
Martingale theory yields a powerful set of tools that have recently been used to prove quantitative properties of stochastic systems such as stochastic safety and qualitative properties such as almost sure termination. In this paper, we examine proof
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec2ac497e711a0b3afebcafc828cc2d2
https://doi.org/10.1007/978-3-662-49674-9_15
https://doi.org/10.1007/978-3-662-49674-9_15
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 63, Iss Proc. WORDS 2011, Pp 71-82 (2011)
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf09bd88aac9391cbd46225811bb4e31
https://doaj.org/article/735957ca5ddd489d95b6f6fbfe17b48a
https://doaj.org/article/735957ca5ddd489d95b6f6fbfe17b48a
Publikováno v:
Static Analysis ISBN: 9783319109350
SAS
SAS
We present static analyses for probabilistic loops using expectation invariants. Probabilistic loops are imperative while-loops augmented with calls to random variable generators. Whereas, traditional program analysis uses Floyd-Hoare style invariant
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::275160e9278caaf896593f25eecf745d
https://doi.org/10.1007/978-3-319-10936-7_6
https://doi.org/10.1007/978-3-319-10936-7_6
Publikováno v:
PLDI
We propose an approach for the static analysis of probabilistic programs that sense, manipulate, and control based on uncertain data. Examples include programs used in risk analysis, medical decision making and cyber-physical systems. Correctness pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed1a2f88812c82bf5150b4c469484bb1
https://doi.org/10.1145/2491956.2462179
https://doi.org/10.1145/2491956.2462179
Publikováno v:
2013 35th International Conference on Software Engineering (ICSE).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39af1b4c3425968883faad2d4052c1fe
https://doi.org/10.1109/icse.2013.6606669
https://doi.org/10.1109/icse.2013.6606669
Publikováno v:
Computer Aided Verification ISBN: 9783642397981
CAV
CAV
We present techniques for the analysis of infinite state probabilistic programs to synthesize probabilistic invariants and prove almost-sure termination. Our analysis is based on the notion of (super) martingales from probability theory. First, we de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6518b5ed4556fcee6f42ce22ab7257b2
https://doi.org/10.1007/978-3-642-39799-8_34
https://doi.org/10.1007/978-3-642-39799-8_34