Sciweavers

222 search results - page 24 / 45
» E-Matching with Free Variables
Sort
View
RTSS
1998
IEEE
13 years 12 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...
ICFP
1997
ACM
13 years 11 months ago
A Modular, Polyvariant, and Type-Based Closure Analysis
We observe that the principal typing property of a type system is the enabling technology for modularity and separate compilation [10]. We use this technology to formulate a modul...
Anindya Banerjee
LICS
1989
IEEE
13 years 11 months ago
Negation As Refutation
A refutation mechanism is introduced into logic programming, dual to the usual proof mechanism; then negation is treated via refutation. A four-valued logic is appropriate for the...
Melvin Fitting
DAC
1995
ACM
13 years 11 months ago
A Method for Finding Good Ashenhurst Decompositions and Its Application to FPGA Synthesis
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
Ted Stanion, Carl Sechen
CP
2008
Springer
13 years 9 months ago
A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules
This paper presents a global constraint that enforces rules written in a language based on arithmetic and first-order logic to hold among a set of objects. In a first step, the rul...
Mats Carlsson, Nicolas Beldiceanu, Julien Martin