Sciweavers

230 search results - page 10 / 46
» A formal analysis of requirements-based testing
Sort
View
COLING
2010
13 years 2 months ago
Near-synonym Lexical Choice in Latent Semantic Space
We explore the near-synonym lexical choice problem using a novel representation of near-synonyms and their contexts in the latent semantic space. In contrast to traditional latent...
Tong Wang, Graeme Hirst
ACRI
2004
Springer
14 years 27 days ago
SAT-Based Analysis of Cellular Automata
Abstract. Cellular Automata are a powerful formal model for describing physical and computational processes. Qualitative analysis of Cellular Automata is in general a hard problem....
Massimo D'Antonio, Giorgio Delzanno
SIES
2007
IEEE
14 years 1 months ago
Distinguishing Environment and System in Coloured Petri Net Models of Reactive Systems
— This paper introduces and formally defines the environment-and-system-partitioned property for behavioral models of reactive systems expressed in the formal modeling language ...
Simon Tjell
PVLDB
2010
116views more  PVLDB 2010»
13 years 2 months ago
Computing Closed Skycubes
In this paper, we tackle the problem of efficient skycube computation. We introduce a novel approach significantly reducing domination tests for a given subspace and the number of...
Chedy Raïssi, Jian Pei, Thomas Kister
CACM
2010
105views more  CACM 2010»
13 years 7 months ago
Automatic program repair with evolutionary computation
Therearemanymethodsfordetectingandmitigatingsoftware errors but few generic methods for automatically repairing errors once they are discovered. This paper highlights recent work ...
Westley Weimer, Stephanie Forrest, Claire Le Goues...