Sciweavers

1209 search results - page 134 / 242
» Universal Algebra and Computer Science
Sort
View
ICALP
2005
Springer
15 years 8 months ago
Combining Intruder Theories
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...
Yannick Chevalier, Michaël Rusinowitch
122
Voted
MFCS
2005
Springer
15 years 8 months ago
Regular Sets of Higher-Order Pushdown Stacks
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
Arnaud Carayol
MFCS
2005
Springer
15 years 8 months ago
Tight Approximability Results for the Maximum Solution Equation Problem over Zp
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...
Fredrik Kuivinen
IWFM
1998
125views Formal Methods» more  IWFM 1998»
15 years 4 months ago
Mathematics for Formal Methods, a Proposal for Education Reform
It is widely recognized that there is a body of mathematics which is crucial to the underpinning of computer science, software engineering, and information and communications tech...
Mícheál Mac an Airchinnigh
WMTE
2005
IEEE
15 years 9 months ago
Supporting Classroom Activities with the BSUL Environment
In this paper we present our ongoing research about the integration of ubiquitous computing systems into classroom settings, in order to give basic support for some classroom and ...
Nobuji A. Saito, Hiroaki Ogata, Rosa G. J. Paredes...