| Sesqui-pushout rewriting A Corradini, T Heindel, F Hermann, B König Graph Transformations: Third International Conference, ICGT 2006 Natal, Rio …, 2006 | 146 | 2006 |
| A static analysis technique for graph transformation systems P Baldan, A Corradini, B König CONCUR 2001—Concurrency Theory: 12th International Conference Aalborg …, 2001 | 117 | 2001 |
| Deriving bisimulation congruences in the DPO approach to graph rewriting H Ehrig, B König Foundations of Software Science and Computation Structures: 7th …, 2004 | 97 | 2004 |
| Counterexample-guided abstraction refinement for the analysis of graph transformation systems B König, V Kozioura TACAS 6, 197-211, 2006 | 92 | 2006 |
| Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts H Ehrig, B König Mathematical Structures in Computer Science 16 (6), 1133-1163, 2006 | 87 | 2006 |
| Approximating the behaviour of graph transformation systems P Baldan, B König Graph Transformation: First International Conference, ICGT 2002 Barcelona …, 2002 | 86 | 2002 |
| Verifying finite-state graph grammars: an unfolding-based approach P Baldan, A Corradini, B König CONCUR 2004-Concurrency Theory: 15th International Conference, London, UK …, 2004 | 83 | 2004 |
| Saturated semantics for reactive systems F Bonchi, B Konig, U Montanari 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 69-80, 2006 | 77 | 2006 |
| Augur 2—a new version of a tool for the analysis of graph transformation systems B König, V Kozioura Electronic Notes in Theoretical Computer Science 211, 201-210, 2008 | 76 | 2008 |
| A framework for the verification of infinite-state graph transformation systems P Baldan, A Corradini, B König Information and Computation 206 (7), 869-907, 2008 | 72 | 2008 |
| A coalgebraic perspective on minimization and determinization J Adámek, F Bonchi, M Hülsbusch, B König, S Milius, A Silva Foundations of Software Science and Computational Structures: 15th …, 2012 | 65 | 2012 |
| On deterministic finite automata and syntactic monoid size M Holzer, B König Theoretical Computer Science 327 (3), 319-347, 2004 | 65 | 2004 |
| Efficient unfolding of contextual Petri nets P Baldan, A Bruni, A Corradini, B König, C Rodríguez, S Schwoon Theoretical Computer Science 449, 2-22, 2012 | 55 | 2012 |
| On the decidability status of reachability and coverability in graph transformation systems N Bertrand, G Delzanno, B König, A Sangnier, J Stückrath 23rd International Conference on Rewriting Techniques and Applications (RTA'12), 2012 | 52 | 2012 |
| A logic for analyzing abstractions of graph transformation systems P Baldan, B König, B König Static Analysis: 10th International Symposium, SAS 2003 San Diego, CA, USA …, 2003 | 49 | 2003 |
| Applying the graph minor theorem to the verification of graph transformation systems S Joshi, B König Computer Aided Verification: 20th International Conference, CAV 2008 …, 2008 | 47 | 2008 |
| Behavior preservation in model refactoring using DPO transformations with borrowed contexts G Rangel, L Lambers, B König, H Ehrig, P Baldan Graph Transformations: 4th International Conference, ICGT 2008, Leicester …, 2008 | 47 | 2008 |
| McMillan’s complete prefix for contextual nets P Baldan, A Corradini, B König, S Schwoon Transactions on Petri Nets and Other Models of Concurrency I, 199-220, 2008 | 41 | 2008 |
| Generating test cases for code generators by unfolding graph transformation systems P Baldan, B König, I Stürmer Graph Transformations: Second International Conference, ICGT 2004, Rome …, 2004 | 40 | 2004 |
| Showing full semantics preservation in model transformation-a comparison of techniques M Hülsbusch, B König, A Rensink, M Semenyak, C Soltenborn, ... Integrated Formal Methods: 8th International Conference, IFM 2010, Nancy …, 2010 | 39 | 2010 |
Paolo BaldanProfessor of Computer Science, University of PadovaBestätigte E-Mail-Adresse bei math.unipd.it
