Sciweavers

3909 search results - page 385 / 782
» Extreme Model Checking
Sort
View
COLING
1992
15 years 5 months ago
On the Satisfiability of Complex Constraints
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
Luís Damas, Giovanni B. Varile
JUCS
2006
109views more  JUCS 2006»
15 years 4 months ago
Verifying Real-Time Properties of tccp Programs
: The size and complexity of software systems are continuously increasing, which makes them difficult and labor-intensive to develop, test and evolve. Since concurrent systems are ...
María Alpuente, María-del-Mar Gallar...
CHI
2009
ACM
15 years 2 months ago
Interaction programming: next steps
Interaction programming bridges the gap between interaction design and programming, but it has not yet been related directly to mainstream development practice. This paper present...
Harold W. Thimbleby
CAV
2010
Springer
179views Hardware» more  CAV 2010»
15 years 8 months ago
Generating Litmus Tests for Contrasting Memory Consistency Models
Well-defined memory consistency models are necessary for writing correct parallel software. Developing and understanding formal specifications of hardware memory models is a chal...
Sela Mador-Haim, Rajeev Alur, Milo M. K. Martin
AMC
2005
191views more  AMC 2005»
15 years 4 months ago
Model identification of ARIMA family using genetic algorithms
ARIMA is a popular method to analyze stationary univariate time series data. There are usually three main stages to build an ARIMA model, including model identification, model est...
Chorng-Shyong Ong, Jih-Jeng Huang, Gwo-Hshiung Tze...