Smith, 2006 - Google Patents
Aspects as invariantsSmith, 2006
View PDF- Document ID
- 10383232951934610704
- Author
- Smith D
- Publication year
- Publication venue
- Automatic Program Development: A Tribute to Robert Paige
External Links
Snippet
Summary Aspect-Oriented Programming (AOP) offers new insights and tools for the modular development of systems with crosscutting features. Current tool support for AOP is provided mainly in the form of code-level constructs. This paper presents a way to express …
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/43—Checking; Contextual analysis
- G06F8/436—Semantic checking
- G06F8/437—Type checking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/44—Arrangements for executing specific programmes
- G06F9/4421—Execution paradigms
- G06F9/4428—Object-oriented
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/42—Syntactic analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/51—Source to source
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/02—Knowledge representation
- G06N5/022—Knowledge engineering, knowledge acquisition
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jones | Computability and complexity: from a programming perspective | |
| Beeri et al. | Formal systems for tuple and equality generating dependencies | |
| Jean-Yves et al. | Efficient first order functional program interpreter with time bound certifications | |
| D’Antoni et al. | Forward bisimulations for nondeterministic symbolic finite automata | |
| Gonzalez et al. | Graph-based relational concept learning | |
| Jha et al. | Efficient type matching | |
| Palsberg et al. | Efficient and flexible matching of recursive types | |
| Smith | Aspects as invariants | |
| Goguen | Hidden algebra for software engineering | |
| Bille et al. | The tree inclusion problem: In optimal space and faster | |
| Ben-Amram et al. | Computational complexity via programming languages: constant factors do matter | |
| Giegerich et al. | Implementing algebraic dynamic programming in the functional and the imperative programming paradigm | |
| Bertoni et al. | Random generation and approximate counting of ambiguously described combinatorial structures | |
| MacCaull | A Proof System for Dependencies for Information Relations. | |
| Okubo et al. | Recent developments on reaction automata theory: A survey | |
| Braibant et al. | A tactic for deciding Kleene algebras | |
| Meyer | Proving pointer program properties. part 1: Context and overview | |
| Valnet et al. | Compositional Static Value Analysis for Higher-Order Numerical Programs | |
| Chu et al. | A formal approach for component retrieval and integration analysis | |
| Premtoon | Multi-language code search | |
| Bulwahn | Counterexample generation for higher-order logic using functional and logic programming | |
| Gómez-Rodríguez | Parsing schemata for practical text analysis | |
| Lesnik et al. | State Algebra for Propositional Logic | |
| Jones et al. | Domain-Theoretic Semantics for Functional Logic Programming | |
| Slepak | A Typed Programming Language: The Semantics of Rank Polymorphism |