Sciweavers

1001 search results - page 92 / 201
» Testing Formal Dialectic
Sort
View
IWOCA
2009
Springer
152views Algorithms» more  IWOCA 2009»
14 years 3 months ago
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
Robert Ganian, Petr Hlinený
HICSS
2008
IEEE
101views Biometrics» more  HICSS 2008»
14 years 3 months ago
The Value of Weak vs. Strong Ties between Individuals and Projects for New Product Review
This study extends the concept of weak and strong ties to the relationship between an individual and a project, in the context of a formal review process. Using data collected fro...
Lynne P. Cooper
SAS
2007
Springer
14 years 3 months ago
Shape Analysis with Structural Invariant Checkers
Abstract. Developer-supplied data structure specifications are important to shape analyses, as they tell the analysis what information should be tracked in order to obtain the des...
Bor-Yuh Evan Chang, Xavier Rival, George C. Necula
SAS
2005
Springer
162views Formal Methods» more  SAS 2005»
14 years 2 months ago
Boolean Heaps
We show that the idea of predicates on heap objects can be cast in the framework of predicate abstraction. This leads to an alternative view on the underlying concepts of three-val...
Andreas Podelski, Thomas Wies
UML
2004
Springer
14 years 2 months ago
System-on-Chip Verification Process Using UML
Abstract. In this paper, we propose a verification methodology for System-OnChip (SoC) design using Unified Modeling Language (UML). We introduce UML as a formal model to analyze a...
Qiang Zhu, Tsuneo Nakata, Masataka Mine, Kenichiro...