1209 search results - page 100 / 242 » Universal Algebra and Computer Science |
99
Voted
IFIPTCS
2000
15 years 6 months ago
2000
Abstract The sos formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to ch...
113
Voted
TCS
2010
14 years 9 months ago
2010
The literature on definitions of security based on causality-like notions such as noninterference has used several distinct semantic models for systems. Early work was based on st...
99
Voted
MFCS
1997
Springer
15 years 6 months ago
1997
Springer
Abstract. Action refinement in process algebras has been widely studied in the last few years as a means to support top-down design of systems. A specific notion of refinement aris...
120
Voted
RTA
2010
Springer
15 years 1 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and...
122
Voted
CADE
2006
Springer
16 years 2 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...