Sciweavers

210 search results - page 5 / 42
» A Formal Theory of Key Conjuring
Sort
View
TOCL
2012
235views Formal Methods» more  TOCL 2012»
11 years 9 months ago
Topological and Simplicial Models of Identity Types
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
Benno van den Berg, Richard Garner
FM
2009
Springer
110views Formal Methods» more  FM 2009»
14 years 1 months ago
Reduced Execution Semantics of MPI: From Theory to Practice
Abstract: There is growing need to develop formal verification tools for Message Passing Interface (MPI) programs, to eliminate bugs such as deadlocks and local assertion violatio...
Sarvani S. Vakkalanka, Anh Vo, Ganesh Gopalakrishn...
MPC
2010
Springer
157views Mathematics» more  MPC 2010»
14 years 4 days ago
Formal Derivation of Concurrent Garbage Collectors
Concurrent garbage collectors are notoriously difficult to implement correctly. Previous approaches to the issue of producing correct collectors have mainly been based on posit-and...
Dusko Pavlovic, Peter Pepper, Douglas R. Smith
CORR
2007
Springer
141views Education» more  CORR 2007»
13 years 7 months ago
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
Stéphane Le Roux
IFIP
2010
Springer
13 years 2 months ago
Efficient Decision Procedures for Message Deducibility and Static Equivalence
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
Bruno Conchinha, David A. Basin, Carlos Caleiro