作者: 結(jié)果 時(shí)間: 2025-3-21 21:54 作者: 蘆筍 時(shí)間: 2025-3-22 04:12 作者: innate 時(shí)間: 2025-3-22 07:15
Proof-Outlines for Threads in JavaWe introduce an assertional method for specifying and proving properties of the multi-threaded flow of control in Java. The method integrates in a modular manner reasoning about the shared-variable concurrency within one object and the communication of values between threads.作者: projectile 時(shí)間: 2025-3-22 09:05 作者: condescend 時(shí)間: 2025-3-22 14:16 作者: condescend 時(shí)間: 2025-3-22 20:30 作者: promote 時(shí)間: 2025-3-22 23:09 作者: Intersect 時(shí)間: 2025-3-23 05:19 作者: 夜晚 時(shí)間: 2025-3-23 08:25 作者: 不適當(dāng) 時(shí)間: 2025-3-23 12:03
Water Security in Tunisia: Debated Issues,currency is formalized and implemented. Concurrency is about communicating processes. We introduce an abstract formal way of representing communication among processes and we show how to refine this representation towards implementation. To this end, we present a formal model, Abstract Co-design Fin作者: 割讓 時(shí)間: 2025-3-23 16:39 作者: 貝雷帽 時(shí)間: 2025-3-23 18:27 作者: 殘暴 時(shí)間: 2025-3-24 00:11 作者: companion 時(shí)間: 2025-3-24 04:37
Leaders, Agents and Followers: An Assessmentology [.]. Initially, the project was focussed on developing an efficient model checker, called XMC [.], for value-passing CCS [.] and the modal mu-calculus [.] based on the XSB logic programming system [.]. We developed an optimizing compiler to translate specifications in a dialect of value-passin作者: 中世紀(jì) 時(shí)間: 2025-3-24 07:49 作者: BROW 時(shí)間: 2025-3-24 10:50 作者: 征稅 時(shí)間: 2025-3-24 16:14 作者: 形容詞 時(shí)間: 2025-3-24 21:26
https://doi.org/10.1007/978-3-642-68979-6f this class of automata, and show as a main result that any finite or infinite . accepted by a . is also acceptable by a stopwatch automaton. The consequences of this result are two-fold: firstly, it shows that the seemingly minor upgrade from timed automata to stopwatch automata immediately yields作者: Ballad 時(shí)間: 2025-3-24 23:47 作者: 蕨類 時(shí)間: 2025-3-25 04:41 作者: Commentary 時(shí)間: 2025-3-25 09:33
Artur Woll,Klaus Glaubitt,Hans-Bernd Sch?feristic finite automaton augmented with finitely many reversal-bounded counters (i.e. each counter can be incremented or decremented by 1 and tested for zero, but the number of times it can change mode from nondecreasing to nonincreasing and vice-versa is bounded by a constant, independent of the comp作者: 向下 時(shí)間: 2025-3-25 15:22 作者: 共同生活 時(shí)間: 2025-3-25 19:39
https://doi.org/10.1007/978-3-658-20429-7stems of agents that maintain their own private stores of information and that interact with each other by means of a synchronous communication mechanism that allows for the exchange of information. The semantics of the language, which is based on a generalisation of traditional failure semantics, i作者: 淡紫色花 時(shí)間: 2025-3-25 22:26 作者: ARIA 時(shí)間: 2025-3-26 01:25
CONCUR 2000 - Concurrency Theory978-3-540-44618-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 蹣跚 時(shí)間: 2025-3-26 05:20
https://doi.org/10.1007/978-981-19-3292-2 elements that do not fit the paradigm of pure mathematical reasoning. In this essay we argue that verification is part of an experimental paradigm in at least two senses. We submit that this observation has consequences for the ways in which we should research and apply formal methods.作者: 品牌 時(shí)間: 2025-3-26 12:30 作者: 以煙熏消毒 時(shí)間: 2025-3-26 14:59 作者: Licentious 時(shí)間: 2025-3-26 19:22 作者: moratorium 時(shí)間: 2025-3-26 22:49
https://doi.org/10.1007/978-3-531-18740-2h ensures that bisimilarity is a congruence when sufficient RPOs exist. Two examples - a simplified form of action calculi and term-rewriting - are given, for which it is shown that sufficient RPOs indeed exist. The thrust of this paper is, therefore, towards a general method for achieving useful behavioural congruence relations.作者: irritation 時(shí)間: 2025-3-27 03:05 作者: IDEAS 時(shí)間: 2025-3-27 08:25
Verification Using Tabled Logic Programmingcently, we have developed.In this tutorial, we describe the XMC system as well as the above developments. In addition, we outline the research efforts of the verification and the logic programming community that have been instrumental in these developments.作者: 小木槌 時(shí)間: 2025-3-27 12:44
Verifying Quantitative Properties of Continuous Probabilistic Timed Automataree Logic (PTCTL). Our method improves on the previously known techniques in that it allows the verification of . probability bounds, as opposed to qualitative properties which can only refer to bounds of probability 0 or 1.作者: 旋轉(zhuǎn)一周 時(shí)間: 2025-3-27 17:04 作者: 大方不好 時(shí)間: 2025-3-27 20:27
Deriving Bisimulation Congruences for Reactive Systemsh ensures that bisimilarity is a congruence when sufficient RPOs exist. Two examples - a simplified form of action calculi and term-rewriting - are given, for which it is shown that sufficient RPOs indeed exist. The thrust of this paper is, therefore, towards a general method for achieving useful behavioural congruence relations.作者: 外科醫(yī)生 時(shí)間: 2025-3-28 00:08 作者: Evocative 時(shí)間: 2025-3-28 03:30
Leaders, Agents and Followers: An Assessment The fusion system framework generalises a new process calculus called the π... We describe the π.-calculus, which is based on different process constructs to those of the π-calculus, and show that the generalisation from the calculus to the framework is simple. We compare the frameworks by studying examples.作者: pessimism 時(shí)間: 2025-3-28 08:39
Leaders, Agents and Followers: An Assessmentat both these problems, with specifications in CTL (CTL*), are 2EXPTIME-complete (resp. 3EXPTIME-complete). Thus, in a sense, reactive environments constitute a provably harder setting for the synthesis of open systems and controllers for them.作者: outer-ear 時(shí)間: 2025-3-28 10:29 作者: GILD 時(shí)間: 2025-3-28 18:19 作者: Parabola 時(shí)間: 2025-3-28 20:52
https://doi.org/10.1007/978-3-658-20429-7ism that allows for the exchange of information. The semantics of the language, which is based on a generalisation of traditional failure semantics, is shown to be fully-abstract with respect to observing of each terminating computation its final global store of information.作者: 有說服力 時(shí)間: 2025-3-29 01:22 作者: 涂掉 時(shí)間: 2025-3-29 06:35 作者: 六個(gè)才偏離 時(shí)間: 2025-3-29 10:13
Model Checking with Finite Complete Prefixes Is PSPACE-Completeemporal logics, including LTL, CTL, and CTL*, is PSPACE-complete in the size of a finite complete prefix of a 1-safe Petri net. This proof employs a class of 1-safe Petri nets for which it is easy to generate a finite complete prefix in polynomial time.作者: Fatten 時(shí)間: 2025-3-29 12:30
Process Spacesaces is the idea of abstract execution, which permits to set the precision and complexity of a system model by the amount of detail included in the execution model. Notwithstanding this generality, we show that process spaces admit several algebraic properties of practical significance.作者: Conflagration 時(shí)間: 2025-3-29 16:19 作者: insecticide 時(shí)間: 2025-3-29 20:06 作者: 免除責(zé)任 時(shí)間: 2025-3-30 00:54 作者: annexation 時(shí)間: 2025-3-30 05:31
Formal Models for Communication-Based Design processes and derived from a model (Co-design Finite State Machine (CFSM)) we have used in POLIS, a system for the design and verification of embedded systems. The design of communication protocols is presented as an example of the use of these formal models.作者: 名詞 時(shí)間: 2025-3-30 09:01 作者: 一夫一妻制 時(shí)間: 2025-3-30 14:30 作者: Carbon-Monoxide 時(shí)間: 2025-3-30 19:13
Programming Access Control: The K, Experienceifying and enforcing policies that control uses of resources and authorize migration and execution of processes. By means of a few programming examples, we illustrate the flexibility of the K. approach to support the specification of control policies and to guarantee their enforcement.作者: 光滑 時(shí)間: 2025-3-31 00:12 作者: 責(zé)怪 時(shí)間: 2025-3-31 01:08
https://doi.org/10.1007/978-981-19-3292-2s of these reductions. This decomposition of the verification task forms the basis of the Symbolic Analysis Laboratory (SAL), a framework for combining different analysis tools for transition systems via a common intermediate language. We demonstrate how symbolic analysis can be an effective methodology for combining deduction and exploration.作者: 琺瑯 時(shí)間: 2025-3-31 08:14
Leaders, Agents and Followers: An Assessmentifying and enforcing policies that control uses of resources and authorize migration and execution of processes. By means of a few programming examples, we illustrate the flexibility of the K. approach to support the specification of control policies and to guarantee their enforcement.作者: 親密 時(shí)間: 2025-3-31 10:49
Combining Theorem Proving and Model Checking through Symbolic Analysise case analysis usually defeats theorem proving. Combinations of the two techniques have been tried with varying degrees of success. We argue for a specific combination where theorem proving is used to reduce verification problems to finite-state form, and model checking is used to explore propertie作者: 英寸 時(shí)間: 2025-3-31 15:56
Verification Is Experimentation!nce. Although the practical application of such verification methods will always be limited by the underlying forms of combinatorial explosion, recent years have shown remarkable progress in computer aided formal verification. They are making formal verification a practical proposition for a growing
