Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Formal methods: State of the art and future directions
Hardware and software systems will inevitably grow in scale and functionality. Because of
this increase in complexity, the likelihood of subtle errors is much greater. Moreover, some of …
this increase in complexity, the likelihood of subtle errors is much greater. Moreover, some of …
[KNIHA][B] Principles of cyber-physical systems
R Alur - 2015 - books.google.com
A foundational text that offers a rigorous introduction to the principles of design,
specification, modeling, and analysis of cyber-physical systems. A cyber-physical system …
specification, modeling, and analysis of cyber-physical systems. A cyber-physical system …
[KNIHA][B] The temporal logic of reactive and concurrent systems: specifications
Z Manna, A Pnueli - 1992 - books.google.com
Reactive systems are computing systems which are interactive, such as real-time systems,
operating systems, concurrent systems, control systems, etc. They are among the most …
operating systems, concurrent systems, control systems, etc. They are among the most …
The temporal logic of actions
L Lamport - ACM Transactions on Programming Languages and …, 1994 - dl.acm.org
The temporal logic of actions (TLA) is a logic for specifying and reasoning about concurrent
systems. Systems and their properties are represented in the same logic, so the assertion …
systems. Systems and their properties are represented in the same logic, so the assertion …
[KNIHA][B] Distributed computing: fundamentals, simulations, and advanced topics
* Comprehensive introduction to the fundamental results in the mathematical foundations of
distributed computing* Accompanied by supporting material, such as lecture notes and …
distributed computing* Accompanied by supporting material, such as lecture notes and …
[PDF][PDF] Software transactional memory
N Shavit, D Touitou - Proceedings of the fourteenth annual ACM …, 1995 - dl.acm.org
As we learn from the literature, flexibility in choosing synchroni~ ation operations greatly
simplifies the task of designing highly concurrent programs. Unfortunately, existing hardware …
simplifies the task of designing highly concurrent programs. Unfortunately, existing hardware …
Composition and behaviors of probabilistic I/O automata
We augment the I/O automaton model of Lynch and Tuttle with probability, as a step toward
the ultimate goal of obtaining a useful tool for specifying and reasoning about asynchronous …
the ultimate goal of obtaining a useful tool for specifying and reasoning about asynchronous …
The existence of refinement map**s
M Abadi, L Lamport - Theoretical Computer Science, 1991 - Elsevier
Refinement map**s are used to prove that a lower-level specification correctly implements
a higher-level one. We consider specifications consisting of a state machine (which may be …
a higher-level one. We consider specifications consisting of a state machine (which may be …
[KNIHA][B] Temporal verification of reactive systems: safety
Z Manna, A Pnueli - 2012 - books.google.com
This book is about the verification of reactive systems. A reactive system is a system that
maintains an ongoing interaction with its environment, as opposed to computing some final …
maintains an ongoing interaction with its environment, as opposed to computing some final …
Interface automata
Conventional type systems specify interfaces in terms of values and domains. We present a
light-weight formalism that captures the temporal aspects of software component interfaces …
light-weight formalism that captures the temporal aspects of software component interfaces …