Sciweavers

111 search results - page 12 / 23
» Testing Input Output Partial Order Automata
Sort
View
KBSE
1998
IEEE
13 years 12 months ago
Towards the Automated Debugging and Maintenance of Logic-based Requirements Models
In this paper we describe a tools environment which automates the validation and maintenance of a requirements model written in many-sorted first order logic. We focus on: a trans...
T. L. McCluskey, Margaret Mary West
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
14 years 4 days ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
EMSOFT
2008
Springer
13 years 9 months ago
Quantitative testing
We investigate the problem of specification based testing with dense sets of inputs and outputs, in particular with imprecision as they might occur due to errors in measurements, ...
Henrik C. Bohnenkamp, Mariëlle Stoelinga
SSDBM
2007
IEEE
105views Database» more  SSDBM 2007»
14 years 2 months ago
Window-Oblivious Join: A Data-Driven Memory Management Scheme for Stream Join
Memory management is a critical issue in stream processing involving stateful operators such as join. Traditionally, the memory requirement for a stream join is query-driven: a qu...
Ji Wu, Kian-Lee Tan, Yongluan Zhou
CAP
2010
13 years 2 months ago
Parallel computation of the minimal elements of a poset
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...