Sciweavers

315 search results - page 33 / 63
» Reactive Turing Machines
Sort
View
POPL
2008
ACM
14 years 8 months ago
A logical account of pspace
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
TACAS
1998
Springer
105views Algorithms» more  TACAS 1998»
14 years 21 days ago
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems. This paper introduces a technique that uses compositionality and depend...
Jørn Lind-Nielsen, Henrik Reif Andersen, Ge...
UC
2009
Springer
14 years 3 months ago
Abstract Geometrical Computation and Computable Analysis
Geometrical Computation and Computable Analysis J´erˆome Durand-Lose⋆ Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P. 6759, F-45067 OR...
Jérôme Durand-Lose
AML
2008
124views more  AML 2008»
13 years 8 months ago
The elementary computable functions over the real numbers: applying two new techniques
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
Manuel Lameiras Campagnolo, Kerry Ojakian
ENTCS
2007
153views more  ENTCS 2007»
13 years 8 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian