Testing Languages with a Languages-as-databases Approach
TAP Best Paper
Language testing is an important element in the cycle of a programming language development. A part of these tests aim at determining features of a language such as what type of binders the language has, whether evaluation takes place underneath a binder, as well as other programming languages features.
In prior work, we have proposed languages-as-databases, an approach that is based on storing languages as databases, which then can be interrogated with declarative queries.
This paper illustrates a number of language tests on various aspects of programming languages. We also formulate tests that establish whether the language at hand conforms to the GSOS rule format, therefore deriving that bisimilarity is a congruence. Our tests show that languages-as-databases provides a lightweight approach to language testing.
Wed 19 JulDisplayed time zone: London change
11:15 - 12:45
|Symbolic Observation Graph-Based Generation of Test Paths
P: Kais Klai Universit Paris 13, Mohamed Taha Bennani Universty of Tunis El Manar, Jaime Arias CNRS; LIPN; Université Sorbonne Paris Nord, Jörg Desel Fernuniversität in Hagen, Hanen Ochi EFREIDOI File Attached
|Testing Languages with a Languages-as-databases ApproachTAP Best Paper
P: Matteo Cimini University of Massachusetts LowellDOI
|Proving Properties of Operation Contracts with Test Scenarios