Sciweavers

4224 search results - page 216 / 845
» Reasoning about Choice
Sort
View
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
14 years 2 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko
TLDI
2010
ACM
210views Formal Methods» more  TLDI 2010»
16 years 4 months ago
Effects for cooperable and serializable threads
Reasoning about the correctness of multithreaded programs is complicated by the potential for unexpected interference between threads. Previous work on controlling thread interfer...
Jaeheon Yi, Cormac Flanagan
LPNMR
2005
Springer
16 years 20 days ago
Revisiting the Semantics of Interval Probabilistic Logic Programs
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
Alex Dekhtyar, Michael I. Dekhtyar
AAAI
2000
15 years 8 months ago
Qualitative Spatial Interpretation of Course-of-Action Diagrams
This paper demonstrates qualitative spatial reasoning techniques in a real-world diagrammatic reasoning task: Course-of-Action (COA) diagrams. COA diagrams are military planning d...
Ronald W. Ferguson, Robert A. Rasch Jr., William T...
BIRTHDAY
2004
Springer
16 years 17 days ago
Retracing the Semantics of CSP
CSP was originally introduced as a parallel programming language in which sequential imperative processes execute concurrently and communicate by synchronized input and output. The...
Stephen D. Brookes