Travelled to:1 × Austria
1 × Brazil
1 × Denmark
1 × Portugal
2 × China
2 × Estonia
2 × Italy
2 × The Netherlands
2 × USA
2 × United Kingdom
3 × Germany
Collaborated with:U.Montanari P.Baldan F.Gadducci H.Ehrig F.Rossi B.König ∅ M.Löwe R.Heckel L.Ribeiro F.L.Dotti L.Foss F.Hermann M.Mehta Manish Mehta 0001 T.Heindel R.Bruni A.Lluch-Lafuente A.Vandin A.Bak T.Hanneforth F.Parisi-Presicce L.R.0001 D.Duval R.Echahed F.Prost A.Bruni S.Schwoon P.Sobocinski J.Padberg M.Korff A.Wagner
Talks about:graph (16) rewrit (8) grammar (7) approach (6) process (6) transform (5) structur (5) pushout (5) semant (5) algebra (4)
Person: Andrea Corradini
DBLP: Corradini:Andrea
Facilitated 2 volumes:
EdEdContributed to:
20152014
2013
2012
2012201020102008
20072007
200620082006200419991998
199819981997
199519941990
1990
19911993
20092001Wrote 32 papers:
- ICGT-2015-CorradiniDEPR #algebra #graph grammar #named
- AGREE — Algebraic Graph Rewriting with Controlled Embedding (AC, DD, RE, FP, LR), pp. 35–51.
- ICGT-2014-CorradiniH #canonical
- Canonical Derivations with Negative Application Conditions (AC, RH), pp. 207–221.
- GT-VMT-2013-Corradini #concurrent #semantics
- Invited Talk: On the Concurrent Semantics of Transformation Systems with Negative Application Conditions (AC).
- FASE-2012-BruniCGLV #adaptation #concept #framework
- A Conceptual Framework for Adaptation (RB, AC, FG, ALL, AV), pp. 240–254.
- WRLA-2012-BruniCGLV #adaptation #maude #modelling #self
- Modelling and Analyzing Adaptive Self-assembly Strategies with Maude (RB, AC, FG, ALL, AV), pp. 118–138.
- GT-VMT-2010-HermannCEK #analysis #equivalence #graph #performance #permutation #petri net
- Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets (FH, AC, HE, BK).
- ICGT-2010-BaldanBCKS #graph grammar #on the
- On the Computation of McMillan’s Prefix for Contextual Nets and Graph Grammars (PB, AB, AC, BK, SS), pp. 91–106.
- ICGT-2008-BaldanCEK #composition #nondeterminism #petri net #process
- Open Petri Nets: Non-deterministic Processes and Compositionality (PB, AC, HE, BK), pp. 257–273.
- HCI-AS-2007-CorradiniBH #2d #game studies #interface #natural language
- A Natural Language Interface for a 2D Networked Game (AC, AB, TH), pp. 225–234.
- HCI-MIE-2007-MehtaC #ontology #using
- Developing a Conversational Agent Using Ontologies (MM, AC), pp. 154–164.
- FoSSaCS-2006-BaldanCHKS #process #term rewriting
- Processes for Adhesive Rewriting Systems (PB, AC, TH, BK, PS), pp. 202–216.
- GT-VMT-2006-BaldanCDFGR08 #graph grammar #towards #transaction
- Towards a Notion of Transaction in Graph Rewriting (PB, AC, FLD, LF, FG, LR), pp. 39–50.
- ICGT-2006-BaldanCFG #graph #process #transaction
- Graph Transactions as Processes (PB, AC, LF, FG), pp. 199–214.
- ICGT-2006-CorradiniHHK #category theory
- Sesqui-Pushout Rewriting (AC, TH, FH, BK), pp. 30–45.
- ICGT-2004-CorradiniDFR #graph transformation #java
- Translating Java Code to Graph Transformation Systems (AC, FLD, LF, LR), pp. 383–398.
- FoSSaCS-1999-BaldranCM #graph grammar #semantics
- Unfolding and Event Structure Semantics for Graph Grammars (PB, AC, UM), pp. 73–89.
- FoSSaCS-1998-BaldanCM #semantics #symmetry
- An Event Structure Semantics for P/T Contextual Nets: Asymmetric Event Structures (PB, AC, UM), pp. 63–80.
- FoSSaCS-1998-CorradiniG #term rewriting
- Rational Term Rewriting (AC, FG), pp. 156–171.
- ICALP-1998-BaldanCM #graph #process
- Concatenable Graph Processes: Relating Processes and Derivation Traces (PB, AC, UM), pp. 283–295.
- TAGT-1998-BaldanCM #graph grammar
- Unfolding of Double-Pushout Graph Grammars is a Coreflection (PB, AC, UM), pp. 145–163.
- GG-Handbook-Vol1-CorradiniMREHL #algebra #approach #category theory #concept #graph transformation
- Algebraic Approaches to Graph Transformation — Part I: Basic Concepts and Double Pushout Approach (AC, UM, FR, HE, RH, ML), pp. 163–246.
- GG-Handbook-Vol1-EhrigHKLRWC #algebra #approach #category theory #comparison #graph transformation
- Algebraic Approaches to Graph Transformation — Part II: Single Pushout Approach and Comparison with Double Pushout Approach (HE, RH, MK, ML, LR, AW, AC), pp. 247–312.
- RTA-1995-CorradiniGM #modelling #term rewriting
- Relating Two Categorial Models of Term Rewriting (AC, FG, UM), pp. 225–240.
- TAGT-1994-CorradiniELMP #category theory #graph grammar
- The Category of Typed Graph Grammars and its Adjunctions with Categories (AC, HE, ML, UM, JP), pp. 56–74.
- TAGT-1994-CorradiniELMR #graph grammar #parallel #semantics
- An Event Structure Semantics for Graph Grammars with Parallel Productions (AC, HE, ML, UM, FR), pp. 240–256.
- TAGT-1994-CorradiniR #composition #graph grammar
- Synchronized Composition of Graph Grammar Productions (AC, FR), pp. 257–270.
- GG-1990-CorradiniMREL #graph grammar #logic programming
- Graph Grammars and Logic Programming (AC, UM, FR, HE, ML), pp. 221–237.
- NACLP-1990-CorradiniM #algebra #logic programming #semantics #source code
- An Algebraic Semantics of Logic Programs as Structured Transition Systems (AC, UM), pp. 788–812.
- CAAP-1991-CorradiniRP #graph grammar #logic programming
- Logic Programming as Hypergraph Rewriting (AC, FR, FPP), pp. 275–295.
- TAPSOFT-1993-Corradini #term rewriting
- Term Rewriting in CT-Sigma (AC), pp. 468–484.
- CIG-2009-MehtaC #approach #evaluation #independence #natural language #user interface
- Evaluation of a domain independent approach to natural language processing for game-like user interfaces (MM0, AC), pp. 225–232.
- GT-VMT-2001-CorradiniDR #graph transformation #mobile #specification #using
- A Graph Transformation View on the Specification of Applications using Mobile Code (AC, FLD, LR0), pp. 238–246.