Paper Info
Title
Testing semantics: connecting processes and process logics
Abstract
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.
Year
DOI
Venue
2006
10.1007/11784180_24
AMAST
Keywords
Field
DocType
computation proceed,testing semantics,computational meaning,contravariant adjunction,abstract term,logical connection,basic philosophy,models machine,duality theory,denotational model,process logic
Data modeling,Programming language,Computer science,Generalization,Theoretical computer science,Turing machine,Duality (optimization),Pushdown automaton,Boolean algebra,Software development,Semantics
Conference
Volume
ISSN
ISBN
4019
0302-9743
3-540-35633-9
Citations 
PageRank 
References 
21
1.04
19
Authors
3
Name
Order
Citations
PageRank
Dusko Pavlovic147243.58
Michael Mislove2968.78
James B. Worrell3211.04