Sciweavers

313 search results - page 30 / 63
» Properties of Euler Diagrams
Sort
View
ICSE
2004
IEEE-ACM
14 years 7 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
NGITS
1999
Springer
13 years 11 months ago
From Object-Process Diagrams to a Natural Object-Process Language
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...
Mor Peleg, Dov Dori
CSMR
2011
IEEE
12 years 11 months ago
Sub-graph Mining: Identifying Micro-architectures in Evolving Object-Oriented Software
Abstract—Developers introduce novel and undocumented micro-architectures when performing evolution tasks on object-oriented applications. We are interested in understanding wheth...
Ahmed Belderrar, Segla Kpodjedo, Yann-Gaël Gu...
TCAD
1998
161views more  TCAD 1998»
13 years 7 months ago
Ordered Kronecker functional decision diagrams-a data structure for representation and manipulation of Boolean functions
— Ordered Kronecker functional decision diagrams (OKFDD’s) are a data structure for efficient representation and manipulation of Boolean functions. OKFDD’s are a generalizat...
Rolf Drechsler, Bernd Becker
AAAI
2006
13 years 9 months ago
Controlled Search over Compact State Representations, in Nondeterministic Planning Domains and Beyond
Two of the most efficient planners for planning in nondeterministic domains are MBP and ND-SHOP2. MBP achieves its efficiency by using Binary Decision Diagrams (BDDs) to represent...
Ugur Kuter, Dana S. Nau