Sciweavers

2106 search results - page 123 / 422
» Specifying C concepts
Sort
View
DIS
1998
Springer
14 years 2 months ago
Uniform Characterizations of Polynomial-Query Learnabilities
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara...
ALGORITHMICA
2002
83views more  ALGORITHMICA 2002»
13 years 10 months ago
A Tutorial for Designing Flexible Geometric Algorithms
The implementation of an algorithm is faced with the issues efficiency, flexibility, and ease-of-use. In this paper, we suggest a design concept that greatly increases the flexibi...
Vikas Kapoor, Dietmar Kühl, Alexander Wolff
DATE
2007
IEEE
85views Hardware» more  DATE 2007»
14 years 4 months ago
Timing simulation of interconnected AUTOSAR software-components
AUTOSAR is a recent specification initiative which focuses on a model-driven architecture like methodology for automotive applications. However, needed engineering steps, or how-t...
Matthias Krause, Oliver Bringmann, André He...
WCRE
2003
IEEE
14 years 3 months ago
Completeness of a Fact Extractor
The process of software reverse engineering commonly uses an extractor, which parses source code and extracts facts about the code. The level of detail in these facts varies from ...
Yuan Lin, Richard C. Holt, Andrew J. Malton
AISC
2010
Springer
14 years 3 months ago
Formal Proof of SCHUR Conjugate Function
Abstract. The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie gr...
Franck Butelle, Florent Hivert, Micaela Mayero, Fr...