Zobrazeno 1 - 10
of 220
pro vyhledávání: '"LAMPORT, LESLIE"'
Autor:
Bayer, Jonas, Benzmüller, Christoph, Buzzard, Kevin, David, Marco, Lamport, Leslie, Matiyasevich, Yuri, Paulson, Lawrence, Schleicher, Dierk, Stock, Benedikt, Zelmanov, Efim
Publikováno v:
Notices of the American Mathematical Society (January 2024), Vol. 71, No. 1, pp. 79-92
A proof is one of the most important concepts of mathematics. However, there is a striking difference between how a proof is defined in theory and how it is used in practice. This puts the unique status of mathematics as exact science into peril. Now
Externí odkaz:
http://arxiv.org/abs/2207.04779
Publikováno v:
EPTCS 310, 2019, pp. 50-62
We discuss the workflows supported by the TLA+ Toolbox to write and verify specifications. We focus on features that are useful in industry because its users are primarily engineers. Two features are novel in the scope of formal IDEs: CloudTLC connec
Externí odkaz:
http://arxiv.org/abs/1912.10633
Autor:
LAMPORT, LESLIE1
Publikováno v:
Communications of the ACM. Sep2022, Vol. 65 Issue 9, p58-66. 9p. 1 Color Photograph, 4 Charts.
Autor:
Lamport, Leslie, Palais, Richard
The Principle of the Glitch states that for any device which makes a discrete decision based upon a continuous range of possible inputs, there are inputs for which it will take arbitrarily long to reach a decision. The appropriate mathematical settin
Externí odkaz:
http://arxiv.org/abs/1704.01154
Autor:
Lamport, Leslie, Merz, Stephan
Auxiliary variables are often needed for verifying that an implementation is correct with respect to a higher-level specification. They augment the formal description of the implementation without changing its semantics--that is, the set of behaviors
Externí odkaz:
http://arxiv.org/abs/1703.05121
We present a syntactic abstraction method to reason about first-order modal logics by using theorem provers for standard first-order logic and for propositional modal logic.
Comment: appears in Automated Reasoning in Quantified Non-Classical Log
Comment: appears in Automated Reasoning in Quantified Non-Classical Log
Externí odkaz:
http://arxiv.org/abs/1409.3819
Autor:
Cousineau, Denis, Doligez, Damien, Lamport, Leslie, Merz, Stephan, Ricketts, Daniel, Vanzetto, Hernán
TLA+ is a specification language based on standard set theory and temporal logic that has constructs for hierarchical proofs. We describe how to write TLA+ proofs and check them with TLAPS, the TLA+ Proof System. We use Peterson's mutual exclusion al
Externí odkaz:
http://arxiv.org/abs/1208.5933
Publikováno v:
Fifth International Joint Conference on Automated Reasoning (IJCAR), Edinburgh : United Kingdom (2010)
TLAPS, the TLA+ proof system, is a platform for the development and mechanical verification of TLA+ proofs written in a declarative style requiring little background beyond elementary mathematics. The language supports hierarchical and non-linear pro
Externí odkaz:
http://arxiv.org/abs/1011.2560
Publikováno v:
Knowledge Exchange: Automated Provers and Proof Assistants (KEAPPA) (2008)
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 language and the PM support the incremental development and checking of
Externí odkaz:
http://arxiv.org/abs/0811.1914
Autor:
Gray, Jim, Lamport, Leslie
The distributed transaction commit problem requires reaching agreement on whether a transaction is committed or aborted. The classic Two-Phase Commit protocol blocks if the coordinator fails. Fault-tolerant consensus algorithms also reach agreement,
Externí odkaz:
http://arxiv.org/abs/cs/0408036