1175 search results - page 23 / 235 » Abstract computability and algebraic specification |
DISCO
1993
13 years 11 months ago
1993
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
CLEIEJ
2004
13 years 7 months ago
2004
ept of reconfigurable systems is almost always restricted to the abstract design level, in which configuration languages are used to manipulate software connections. In this paper...
KBSE
2000
IEEE
13 years 11 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
RELMICS
2009
Springer
14 years 2 days ago
2009
Springer
Abstract. A Concurrent Kleene Algebra offers two composition operators, one that stands for sequential execution and the other for concurrent n [10]. In this paper we investigate ...
CSFW
2010
IEEE
13 years 11 months ago
2010
IEEE
Nowadays it is widely accepted to formulate the security of a protocol carrying out a given task via the "trusted-party paradigm," where the protocol execution is compar...