Sciweavers

2291 search results - page 221 / 459
» Logic Programming and Model Checking
Sort
View
PLDI
2009
ACM
15 years 7 months ago
Progress guarantee for parallel programs via bounded lock-freedom
Parallel platforms are becoming ubiquitous with modern computing systems. Many parallel applications attempt to avoid locks in order to achieve high responsiveness, aid scalabilit...
Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaa...
IIE
2007
75views more  IIE 2007»
15 years 3 months ago
Program and Evaluation Planning Light: Planning in the Real World
Although there are many high-quality models for program and evaluation planning, these models are often too intensive to be used in situations when time and resources are scarce. A...
Justus J. Randolph, Pasi J. Eronen
ATAL
2010
Springer
15 years 4 months ago
Strategic planning for probabilistic games with incomplete information
Alternating-time Temporal Logic (ATL) [1] is used to reason about strategic abilities of agents. Aiming at strategies that can realistically be implemented in software, many varia...
Henning Schnoor
JANCL
2007
86views more  JANCL 2007»
15 years 3 months ago
Constructive knowledge: what agents can achieve under imperfect information
We propose a non-standard interpretation of Alternating-time Temporal Logic with imperfect information, for which no commonly accepted semantics has been proposed yet. Rather than ...
Wojciech Jamroga, Thomas Ågotnes
CAV
2009
Springer
209views Hardware» more  CAV 2009»
16 years 3 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...