Sciweavers

6 search results - page 1 / 2
» Combining Equational Theories Sharing Non-Collapse-Free Cons...
Sort
View
FROCOS
2000
Springer
13 years 8 months ago
Combining Equational Theories Sharing Non-Collapse-Free Constructors
In this paper we extend the applicability of our combination method for decision procedures for the word problem to theories sharing non-collapse-free constructors. This extension ...
Franz Baader, Cesare Tinelli
ESOP
2007
Springer
13 years 11 months ago
On the Implementation of Construction Functions for Non-free Concrete Data Types
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...
Frédéric Blanqui, Thérè...
CSFW
2010
IEEE
13 years 8 months ago
Impossibility Results for Secret Establishment
—Security protocol design is a creative discipline where the solution space depends on the problem to be solved and the cryptographic operators available. In this paper, we exami...
Benedikt Schmidt, Patrick Schaller, David A. Basin
JLP
2006
138views more  JLP 2006»
13 years 4 months ago
Algebraic-coalgebraic specification in CoCasl
We introduce CoCasl as a light-weight but expressive coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatype...
Till Mossakowski, Lutz Schröder, Markus Rogge...
CCL
1994
Springer
13 years 9 months ago
On Modularity in Term Rewriting and Narrowing
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
Christian Prehofer