Sciweavers

5255 search results - page 785 / 1051
» Formal Methods for Privacy
Sort
View
FORMATS
2005
Springer
16 years 4 days ago
Implementation of Timed Automata: An Issue of Semantics or Modeling?
Abstract. We examine to what extent implementation of timed automata can be achieved using the standard semantics and appropriate modeling, instead of introducing new semantics. We...
Karine Altisen, Stavros Tripakis
FORMATS
2005
Springer
16 years 4 days ago
Reachability Problems on Extended O-Minimal Hybrid Automata
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
Raffaella Gentilini
IFL
2005
Springer
155views Formal Methods» more  IFL 2005»
16 years 3 days ago
A Binding Scope Analysis for Generic Programs on Arrays
Performance of generic array programs crucially relies on program specialization wrt. shape information. Traditionally, this is done in a rather adhoc fashion by propagating all sh...
Clemens Grelck, Sven-Bodo Scholz, Alexander V. Sha...
IFL
2005
Springer
103views Formal Methods» more  IFL 2005»
16 years 3 days ago
The Implementation of iData
The iData Toolkit is a toolkit that allows programmers to create interactive, type-safe, dynamic web applications with state on a high level of abstraction. The key element of this...
Rinus Plasmeijer, Peter Achten
IFM
2005
Springer
16 years 3 days ago
A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
Héctor Ruíz Barradas, Didier Bert