3,912 research outputs found
Recommended from our members
Machine learning : techniques and foundations
The field of machine learning studies computational methods for acquiring new knowledge, new skills, and new ways to organize existing knowledge. In this paper we present some of the basic techniques and principles that underlie AI research on learning, including methods for learning from examples, learning in problem solving, learning by analogy, grammar acquisition, and machine discovery. In each case, we illustrate the techniques with paradigmatic examples
Recommended from our members
Information flow analysis for a dynamically typed language with staged metaprogramming
Web applications written in JavaScript are regularly used for dealing with sensitive or personal data. Consequently, reasoning about their security properties has become an important problem, which is made very difficult by the highly dynamic nature of the language, particularly its support for runtime code generation via eval. In order to deal with this, we propose to investigate security analyses for languages with more principled forms of dynamic code generation. To this end, we present a static information flow analysis for a dynamically typed functional language with prototype-based inheritance and staged metaprogramming. We prove its soundness, implement it and test it on various examples designed to show its relevance to proving security properties, such as noninterference, in JavaScript. To demonstrate the applicability of the analysis, we also present a general method for transforming a program using eval into one using staged metaprogramming. To our knowledge, this is the first fully static information flow analysis for a language with staged metaprogramming, and the first formal soundness proof of a CFA-based information flow analysis for a functional programming language
12th International Workshop on Termination (WST 2012) : WST 2012, February 19â23, 2012, Obergurgl, Austria / ed. by Georg Moser
This volume contains the proceedings of the 12th International Workshop on Termination (WST 2012), to be held February 19â23, 2012 in Obergurgl, Austria. The goal of the Workshop on Termination is to be a venue for presentation and discussion of all topics in and around termination. In this way, the workshop tries to bridge the gaps between different communities interested and active in research in and around termination. The 12th International Workshop on Termination in Obergurgl continues the successful workshops held in St. Andrews (1993), La Bresse (1995), Ede (1997), Dagstuhl (1999), Utrecht (2001), Valencia (2003), Aachen (2004), Seattle (2006), Paris (2007), Leipzig (2009), and Edinburgh (2010). The 12th International Workshop on Termination did welcome contributions on all aspects of termination and complexity analysis. Contributions from the imperative, constraint, functional, and logic programming communities, and papers investigating applications of complexity or termination (for example in program transformation or theorem proving) were particularly welcome. We did receive 18 submissions which all were accepted. Each paper was assigned two reviewers. In addition to these 18 contributed talks, WST 2012, hosts three invited talks by Alexander Krauss, Martin Hofmann, and Fausto Spoto
Domain-specific Language for Data-driven Design Time Analyses and Result Mappings for Logic Programs
In der vernetzten Welt von Heute ist der Austausch von Daten fĂŒr viele Anwendungen unerlĂ€sslich. Mit der zunehmenden Vernetzung und dem wachsenden Datenaufkommen wird die GewĂ€hrleistung von Sicherheit, Datenschutz und die Einhaltung rechtlicher Vorgaben immer wichtiger. Um diesen Anforderungen frĂŒhzeitig gerecht zu werden, können Datenflussanalysen zur Entwurfszeit eingesetzt werden. Durch explizite Modellierung der Daten und ihrer Eigenschaften kann das Architekturmodell automatisch gegen DatenflussbeschrĂ€nkungen getestet werden. Diese VerifikationsansĂ€tze transformieren die modellierte Architektur in ihnen zugrunde liegende Formalismen wie z.B. logische Programme. Um die
Aussagekraft der BeschrĂ€nkungen zu erhöhen, mĂŒssen diese oft ebenfalls unter Nutzung des Formalismus ausgedrĂŒckt werden. Dies erfordert von den Architekten Kenntnisse ĂŒber den Formalismus, die transformierte Architektur und die Verifikationsumgebung.
Unser Ziel ist es, die LĂŒcke zwischen der architektonischen DomĂ€ne und dem zugrundeliegenden Formalismus zu schlieĂen, die bei der Formulierung von DatenflussbeschrĂ€nkungen auftritt. Wir schlagen eine domĂ€nenspezifische Sprache (DSL) vor, die es Architekten ermöglicht, EinschrĂ€nkungen bereits wĂ€hrend der Definition der Architektur festzulegen. Durch die Verwendung der selben Terminologie, die auch zur Modellierung der Architektur eingesetzt wird, können individualisierte BeschrĂ€nkungen ohne Kenntnisse des ĂberprĂŒfungsprozesses formuliert werden. ZusĂ€tzlich stellen wir eine Abbildung der in unserer DSL formulierten EinschrĂ€nkungen von der ArchitekturdomĂ€ne in den Formalismus vor. Analyseergebnisse werden in die ArchitekturdomĂ€ne zurĂŒck abgebildet, um deren Interpretation zu erleichtern.
Die DSL basiert auf der Sammlung und Generalisierung bestehender EinschrĂ€nkungen aus realen Fallstudien. Wir bewerten die Aussagekraft, Nutzbarkeit und Kompaktheit der DSL fĂŒr DatenflussbeschrĂ€nkungen unterschiedlicher GröĂe. UngefĂ€hr 75% der untersuchten BeschrĂ€nkungen können mit der ersten Version unserer DSL ausgedrĂŒckt werden, wobei bis zu 10-mal weniger Quelltext benötigt wird. Neben den Grundlagen der Datenflussmodellierung und Wissen ĂŒber die Modellierungsumgebung sind keine weiteren Kenntnisse ĂŒber den Transformations- oder Verifikationsmechanismus erforderlich. ZusĂ€tzlich untersuchen wir die Ăquivalenz der Analyseergebnisse von BeschrĂ€nkungen, die in unserer DSL formuliert wurden mit BeschrĂ€nkungen, welche direkt unter Nutzung des Formalismus ausgedrĂŒckt wurden. In unseren Tests erreichen BeschrĂ€nkungen, welche mit Hilfe unserer DSL formuliert wurden, eine 100%ige Ausbeute bei einer PrĂ€zision von 90%
Learning to Infer Graphics Programs from Hand-Drawn Images
We introduce a model that learns to convert simple hand drawings into
graphics programs written in a subset of \LaTeX. The model combines techniques
from deep learning and program synthesis. We learn a convolutional neural
network that proposes plausible drawing primitives that explain an image. These
drawing primitives are like a trace of the set of primitive commands issued by
a graphics program. We learn a model that uses program synthesis techniques to
recover a graphics program from that trace. These programs have constructs like
variable bindings, iterative loops, or simple kinds of conditionals. With a
graphics program in hand, we can correct errors made by the deep network,
measure similarity between drawings by use of similar high-level geometric
structures, and extrapolate drawings. Taken together these results are a step
towards agents that induce useful, human-readable programs from perceptual
input
Finite Countermodel Based Verification for Program Transformation (A Case Study)
Both automatic program verification and program transformation are based on
program analysis. In the past decade a number of approaches using various
automatic general-purpose program transformation techniques (partial deduction,
specialization, supercompilation) for verification of unreachability properties
of computing systems were introduced and demonstrated. On the other hand, the
semantics based unfold-fold program transformation methods pose themselves
diverse kinds of reachability tasks and try to solve them, aiming at improving
the semantics tree of the program being transformed. That means some
general-purpose verification methods may be used for strengthening program
transformation techniques. This paper considers the question how finite
countermodels for safety verification method might be used in Turchin's
supercompilation method. We extract a number of supercompilation sub-algorithms
trying to solve reachability problems and demonstrate use of an external
countermodel finder for solving some of the problems.Comment: In Proceedings VPT 2015, arXiv:1512.0221
- âŠ