Sciweavers

5015 search results - page 413 / 1003
» Model Checking a Path
Sort
View
SPIN
2010
Springer
15 years 5 months ago
An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
Alexander Linden, Pierre Wolper
ACL
2010
15 years 4 months ago
Learning Lexicalized Reordering Models from Reordering Graphs
Lexicalized reordering models play a crucial role in phrase-based translation systems. They are usually learned from the word-aligned bilingual corpus by examining the reordering ...
Jinsong Su, Yang Liu, Yajuan Lü, Haitao Mi, Q...
LPNMR
2009
Springer
16 years 1 months ago
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
Jos de Bruijn, Stijn Heymans
SSS
2007
Springer
117views Control Systems» more  SSS 2007»
16 years 25 days ago
Distributed Synthesis of Fault-Tolerant Programs in the High Atomicity Model
In this paper, we concentrate on distributed algorithms for automated synthesis of fault-tolerant programs in the high atomicity model, where all processes can read and write all p...
Borzoo Bonakdarpour, Sandeep S. Kulkarni, Fuad Abu...
ICECCS
2005
IEEE
136views Hardware» more  ICECCS 2005»
16 years 10 days ago
Model-Based Design and Analysis of Permission-Based Security
To guarantee the security of computer systems, it is necessary to define security permissions to restrict the access to the systems’ resources. These permissions rely on certai...
Jan Jürjens, Markus Lehrhuber, Guido Wimmel