4959 search results - page 613 / 992 » Imperative Functional Programming |
160
Voted
TACAS
2005
Springer
16 years 8 days ago
2005
Springer
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
204
click to vote
AUSAI
2004
Springer
16 years 6 days ago
2004
Springer
The PolicyUpdater1 system is a fully-implemented access control system that provides policy evaluations as well as dynamic policy updates. These functions are achieved by the use o...
158
click to vote
CSL
2004
Springer
16 years 6 days ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
175
click to vote
ICALP
2004
Springer
16 years 5 days ago
2004
Springer
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
176
click to vote
ERLANG
2003
ACM
16 years 1 days ago
2003
ACM
We present a user-oriented description of features and characteristics of the High Performance Erlang (HiPE) native code compiler, which nowadays is part of Erlang/OTP. In particu...