Graph-Based Verification of Static Program Constraints


Share/Save/Bookmark

Ciraci, Selim and Broek, Pim van den and Aksit, Mehmet (2010) Graph-Based Verification of Static Program Constraints. In: 25th Annual ACM Symposium on Applied Computing 2010, 22-26 March, 2010, Sierre, Switzerland (pp. pp. 2265-2273).

[img] PDF
Restricted to UT campus only
: Request a copy
2MB
Abstract:Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisfy the coding conventions used by their organization. Because in a complex software system there are too many coding conventions and program constraints to be satisfied, it becomes a cumbersome task to check them all manually. This paper presents a process and tools that allow computer-aided program constraint checking that work on the source code. We developed a modeling language called Source Code Modeling Language (SCML) in which program elements from the source code can be represented. In the process, the source code is converted into SCML models. The constraint detection is realized by graph transformation rules which are also modeled in SCML; the rules detect the violation and extract information from the SCML model of the source code to provide feedback on the location of the problem. The constraint violations can be queried from a querying mechanism that automatically searches the graph for the extracted information. The process has been applied to an industrial software system.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/70689
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page