Sciweavers

1000 search results - page 93 / 200
» Nominal rewriting systems
Sort
View
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 10 months ago
Well-definedness of Streams by Transformation and Termination
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream spec...
Hans Zantema
JUCS
2002
81views more  JUCS 2002»
13 years 9 months ago
Membrane Computing: The Power of (Rule) Creation
: We consider a uniform way of treating objects and rules in P systems: we start with multisets of rules, which are consumed when they are applied, but the application of a rule ma...
Fernando Arroyo, Angel V. Baranda, Juan Castellano...
RTA
2010
Springer
13 years 8 months ago
Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and...
Friedrich Neurauter, Aart Middeldorp
DSN
2005
IEEE
14 years 3 months ago
Authenticated System Calls
System call monitoring is a technique for detecting and controlling compromised applications by checking at runtime that each system call conforms to a policy that specifies the ...
Mohan Rajagopalan, Matti A. Hiltunen, Trevor Jim, ...
CJ
2006
100views more  CJ 2006»
13 years 10 months ago
Fuzzifying P Systems
Abstract. Uncertainty is an inherent property of all living systems. Curiously enough, computational models inspired by biological systems do not take, in general, under considerat...
Apostolos Syropoulos