Sciweavers

8766 search results - page 1280 / 1754
» Functional logic programming
Sort
View
120
Voted
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
15 years 10 months ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
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...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko
ICALP
2004
Springer
15 years 10 months ago
Deciding Knowledge in Security Protocols Under Equational Theories
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...
Martín Abadi, Véronique Cortier
147
Voted
ERLANG
2003
ACM
15 years 10 months ago
All you wanted to know about the HiPE compiler: (but might have been afraid to ask)
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...
Konstantinos F. Sagonas, Mikael Pettersson, Richar...
FCT
2003
Springer
15 years 10 months ago
Membrane Computing
: In this paper a comparison is provided between the membrane computing systems and the graphical interfaces of operating systems. A membrane computing system is a computing model ...
Gheorghe Paun
ECCV
2010
Springer
15 years 10 months ago
MRF Inference by k-Fan Decomposition and Tight Lagrangian Relaxation
We present a novel dual decomposition approach to MAP inference with highly connected discrete graphical models. Decompositions into cyclic k-fan structured subproblems are shown t...
« Prev « First page 1280 / 1754 Last » Next »