Sciweavers

456 search results - page 59 / 92
» The Logical Execution Time Paradigm
Sort
View
CC
2009
Springer
142views System Software» more  CC 2009»
14 years 9 months ago
Extensible Proof-Producing Compilation
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...
Magnus O. Myreen, Konrad Slind, Michael J. C. Gord...
CSCLP
2005
Springer
14 years 2 months ago
Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
Thom W. Frühwirth
VTS
2003
IEEE
131views Hardware» more  VTS 2003»
14 years 2 months ago
Efficient Implication - Based Untestable Bridge Fault Identifier
: This paper presents a novel, low cost technique based on implications to identify untestable bridging faults in sequential circuits. Sequential symbolic simulation [1] is first p...
Manan Syal, Michael S. Hsiao, Kiran B. Doreswamy, ...
EUROMICRO
2000
IEEE
14 years 1 months ago
Task Assignment and Scheduling under Memory Constraints
Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constrain...
Radoslaw Szymanek, Krzysztof Kuchcinski
VLSID
1999
IEEE
122views VLSI» more  VLSID 1999»
14 years 1 months ago
Formal Verification of an ARM Processor
This paper presents a detailed description of the application of a formal verification methodology to an ARM processor. The processor, a hybrid between the ARM7 and the StrongARM ...
Vishnu A. Patankar, Alok Jain, Randal E. Bryant