Karl Trygve Kalleberg - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged rewriting logic

The Second Rewrite Engines CompetitionFrancisco Durán, Manuel Roldán, Emilie Balland, Mark G. J. van den Brand, Steven Eker, Karl Trygve Kalleberg, Lennart C. L. Kats, Pierre-Etienne Moreau, Ruslan Shevchenko, Eelco Visser. ENTCS, 238(3):281-291, 2009. [doi]

Rewriting Logic Specification of Membrane Systems with Promoters and InhibitorsOana Agrigoroaiei, Gabriel Ciobanu. ENTCS, 238(3):5-22, 2009. [doi]

HeDGE: Hybrid Dataflow Graph Execution in the Issue LogicSuriya Subramanian, Kathryn S. McKinley. hipeac 2009: 308-323 [doi]

Fusing a Transformation Language with an Open CompilerKarl Trygve Kalleberg, Eelco Visser. ENTCS, 203(2):21-36, 2008. [doi]

The Temporal Logic of Rewriting: A Gentle IntroductionJosé Meseguer. birthday 2008: 354-382 [doi]

Graph Structure and Monadic Second-Order Logic: Language Theoretical AspectsBruno Courcelle. icalp 2008: 1-13 [doi]

The modular decomposition of countable graphs. Definition and construction in monadic second-order logicBruno Courcelle, Christian Delhommé. TCS, 394(1-2):1-38, 2008. [doi]

Narrowing and Rewriting Logic: from Foundations to ApplicationsSantiago Escobar, José Meseguer, Prasanna Thati. ENTCS, 177:5-33, 2007. [doi]

Understanding Promise Theory Using Rewriting LogicKyrre M. Begnum, Mark Burgess. aimsa 2007: 204-207 [doi]

Concept Graphs as Semantic Structures for Contextual Judgment LogicRudolf Wille. cla 2008: [doi]

Using existential graphs to integrate mental logic theory and mental model theoryBram Van Heuveln. jetai, 18(2):149-155, 2006. [doi]

On the Expressive Power of Graph LogicJerzy Marcinkowski. csl 2006: 486-500 [doi]

A Rewriting Logic SamplerJosé Meseguer. ictac 2005: 1-28 [doi]

The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order LogicBruno Courcelle, Christian Delhommé. csl 2005: 325-338 [doi]

Representing First-Order Logic Using GraphsArend Rensink. gg 2004: 319-335 [doi]

The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown AutomataArnaud Carayol, Stefan Wöhrle. fsttcs 2003: 112-123 [doi]

The Logic System of Concept Graphs with Negation And Its Relationship to Predicate LogicFrithjof Dau. Volume 2892 of Lecture Notes in Computer Science, Springer, 2003.

A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logicMisao Nagayama, Mitsuhiro Okada. TCS, 294(3):551-573, 2003.

ELAN from a rewriting logic point of viewPeter Borovanský, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau. TCS, 285(2):155-185, 2002. [doi]

Rewriting Logic and Elan: Prototyping Tools for Petri Nets with TimeL. J. Steggles. apn 2001: 363-381 [doi]

A Rewriting Logic Implementation of ErlangThomas Noll. ENTCS, 44(2):206-224, 2001. [doi]

Concept Graphs and Predicate LogicFrithjof Dau. iccS 2001: 72-86 [doi]

New Foundations for Rewriting LogicHendrik Hilberdink. ENTCS, 36:43-69, 2000. [doi]

Rewriting Logic and Maude: Concepts and ApplicationsJosé Meseguer. RTA 2000: 1-26

The Monadic Second-Order Logic of Graphs XI: Hierarchical Decompositions of Connected GraphsBruno Courcelle. TCS, 224(1-2):35-58, 1999. [doi]

Behavioral Network Graph: Unifying the Domains of High-Level and Logic SynthesisReinaldo A. Bergamaschi. dac 1999: 213-218 [doi]

From rewrite theories to temporal logic theoriesGrit Denker. ENTCS, 15:105-126, 1998. [doi]

Rewriting logic as a logic of special relationsW. Marco Schorlemmer. ENTCS, 15:196-217, 1998. [doi]

Mapping tile logic into rewriting logicJosé Meseguer, Ugo Montanari. WADT 1997: 62-91

Infinitary Logics and Very Sparse Random GraphsJames F. Lynch. JSYML, 62(2):609-623, 1997.

On the Expression of Graph Properties in some Fragments of Monadic Second-Order LogicBruno Courcelle. dimacs 1996: 33-62

Rewriting Logic as a Semantic Framework for Concurrency: a Progress ReportJosé Meseguer. concur 1996: 331-372

Bi-rewriting rewriting logicW. Marco Schorlemmer. ENTCS, 4:266-283, 1996. [doi]

A Graph-Theoretic Characterization Theorem for Multiplicative Fragment of Non-Commutative Linear LogicMisao Nagayama, Mitsuhiro Okada. ENTCS, 3:153, 1996. [doi]

Existential Graphs and Tense LogicPeter Øhrstrøm. iccS 1996: 202-217

Logic and graphsBruno Courcelle. ENTCS, 2:71-72, 1995. [doi]

On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (Abstract)Yuri Matiyasevich. RTA 1995: 1

A Formal Theory of Undirected Graphs in Higher-Order LogicChing-Tsun Chou. tphol 1994: 144-157

A Graph Reduction Technique with Sharing across Narrowings for Functional-Logic LanguagesJohn Maraist, Frank S. K. Silbermann. plilp 1994: 355-369

The Definition in Monadic Second-Order Logic of Modular Decompositions of Ordered GraphsBruno Courcelle. tagt 1996: 487-501

Infinitary Logics and Very Sparse Random GraphsJames F. Lynch. lics 1993: 191-198

Graph model of LAMBDA in Higher Order LogicKim Dam Petersen. tphol 1994: 16-28

Conditional Rewriting Logic as a United Model of ConcurrencyJosé Meseguer. TCS, 96(1):73-155, 1992.

A Graph Proof Procedure for Real Time LogicJung-Hong Kao, Lawrence J. Henschen. seke 1992: 300-306 [doi]

Conditional Rewriting Logic: Deduction, Models and ConcurrencyJosé Meseguer. ctrs 1991: 64-91

The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite GraphsBruno Courcelle. iandc, 85(1):12-75, March 1990.

The Definability of Equational Graphs in Monadic Second-Order LogicBruno Courcelle. icalp 1989: 207-221

Application of Graph Theory to Topology Generation for Logic GatesHubert Kaeslin. criwg 1989: 304-316

Signal Graphs: A Model for Designing Concurrent LogicAlex Kondratyev, Leonid Ya. Rosenblum, Alexandre Yakovlev. icpp 1988: 51-54

Rewritable Progammable Logic Array of Current Mode LogicMamoru Tanaka, Shinji Ozawa, Shinsaku Mori. TC, 30(3):229-234, 1981.

runs on WebDSL