Sciweavers

1491 search results - page 174 / 299
» Resource-Passing Concurrent Programming
Sort
View
TAPSOFT
1997
Springer
15 years 10 months ago
Inclusion Constraints over Non-empty Sets of Trees
Abstract. We present a new constraint system called INES. Its constraints are conjunctions of inclusions t1 t2 between rst-order terms (without set operators) which are interpreted...
Martin Müller, Joachim Niehren, Andreas Podel...
KR
1994
Springer
15 years 10 months ago
Modalities Over Actions, I. Model Theory
This paper analyzes a language for actions and the deontic modalities over actions -- i.e., the modalities permitted, forbidden and obligatory. The work is based on: (1) an action...
L. Thorne McCarty
FPL
2009
Springer
132views Hardware» more  FPL 2009»
15 years 10 months ago
Binary Synthesis with multiple memory banks targeting array references
High-Level Synthesis (HLS) is the field of transforming a high-level programming language, such as C, into a register transfer level(RTL) description of the design. In HLS, Binary...
Yosi Ben-Asher, Nadav Rotem
ATS
2004
IEEE
97views Hardware» more  ATS 2004»
15 years 10 months ago
Test Instruction Set (TIS) for High Level Self-Testing of CPU Cores
TIS (Test Instruction Set) is an instruction level technique for CPU core self-testing. This method is based on enhancing a CPU instruction set with test instructions. TIS replace...
Saeed Shamshiri, Hadi Esmaeilzadeh, Zainalabedin N...
ATVA
2006
Springer
160views Hardware» more  ATVA 2006»
15 years 10 months ago
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
Giorgio Delzanno, Javier Esparza, Jirí Srba