Sciweavers

3319 search results - page 611 / 664
» Subshifts, Languages and Logic
Sort
View
CONCUR
2000
Springer
15 years 4 months ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
FM
1999
Springer
107views Formal Methods» more  FM 1999»
15 years 4 months ago
A Formalization of Software Architecture
Software architecture addresses the high level specification, design and analysis of software systems. Formal models can provide essential underpinning for architectural descripti...
John Herbert, Bruno Dutertre, Robert A. Riemenschn...
89
Voted
ICLP
1999
Springer
15 years 4 months ago
Concurrency in Prolog Using Threads and a Shared Database
Concurrency in Logic Programming has received much attention in the past. One problem with many proposals, when applied to Prolog, is that they involve large modifications to the...
Manuel Carro, Manuel V. Hermenegildo
104
Voted
PEPM
1999
ACM
15 years 4 months ago
Declarative Aspect-Oriented Programming
Aspect-oriented programming addresses the problem that the implementation of some properties such as error handling and optimization tends to cross-cut the basic functionality. To...
Ralf Lämmel
ASAP
1997
IEEE
144views Hardware» more  ASAP 1997»
15 years 4 months ago
Automatic data mapping of signal processing applications
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...
Corinne Ancourt, Denis Barthou, Christophe Guettie...