An expressive semantics of mocking
Paper in proceeding, 2014

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.

Author

Josef Svenningsson

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Hans Svensson

Quviq Ab

Nicholas Smallbone

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Thomas Arts

Quviq Ab

Ulf Norell

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

John Hughes

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 8411 LNCS 385-399
9783642548031 (ISBN)

Subject Categories

Computer and Information Science

DOI

10.1007/978-3-642-54804-8_27

ISBN

9783642548031

More information

Latest update

11/14/2024