Sciweavers

Share
TCS
2002
9 years 3 months ago
Martin's game: a lower bound for the number of sets
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
M. Ageev
TCS
2002
9 years 3 months ago
A formal approach to object-oriented software engineering
We show how formal specifications can be integrated into one of the current pragmatic object-oriented software development methods. Jacobson's "Object-Oriented Software ...
Martin Wirsing, Alexander Knapp
TCS
2002
9 years 3 months ago
A comparison of two approaches to pseudorandomness
The concept of pseudorandomness plays an important role in cryptography. In this note, we contrast the notions of complexity-theoretic pseudorandom strings (from algorithmic infor...
Yongge Wang
TCS
2002
9 years 3 months ago
Monadic second-order logic on tree-like structures
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
Igor Walukiewicz
TCS
2002
9 years 3 months ago
The continuum as a final coalgebra
oole.stanford.edu/pub/ABSTRACTS Pratt, V.R., "Transition and Cancellation in Concurrency and Branching Time", Math. Structures in Comp. Sci., 13:4, 485-529, August 2003. ...
Dusko Pavlovic, Vaughan R. Pratt
TCS
2002
9 years 3 months ago
A guide to membrane computing
Membrane systems are models of computation which are inspired by some basic features of biological membranes. In a membrane system multisets of objects are placed in the compartme...
Gheorghe Paun, Grzegorz Rozenberg
TCS
2002
9 years 3 months ago
Specification of real-time and hybrid systems in rewriting logic
This paper explores the application of rewriting logic to the executable formal modeling of real-time and hybrid systems. We give general techniques by which such systems can be s...
Peter Csaba Ölveczky, José Meseguer
books