1175 search results - page 86 / 235 » Abstract computability and algebraic specification |
AAAI
1990
13 years 9 months ago
1990
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
CALCO
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
SAS
1991
Springer
13 years 11 months ago
1991
Springer
d Abstract) Marcelo Fiore1 Chung-Kil Hur2,3 Computer Laboratory University of Cambridge Cambridge, UK We introduce an abstract general notion of system of equations between terms,...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...