Sciweavers

1192 search results - page 90 / 239
» Symbolic Query Exploration
Sort
View
WIA
2004
Springer
15 years 7 months ago
A BDD-Like Implementation of an Automata Package
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
Jean-Michel Couvreur
ICFEM
2009
Springer
15 years 6 months ago
An Empirical Study of Structural Constraint Solving Techniques
Structural constraint solving allows finding object graphs that satisfy given constraints, thereby enabling software reliability tasks, such as systematic testing and error recove...
Junaid Haroon Siddiqui, Sarfraz Khurshid
CAV
2006
Springer
86views Hardware» more  CAV 2006»
15 years 5 months ago
The Power of Hybrid Acceleration
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
Bernard Boigelot, Frédéric Herbretea...
ICDE
2008
IEEE
167views Database» more  ICDE 2008»
16 years 3 months ago
Towards Declarative Queries on Adaptive Data Structures
In this work we look at combining emerging technologies in programming languages with traditional query processing techniques to provide support for efficient execution of declarat...
Nicolas Bruno, Pablo Castro
CHI
2002
ACM
16 years 2 months ago
Interactive querying of time series data
Title of Dissertation: INTERACTIVE GRAPHICAL QUERYING OF TIME SERIES AND LINEAR SEQUENCE DATA SETS Harry Hochheiser, Doctor of Philosophy, 2003 Dissertation directed by: Professor...
Harry Hochheiser