Weakest preconditions for high-level programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4178 LNCS, Issue , 2006, Pages 445-460

  Habel, Annegret ^a   Pennemann, Karl Heinz ^a   Rensink, Arend ^b  

^a UNIVERSITY OF OLDENBURG   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL MODELS;

HIGH LEVEL PROGRAMS; WEAKEST PRECONDITIONS;

HIGH LEVEL LANGUAGES;

EID: 33750254180     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841883_31     Document Type: Conference Paper

References (33)

1. P. Baldan, A. Corradini, and B. König. Verifying finite-state graph grammars. In Concurrency Theory, volume 3170 of LNCS, pages 83-98. Springer, 2004.
2. P. Baldan and B. König. Approximating the behaviour of graph transformation systems. In Graph Transformations (ICGT'02), volume 2505 of LNCS, pages 14-29. Springer, 2002.
3. P. Baldan, B. König, and B. König. A logic for analyzing abstractions of graph transformation systems. In Static Analysis Symposium (SAS), volume 2694 of LNCS, pages 255-272. Springer, 2003.
4. P. Baldan, B. König, and A. Rensink. Graph grammar verification through abstraction. In B. König, U. Montanari, and P. Gardner, editors, Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, number 04241 in Dagstuhl Seminar Proceedings, 2005.
5. E. M. Clarke, A. Biere, R. Raimi, and Y. Zhu. Bounded model checking using satisfiability solving. Formal Methods in System Design, 19(1):7-34, 2001.
6. A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel, and M. Löwe. Algebraic approaches to graph transformation. In Handbook of Graph Grammars and Computing by Graph Trans., volume 1, pages 163-245. World Scientific, 1997.
7. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
8. E. W. Dijkstra and C. S. Scholten. Predicate Calculus and Program Semantics. Springer, 1989.
9. O. M. dos Santos, F. L. Dotti, and L. Ribeiro. Verifying object-based graph grammars. ENTCS, 109:125-136, 2004.
10. F. L. Dotti, L. Foss, L. Ribeiro, and O. M. dos Santos. Verification of distributed object-based systems. In Formal Methods for Open Object-Based Distributed Systems (FMOODS), volume 2884 of LNCS, pages 261-275. Springer, 2003.
11. H. Ehrig. Introduction to the algebraic theory of graph grammars. In Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of LNCS, pages 1-69. Springer, 1979.
12. H. Ehrig, K. Ehrig, J. De Lara, G. Taentzer, D. Varró, and S. Varró-Gyapay. Termination criteria for model transformation. In Proc. Fundamental Approaches to Software Engineering, volume 2984 of LNCS, pages 214-228. Springer, 2005.
13. H. Ehrig, K. Ehrig, A. Habel, and K.-H. Pennemann. Theory of constraints and application conditions: From graphs to high-level structures. Fundamenta Informaticae, 72, 2006.
14. H. Ehrig, K. Ehrig, U. Prange, and G. Taentzer. Fundamentals of Algebraic Graph Transformation. EATCS Monographs of Theoretical Computer Science. Springer-Verlag, Berlin, 2006.
15. H. Ehrig, A. Habel, J. Padberg, and U. Prange. Adhesive high-level replacement systems: A new categorical framework for graph transformation. Fundamenta Informaticae, 72, 2006.
16. A. Habel and K.-H. Pennemann. Nested constraints and application conditions for high-level structures. In Formal Methods in Software and System Modeling, volume 3393 of LNCS, pages 293-308. Springer, 2005.
17. A. Habel and K.-H. Pennemann. Satisfiability of high-level conditions. In Graph Transformations (ICGT'06), this volume of LNCS. Springer, 2006.
18. A. Habel, K.-H. Pennemann, and A. Rensink. Weakest preconditions for high-level programs: Long version. Technical Report 8/06, University of Oldenburg, 2006.
19. A. Habel and D. Plump. Computational completeness of programming languages based on graph transformation. In Proc. Foundations of Software Science and Computation Structures, volume 2030 of LNCS, pages 230-245. Springer, 2001.
20. J. Y. Halpern and M. Y. Vardi. Model checking vs. theorem proving: A manifesto. In J. Allen, R. Fikes, and E. Sandewall, editors. Proc. International Conference on Principles of Knowledge Representation and Reasoning, pages 325-334. Morgan Kaufmann Publishers, 1991.
21. R. Heckel and A. Wagner. Ensuring consistency of conditional graph grammars. In SEGRAGRA'95, volume 2 of ENTCS, pages 95-104, 1995.
22. M. Koch, L. V. Mancini, and F. Parisi-Presicce. Graph-based specification of access control policies. Journal of Computer and System Sciences (JCSS), 71:1-33, 2005.
23. B. König and V. Kozioura. Counterexample-guided abstraction refinement for the analysis of graph transformation systems. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 3920 of LNCS, pages 197-211. Springer, 2006.
24. K. L. McMillan. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In Fourth Workshop on Computer-Aided Verification (CAV), volume 663 of LNCS, pages 164-174. Springer, 1992.
25. S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In 11th International Conference on Automated Deduction (CADE), volume 607 of LNCS, pages 748-752. Springer, 1992.
26. D. Plump. Termination of graph rewriting is undecidable. Fundamenta Informaticae, 33(2):201-209, 1998.
27. D. Plump and S. Steinert. Towards graph programs for graph algorithms. In Graph Transformations (ICGT'04), volume 3256 of LNCS, pages 128-143. Springer, 2004.
28. A. Rensink. Towards model checking graph grammars. In M. Leuschel, S. Gruner, and S. L. Presti, editors, Workshop on Automated Verification of Critical Systems (AVoCS), Technical Report DSSE-TR-2003-2, pages 150-160. University of South-hampton, 2003.
29. A. Rensink. The GROOVE simulator: A tool for state space generation. In Applications of Graph Transformations with Industrial Relevance (AGTIVE), volume 3062 of LNCS, page 485. Springer, 2004.
30. A. Rensink. Representing first-order logic by graphs. In Graph Transformations (ICGT'04), volume 3256 of LNCS, pages 319-335. Springer, 2004.
31. A. Rensink, A. Schmidt, and D., Varró. Model checking graph transformations: A comparison of two approaches. In Graph Transformations (ICGT'04), volume 3256 of LNCS, pages 226-241. Springer, 2004.
32. D. Varró. Towards symbolic analysis of visual modeling languages. ENTCS, 72(3), 2003.
33. D. Varró. Automated formal verification of visual modeling languages by model checking. Journal of Software and Systems Modelling, 3(2):85-113, 2004.