Sciweavers

3680 search results - page 438 / 736
» cases 2010
Sort
View
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
16 years 4 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
ICS
2010
Tsinghua U.
16 years 4 months ago
Game Theory with Costly Computation: Formulation and Application to Protocol Security
: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resu...
Joseph Y. Halpern, Rafael Pass
ESOP
2010
Springer
16 years 4 months ago
Faulty Logic: Reasoning about Fault Tolerant Programs
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...
Matthew L. Meola and David Walker
ESOP
2010
Springer
16 years 4 months ago
Generative Operational Semantics for Relaxed Memory Models
The specification of the Java Memory Model (JMM) is phrased in terms of acceptors of execution sequences rather than the standard generative view of operational semantics. This cre...
Radha Jagadeesan, Corin Pitcher and James Riely
SOFSEM
2010
Springer
16 years 4 months ago
Practically Applicable Formal Methods
Abstract. Formal methods are considered to be highly expensive. Therefore, they are currently applied almost only in high risk software development. In this paper, we show that for...
Jedrzej Fulara, Krzysztof Jakubczyk