Travelled to:1 × Brazil
1 × Italy
1 × United Kingdom
Collaborated with:∅ A.Habel K.Azab A.Rensink H.Ehrig K.Ehrig
Talks about:level (5) high (5) condit (4) graph (3) satisfi (2) program (2) constraint (1) transform (1) precondit (1) algorithm (1)
Person: Karl-Heinz Pennemann
DBLP: Pennemann:Karl=Heinz
Contributed to:
2008
2008
200820062004Wrote 7 papers:
- GT-VMT-2008-AzabP #c++ #graph #source code #type checking
- Type Checking C++ Template Instantiation by Graph Programs (KA, KHP).
- ICGT-2008-Pennemann #proving #theorem proving
- Resolution-Like Theorem Proving for High-Level Conditions (KHP), pp. 289–304.
- ICGT-2008-Pennemann08a #development #graph transformation
- Development of Correct Graph Transformation Systems (KHP), pp. 508–510.
- GT-VC-2007-Pennemann08 #algorithm #approximate #problem #satisfiability
- An Algorithm for Approximating the Satisfiability Problem of High-level Conditions (KHP), pp. 75–94.
- ICGT-2006-HabelP #satisfiability
- Satisfiability of High-Level Conditions (AH, KHP), pp. 430–444.
- ICGT-2006-HabelPR #source code
- Weakest Preconditions for High-Level Programs (AH, KHP, AR), pp. 445–460.
- ICGT-2004-EhrigEHP #constraints #graph
- Constraints and Application Conditions: From Graphs to High-Level Structures (HE, KE, AH, KHP), pp. 287–303.