Testing Semantics: Connecting Processes and Process Logics
We propose a methodology based on testing as a framework to capture the interactions of a machine represented in a denotational model and the data it manipulates. Using a connection that models machines on the one hand, and the data they manipulate on the other, testing is used to capture the interactions of each with the objects on the other side: just as the data that are input into a machine can be viewed as tests that the machine can be subjected to, the machine can be viewed as a test that can be used to distinguish data. This approach is based on generalizing from duality theories that now are common in semantics to logical connections, which are simply contravariant adjunctions. In the process, it accomplishes much more than simply moving from one side of a duality to the other; it faithfully represents the interactions that embody what is happening as the computation proceeds.
Our basic philosophy is that tests can be used as a basis for modeling interactions, as well as processes and the data on which they operate. In more abstract terms, tests can be viewed as formulas of process logics, and testing semantics connects processes and process logics, and assigns computational meanings to both.
KeywordsBoolean Algebra Turing Machine Algebra Homomorphism Logical Connection Pushdown Automaton
Unable to display preview. Download preview PDF.
- 1.Moore, E.F.: Gedanken experiments on sequential machines. In: Automata Studies, Princeton, pp. 129–153 (1956)Google Scholar
- 2.Holzmann, G.J.: Design and Validation of Computer Protocols. Software Series. Prentice Hall, London (1991)Google Scholar
- 5.Pavlovic, D., Smith, D.R.: Composition and refinement of behavioral specifications. In: Automated Software Engineering 2001. The Sixteenth International Conference on Automated Software Engineering, IEEE, Los Alamitos (2001)Google Scholar
- 7.Pavlovic, D., Pepper, P., Smith, D.R.: Colimits for concurrent collectors. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 568–597. Springer, Heidelberg (2004)Google Scholar
- 8.Jacobs, B.: Trace semantics for coalgebras. In: Coalgebraic Methods in Computer Science (CMCS) 2004. Electr. Notes in Theor. Comp. Sci., vol. 106 (2004)Google Scholar
- 18.Plotkin, G.D., Turi, D.: Towards a mathematical operational semantics. In: Proceedings of LICS, vol. 308, pp. 280–291 (1997)Google Scholar
- 21.Varacca, D.: The powerdomain of indexed valuations. In: Proceedings 17th IEEE Symposium on Logic in Computer Science, IEEE Press, Los Alamitos (2002)Google Scholar