Jean-Marc Jézéquel - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged rewriting strategies

Minimization strategies for maximally parallel multiset rewriting systemsArtiom Alhazov, Sergey Verlan. TCS, 412(17):1581-1591, 2011. [doi]

More precise typing of rewrite strategiesAzamatbek Mametjanov, Victor L. Winter, Ralf Lämmel. LDTA 2011: 3 [doi]

Graph Partitioning Strategies for Efficient BFS in Shared-Nothing Parallel SystemsVictor Muntés-Mulero, Norbert Martínez-Bazan, Josep-Lluis Larriba-Pey, Esther Pacitti, Patrick Valduriez. waim 2010: 13-24 [doi]

Specifying Rewrite Strategies for Interactive ExercisesBastiaan Heeren, Johan Jeuring, Alex Gerdes. mics, 3(3):349-370, 2010. [doi]

Termination of rewriting under strategiesIsabelle Gnaedig, Hélène Kirchner. tocl, 10(2), 2009. [doi]

Admissible Strategies in Infinite Games over GraphsMarco Faella. mfcs 2009: 307-318 [doi]

Shifting Strategy for Geometric Graphs without GeometryImran A. Pirwani. isaac 2009: 362-371 [doi]

Using Rewrite Strategies for Testing BUpL AgentsLacramioara Astefanoaei, Frank S. de Boer, M. Birna van Riemsdijk. LOPSTR 2010: 143-157 [doi]

Finite-Element Non-conforming h-Adaptive Strategy Based on Autonomous Leaves GraphDiego Brandão, Sanderson L. Gonzaga de Oliveira, Mauricio Kischinhevsky. iccS 2009: 570-579 [doi]

Rewriting Strategies in JavaEmilie Balland, Pierre-Etienne Moreau, Antoine Reilles. ENTCS, 219:97-111, 2008. [doi]

On Term-Graph Rewrite StrategiesRachid Echahed. ENTCS, 204:99-110, 2008. [doi]

Structured strategies in games on graphsRamaswamy Ramanujam, Sunil Easaw Simon. BIRTHDAY 2008: 553-574

A Needed Rewriting Strategy for Data-Structures with PointersRachid Echahed, Nicolas Peltier. RTA 2008: 63-78 [doi]

Towards a Sharing Strategy for the Graph Rewriting CalculusPaolo Baldan, Clara Bertolissi, Horatiu Cirstea, Claude Kirchner. ENTCS, 204:111-127, 2008. [doi]

On model typingJim Steel, Jean-Marc Jézéquel. SoSyM, 6(4):401-413, 2007. [doi]

Dynamic Grouping Strategies Based on a Conceptual Graph for Cooperative LearningBinShyan Jong, YuLung Wu, TeYi Chan. tkde, 18(6):738-747, 2006. [doi]

Model Typing for Improving Reuse in Model-Driven EngineeringJim Steel, Jean-Marc Jézéquel. uml 2005: 84-96 [doi]

Tree automata for rewrite strategiesPierre Réty, Julie Vuotto. JSC, 40(1):749-794, 2005. [doi]

Reduction Strategies for Left-Linear Term Rewriting SystemsYoshihito Toyama. BIRTHDAY 2005: 198-223 [doi]

Heuristic Colour Assignment Strategies for Merge Models in Graph ColouringIstván Juhos, Attila Tóth, Jano I. van Hemert. evoW 2005: 132-143 [doi]

A Detailed Study of the Attachment Strategies of New Autonomous Systems in the AS Connectivity GraphIngrid Daubechies, Konstantinos Drakakis, Tanya Khovanova. im, 2(2):185-246, 2005.

Programmable Rewriting Strategies in Haskell: -- White Paper --Ralf Lämmel. ENTCS, 124(2):101-112, 2005. [doi]

A new strategy for multiprocessor scheduling of cyclic task graphsFrode Eika Sandnes, Oliver Sinnen. ijhpcn, 3(1):62-71, 2005. [doi]

A rewriting strategy for protocol verificationMonica Nesi, Giuseppina Rucci, Massimo Verdesca. ENTCS, 86(4):657-672, 2003. [doi]

Rewrite strategies in the rewriting calculusHoratiu Cirstea, Claude Kirchner, Luigi Liquori, Benjamin Wack. ENTCS, 86(4):593-624, 2003. [doi]

Applying Crossing Reduction Strategies to Layered Compound GraphsMichael Forster. gd 2002: 276-284 [doi]

Regular Sets of Descendants by Some Rewrite StrategiesPierre Réty, Julie Vuotto. RTA 2002: 129-143 [doi]

Symbolic Strategy Synthesis for Games on Pushdown GraphsThierry Cachat. icalp 2002: 704-715 [doi]

Termination of Rewriting with Local StrategiesOlivier Fissore, Isabelle Gnaedig, Hélène Kirchner. TCS, 58(2):155-188, 2001. [doi]

Rewriting with Strategies in ELAN: A Functional SemanticsPeter Borovanský, Claude Kirchner, Hélène Kirchner, Christophe Ringeissen. ijfcs, 12(1):69-95, 2001.

Specifying Authentication Protocols Using Rewriting and StrategiesHoratiu Cirstea. PADL 2001: 138-152 [doi]

Constrained Graph Drawing with Evolution StrategiesP. Simula, Ilkka Karanta, Mikko Hiirsalmi. icscCd 1999:

The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphsCees Duin, Stefan Voß. networks, 34(3):181-191, 1999. [doi]

Improving bipartite graphs using multi-strategy simulated annealingPanagiotis K. Linos, Michael Breen. ACMse 1999: [doi]

Term rewriting with operator evaluation strategiesSteven Eker. ENTCS, 15:311-330, 1998. [doi]

A Functional View of Rewriting and Strategies for a Semantics of ELANPeter Borovanský, Claude Kirchner, Hélène Kirchner. FLOPS 1998: 143-166

Controlling rewriting: study and implementation of a strategy formalismPeter Borovanský. ENTCS, 15:299-310, 1998. [doi]

Optimizing Cut-and-Paste on Directed Graphs, with a User-Controlled Edge Reconstruction StrategyBertrand Ibrahim. vl 1998: 90-91

Internal strategies in a rewriting implementation of tile systemsRoberto Bruni, José Meseguer, Ugo Montanari. ENTCS, 15:263-284, 1998. [doi]

Implementation of Term Rewritings with the Evaluation StrategyKazuhiro Ogata, Kokichi Futatsugi. plilp 1997: 225-239

Extremal paths in graphs - foundations, search strategies and related topicsUlrich Huckenbeck. Akademie Verlag, 1997.

The Majority Strategy on GraphsHenry Martyn Mulder. DAM, 80(1):97-105, 1997. [doi]

On a Simple Depth-First Search Strategy for Exploring Unknown GraphsStephen Kwek. wads 1997: 345-353

A Winning Strategy for the Ramsey Graph GameAleksandar Pekec. cpc, 5:267-276, 1996.

Narrowing Strategies for Arbitrary Canonical Rewrite SystemsAlexander Bockmayr, Stefan Krischer, Andreas Werner. FUIN, 24(1/2):125-155, 1995.

Strategies in Modular System Design by Interface RewritingSerafino Cicerone, Francesco Parisi-Presicce. ESOP 1994: 165-179

Development of Rewriting StrategiesAlexander A. Letichevsky. plilp 1993: 378-390

Strategies for Interconnection Networks: Some Methods from Graph TheoryJean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater. jpdc, 3(4):433-449, 1986.

Good Rewrite Strategies for FPJoseph Y. Halpern, John H. Williams, Edward L. Wimmers. lics 1986: 149-162

Selection Heuristics, Deletion Strategies and N-Level Terminator Configurations for the Connection Graph Proof ProcedureJörg H. Siekmann, Gert Smolka. ki 1981: 199-200

runs on WebDSL