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

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 11 - 20 of 16,515
Next 10 →

Safe Kernel Extensions Without Run-Time Checking

by George C. Necula, Peter Lee - Proc. of OSDI'96
"... Abstract This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel first defines a safety policy and makes it public. Then, using this policy, an application can provide binaries i ..."
Abstract - Cited by 429 (20 self) - Add to MetaCart
. If the validation succeeds, the code is guaranteed to respect the safety policy without relying on run-time checks. The main practical difficulty of PCC is in generating the safety proofs. In order to gain some preliminary experience with this, we have written several network packet filters in hand-tuned DEC Alpha

Query evaluation techniques for large databases

by Goetz Graefe - ACM COMPUTING SURVEYS , 1993
"... Database management systems will continue to manage large data volumes. Thus, efficient algorithms for accessing and manipulating large sets and sequences will be required to provide acceptable performance. The advent of object-oriented and extensible database systems will not solve this problem. On ..."
Abstract - Cited by 767 (11 self) - Add to MetaCart
Database management systems will continue to manage large data volumes. Thus, efficient algorithms for accessing and manipulating large sets and sequences will be required to provide acceptable performance. The advent of object-oriented and extensible database systems will not solve this problem

Statecharts: A Visual Formalism For Complex Systems

by David Harel , 1987
"... We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discrete-event systems, such as multi-computer real-time systems, communication protocols and digital control units. Our diagrams, which we cal ..."
Abstract - Cited by 2704 (56 self) - Add to MetaCart
We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discrete-event systems, such as multi-computer real-time systems, communication protocols and digital control units. Our diagrams, which we

An Introduction to the Kalman Filter

by Greg Welch, Gary Bishop - UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL , 1995
"... In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discrete-data linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area o ..."
Abstract - Cited by 1146 (13 self) - Add to MetaCart
In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discrete-data linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area

A theory of timed automata

by Rajeev Alur , 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract - Cited by 2651 (32 self) - Add to MetaCart
Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis

Mixin-based inheritance.

by Gilad Bracha , William Cook - Proc. OOPSLA/ECOOP’90 , 1990
"... Abstract The diverse inheritance mechanisms provided by Smalltalk, Beta, and CLOS are interpreted as different uses of a single underlying construct. Smalltalk and Beta differ primarily in the direction of class hierarchy growth. These inheritance mechanisms are subsumed in a new inheritance model ..."
Abstract - Cited by 487 (15 self) - Add to MetaCart
based on composition of mixins, or abstract subclasses. This form of inheritance can also encode a CLOS multiple-inheritance hierarchy, although changes to the encoded hierarchy that would violate encapsulation are difficult. Practical application of mixin-based inheritance is illustrated in a sketch

Practical extensions in agent programming languages

by Mehdi Dastani, Dirk Hobo, John-jules Ch. Meyer - In Proceedings of AAMAS 2007 , 2007
"... This paper proposes programming constructs to improve the practical application of existing BDI-based agent-oriented programming languages that have formal semantics. The proposed programming constructs include operations such as testing, adopting and dropping declarative goals, different execution ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
This paper proposes programming constructs to improve the practical application of existing BDI-based agent-oriented programming languages that have formal semantics. The proposed programming constructs include operations such as testing, adopting and dropping declarative goals, different execution

When choice is demotivating: can one desire too much of a good thing

by Sheena S. Iyengar - Journal of Personality and Social Psychology , 2000
"... Current psychological theory and research affirm the positive affective and motivational consequences of having personal choice. These findings have led to the popular notion that the more choice, the better--that the human ability omanage, and the human desire for, choice isunlimited. Findings from ..."
Abstract - Cited by 438 (12 self) - Add to MetaCart
or chocolates or to undertake optional class essay assignments when offered a limited array of 6 choices rather than a more extensive array of 24 or 30 choices. Moreover, participants actually reported greater subsequent satisfaction with their selections and wrote better essays when their original set

Exemplars: Practical, Extensible Framework for Dynamic Text Generation

by Michael White, Ted Caldwell, Cogentex Inc - In Proceedings of the Ninth International Workshop on Natural Language Generation , 1998
"... In this paper, we present EXEMPLARS, an object-oriented, rule-base d framework designed to support practical, dynamic text generation, emphasizing its novel features compared to existing hybrid systems that mix template-style and more sophisticated techniques. These features-.include an extensible c ..."
Abstract - Cited by 43 (6 self) - Add to MetaCart
In this paper, we present EXEMPLARS, an object-oriented, rule-base d framework designed to support practical, dynamic text generation, emphasizing its novel features compared to existing hybrid systems that mix template-style and more sophisticated techniques. These features-.include an extensible

Extensibility for the masses: Practical extensibility with object algebras

by Bruno C. D. S. Oliveira, William R. Cook - IN: ECOOP’12 , 2012
"... This paper presents a new solution to the expression problem (EP) that works in OO languages with simple generics (including Java or C#). A key novelty of this solution is that advanced typing features, including F-bounded quantification, wildcards and variance annotations, are not needed. The solu ..."
Abstract - Cited by 9 (4 self) - Add to MetaCart
. The solution is based on object algebras, which are an abstraction closely related to algebraic datatypes and Church encodings. Object algebras also have much in common with the traditional forms of the Visitor pattern, but without many of its drawbacks: they are extensible, remove the need for accept methods
Next 10 →
Results 11 - 20 of 16,515
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-2019 The Pennsylvania State University