Sciweavers

1071 search results - page 121 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
ICFEM
2010
Springer
13 years 6 months ago
Loop Invariant Synthesis in a Combined Domain
Abstract. Automated verification of memory safety and functional correctness for heap-manipulating programs has been a challenging task, especially when dealing with complex data ...
Shengchao Qin, Guanhua He, Chenguang Luo, Wei-Ngan...
DKE
2011
251views Education» more  DKE 2011»
13 years 3 months ago
Generating operation specifications from UML class diagrams: A model transformation approach
One of the more tedious and complex tasks during the specification of conceptual schemas (CSs) is modeling the operations that define the system behavior. This paper aims to simpl...
Manoli Albert, Jordi Cabot, Cristina Gómez,...
COMPGEOM
2010
ACM
14 years 1 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
HICSS
2002
IEEE
87views Biometrics» more  HICSS 2002»
14 years 1 months ago
Using Enterprise Reference Models for Automated ISO 9000 Compliance Evaluation
A computational enterprise model representing key facets of an organization can be an effective tool. For example, a specific organization's quality management business proce...
Henry M. Kim, Mark S. Fox
BIBE
2006
IEEE
138views Bioinformatics» more  BIBE 2006»
14 years 2 months ago
Assigning Schema Labels Using Ontology And Hueristics
Bioinformatics data is growing at a phenomenal rate. Besides the exponential growth of individual databases, the number of data depositories is increasing too. Because of the comp...
Xuan Zhang, Ruoming Jin, Gagan Agrawal