Rete network slicing for model queries

DOI10.1007/978-3-319-40530-8_9zbMATH Open1344.68113OpenAlexW2486000175MaRDI QIDQ3187807FDOQ3187807

Authors: Zoltán Ujhelyi, Gábor Bergmann, Dániel Varró 

Publication date: 5 September 2016

Published in: Graph Transformation (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/81761/1/icgt2016_reteslicing_u.pdf

Recommendations

• Host-graph-sensitive RETE nets for incremental graph pattern matching
• A formal framework for incremental model slicing
• Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions
• On the relationship between model-based debugging and program slicing
• Dynamic slicing of Petri nets based on structural dependency graph and its application in system analysis

zbMATH Keywords

program slicinggraph patternsmodel queries

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Theory of software (68N99)

Cites Work

• Sequential abstract-state machines capture sequential algorithms
• Static and dynamic slicing of constraint logic programs
• The model transformation language of the VIATRA2 framework
• Title not available (Why is that?)
• Programming Languages and Systems

Cited In (1)

• Host-graph-sensitive RETE nets for incremental graph pattern matching

Uses Software

• VIATRA2
• Drools
• JBoss

This page was built for publication: Rete network slicing for model queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3187807)