Sciweavers

1021 search results - page 42 / 205
» Pure Subtype Systems
Sort
View
CAV
2005
Springer
129views Hardware» more  CAV 2005»
14 years 1 months ago
Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
Roberto Sebastiani, Stefano Tonetta, Moshe Y. Vard...
DATE
2004
IEEE
135views Hardware» more  DATE 2004»
13 years 11 months ago
Quasi-Static Scheduling for Real-Time Systems with Hard and Soft Tasks
This report addresses the problem of scheduling for real-time systems that include both hard and soft tasks. In order to capture the relative importance of soft tasks and how the ...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
CONCUR
2007
Springer
14 years 1 months ago
Is Observational Congruence Axiomatisable in Equational Horn Logic?
It is well known that bisimulation on µ-expressions cannot be finitely axiomatised in equational logic. Complete axiomatisations such as those of Milner and Bloom/´Esik necessar...
Michael Mendler, Gerald Lüttgen
ALT
1994
Springer
13 years 12 months ago
Explanation-Based Reuse of Prolog Programs
This paper presents a method of extracting subprograms from background knowledge. Most studies on learning logic programs so far developed are mainly concerned with pure Prolog, so...
Yasuyuki Koga, Eiju Hirowatari, Setsuo Arikawa
ICC
2009
IEEE
13 years 5 months ago
OFDMA-TDD Networks with Busy Burst Enabled Grid-of-Beam Selection
Abstract--Interference aware user scheduling in fixed gridof-beam (GoB) transmission is envisaged to significantly benefit from the receiver initiated busy burst (BB) protocol. Fix...
Birendra Ghimire, Gunther Auer, Harald Haas