Sciweavers

50 search results - page 1 / 10
» Undecidability Results for Finite Interactive Systems
Sort
View
130
Voted
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
15 years 7 months ago
Undecidability Results for Finite Interactive Systems
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
106
Voted
CADE
2005
Springer
16 years 1 months ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev
BIRTHDAY
2004
Springer
15 years 4 months ago
On Model Checking Data-Independent Systems with Arrays with Whole-Array Operations
Abstract. We consider programs which are data independent with respect to two type variables X and Y , and can in addition use arrays indexed by X and storing values from Y . We ar...
Ranko Lazic, Thomas Christopher Newcomb, A. W. Ros...
114
Voted
LICS
1999
IEEE
15 years 5 months ago
Type Inference for Recursive Definitions
We consider type systems that combine universal types, recursive types, and object types. We study type inference in these systems under a rank restriction, following Leivant'...
A. J. Kfoury, Santiago M. Pericás-Geertsen
107
Voted
GI
2010
Springer
14 years 11 months ago
Finite System Composition and Interaction
: In this article, it is proven for finite systems that if by reciprocal interaction, one finite system determines the action of another finite system, then both systems become sub...
Johannes Reich