Sciweavers

478 search results - page 45 / 96
» Structural Properties of Twin-Free Graphs
Sort
View
ICSM
2005
IEEE
14 years 3 months ago
A Category-theoretic Approach to Syntactic Software Merging
Software merging is a common and essential activity during the lifespan of large-scale software systems. Traditional textual merge techniques are inadequate for detecting syntacti...
Nan Niu, Steve M. Easterbrook, Mehrdad Sabetzadeh
JCISE
2002
117views more  JCISE 2002»
13 years 9 months ago
Memory Analysis of Solid Model Representations for Heterogeneous Objects
Methods to represent and exchange parts consisting of Functionally Graded Material (FGM) for Solid Freeform Fabrication (SFF) with Local Composition Control (LCC) are evaluated ba...
Todd R. Jackson, Wonjoon Cho, Nicholas M. Patrikal...
SAC
2002
ACM
13 years 9 months ago
A mobility and traffic generation framework for modeling and simulating ad hoc communication networks
We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad hoc networks. Three components of thi...
Christopher L. Barrett, Madhav V. Marathe, James P...
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 9 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
ATVA
2007
Springer
108views Hardware» more  ATVA 2007»
14 years 4 months ago
A New Approach to Bounded Model Checking for Branching Time Logics
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
Rotem Oshman, Orna Grumberg