Sciweavers

4167 search results - page 593 / 834
» Regression model checking
Sort
View
COMPULOG
1999
Springer
15 years 8 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh
VLDB
1998
ACM
111views Database» more  VLDB 1998»
15 years 8 months ago
Filtering with Approximate Predicates
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
Narayanan Shivakumar, Hector Garcia-Molina, Chandr...
CONCUR
1997
Springer
15 years 8 months ago
Modularity for Timed and Hybrid Systems
Abstract. In a trace-based world, the modular speci cation, veri cation, and control of live systems require each module to be receptive that is, each module must be able to meet i...
Rajeev Alur, Thomas A. Henzinger
CAV
1994
Springer
113views Hardware» more  CAV 1994»
15 years 8 months ago
A Determinizable Class of Timed Automata
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...
Rajeev Alur, Limor Fix, Thomas A. Henzinger
POPL
1990
ACM
15 years 8 months ago
Higher-Order Modules and the Phase Distinction
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
Robert Harper, John C. Mitchell, Eugenio Moggi