Topic
Hard coding
About: Hard coding is a research topic. Over the lifetime, 80 publications have been published within this topic receiving 640 citations. The topic is also known as: hardcoding & hard-coding.
Papers published on a yearly basis
Papers
Patent•
10 Jun 1999
TL;DR: In this article, the authors present a method and apparatus for creating network services, which is comprised of a list of features, and a model (referred to as a run time model or RTM).
Abstract: A method and apparatus for creating network services. Instead of programming or hard coding an entire web service, the invention provides the ability to easily create a module/mechanism (referred to as a template) that produces code that may be utilized to create a web service. Thus, a template is formed and utilized to create a model that can generate an application or web service. Each template is comprised of a list of features, and a model (referred to as a run time model or RTM). An RTM is an XML document that declares the structure, functionality, and behavior of a web service application (referred to as a WSA). In one or more embodiments, each feature is responsible for generating XML entities to be output in a new RTM. Each feature may obtain one or more users' input that is utilized to build an XML entity in a new RTM. Further, each feature may be processed sequentially and has the ability to modify any existing XML entities that have already been created (by other features, for example). Consequently, features have the ability to look at an application as a whole to effect a change to the entire existing application instead of merely adjusting and modifying the entity they are responsible for. In one or more embodiments of the invention, when a condition that may affect an application changes, the template may be utilized to regenerate the RTM to produce a new web service or XML document.
128 citations
Patent•
5 Sep 2003
TL;DR: In this article, the authors propose a hardware-based digital rights management (HWDM) scheme, where software/digital content is self-activating/self-authenticating when used in conjunction with a resident authorized administrator.
Abstract: Hardware based digital rights management includes designating software for protection via a code or identifier associated with the software and detected by a hardware based authorized representative entity resident on a user computer, network, or device, remotely located relative to the user, or both. Representative hardware based implementations may be in the form of a chip, chipset, PC card, processor, and/or integral with a CPU, preferably supplied on an OEM basis. Authorized representative functions are programmable and/or hard coded. Software/digital content is self-activating/self-authenticating when used in conjunction with a resident authorized administrator. During the first use or transfer of content designated for protection, the authorized representative generates a password or authentication code at least partially based on registration information including user system information and links the code to the content. Registration information associated with the user/device remains within a trusted network associated with the user providing optimal user privacy.
92 citations
2 Jun 1998
TL;DR: A systematic approach for detecting both kinds of violations, so that violation detection is not hard coded into base level components, but is "layered" on top of them, and so that it can be turned "on" or "off" selectively for one or more components, with practically no change to executable code.
Abstract: Two kinds of interface contract violations can occur in component based software: a client component may fail to satisfy a requirement of a component it is using, or a component implementation may fail to fulfil its obligations to the client. The paper proposes a systematic approach for detecting both kinds of violations, so that violation detection is not hard coded into base level components, but is "layered" on top of them, and so that it can be turned "on" or "off" selectively for one or more components, with practically no change to executable code (limiting changes to a few declarations). Among the salient features of this approach are its use of formal specifications, the ability to handle parameterized (i.e., generic, or template) components, and the automatic generation of routine aspects of violation detection. We have designed, built, and experimented with a generator of checking components for C++ templates.
45 citations
Patent•
2 Jun 2006TL;DR: In this article, a summary report is generated that summarizes aspects of the current status of a software project, including which portions of code have been written, which have been edited to predetermined standards, and which remain to be written.
Abstract: A data processing system, method, and instructions executable on a computer inspect the quality of software code. A summary report is generated that summarizes aspects of the current status of a software project. The summary report may include which portions of code have been written, which have been edited to predetermined standards, and which remain to be written. Errors in the code may be identified. Warnings associated with portions of the code may be generated, as well as suggested changes to the code. For comparison, the suggested code changes may be displayed along side of the corresponding portions of the pre-existing code that the suggested code is intended to replace. Hard coded values may be automatically identified. Text elements corresponding to each hard coded value may be automatically created. Subsequently, each hard coded value may be automatically replaced by the corresponding text element. Revisions to pre-existing code may be inspected.
30 citations
TL;DR: A program that compiles BURS tables into a combination of hard code and data is described, which is not just faster but also significantly smaller than their predecessors.
Abstract: SUMMARY Code generators based on bottom-up rewrite systems (BURS) are automatically generated from machinedescription grammars. They produce locally optimal code for expression trees, but their tables are large and require compile-time interpretation. This paper describes a program that compiles BURS tables into a combination of hard code and data. Hard-coding exposed important opportunities for compression that were previously hidden in the tables, so the hard-coded code generators are not just faster but also significantly smaller than their predecessors. A VAX code generator takes 21.4Kbytes and identifies optimal assembly code in about 50 VAX instructions per node.
29 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 1 |
| 2020 | 4 |
| 2019 | 7 |
| 2018 | 9 |
| 2017 | 4 |
| 2016 | 5 |