4340 search results - page 285 / 868 » Formal Methods and Cryptography |
170
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
186
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as...
160
click to vote
ICFEM
2000
Springer
15 years 10 months ago
2000
Springer
Use Cases are a wide-spread informal method for specifying the requirements of a technical system in the early development phase. Z is a formal notation which aims to support, bes...
171
click to vote
IFL
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The paper presents several analyses to detect non-deterministic expressions in the parallel-functional language Eden. First, the need for the analysis is motivated, and t...
151
click to vote
IFL
2000
Springer
15 years 10 months ago
2000
Springer
Sac is a functional array processing language particularly designed with numerical applications in mind. In this field the runtime performance of programs critically depends on the...