CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

An expressive semantics of mocking

Josef Svenningsson (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; H.E. Svensson ; Nicholas Smallbone (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; T. Arts ; Ulf Norell (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)) ; John Hughes (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers))
Lecture Notes in Computer Science: 17th International Conference on Fundamental Approaches to Software Engineering, FASE 2014 - Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014 (0302-9743). Vol. 8411 (2014), p. 385-399.
[Konferensbidrag, refereegranskat]

We present a semantics of mocking, based on a process calculus-like formalism, and an associated mocking framework. We can build expressive mocking specifications from a small, orthogonal set of operators. Our framework detects and rejects ambiguous specifications as a validation measure. We report our experience testing software components for the car industry, which needed the full power of our framework.

Denna post skapades 2015-05-04. Senast ändrad 2017-09-14.
CPL Pubid: 216382


Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)