Resolution-Like Theorem Proving for High-Level Conditions-Reference-Cited by-同舟云学术

Resolution-Like Theorem Proving for High-Level Conditions

Published: Issue: Volume: Page:289-304
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Pennemann Karl-Heinz

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-87405-8_20.pdf

Reference20 articles.

1. Baumgartner, P., Fuchs, A., Tinelli, C.: Implementing the model evolution calculus. Int. Journal on Artificial Intelligence Tools 15(1), 21–52 (2006)

2. Courcelle, B.: Graph rewriting: An algebraic and logical approach. In: Handbook of Theoretical Computer Science, vol. B, pp. 193–242. Elsevier, Amsterdam (1990)

3. Dijkstra, E.W., Scholten, C.S.: Predicate Calculus and Program Semantics. Springer, Heidelberg (1989)

4. Ehrig, H., Ehrig, K., Habel, A., Pennemann, K.-H.: Theory of constraints and application conditions: From graphs to high-level structures. Fundamenta Informaticae 74, 135–166 (2006)

5. EATCS Monographs of Theoretical Computer Science;H. Ehrig,2006

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graph Solver as a Service;2023 IEEE/ACM 45th International Conference on Software Engineering: Companion Proceedings (ICSE-Companion);2023-05

2. System architecture synthesis for performability by logic solvers;Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems;2022-10-23

3. Automated generation of consistent models using qualitative abstractions and exploration strategies;Software and Systems Modeling;2021-09-17

4. Rewriting theory for the life sciences: A unifying theory of CTMC semantics;Theoretical Computer Science;2021-09

5. A navigational logic for reasoning about graph properties;Journal of Logical and Algebraic Methods in Programming;2021-01