Filters








58,637 Hits in 7.3 sec

Datalog Automata Extended Abstract [chapter]

Bernard LANG
1988 Proceedings of the Third International Conference on Data and Knowledge Bases  
By extending to these automata a dynamic programming technique developed for PDAs in context-free parsing, we obtain a general and simple technique for constructing efficient polynomial query evaluators  ...  We propose a new computational paradigm for the evaluation of recursive Datalog queries, which is based on a pushdown automaton (PDA) model.  ...  extending the dynamic programming parsing techniques presented in [16] .  ... 
doi:10.1016/b978-1-4832-1313-2.50036-6 dblp:conf/jcdkb/Lang88 fatcat:cglmszdjbzdbxgxdvbui2pfjli

RASP ABSTRACT MACHINE EMULATOR – EXTENDING THE EMUSTUDIO PLATFORM

Michal ŠIPOŠ, Slavomír ŠIMOŇÁK
2017 Acta Electrotechnica et Informatica  
This paper presents the RASP (Random Access Stored Program) abstract machine emulator implemented as a plugin for emuStudio -extendable platform for computer architectures emulation.  ...  It consists of three submodules -the CPU emulator (the core of the plugin), main memory for storing RASP machine's program and data and compiler of RASP assembly language.  ...  Again, there is an automated generation tool for this part recommended by the author of emuStudio -Java Cup 9 . It requires a syntax definition file.  ... 
doi:10.15546/aeei-2017-0024 fatcat:bhxrdriphjerbccyrgy7ga6to4

A Safety and Liveness Theory for Total Reversibility (Extended Abstract) [article]

Claudio Antares Mezzina, Vasileios Koutavas
2016 arXiv   pre-print
We develop fully abstract models for these preorders in a reversible calculus, which are based only on forward transitions, thus providing a simple proof technique for refinement of such systems.  ...  Similar to previous work on communicating transactions, liveness and safety respectively correspond to the should-testing and inverse may-testing preorders.  ...  (A B) (when a B) νa.νb.A = νb.νa.A (3) The Language CCS roll The language CCS roll extends CCS with a form of controlled reversibility, where reductions are totally ordered and systems can be programmed  ... 
arXiv:1604.05555v2 fatcat:curlubumjfgj7h4za33fq5wweu

Code generation for expressions with common subexpressions (Extended Abstract)

A. V. Aho, S. C. Johnson, J. D. Ullman
1976 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76  
Acknowledgements The authors wish to thank Brenda Baker, Brian Kernighan, Doug Mcllroy, and Elliot Pinson for their helpful comments on the manuscript.  ...  Some of the difficulty of generating good code may arise from the lack of realistic models for programming language and machine semantics.  ...  Definition: The optimal code generation problem (OCG) is to produce from a dag a shortest machine program that evaluates and stores all roots of the dag.  ... 
doi:10.1145/800168.811537 dblp:conf/popl/AhoJU76 fatcat:aw5mjhx5s5ecbjhuduynt4bygi

A Type System for Bounded Space and Functional In-Place Update—Extended Abstract [chapter]

Martin Hofmann
2000 Lecture Notes in Computer Science  
], the present method provides guaranteed bounds on heap space which will be of use for applications such as languages for embedded systems or 'proof carrying code' [18] .  ...  The crucial innovation over previous linear typing schemes consists of the introduction of a resource type 3 which controls the number of constructor symbols such as cons in recursive definitions and ensures  ...  The formal definition of [[−]] η,ρ is by induction on terms.  ... 
doi:10.1007/3-540-46425-5_11 fatcat:vdd7jew6yfe7xhsa62tmuvgm6i

Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract)

Jiří Čermák, Viliam Lisý, Branislav Bošanský
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
We present two algorithms that follow these steps -- FPIRA, based on fictitious play, and CFR+IRA, based on counterfactual regret minimization.  ...  Information abstraction is one of the methods for tackling large extensive-form games (EFGs).  ...  One way to visualize this definition is via run-trees 1 , see [Vardi, 1996] .  ... 
doi:10.24963/ijcai.2020/690 dblp:conf/ijcai/GiacomoSFR20 fatcat:vko54j63brecth72cjkhpoo3xu

A typed language for distributed mobile processes (extended abstract)

James Riely, Matthew Hennessy
1998 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98  
In the final section we define a semantic theory based on barbed bisimulations and discuss its characterization in terms of a bisimulation relation over a relativized labelled transition system.  ...  The language is a distributed extension of the π-calculus which incorporates the notions of remote execution, migration, and site failure. Novel features of Dπ include 1.  ...  Besides the fact that we treat a distributed language, with an extended collection of types, we have made two main contributions, building on [16] .  ... 
doi:10.1145/268946.268978 dblp:conf/popl/RielyH98 fatcat:tnlwbrvgrzdync2fm6etl775oy

Non-commutative computation, depth reduction, and skew circuits (extended abstract) [chapter]

Meena Mahajan, V Vinay
1994 Lecture Notes in Computer Science  
I am sincerely thankful to her for spending time for discussions with me, constantly motivating me and developing an enthusiasm in me to work and for being patient with me.  ...  Definition 1.8 (Computation Tree and Accepting Computation Tree) A tree is a computation tree of ATM M on string w if its nodes are labeled with the configurations of M on w, such that the descendants  ...  Definition 1.21 (Proof-Tree and Proof-Tree Size) Given a multiplex circuit C, a proof tree on input x is a pruning of the unraveled circuit which eliminates all the gates except the root of T and for each  ... 
doi:10.1007/3-540-58715-2_113 fatcat:xyoamfty75aozjmlbwewnx7dgi

Automatic Simplification of Obfuscated JavaScript Code (Extended Abstract) [chapter]

Gen Lu, Kevin Coogan, Saumya Debray
2012 Communications in Computer and Information Science  
This paper describes a simple approach to deobfuscation of JavaScript code based on dynamic analysis and slicing.  ...  Javascript is a scripting language that is commonly used to create sophisticated interactive client-side web applications. It can also be used to carry out browser-based attacks on users.  ...  Since the CFG has already been processed using loop analysis and function indentification, we need to construct an abstract syntax tree for each function.  ... 
doi:10.1007/978-3-642-29166-1_31 fatcat:fimzy6ojxjgnlkympd7oy652ue

Matching with multiplication and exponentiation (extended abstract)

BERNARD LANG
2005 Mathematical Structures in Computer Science  
The algorithm is proved consistent, complete and minimal using techniques based on initial algebras.  ...  We develop a matching algorithm for an equational theory with multiplication, exponentiation and a unit element.  ...  Acknowledgements -I wish to thank Mikael Rittri for making this work better known, and Roberto Di Cosmo for this opportunity to have it published.  ... 
doi:10.1017/s0960129505004883 fatcat:ud5kinnk75bzvlbceyipxi3yru

Linear Dependent Type Theory for Quantum Programming Languages

Peng Fu, Kohei Kishida, Peter Selinger
2020 Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science  
Modern quantum programming languages integrate quantum resources and classical control. They must, on the one hand, be linearly typed to reflect the no-cloning property of quantum resources.  ...  On the other hand, high-level and practical languages should also support quantum circuits as first-class citizens, as well as families of circuits that are indexed by some classical parameters.  ...  Ross for helpful discussions of a draft of this paper, and Marco Gaboardi and Aaron Stump for pointing out related works.  ... 
doi:10.1145/3373718.3394765 dblp:conf/lics/FuKS20 fatcat:i6vlwo66ynashkgvkvrk5daamm

Optimal representations of polymorphic types with subtyping (Extended abstract) [chapter]

Alexander Aiken, Edward L. Wimmers, Jens Palsberg
1997 Lecture Notes in Computer Science  
Eliminating variables both improves the readability of types and the performance of algorithms whose complexity depends on the number of type variables.  ...  We present an algorithm for simplifying quanti ed types in the presence of subtyping and prove it is sound and complete for non-recursive and recursive types. 4 The source code for the Illyria system and  ...  For lack of space, this extended abstract omits additional extensions to sound but incomplete algorithms to systems with union and intersection types and constrained types.  ... 
doi:10.1007/bfb0014547 fatcat:m3unkvrjhvd2rctuektuvrmjqq

Evaluation transformers — A model for the parallel evaluation of functional languages (extended abstract) [chapter]

Geoffrey L. Burn
1987 Lecture Notes in Computer Science  
This leads to a natural model of the parallel evaluation of functional languages. K e y w o r d s :  ...  This information is available from the same abstract interpretation that is used for slrictness analysis.  ...  There is a similar idea for all recursively defined types, such as numeric binary trees which have the Miranda type definition : tree ::= NIL.  ... 
doi:10.1007/3-540-18317-5_24 fatcat:5bs2325qxvfn3f4247wj453akq

Improved Algorithms for Approximate String Matching (Extended Abstract) [article]

Dimitris Papamichail, Georgios Papamichail
2008 arXiv   pre-print
We designed an output sensitive algorithm solving the edit distance problem between two strings of lengths n and m respectively in time O((s-|n-m|)min(m,n,s)+m+n) and linear space, where s is the edit  ...  The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition.  ...  Acknowledgements We would like to thank Gonzallo Navarro, Amihood Amir and Gad M. Landau for information provided regarding the complexity of the edit distance problem.  ... 
arXiv:0807.4368v1 fatcat:oejk3nourfbafggmosvxww55qe

Innovation and Global Issues 1: Extended Abstracts Book [article]

Nurettin Bilici, Ragıp Pehlivanlı, Selçuk Demirkılınç
2021 figshare.com  
Innovation and Global Issues Congress I kapsamında sunulan akademik çalışmaların geniş özet metinlerinin bulunduğu, multidisipliner çalışmalar içeren değerli akademik bir eserdir.  ...  Sosyal Bir Fenomen Olarak Dilin Belirsizliği, İstanbul: Although the methodology focuses on teaching of mechanism, the general approach on implementation and evaluation could be extrapolated to other  ...  Each piece that has produced in different countries and finally brought together to generate a product for market in global system.  ... 
doi:10.6084/m9.figshare.13634555.v1 fatcat:q5mkgjq3jrh5jn4ualb2pshj5u
« Previous Showing results 1 — 15 out of 58,637 results