Sciweavers

10707 search results - page 275 / 2142
» Designing executable abstractions
Sort
View
ISCAS
2003
IEEE
135views Hardware» more  ISCAS 2003»
15 years 12 months ago
Formal verification of LTL formulas for SystemC designs
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
Daniel Große, Rolf Drechsler
CAISE
1999
Springer
15 years 11 months ago
Design of Object Caching in a CORBA OTM System
Abstract. CORBA Object Transaction Monitors (OTM) refer to a middleware technology that enable the building of transactional, objectoriented information systems running in distribu...
Thomas Sandholm, Stefan Tai, Dirk Slama, Eamon Wal...
PERCOM
2004
ACM
16 years 6 months ago
PCOM - A Component System for Pervasive Computing
Applications in the Pervasive Computing domain are challenged by the dynamism in which their execution environment changes, e.g. due to user mobility. As a result, applications ha...
Christian Becker, Marcus Handte, Gregor Schiele, K...
ICCAD
2003
IEEE
188views Hardware» more  ICCAD 2003»
16 years 3 months ago
Communication-Aware Task Scheduling and Voltage Selection for Total Systems Energy Minimization
Abstract: In this paper, we present an interprocessor communication-aware task scheduling algorithm applicable to a multiprocessor system executing an application with dependent ta...
Girish Varatkar, Radu Marculescu
TPHOL
2009
IEEE
16 years 1 months ago
Formalising FinFuns - Generating Code for Functions as Data from Isabelle/HOL
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
Andreas Lochbihler