Sciweavers

363 search results - page 43 / 73
» The SAT Phase Transition
Sort
View
ATAL
2005
Springer
14 years 2 months ago
Bounded model checking knowledge and branching time in synchronous multi-agent systems
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
Xiangyu Luo, Kaile Su, Abdul Sattar, Qingliang Che...
IGPL
2006
87views more  IGPL 2006»
13 years 8 months ago
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
Eli Shamir
WSCG
2004
138views more  WSCG 2004»
13 years 10 months ago
A Three-stage Conceptual Design Process Using Virtual Environments
A simple conceptual design process that runs in a virtual environment is described. The design process consists of three stages. In each of the first two stages used to create, an...
Frank-Lothar Krause, Martin Göbel, Alain Roge...
RTAS
2008
IEEE
14 years 2 months ago
Incorporating Resource Safety Verification to Executable Model-based Development for Embedded Systems
This paper formulates and illustrates the integration of resource safety verification into a design methodology for development of verified and robust real-time embedded systems. ...
Jianliang Yi, Honguk Woo, James C. Browne, Aloysiu...
CAV
2009
Springer
123views Hardware» more  CAV 2009»
14 years 15 days ago
On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure
We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisf...
David Monniaux