scholarly journals BIM quality control based on requirement linked data

2021 ◽  
pp. 147807712110121
Author(s):  
Adam Tamas Kovacs ◽  
Andras Micsik

This article discusses a BIM Quality Control Ecosystem that is based on Requirement Linked Data in order to create a framework where automated BIM compliance checking methods can be widely used. The meaning of requirements is analyzed in a building project context as a basis for data flow analysis: what are the main types of requirements, how they are handled, and what sources they originate from. A literature review has been conducted to find the present development directions in quality checking, besides a market research on present, already widely used solutions. With the conclusions of these research and modern data management theory, the principles of a holistic approach have been defined for quality checking in the Architecture, Engineering and Construction (AEC) industry. A comparative analysis has been made on current BIM compliance checking solutions according to our review principles. Based on current practice and ongoing research, a state-of-the-art BIM quality control ecosystem is proposed that is open, enables automation, promotes interoperability, and leaves the data governing responsibility at the sources of the requirements. In order to facilitate the flow of requirement and quality data, we propose a model for requirements as Linked Data and provide example for quality checking using Shapes Constraint Language (SHACL). As a result, an opportunity is given for better quality and cheaper BIM design methods to be implemented in the industry.

2003 ◽  
Vol 11 (1) ◽  
pp. 3-37
Author(s):  
Yuan-Shin Hwang ◽  
Joel Saltz

This paper presents a flow-sensitive algorithm to compute interprocedural definition-use chains of dynamic pointer-linked data structures. The goal is to relate the statements that construct links of dynamic pointer-linked data structures (i.e. definitions) to the statements that might traverse the structures through the links (i.e. uses). Specifically, for each statementSthat defines links of pointer-linked data structures, the algorithm finds the set of statements that traverse the links which are defined by S. This algorithm solves the definition-use chaining problem by performing backward iterative data flow analysis to compute the set of upward exposed uses at each statement. The results of this algorithm can be used to identify parallelism in programs even with cyclic pointer-linked data structures.


2007 ◽  
Vol 190 (3) ◽  
pp. 59-77 ◽  
Author(s):  
Alessandra Di Pierro ◽  
Chris Hankin ◽  
Herbert Wiklicky

2009 ◽  
Vol 51 (10) ◽  
pp. 1440-1453 ◽  
Author(s):  
Andrew Stone ◽  
Michelle Strout ◽  
Shweta Behere

Author(s):  
Francky Catthoor ◽  
Sven Wuytack ◽  
Eddy De Greef ◽  
Florin Balasa ◽  
Lode Nachtergaele ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document