215 citations
- Microsoft (United States)US7 papers
- Johns Hopkins UniversityUS4 papers
- Massachusetts Institute of TechnologyUS3 papers
- Tel Aviv UniversityIL3 papers
- University of MichiganUS3 papers
- University of WashingtonUS3 papers
- Argonne National LaboratoryUS2 papers
- Microsoft Research (India)IN2 papers
- Stanford UniversityUS2 papers
- The University of SydneyAU2 papers
- University of California, BerkeleyUS2 papers
- University of ChicagoUS2 papers
5 papers · 1 filter
A Better Reduction Theorem for Store Buffers
Ernie Cohen, Norbert Schirmer
When verifying a concurrent program, it is usual to assume that memory is sequentially consistent. However, most modern multiprocessors depend on store buffering for efficiency, an…
A TLA+ Proof System
Kaustuv C. Chaudhuri, Damien Doligez, Leslie Lamport +1
We describe an extension to the TLA+ specification language with constructs for writing proofs and a proof environment, called the Proof Manager (PM), to checks those proofs. The l…
Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog
Andreas Blass, Yuri Gurevich
A natural liberalization of Datalog is used in the Distributed Knowledge Authorization Language (DKAL). We show that the expressive power of this liberal Datalog is that of existen…
One useful logic that defines its own truth
Andreas Blass, Yuri Gurevich
Existential fixed point logic (EFPL) is a natural fit for some applications, and the purpose of this talk is to attract attention to EFPL. The logic is also interesting in its own…
Generalizing Consistency and other Constraint Properties to Quantified Constraints
Lucas Bordeaux, Marco Cadoli, Toni Mancini
Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical constraints, because quantifier alternation makes the usual n…