Sciweavers

379 search results - page 53 / 76
» Generalized Typestate Checking for Data Structure Consistenc...
Sort
View
COMPGEOM
2010
ACM
14 years 24 days ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
SIGSOFT
2008
ACM
14 years 8 months ago
Requirements engineering: from craft to discipline
Getting the right software requirements under the right environment assumptions is a critical precondition for developing the right software. This task is intrinsically difficult....
Axel van Lamsweerde
AAAI
2008
13 years 10 months ago
A Scalable Jointree Algorithm for Diagnosability
Diagnosability is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. An unobservable fault event in...
Anika Schumann, Jinbo Huang
LREC
2010
136views Education» more  LREC 2010»
13 years 9 months ago
Partial Parsing of Spontaneous Spoken French
This paper describes the process and the resources used to automatically annotate a French corpus of spontaneous speech transcriptions in super-chunks. Super-chunks are enhanced c...
Olivier Blanc, Matthieu Constant, Anne Dister, Pat...
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
14 years 1 days ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz