Página 1 dos resultados de 82 itens digitais encontrados em 0.115 segundos

‣ The design of a conservative logic computer and a graphical editor simulator

Ressler, Andrew Lewis
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 128 leaves; 7002152 bytes; 7001908 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
78.672935%
by Andrew Lewis Ressler.; Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1981.; MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.; Bibliography: leaf 128.

‣ Design and implementation of an online laboratory for introductory digital systems

Tsai, Judy
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 64 p.
Português
Relevância na Pesquisa
48.274673%
In this thesis, I designed and implemented an online, web-based laboratory system for the Introductory Digital Systems Laboratory course at MIT (6.111). The intent is to allow a student access to a 6.111 labkit, program it, and view the results without ever entering the physical lab room. The lab architecture consists of primarily of two portions: a server and a client. The server programs the Xilinx FPGA on the labkit, and it controls the logic analyzer used to observe the labkit signals. The client is a Java applet that can send code to the server and retrieve logic analyzer data from the server. The user can view and manipulate the retrieved data through the client. The applet is embedded in a web page, along with a video stream that shows the labkit setup live to the user. The user interface is designed to be accessible from any browser, independent of platform.; by Judy Tsai.; Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.; Includes bibliographical references (p. 63-64).

‣ Design of the CONSUL Programming Language

Baldwin, Douglas ; Quiroz Gonzalez, Cesar Augusto
Fonte: University of Rochester. Computer Science Department. Publicador: University of Rochester. Computer Science Department.
Tipo: Relatório
Português
Relevância na Pesquisa
58.328003%
We study the problem of automatically exploiting parallelism in computer programs, with particular emphasis on linguistic barriers to parallelism detection. Although functional languages and Prolog have many desirable characteristics in this respect, we find that they are not entirely ideal. We therefore offer constraint-based programming as a generalization of logic programming. By virtue of the more flexible ways in which they allow relations to be defined, constraint languages support more natural descriptions of potentially parallel algorithms than do existing logic or functional languages. We introduce a prototype constraint language called CONSUL, which demonstrates features that we feel make constraint languages well-suited for general-purpose programming of multi-processors. The extra expressiveness of constraint languages comes at a price, namely that satisfaction of general constraints can be much more difficult than satisfaction of predicates for a language like Prolog. Nonetheless, we believe that effective compilers for constraint languages can be built, and we outline some ideas on which they could be based.

‣ An Interactive Theorem Prover for First-Order Dynamic Logic

Das, Tuhin Kanti
Fonte: Brock University Publicador: Brock University
Tipo: Electronic Thesis or Dissertation
Português
Relevância na Pesquisa
59.1645%
Dynamic logic is an extension of modal logic originally intended for reasoning about computer programs. The method of proving correctness of properties of a computer program using the well-known Hoare Logic can be implemented by utilizing the robustness of dynamic logic. For a very broad range of languages and applications in program veri cation, a theorem prover named KIV (Karlsruhe Interactive Veri er) Theorem Prover has already been developed. But a high degree of automation and its complexity make it di cult to use it for educational purposes. My research work is motivated towards the design and implementation of a similar interactive theorem prover with educational use as its main design criteria. As the key purpose of this system is to serve as an educational tool, it is a self-explanatory system that explains every step of creating a derivation, i.e., proving a theorem. This deductive system is implemented in the platform-independent programming language Java. In addition, a very popular combination of a lexical analyzer generator, JFlex, and the parser generator BYacc/J for parsing formulas and programs has been used.

‣ Abstraction and Acceleration in SMT-based Model-Checking for Array Programs

Alberti, Francesco; Ghilardi, Silvio; Sharygina, Natasha
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Português
Relevância na Pesquisa
48.34463%
Abstraction (in its various forms) is a powerful established technique in model-checking; still, when unbounded data-structures are concerned, it cannot always cope with divergence phenomena in a satisfactory way. Acceleration is an approach which is widely used to avoid divergence, but it has been applied mostly to integer programs. This paper addresses the problem of accelerating transition relations for unbounded arrays with the ultimate goal of avoiding divergence during reachability analysis of abstract programs. For this, we first design a format to compute accelerations in this domain; then we show how to adapt the so-called 'monotonic abstraction' technique to efficiently handle complex formulas with nested quantifiers generated by the acceleration preprocessing. Notably, our technique can be easily plugged-in into abstraction/refinement loops, and strongly contributes to avoid divergence: experiments conducted with the MCMT model checker attest the effectiveness of our approach on programs with unbounded arrays, where acceleration and abstraction/refinement technologies fail if applied alone.; Comment: Published in the proceedings of the 9th International Symposium on Frontiers of Combining Systems (FroCoS) with the title "Definability of Accelerated Relations in a Theory of Arrays and its Applications" (available at http://www.springerlink.com)

‣ Alternation in Quantum Programming: From Superposition of Data to Superposition of Programs

Ying, Mingsheng; Yu, Nengkun; Feng, Yuan
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 20/02/2014 Português
Relevância na Pesquisa
48.58524%
We extract a novel quantum programming paradigm - superposition of programs - from the design idea of a popular class of quantum algorithms, namely quantum walk-based algorithms. The generality of this paradigm is guaranteed by the universality of quantum walks as a computational model. A new quantum programming language QGCL is then proposed to support the paradigm of superposition of programs. This language can be seen as a quantum extension of Dijkstra's GCL (Guarded Command Language). Surprisingly, alternation in GCL splits into two different notions in the quantum setting: classical alternation (of quantum programs) and quantum alternation, with the latter being introduced in QGCL for the first time. Quantum alternation is the key program construct for realizing the paradigm of superposition of programs. The denotational semantics of QGCL are defined by introducing a new mathematical tool called the guarded composition of operator-valued functions. Then the weakest precondition semantics of QGCL can straightforwardly derived. Another very useful program construct in realizing the quantum programming paradigm of superposition of programs, called quantum choice, can be easily defined in terms of quantum alternation. The relation between quantum choices and probabilistic choices is clarified through defining the notion of local variables. We derive a family of algebraic laws for QGCL programs that can be used in program verification...

‣ Typing a Core Binary Field Arithmetic in a Light Logic

Cesena, Emanuele; Pedicini, Marco; Roversi, Luca
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 28/06/2011 Português
Relevância na Pesquisa
48.328003%
We design a library for binary field arithmetic and we supply a core API which is completely developed in DLAL, extended with a fix point formula. Since DLAL is a restriction of linear logic where only functional programs with polynomial evaluation cost can be typed, we obtain the core of a functional programming setting for binary field arithmetic with built-in polynomial complexity.

‣ Design of a Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata

Jha, Sumit Kumar
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 19/10/2007 Português
Relevância na Pesquisa
48.063286%
This paper presents the design of a novel distributed algorithm d-IRA for the reachability analysis of linear hybrid automata. Recent work on iterative relaxation abstraction (IRA) is leveraged to distribute the computational problem among multiple computational nodes in a non-redundant manner by performing careful infeasibility analysis of linear programs corresponding to spurious counterexamples. The d-IRA algorithm is resistant to failure of multiple computational nodes. The experimental results provide promising evidence for the possible successful application of this technique.; Comment: 8 pages

‣ Dual-normal Logic Programs - the Forgotten Class

Fichte, Johannes K.; Truszczynski, Miroslaw; Woltran, Stefan
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 20/07/2015 Português
Relevância na Pesquisa
49.3217%
Disjunctive Answer Set Programming is a powerful declarative programming paradigm with complexity beyond NP. Identifying classes of programs for which the consistency problem is in NP is of interest from the theoretical standpoint and can potentially lead to improvements in the design of answer set programming solvers. One of such classes consists of dual-normal programs, where the number of positive body atoms in proper rules is at most one. Unlike other classes of programs, dual-normal programs have received little attention so far. In this paper we study this class. We relate dual-normal programs to propositional theories and to normal programs by presenting several inter-translations. With the translation from dual-normal to normal programs at hand, we introduce the novel class of body-cycle free programs, which are in many respects dual to head-cycle free programs. We establish the expressive power of dual-normal programs in terms of SE- and UE-models, and compare them to normal programs. We also discuss the complexity of deciding whether dual-normal programs are strongly and uniformly equivalent.; Comment: This is the author's self-archived copy including detailed proofs. To appear in Theory and Practice of Logic Programming (TPLP)...

‣ An MML-based tool for evaluating the complexity of (stochastic) logic theories

Castillo-Andreu, Héctor
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Português
Relevância na Pesquisa
48.870283%
Theory evaluation is a key problem in many areas: machine learning, scientific discovery, inverse engineering, decision making, software engineering, design, human sciences, etc. If we have a set of theories that are able to explain the same set of phenomena, we need a criterion to choose which one is best. There are, of course, many possible criteria. Model simplicity is one of the most common criteria in theory evaluation. The Minimum Message Length (MML) is a solid approach to evaluate theories relative to a given evidence or data. Theories can be expressed in specific or general (Turing-complete) languages. First-order logic, and logic programming in particular, is a Turing-complete language. Evaluating the simplicity of a theory or program described in a Turing-complete language is much more difficult than just counting the number of lines or bits. It is, in fact, the problem of calculating its Kolmogorov complexity, which is uncomputable. Few works in the literature have been able to present accurate and effective approximations for a Turing-complete language. In this work, we present the first general MML coding scheme for logic programs. With this scheme, we can quantify the bits of information required to code (or send) a theory...

‣ Design, development and implementation of a tool for construction of declarative functional descriptions of semantic web services based on WSMO methodology

Kormushev, Petar
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 02/04/2009 Português
Relevância na Pesquisa
58.60454%
Semantic web services (SWS) are self-contained, self-describing, semantically marked-up software resources that can be published, discovered, composed and executed across the Web in a semi-automatic way. They are a key component of the future Semantic Web, in which networked computer programs become providers and users of information at the same time. This work focuses on developing a full-life-cycle software toolset for creating and maintaining Semantic Web Services (SWSs) based on the Web Service Modelling Ontology (WSMO) framework. A main part of WSMO-based SWS is service capability - a declarative description of Web service functionality. A formal syntax and semantics for such a description is provided by Web Service Modeling Language (WSML), which is based on different logical formalisms, namely, Description Logics, First-Order Logic and Logic Programming. A WSML description of a Web service capability is represented as a set of complex logical expressions (axioms). We develop a specialized user-friendly tool for constructing and editing WSMO-based SWS capabilities. Since the users of this tool are not specialists in first-order logic, a graphical way for constricting and editing axioms is proposed. The designed process for constructing logical expressions is ontology-driven...

‣ Logic Programming, Functional Programming, and Inductive Definitions

Paulson, Lawrence C.; Smith, Andrew W.
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 28/03/2001 Português
Relevância na Pesquisa
48.49583%
An attempt at unifying logic and functional programming is reported. As a starting point, we take the view that "logic programs" are not about logic but constitute inductive definitions of sets and relations. A skeletal language design based on these considerations is sketched and a prototype implementation discussed.

‣ Extremal problems in logic programming and stable model computation

Cholewinski, Pawel; Truszczynski, Miroslaw
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 25/01/1999 Português
Relevância na Pesquisa
49.389%
We study the following problem: given a class of logic programs C, determine the maximum number of stable models of a program from C. We establish the maximum for the class of all logic programs with at most n clauses, and for the class of all logic programs of size at most n. We also characterize the programs for which the maxima are attained. We obtain similar results for the class of all disjunctive logic programs with at most n clauses, each of length at most m, and for the class of all disjunctive logic programs of size at most n. Our results on logic programs have direct implication for the design of algorithms to compute stable models. Several such algorithms, similar in spirit to the Davis-Putnam procedure, are described in the paper. Our results imply that there is an algorithm that finds all stable models of a program with n clauses after considering the search space of size O(3^{n/3}) in the worst case. Our results also provide some insights into the question of representability of families of sets as families of stable models of logic programs.

‣ Integrating Interval Constraints into Logic Programming

van Emden, M. H.
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 06/02/2010 Português
Relevância na Pesquisa
48.504487%
The CLP scheme uses Horn clauses and SLD resolution to generate multiple constraint satisfaction problems (CSPs). The possible CSPs include rational trees (giving Prolog) and numerical algorithms for solving linear equations and linear programs (giving CLP(R)). In this paper we develop a form of CSP for interval constraints. In this way one obtains a logic semantics for the efficient floating-point hardware that is available on most computers. The need for the method arises because in the practice of scheduling and engineering design it is not enough to solve a single CSP. Ideally one should be able to consider thousands of CSPs and efficiently solve them or show them to be unsolvable. This is what CLP/NCSP, the new subscheme of CLP described in this paper is designed to do.; Comment: 21 pages, 2 tables, no figures

‣ The Full Abstraction Problem for Higher Order Functional-Logic Programs

López-Fraguas, F. J.; Rodríguez-Hortalá, J.
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 09/02/2010 Português
Relevância na Pesquisa
48.537305%
Developing suitable formal semantics can be of great help in the understanding, design and implementation of a programming language, and act as a guide for software development tools like analyzers or partial evaluators. In this sense, full abstraction is a highly desirable property, indicating a perfect correspondence between the semantics and the observable behavior of program pieces. In this work we address the question of full abstraction for the family of modern functional logic languages, in which functions can be higher order and non-deterministic, and where the semantics adopted for non-determinism is \emph{call-time choice}. We show that, with respect to natural notions of \emph{observation}, any semantics based on \emph{extensional} functions is necessarily unsound; in contrast, we show that the higher order version of \emph{CRWL}, a well-known existing semantic framework for functional logic programming, based on an \emph{intensional} view of functions, turns out to be fully abstract and compositional.

‣ A Type System Theory for Higher-Order Intensional Logic Support for Variable Bindings in Hybrid Intensional-Imperative Programs in GIPSY

Mokhov, Serguei A.; Paquet, Joey
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 22/06/2009 Português
Relevância na Pesquisa
48.437256%
We describe a type system for a platform called the General Intensional Programming System (GIPSY), designed to support intensional programming languages built upon intensional logic and their imperative counter-parts for the intensional execution model. In GIPSY, the type system glues the static and dynamic typing between intensional and imperative languages in its compiler and run-time environments to support the intensional evaluation of expressions written in various dialects of the intensional programming language Lucid. The intensionality makes expressions to explicitly take into the account a multidimensional context of evaluation with the context being a first-class value that serves a number of applications that need the notion of context to proceed. We describe and discuss the properties of such a type system and the related type theory as well as particularities of the semantics, design and implementation of the GIPSY type system.; Comment: 12 pages, 1 table; 2 figures

‣ AutoProof: Auto-active Functional Verification of Object-oriented Programs

Tschannen, Julian; Furia, Carlo A.; Nordio, Martin; Polikarpova, Nadia
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Português
Relevância na Pesquisa
48.259146%
Auto-active verifiers provide a level of automation intermediate between fully automatic and interactive: users supply code with annotations as input while benefiting from a high level of automation in the back-end. This paper presents AutoProof, a state-of-the-art auto-active verifier for object-oriented sequential programs with complex functional specifications. AutoProof fully supports advanced object-oriented features and a powerful methodology for framing and class invariants, which make it applicable in practice to idiomatic object-oriented patterns. The paper focuses on describing AutoProof's interface, design, and implementation features, and demonstrates AutoProof's performance on a rich collection of benchmark problems. The results attest AutoProof's competitiveness among tools in its league on cutting-edge functional verification of object-oriented programs.

‣ Building an IDE for the Calculational Derivation of Imperative Programs

Chaudhari, Dipak L.; Damani, Om
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 16/08/2015 Português
Relevância na Pesquisa
48.22948%
In this paper, we describe an IDE called CAPS (Calculational Assistant for Programming from Specifications) for the interactive, calculational derivation of imperative programs. In building CAPS, our aim has been to make the IDE accessible to non-experts while retaining the overall flavor of the pen-and-paper calculational style. We discuss the overall architecture of the CAPS system, the main features of the IDE, the GUI design, and the trade-offs involved.; Comment: In Proceedings F-IDE 2015, arXiv:1508.03388

‣ Color logic: Interactively defining color in the context of computer graphics

Rose, Brian J.
Fonte: Rochester Instituto de Tecnologia Publicador: Rochester Instituto de Tecnologia
Tipo: Tese de Doutorado
Português
Relevância na Pesquisa
48.9674%
An attempt was made to build a bridge between the art and science of color, utilizing computer graphics as a medium. This interactive tutorial presents both technical and non-technical information in virtually complete graphic form, allowing the undergraduate college student to readily understand and apply its content. The program concentrates on relevant topics within each of the following aspects of color science: Color Vision, Light and Objects, Color Perception, Aesthetics and Design, Color Order, and Computer Color Models. Upon preliminary completion, user-testing was conducted in order to ensure that the program is intuitive, intriguing, and valuable to a wide range of users. COLOR LOGIC represents effective integration of color science, graphic design, user-interface design, and computer graphics design. Several practical applications for the program are discussed.

‣ GSD - An interactive window oriented debugger

Bricault, Gary S.
Fonte: Rochester Instituto de Tecnologia Publicador: Rochester Instituto de Tecnologia
Tipo: Tese de Doutorado
Português
Relevância na Pesquisa
48.624424%
Each computer program, no matter how carefully designed, may contain code entry mistakes, errors in logic, and/or anomalies that can result in unexpected outcome (also known as bugs). In order to find and correct these problems, a software tool known as a debugger can be utilized by a programmer as an aid in isolating and correcting computer programs. The purpose of this thesis is to design and create such a tool for the AT&T UNIX-PC CU that will allow the user to function interactively within a window-oriented environment. This new debugger will be referred to as GSD (Graphic Symbolic Debugger). A study of prior art has been made in order to learn various debugger implementation techniques, their advantages and shortcomings, and to gain an understanding of methods that may be utilized within the UNIX environment for such a tool to be effective.