Zobrazeno 1 - 10
of 245
pro vyhledávání: '"Merz, Stephan"'
TLA+ is a formal language for specifying systems, including distributed algorithms, that is supported by powerful verification tools. In this work we present a framework for relating traces of distributed programs to high-level specifications written
Externí odkaz:
http://arxiv.org/abs/2404.16075
Publikováno v:
Leveraging Applications of Formal Methods, Verification and Validation. 11th International Symposium, ISoLA 2022, 2022, Rhodes, Greece. pp.88-105
Using an algorithm due to Safra for distributed termination detection as a running example, we present the main tools for verifying specifications written in TLA+. Examining their complementary strengths and weaknesses, we suggest a workflow that sup
Externí odkaz:
http://arxiv.org/abs/2211.07216
Publikováno v:
In Theoretical Computer Science 9 January 2023 942:200-212
Comparing provers on a formalization of the same problem is always a valuable exercise. In this paper, we present the formal proof of correctness of a non-trivial algorithm from graph theory that was carried out in three proof assistants: Why3, Coq,
Externí odkaz:
http://arxiv.org/abs/1810.11979
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
Autor:
Merz, Stephan, Vanzetto, Hernán
We present an encoding of Zermelo-Fraenkel set theory into many-sorted first-order logic, the input language of state-of-the-art SMT solvers. This translation is the main component of a back-end prover based on SMT solvers in the TLA+ Proof System.
Externí odkaz:
http://arxiv.org/abs/1508.03838
Publikováno v:
Electronic Communications of the EASST, 2014, Automated Verification of Critical Systems 2014, 70, pp.14
Avoiding access conflicts is a major challenge in the design of multi-threaded programs. In the context of real-time systems, the absence of conflicts can be guaranteed by ensuring that no two potentially conflicting accesses are ever scheduled concu
Externí odkaz:
http://arxiv.org/abs/1412.0961
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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