Design and validation of computer protocols
Design and validation of computer protocols
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Communication and Concurrency
The Powerdomain of Indexed Valuations
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Guarded Transitions in Evolving Specifications
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Composition and Refinement of Behavioral Specifications
Proceedings of the 16th IEEE international conference on Automated software engineering
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Trace Semantics for Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
A domain equation for bisimulation
Information and Computation
Duality for logics of transition systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Context-free languages via coalgebraic trace semantics
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Ultrafilter extensions for coalgebras
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
On monotone modalities and adjointness
Mathematical Structures in Computer Science
Coalgebraic walks, in quantum and turing computation
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
The duality of state and observation in probabilistic transition systems
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Approximating Markov Processes by Averaging
Journal of the ACM (JACM)
Hi-index | 0.00 |
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.