An Object-Oriented Framework for Explicit-State Model Checking Mark Kattenbelt1 and Theo C. Ruys2 and Arend Rensink2 Abstract. This paper presents a conceptual architecture for an object-oriented framework to support the

First Page		Document Content
Date: 2008-02-25 10:26:47 Theoretical computer science Formal methods Computing Mathematics Logic in computer science Graph rewriting Model checking Algorithm Formal verification Abstraction Generic programming Finite-state machine		An Object-Oriented Framework for Explicit-State Model Checking Mark Kattenbelt1 and Theo C. Ruys2 and Arend Rensink2 Abstract. This paper presents a conceptual architecture for an object-oriented framework to support the Add to Reading List Source URL: qav.comlab.ox.ac.uk Download Document from Source Website File Size: 160,23 KB Share Document on Facebook

	Termination of term graph rewriting Hans Zantema Technische Universiteit Eindhoven and Radboud Universiteit Nijmegen Joined work with Dennis Nolte and Barbara K¨ onig DocID: 1v3U0 - View Document
	In-place Graph Rewriting with Interaction Nets Ian Mackie Shinya Sato An algorithm is in-place, or runs in-situ, when it does not need any additional memory to execute DocID: 1tTd9 - View Document
	Efficient implementation of evaluation strategies via token-guided graph rewriting Koko Muroya Dan R. Ghica DocID: 1tG41 - View Document
	Categorical Semantics of Digital Circuits Dan R. Ghica, Achim Jung University of Birmingham, UK Abstract—This paper proposes a categorical theory of digital circuits based on monoidal categories and graph rewriting. Th DocID: 1sSGp - View Document
	Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus Niels Bjørn Bugge Grathwohl1 , Jeroen Ketema2 , Jens Duelund Pallesen1 , and Jakob Grue Simonsen1 1 DocID: 1sQvw - View Document