Sciweavers

4666 search results - page 710 / 934
» Equations on Timed Languages
Sort
View
145
Voted
IANDC
2007
132views more  IANDC 2007»
15 years 4 months ago
An automata-theoretic approach to constraint LTL
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
Stéphane Demri, Deepak D'Souza
PUC
2006
99views more  PUC 2006»
15 years 4 months ago
The value of storyboards in the product design process
In the realm of product design, communication between designer, client, design team and future users is of great importance. Throughout the design process, ideas and concepts are g...
Corrie van der Lelie
LATA
2010
Springer
16 years 2 months ago
The Inclusion Problem for Regular Expressions
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
Dag Hovland
AML
2005
104views more  AML 2005»
15 years 4 months ago
Weak theories of linear algebra
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
Neil Thapen, Michael Soltys
150
Voted
ACTAC
2002
102views more  ACTAC 2002»
15 years 4 months ago
Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithm
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...
Csaba Faragó, Tamás Gergely