Sciweavers

555 search results - page 70 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
CC
2004
Springer
163views System Software» more  CC 2004»
14 years 1 months ago
Declarative Composition of Stack Frames
When a compiler translates a procedure, it must lay out the procedure’s stack frame in a way that respects the calling convention. Many compilers respect the convention either by...
Christian Lindig, Norman Ramsey
EMISA
2004
Springer
14 years 1 months ago
On the Modeling of Correct Service Flows with BPEL4WS
: Frameworks for composing Web Services offer a promising approach for realizing enterprise-wide and cross-organizational business applications. With BPEL4WS a powerful composition...
Manfred Reichert, Stefanie Rinderle, Peter Dadam
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Efficient Automata-Based Assertion-Checker Synthesis of SEREs for Hardware Emulation
In this paper, we present a method for generating checker circuits from sequential-extended regular expressions (SEREs). Such sequences form the core of increasingly-used Assertion...
Marc Boule, Zeljko Zilic
AAAI
2007
13 years 10 months ago
Semantic Inference at the Lexical-Syntactic Level
Semantic inference is an important component in many natural language understanding applications. Classical approaches to semantic inference rely on complex logical representation...
Roy Bar-Haim, Ido Dagan, Iddo Greental, Eyal Shnar...
SDL
2001
73views Hardware» more  SDL 2001»
13 years 9 months ago
HyperMSCs with Connectors for Advanced Visual System Modelling and Testing
Experiences with the use of the MSC language for complex system specifications have shown that certain extensions are necessary in order to arrive at sufficiently transparent and m...
Jens Grabowski, Peter Graubmann, Ekkart Rudolph