• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 149
Next 10 →

Reversible Structured Program Theorem

by Tetsuo Yokoyama, Robert Glück
"... In 2001, Patrick P. Gelsinger, a senior vice president at Intel corp., predicts that one of the bottlenecks of modern chip design is heat dissipation and that the upper limits of power density will be reached within the next 15 years, provided that the current trends continue [Gel01]. For the end of ..."
Abstract - Add to MetaCart
and programming language level. Reversible computation which is a deterministic forward and backward computation of a program is closely related to inverse computation. A reversible program allows a deterministic time-invertible computation where at any time not only the next machine state can be constructed

TIE: Principled reverse engineering of types in binary programs

by Jonghyup Lee, Thanassis Avgerinos, David Brumley - In Proceedings of the Network and Distributed System Security Symposium , 2011
"... A recurring problem in security is reverse engineering binary code to recover high-level language data abstrac-tions and types. High-level programming languages have data abstractions such as buffers, structures, and local vari-ables that all help programmers and program analyses rea-son about progr ..."
Abstract - Cited by 39 (2 self) - Add to MetaCart
A recurring problem in security is reverse engineering binary code to recover high-level language data abstrac-tions and types. High-level programming languages have data abstractions such as buffers, structures, and local vari-ables that all help programmers and program analyses rea-son about

Proving Theorems about LISP Functions

by Robert S. Boyer, J Strother Moore , 1975
"... Program verification is the idea that properties of programs can be precisely stated and proved in the mathematical sense. In this paper, some simple heuristics combining evaluation and mathematical induction are described, which the authors have implemented in a program that automatically proves a ..."
Abstract - Cited by 59 (2 self) - Add to MetaCart
wide variety of theorems about recursive LISP functions. The method the program uses to generate induction formulas is described at length. The theorems proved by the program include that REVERSE is its own inverse and that a particular SORT program is correct. A list of theorems proved by the program

Reverse Engineering Method Stereotypes

by Natalia Dragan, Michael L. Collard, Jonathan I. Maletic
"... An approach to automatically identify the stereotypes of all the methods in an entire system is presented. A taxonomy for object-oriented class method stereotypes is given that unifies and extends the existing literature to address gaps and deficiencies. Based on this taxonomy, a set of definitions ..."
Abstract - Cited by 16 (8 self) - Add to MetaCart
is given and method stereotypes are reverse engineered using lightweight static program analysis. Classification is done solely by programming language structures and idioms, in this case C++. The approach is used to automatically re-document each method by annotating the original source code

A functional quantum programming language

by Jonathan James Grattage, James Chapman, Alex Green, Mark Jago, Wouter Swierstra, Mauro Jaskelioff - In: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science , 2005
"... This thesis introduces the language QML, a functional language for quantum computations on finite types. QML exhibits quantum data and control structures, and integrates reversible and irreversible quantum computations. The design of QML is guided by the categorical semantics: QML programs are in-te ..."
Abstract - Cited by 64 (10 self) - Add to MetaCart
This thesis introduces the language QML, a functional language for quantum computations on finite types. QML exhibits quantum data and control structures, and integrates reversible and irreversible quantum computations. The design of QML is guided by the categorical semantics: QML programs are in

Causal-Consistent Reversibility in a Tuple-Based Language

by Elena Giachino, Ivan Lanese, Claudio Antares Mezzina, Francesco Tiezzi
"... Abstract—Causal-consistent reversibility is a natural way of undoing concurrent computations. We study causal-consistent reversibility in the context of µKLAIM, a formal coordination language based on distributed tuple spaces. We consider both uncontrolled reversibility, suitable to study the basic ..."
Abstract - Add to MetaCart
properties of the reversibility mechanism, and controlled reversibility based on a rollback operator, more suitable for programming applications. The causality structure of the language, and thus the definition of its reversible semantics, differs from all the reversible lan-guages in the literature because

Reverse Engineering Foreign Type Systems

by Mark Grechanik, Dewayne E. Perry
"... Abstract. Building systems from existing applications and data sources is common practice. Semi-structured data sources (such as XML, HTML, and databases) and programming languages (such as C # and Java) conform to welldefined, albeit different, type systems, each with their own unique underlying re ..."
Abstract - Add to MetaCart
Abstract. Building systems from existing applications and data sources is common practice. Semi-structured data sources (such as XML, HTML, and databases) and programming languages (such as C # and Java) conform to welldefined, albeit different, type systems, each with their own unique underlying

Reverse mathematics and Π12 comprehension

by Carl Mummert, Stephen, G. Simpsony - Bulletin of Symbolic Logic
"... Abstract. We initiate the reverse mathematics ofgeneraltopology. We show thata certain m etrization theorem is equivalent to Π12 comprehension. An MF space is defined to be a topologicalspace of the form MF(P) with the topology generated by fNp j p 2 Pg. Here P is a poset, MF(P) is the setof maximal ..."
Abstract - Cited by 6 (5 self) - Add to MetaCart
. This is the firstexample of a theorem of core mathematics which is provable in second orderarithm eticand im plies Π12 comprehension. In the foundations ofmathematics, there is an ongoingresearch program known as reverse mathematics. One focuses on specific core mathematical theorem s ô, and one determ ines

A Method of Program Understanding using Constraint Satisfaction for Software Reverse Engineering

by Steven Woods , 1996
"... The process of understanding a source code in a high-level programming language is a complex cognitive task. The provision of helpful decision aid subsystems would be of great benefit to software maintainers. Given a library of program plan templates, generating a partial understanding of a piece of ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
The process of understanding a source code in a high-level programming language is a complex cognitive task. The provision of helpful decision aid subsystems would be of great benefit to software maintainers. Given a library of program plan templates, generating a partial understanding of a piece

Language Oriented Programming

by M. P. Ward - In: Software - Concepts and Tools, Springer Berlin / Heidelberg, Vol.15, No.4 , 1994
"... This paper describes the concept of language oriented programming which is a novel way of organising the development of a large software system, leading to a different structure for the finished product. The approach starts by developing a formally specified, domain-oriented, very high-level languag ..."
Abstract - Cited by 14 (3 self) - Add to MetaCart
This paper describes the concept of language oriented programming which is a novel way of organising the development of a large software system, leading to a different structure for the finished product. The approach starts by developing a formally specified, domain-oriented, very high
Next 10 →
Results 1 - 10 of 149
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2016 The Pennsylvania State University