Filters








24,885 Hits in 6.3 sec

Computing with relational machines

GÉRARD HUET, BENOÎT RAZET
2015 Mathematical Structures in Computer Science  
An Eilenberg machine generalizes a finite-state automaton, seen as its control component, with a computation component over a data domain specified as a relational algebra, its actions being interpreted  ...  Relational machines may be composed in a modular fashion, since atomic actions of one machine can be mapped to the characteristic relation of other relational machines acting as its parameters.  ...  Machines Relational machines We shall define a notion of abstract machine inspired from the work of Eilenberg (X-machines, presented in [8] ). Our machines are non-deterministic in nature.  ... 
doi:10.1017/s0960129515000390 fatcat:t4y4j673b5hnjn4ptcz7ajayie

Objects as Abstract Machines [chapter]

Simone Veglioni
1997 IFIP Advances in Information and Communication Technology  
Keywords abstract machine, behavioural equivalence, hidden algebra, OBJ, algebraic specification.  ...  Most of the attempts aiming at providing a foundation to the object paradigm are based on processes, sometimes with a high degree of success.  ...  ACKNOWLEDGEMENTS I would like to express my gratitude to my supervisor Grant Malcolm for his constant help, and to Rocco de Nicola for many helpful discussions.  ... 
doi:10.1007/978-0-387-35261-9_19 fatcat:u7v46ogarfcmdbexzqoi4llhhu

Machine-verified network controllers

Arjun Guha, Mark Reitblatt, Nate Foster
2013 SIGPLAN notices  
This paper describes the design and implementation of the first machine-verified SDN controller.  ...  We then use this model to develop a verified compiler and run-time system for a high-level network programming language.  ...  This work is supported in part by the NSF under grant CNS-1111698, the ONR under award N00014-12-1-0757, and by a Google Research Award.  ... 
doi:10.1145/2499370.2462178 fatcat:aqt3b5lmojbvxgq5rnj5cuutiq

Machine-verified network controllers

Arjun Guha, Mark Reitblatt, Nate Foster
2013 Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation - PLDI '13  
This paper describes the design and implementation of the first machine-verified SDN controller.  ...  We then use this model to develop a verified compiler and run-time system for a high-level network programming language.  ...  This work is supported in part by the NSF under grant CNS-1111698, the ONR under award N00014-12-1-0757, and by a Google Research Award.  ... 
doi:10.1145/2491956.2462178 dblp:conf/pldi/GuhaRF13 fatcat:unwawip3hjf5hjrowxocztvari

Cognitive Machine Learning

Zhongzhi Shi
2019 International Journal of Intelligence Science  
Cognitive machine learning refers to the combination of machine learning and brain cognitive mechanism, specifically, combining machine learning with mind model CAM.  ...  In order to solve the problem that machines have the ability of abstract reasoning and computers can learn evolution, cognitive machine learning is presented in this paper.  ...  Intermorphic level combination construction only occurs locally and gradually and finally does not construct a closed general system. The last stage is extramorphic level.  ... 
doi:10.4236/ijis.2019.94007 fatcat:xxojkvb22jdyblb5wmllhopn5m

Machines in a category

Michael A. Arbib, Ernest G. Manes
1980 Journal of Pure and Applied Algebra  
as an X-indexed family 6, : Q-Q of unary operations, and that much of sequential machine theory could be generalized from the string-processing of sequential machines to tree-processing wherein the unary  ...  One response to the problem of unifying sequential machines and linear systems was the study of machines in a closed category [16, 21, 301 , with the dynamics Q x XO -Q of a sequential machine generalizing  ...  A bisequence of x'-morphisms ofform Hk .Llachines in a caleyor?  ... 
doi:10.1016/0022-4049(80)90090-0 fatcat:eylerllivff7holujcxxug6j74

Fuzzy Chemical Abstract Machines [article]

Apostolos Syropoulos
2009 arXiv   pre-print
Solutions of fuzzy molecules and fuzzy reaction rules are used to define the general notion of a fuzzy chemical abstract machine, which is a realization of the fuzzy chemical metaphor.  ...  Based on the idea that these machines can be used to describe the operational semantics of process calculi and algebras that include fuzziness as a fundamental property, I present a toy calculus that is  ...  Acknowledgements I would like to thank Athanassios Doupas for his help during the early stages of this work.  ... 
arXiv:0903.3513v1 fatcat:lst3ww5jkjekxndckbxbvj4m6e

McScM: A General Framework for the Verification of Communicating Machines [chapter]

Alexander Heußner, Tristan Le Gall, Grégoire Sutre
2012 Lecture Notes in Computer Science  
Seen as a general framework for the class of transition systems with finite control/infinite data, McScM delivers the basic infrastructure for implementing verification algorithms, and privileges to conveniently  ...  implement new ideas on a high level of abstraction.  ...  In general, verify is able to give a solution for each example in a reasonable amount of time and memory.  ... 
doi:10.1007/978-3-642-28756-5_34 fatcat:n5mqloosaffj5dqnzse6htx7um

Machine Function Based Control Code Algebras [chapter]

Jan A. Bergstra
2004 Lecture Notes in Computer Science  
Machine functions describe the operation of a machine at a very abstract level.  ...  In this paper we develop some control code algebras from first principles.  ...  As the main focus of the use of machine functions is in analyzing semantic generalities of control codes at a very abstract level these algebras will be referred to as control code algebras (CCA's). 3  ... 
doi:10.1007/978-3-540-30101-1_2 fatcat:zdrmgdm4rrfnjay2ondpkvxnsq

Turing Automata and Graph Machines

Miklós Bartha
2010 Electronic Proceedings in Theoretical Computer Science  
Turing automata and Turing graph machines are defined by generalizing the classical Turing machine concept, so that the collection of such machines becomes an indexed monoidal algebra.  ...  Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras.  ...  Our aim is to provide a left adjoint for the functor A . In algebraic terms this amounts to constructing the indexed monoidal algebra freely generated by a given S-ranked alphabet Σ.  ... 
doi:10.4204/eptcs.26.3 fatcat:vpory26l4bdzbdueqzbrqtj7f4

Turing Machines with Atoms

Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk
2013 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science  
Our main construction is closely related to the Cai-Fürer-Immerman graphs used in descriptive complexity theory.  ...  We study Turing machines over sets with atoms, also known as nominal sets.  ...  Our inspiration for the language L came from yet another source: it is a generalization of a construction from Model Theory ( [13] , example on p. 819). B.  ... 
doi:10.1109/lics.2013.24 dblp:conf/lics/BojanczykKLT13 fatcat:bntizruis5bezdfgmwuemw7jje

Abstract State Machines 1988-1998: Commented ASM Bibliography [article]

Egon Boerger, James K. Huggins
1998 arXiv   pre-print
An annotated bibliography of papers which deal with or use Abstract State Machines (ASMs), as of January 1998.  ...  A hierarchy of ASMs provides a solid foundation for constructing provably correct compilers from Prolog to WAM.  ...  An Evolving Algebra Abstract Machine. In H.  ... 
arXiv:cs/9811014v1 fatcat:w3vj5i7mzbccbcibroi7dkmhtq

Addressing Machines as models of lambda-calculus [article]

Giuseppe Della Penna and Benedetto Intrigila and Giulio Manzonetto
2021 arXiv   pre-print
We study a class of abstract machines that we call addressing machine since they are only able to manipulate memory addresses of other machines.  ...  The set of addresses of these machines can be easily turned into a combinatory algebra.  ...  We would like to thank Henk Barendregt for interesting discussions concerning the problem of finding a model of λ-calculus based on recursive functions, as well as the role of the (ω)-rule.  ... 
arXiv:2107.00319v2 fatcat:hg442nak6rhhfgg6mbq3cckyu4

Towards a Uniform Theory of Effectful State Machines [article]

Sergey Goncharov and Stefan Milius and Alexandra Silva
2019 arXiv   pre-print
We show that the generic language semantics for T-automata correctly instantiates the usual language semantics for a number of known classes of machines/languages, including regular, context-free, recursively-enumerable  ...  Using recent developments on coalgebraic and monad-based semantics, we present a uniform study of various notions of machines, e.g. finite state machines, multi-stack machines, Turing machines, valence  ...  We thank the anonymous reviewers for their very careful reading of our manuscript and for their suggestions to improve the presentation.  ... 
arXiv:1401.5277v5 fatcat:lpiddyg7knd6plo53rc2ojlvzi

Machine Reasoning Explainability [article]

Kristijonas Cyras, Ramamurthy Badrinath, Swarup Kumar Mohalik, Anusha Mujumdar, Alexandros Nikou, Alessandro Previti, Vaishnavi Sundararajan, Aneta Vulgarakis Feljan
2020 arXiv   pre-print
As a field of AI, Machine Reasoning (MR) uses largely symbolic means to formalize and emulate abstract reasoning.  ...  We hereby aim to provide a selective overview of MR explainability techniques and studies in hopes that insights from this long track of research will complement well the current XAI landscape.  ...  Introduction Machine Reasoning (MR) is a field of AI that complements the field of Machine Learning (ML) by aiming to computationally mimic abstract thinking.  ... 
arXiv:2009.00418v2 fatcat:wvx77eo73jeb7eplcpz42lw3zq
« Previous Showing results 1 — 15 out of 24,885 results