Sciweavers

1894 search results - page 100 / 379
» A TLA Proof System
Sort
View
142
Voted
AMAST
2010
Springer
14 years 7 months ago
Matching Logic: An Alternative to Hoare/Floyd Logic
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
Grigore Rosu, Chucky Ellison, Wolfram Schulte
104
Voted
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
15 years 9 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
ICFEM
2007
Springer
15 years 4 months ago
Automating Refinement Checking in Probabilistic System Design
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
Carlos Gonzalia, Annabelle McIver
ESORICS
2007
Springer
15 years 4 months ago
Efficient Proving for Practical Distributed Access-Control Systems
We present a new technique for generating a formal proof that an access request satisfies accesscontrol policy, for use in logic-based access-control frameworks. Our approach is t...
Lujo Bauer, Scott Garriss, Michael K. Reiter
ICNP
2002
IEEE
15 years 5 months ago
A Lightweight, Robust P2P System to Handle Flash Crowds
Abstract— Internet flash crowds (a.k.a. hot spots) are a phenomenon that result from a sudden, unpredicted increase in an on-line object’s popularity. Currently, there is no e...
Angelos Stavrou, Dan Rubenstein, Sambit Sahu