Sciweavers

3470 search results - page 396 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
174
Voted
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
15 years 6 months ago
Reasoning over Networks by Symbolic Methods
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
Thomas Sturm
CORR
2011
Springer
170views Education» more  CORR 2011»
15 years 1 months ago
A Model for Coherent Distributed Memory For Race Condition Detection
—We present a new model for distributed shared memory systems, based on remote data accesses. Such features are offered by network interface cards that allow one-sided operations...
Franck Butelle, Camille Coti
TOOLS
1999
IEEE
15 years 11 months ago
Constraint Diagrams: A Step Beyond UML
The Unified Modeling Language (UML) is a set of notations for modelling object-oriented systems. It has become the de facto standard. Most of its notations are diagrammatic. An ex...
Joseph Gil, John Howse, Stuart Kent
RTSS
1998
IEEE
15 years 11 months ago
Symbolic Schedulability Analysis of Real-Time Systems
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities....
Hee-Hwan Kwak, Insup Lee, Anna Philippou, Jin-Youn...
157
Voted
ECOOP
1998
Springer
15 years 11 months ago
Predicate Dispatching: A Unified Theory of Dispatch
Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using logical implication between pr...
Michael D. Ernst, Craig S. Kaplan, Craig Chambers