Sciweavers

632 search results - page 105 / 127
» Explicit Substitutions and Programming Languages
Sort
View
FM
2006
Springer
113views Formal Methods» more  FM 2006»
13 years 11 months ago
Interface Input/Output Automata
We propose a new look at one of the most fundamental types of behavioral interfaces: discrete time specifications of communication--directly related to the work of de Alfaro and H...
Kim Guldstrand Larsen, Ulrik Nyman, Andrzej Wasows...
HIPEAC
2010
Springer
13 years 9 months ago
Computer Generation of Efficient Software Viterbi Decoders
This paper presents a program generator for fast software Viterbi decoders for arbitrary convolutional codes. The input to the generator is a specification of the code and a single...
Frédéric de Mesmay, Srinivas Chellap...
FORTE
2011
12 years 11 months ago
A Framework for Verifying Data-Centric Protocols
Abstract. Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They simplify greatly the code, whic...
Yuxin Deng, Stéphane Grumbach, Jean-Fran&cc...
COMPSAC
1997
IEEE
13 years 11 months ago
Classifying Architectural Elements as a Foundation for Mechanism Matching
Building a system at the architectural level can be thought of as decomposition into components followed by a series of exercises in matching. Components must be composed with eac...
Rick Kazman, Paul C. Clements, Leonard J. Bass, Gr...
SIGSOFT
2005
ACM
14 years 8 months ago
Strathcona example recommendation tool
Using the application programming interfaces (API) of large software systems requires developers to understand details about the interfaces that are often not explicitly defined. ...
Reid Holmes, Robert J. Walker, Gail C. Murphy