Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Abstract data type”

Blockchain Abstract Data Type

Emmanuelle Anceaume, Antonella Del Pozzo, Romaric Ludinard et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2018

Cited by 2Open access

Library Abstract data type

Temesio Vizoso, Silvana; Escuela Universitaria de Bibliotecología y Ciencias Afines, EUBCA, Universidad de la República. Emilio Frugoni 1427, 11.200 Montevideo · Americanae (AECID Library) · 2013

Analysis of bibliographic description from a conceptual point of view from the formal specification: «library» abstract data type. Other approaches are detailed using the entity-relationship model and XML language. We conclude the relevance of abstract approach and its general applicability in a subject of constant change.

Cited by 0

Blockchain Abstract Data Type

Emmanuelle Anceaume, Antonella Del Pozzo, Romaric Ludinard et al. · arXiv (Cornell University) · 2018

The presented work continues the line of recent distributed computing\ncommunityefforts dedicated to the theoretical aspects of blockchains. This\npaper is the rst tospecify blockchains as a composition of abstract data types\nall together with a hierarchyof consistency criteria that formally\ncharacterizes the histories admissible for distributedprograms that use them.\nOur work is based on an original oracle-based constructionthat, along with new\nconsistency deffnitions, captures the eventual convergence processin blockchain\nsystems. The paper presents as well some results on implementability ofthe\npresented abstractions and a mapping of representative existing blockchains\nfromboth academia and industry in our framework.\n

Cited by 2Open access

Blockchain Abstract Data Type

Emmanuelle Anceaume, Antonella Del Pozzo, Romaric Ludinard et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2019

The presented work continues the line of recent distributed computing community efforts dedicated to the theoretical aspects of blockchains. This paper is the first to specify blockchains as a composition of abstract data types all together with a hierarchy of consistency criteria that formally characterizes the histories admissible for distributed programs that use them. Our work is based on an original oracle-based construction that, along with new consistency definitions, captures the eventual convergence process in blockchain systems. The paper presents as well some results on implementability of the presented abstractions and a mapping of representative existing blockchains from both academia and industry in our framework.

Cited by 23Open access

The VagueGeometry Abstract Data Type

Chaves Carniel, Anderson, Rodrigues Ciferri, Ricardo, Dutra de Aguiar Ciferri, Cristina · Cadernos de Linguística e Teoria da Literatura (Universidade Federal de Minas Gerais) · 2016

Cited by 0

The VagueGeometry abstract data type

Ciferri, Cristina Dutra de Aguiar · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2016

Cited by 0Open access

Symbolic abstract data type inference

Michael Emmi, Constantin Enea · ACM SIGPLAN Notices · 2016

Formal specification is a vital ingredient to scalable verification of software systems. In the case of efficient implementations of concurrent objects like atomic registers, queues, and locks, symbolic formal representations of their abstract data types (ADTs) enable efficient modular reasoning, decoupling clients from implementations. Writing adequate formal specifications, however, is a complex task requiring rare expertise. In practice, programmers write reference implementations as informal specifications. In this work we demonstrate that effective symbolic ADT representations can be automatically generated from the executions of reference implementations. Our approach exploits two key features of naturally-occurring ADTs: violations can be decomposed into a small set of representative patterns, and these patterns manifest in executions with few operations. By identifying certain algebraic properties of naturally-occurring ADTs, and exhaustively sampling executions up to a small number of operations, we generate concise symbolic ADT representations which are complete in practice, enabling the application of efficient symbolic verification algorithms without the burden of manual specification. Furthermore, the concise ADT violation patterns we generate are human-readable, and can serve as useful, formal documentation.

Cited by 0

Multimedia Visualization of Abstract Data Type

Xu, Cong · SHAREOK (University of Oklahoma) · 2014

In order to understand the complexity of the real world, people build abstract descriptions or models. By omitting details and including just the relevant factors, a model can provide a useful tool for understanding a particular problem. A model must be proved, tested and solved. Systematized techniques for analyzing models are called algorithms [22]. Models and algorithms must be represented in a way that is clear and informative. "A picture is worth a thousand words." Visualization is a method of computing [33]. It transforms the symbolic into the geometric, enabling researchers to observe their simulations and computations. Today, the study of visualization has expanded greatly with the variety of representations [33], such as computer multimedia, graphics, and graphical user interfaces. Visualization uses carefully designed representations to help people understand complicated models and algorithms. Nowadays visualization has become- one of the most exciting and rapidly growing fields in computer science. It has greatly affected such diverse areas as education, science, industry, business, and military than ever before. One of the benefits of using visualization in education is that it involves the right side of the human brain in the learning activity [21]. The perceptual work is done by the right hemisphere of human brain that initially processes pictorial information. Then the left hemisphere does the analysis work. If we use both graphics and wordst more of the brain will be involved in processing the information. This results in better and fast understanding of abstract concepts.

Cited by 0Open access

Abstract Polymorphic Algebraic Data Type Reconstruction

2008

One of the disadvantages of statically typed languages is the programming overhead caused by writing all the necessary type information: Both type declarations and type definitions are typically required. Traditional type inference aims at relieving the programmer from the former. We present a rule-based constraint rewriting algorithm that reconstructs both type declarations and type definitions, allowing the programmer to effectively program type-less in a strictly typed language. This effectively combines strong points of dynamically typed languages (rapid prototyping) and statically typed ones (documentation, optimized compilation). Moreover it allows to quickly port code from a statically untyped to a statically typed setting. Our constraint-based algorithm reconstructs uniform polymorphic definitions of algebraic data types and simultaneously infers the types of all expressions and functions (supporting polymorphic recursion) in the program. The declarative nature of the algorithm allows us to easily show that it has a number of highly desirable properties such as soundness, completeness and various optimality properties. Moreover, we show how to easily extend and adapt it to suit a number of different language constructs and type system features.

Cited by 0

Encryption as an abstract data-type: An extended abstract

Dale Miller · 2003

At the Dolev-Yao level of abstraction, security protocols can be specified using multisets rewriting. Such rewriting can be modeled naturally using proof search in linear logic. The linear logic setting also provides a simple mechanism for generating nonces and session and encryption keys via eigenvariables. We illustrate several additional aspects of this direct encoding of protocols into logic. In particular, encrypted data can be seen naturally as an abstract data-type. Entailments between security protocols as linear logic theories can be surprisingly strong. We also illustrate how the wellknown connection in linear logic between bipolar formulas and general formulas can be used to show that the asynchronous model of communication given by multiset rewriting rules can be understood, more naturally as asynchronous process calculus (also represented directly as linear logic formulas). The familiar proof theoretic notion of interpolants can also serve to characterize communication between a role and its environment.

Cited by 0

\t Encryption as an abstract data-type: An extended abstract

Dale Miller · 2003

At the Dolev-Yao level of abstraction, security protocols can be speci ed using multisets rewriting. Such rewriting can be modeled naturally using proof search in linear logic. The linear logic setting also provides a simple mechanism for generating nonces and session and encryption keys via eigenvariables. We illustrate several additional aspects of this direct encoding of protocols into logic. In particular, encrypted data can be seen naturally as an abstract data-type. Entailments between security protocols as linear logic theories can be surprisingly strong. We also illustrate how the well-known connection in linear logic between bipolar formulas and general formulas can be used to show that the asynchronous model of communication given by multiset rewriting rules can be understood, more naturally as asynchronous process calculus (also represented directly as linear logic formulas). The familiar proof theoretic notion of interpolants can also serve to characterize communication between a role and its environment.

Cited by 0

Transrational Numbers as an Abstract Data Type

Bergstra, Jan A., Tucker, John V. · Figshare · 2020

Transmathematica archive. Please cite as:<br>J.A. Bergstra and J.V. Tucker, "Transrational Numbers as an Abstract Data Type", Transmathematica, ISSN 2632-9212, pp 1-29, 16 December 2020, https://doi.org/10.36285/tm.47<br>

Cited by 0Open access