Results 171 to 180 of about 150,251 (227)
Utility of [99mTc]Tc-tilmanocept, an immunosuppressive macrophage functional imaging agent in melanoma patients receiving checkpoint inhibitor treatment: a feasibility study. [PDF]
Cancer Immunol ImmunotherBoughdad S +8 more
europepmc +1 more source
TLA KRŠKIH POLJA I KRŠEVITA TLA LIKE
Agronomski glasnik : Glasilo Hrvatskog agronomskog društva, 1996 openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Verifying Hyperproperties With TLA
2021 IEEE 34th Computer Security Foundations Symposium (CSF), 2021Hyperproperties generalize ordinary properties by expressing relations among multiple executions of a system. Self–composition has been used to reduce verifying that a system satisfies certain classes of Hyperproperties to verifying that a derived system satisfies an ordinary property.
Leslie Lamport, Fred B. Schneider
openaire +1 more source
Distributed Computing, 1999
We address the problem, proposed by Gerth, of verifying that a simplified version of the lazy caching algorithm of Afek, Brown, and Merritt is sequentially consistent. We specify the algorithm and sequential consistency in TLA+, a formal specification language based on TLA (the Temporal Logic of Actions).
Ladkin, Peter +3 more
openaire +2 more sources
We address the problem, proposed by Gerth, of verifying that a simplified version of the lazy caching algorithm of Afek, Brown, and Merritt is sequentially consistent. We specify the algorithm and sequential consistency in TLA+, a formal specification language based on TLA (the Temporal Logic of Actions).
Ladkin, Peter +3 more
openaire +2 more sources
2011 Fifth International Conference on Theoretical Aspects of Software Engineering, 2011
This paper introduces the Inverse Implementation method, that augments classical software development processes by a step of formal conformity verification. Our method is based on a formal model of the machine that executes programs of the chosen programming language. The model can automatically be combined with the code of a concrete program to gain a
Hannes Lau, Uwe Nestmann
openaire +1 more source
This paper introduces the Inverse Implementation method, that augments classical software development processes by a step of formal conformity verification. Our method is based on a formal model of the machine that executes programs of the chosen programming language. The model can automatically be combined with the code of a concrete program to gain a
Hannes Lau, Uwe Nestmann
openaire +1 more source
2014
TLA+ is a specification language, mainly intended for concurrent and distributed systems. Its non-temporal fragment is based on a variant of (untyped) ZF set theory. Motivated by the integration of the TLA+ Proof System with SMT solvers or similar tools based on multi-sorted first-order logic, we define a type system for TLA+ and we prove its soundness.
Merz, Stephan, Vanzetto, Hernán
openaire +1 more source
TLA+ is a specification language, mainly intended for concurrent and distributed systems. Its non-temporal fragment is based on a variant of (untyped) ZF set theory. Motivated by the integration of the TLA+ Proof System with SMT solvers or similar tools based on multi-sorted first-order logic, we define a type system for TLA+ and we prove its soundness.
Merz, Stephan, Vanzetto, Hernán
openaire +1 more source
1998
Reduction theorems allow one to deduce properties of a concurrent system specification from properties of a simpler, coarser-grained version called the reduced specification. We present reduction theorems based upon a more precise relation between the original and reduced specifications than earlier ones, permitting the use of reduction to reason about
Ernie Cohen, Leslie Lamport
openaire +1 more source
Reduction theorems allow one to deduce properties of a concurrent system specification from properties of a simpler, coarser-grained version called the reduced specification. We present reduction theorems based upon a more precise relation between the original and reduced specifications than earlier ones, permitting the use of reduction to reason about
Ernie Cohen, Leslie Lamport
openaire +1 more source
Proceedings of the 7th workshop on ACM SIGOPS European workshop Systems support for worldwide applications - EW 7, 1996
In this paper, we present a proposed system architecture for global computing that we call ATLAS, and we describe an early prototype that implements several of the mechanisms and policies that comprise the proposed architecture. ATLAS is designed to execute parallel multithreaded programs on the networked computing resources of the world.
J. Eric Baldeschwieler +2 more
openaire +1 more source
In this paper, we present a proposed system architecture for global computing that we call ATLAS, and we describe an early prototype that implements several of the mechanisms and policies that comprise the proposed architecture. ATLAS is designed to execute parallel multithreaded programs on the networked computing resources of the world.
J. Eric Baldeschwieler +2 more
openaire +1 more source