17 search results - page 2 / 4 » On the complexity of checking semantic equivalences between ... |
FAC
2008
13 years 5 months ago
2008
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
PODS
2009
ACM
14 years 6 months ago
2009
ACM
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
PADS
2009
ACM
14 years 8 days ago
2009
ACM
Semantic composability aims to ensure that the composition of simulation components is meaningful in terms of their expressed behavior, and achieves the desired objective of the n...
ICECCS
2005
IEEE
13 years 11 months ago
2005
IEEE
Live Sequence Charts (LSCs) are a broad extension to Message Sequence Charts (MSCs) to capture complex interobject communication rigorously. A tool support for LSCs, named PlayEng...
FORTE
2010
13 years 7 months ago
2010
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...