Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Leonidas Lampropoulos"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 98, Iss Proc. WWV 2012, Pp 3-16 (2012)
With web services already being key ingredients of modern web systems, automatic and easy-to-use but at the same time powerful and expressive testing frameworks for web services are increasingly important. Our work aims at fully automatic testing of
Externí odkaz:
https://doaj.org/article/19f372efa20a4eab870272af5268d686
Publikováno v:
Proceedings of the ACM on Programming Languages. 6:886-901
We describe our experience of using property-based testing---an approach for automatically generating random inputs to check executable program specifications---in a development of a higher-order smart contract language that powers a state-of-the-art
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d5ca8921c1256c181294002b9e6e30d
https://doi.org/10.1145/3547653
https://doi.org/10.1145/3547653
Publikováno v:
Proceedings of the 15th ACM SIGPLAN International Haskell Symposium.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d0a9b8b63528349411c813072cada3b
https://doi.org/10.1145/3546189.3549921
https://doi.org/10.1145/3546189.3549921
Publikováno v:
Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::203f9d515382a03f54441e4fd57b7898
https://doi.org/10.1145/3519939.3523707
https://doi.org/10.1145/3519939.3523707
Publikováno v:
David Van Horn
We present a formal model of Checked C, a dialect of C that aims to enforce spatial memory safety. Our model pays particular attention to the semantics of dynamically sized, potentially null-terminated arrays. We formalize this model in Coq, and prov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d8436fb00efcafc26070e4219891304
Publikováno v:
Proceedings of the ACM on Programming Languages. 3:1-29
Property-based random testing, exemplified by frameworks such as Haskell's QuickCheck, works by testing an executable predicate (a property) on a stream of randomly generated inputs. Property testing works very well in many cases, but not always. Som
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75a8a04e396b946ee9ceb987f6b983f3
https://doi.org/10.1145/3360607
https://doi.org/10.1145/3360607
Publikováno v:
Programming Languages and Systems ISBN: 9783030720186
ESOP
ESOP
Property-based testing uses randomly generated inputs to validate high-level program specifications. It can be shockingly effective at finding bugs, but it often requires generating a very large number of inputs to do so. In this paper, we apply idea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7fb02806ef21656bde8a315310cb8e16
https://doi.org/10.26226/morressier.604907f41a80aac83ca25d16
https://doi.org/10.26226/morressier.604907f41a80aac83ca25d16
Publikováno v:
Proceedings of the ACM on Programming Languages. 2:1-30
We introduce StrictCheck: a property-based random testing framework for observing, specifying, and testing the strictness of Haskell functions. Strictness is traditionally considered a non-functional property; StrictCheck allows it to be tested as if
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a56a3369dc864cc7da735e503f936fb
https://doi.org/10.1145/3236797
https://doi.org/10.1145/3236797
Publikováno v:
Proceedings of the ACM on Programming Languages. 2:1-30
Property-based random testing (PBRT) is widely used in the functional programming and verification communities. For testing simple properties, PBRT tools such as QuickCheck can automatically generate random inputs of a given type. But for more comple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b390bdfeac868351324a3ca722f0c915
https://doi.org/10.1145/3158133
https://doi.org/10.1145/3158133
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030171377
POST
POST
Checked C is a new effort working toward a memory-safe C. Its design is distinguished from that of prior efforts by truly being an extension of C: Every C program is also a Checked C program. Thus, one may make incremental safety improvements to exis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3c79aeb6ebb7f7fd12ad1e72045cbc8
https://doi.org/10.1007/978-3-030-17138-4_4
https://doi.org/10.1007/978-3-030-17138-4_4