Christopher M. Poskitt - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged rewriting logic

Hoare Logic for Graph ProgramsChristopher M. Poskitt, Detlef Plump. In Proc. THEORY Workshop at Verified Software: Theories, Tools and Experiments (VS-THEORY 2010). 2010:

Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical ApplicationsBruno Courcelle. LATA 2009: 19-22 [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]

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]

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.

Relation Graphs: A Structure for Representing Relations in Contextual Logic of RelationsSilke Pollandt. iccS 2002: 34-47 [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]

The 0-1 law fails for monadic existential second-order logic on undirected graphsJean-Marie Le Bars. ipl, 77(1):43-48, 2001. [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

Existential Graphs and Dynamic Predicate LogicHarman van den Berg. iccS 1995: 338-352

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]

A Regular Characterization of Graph Languages Definable in Monadic Second-Order LogicJoost Engelfriet. TCS, 88(1):139-150, 1991.

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

The Monadic Second-Order Logic of Graphs: Definable Sets of Finite GraphsBruno Courcelle. criwg 1989: 30-53

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

runs on WebDSL