A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Enhancements of the bisimulation proof method
[chapter]
Advanced Topics in Bisimulation and Coinduction
Preserved Fulltext
substitutions) page 38 Conclusions, part I -Enhancements of the bisimulation proof methods: extremely useful * essential in π-calculus-like languages, higher-order languages -Various forms of enhancement ...
P , as the transitions are the same) Process abbreviations: a a. 0 P n P | . . . | P (n times) page 4 Enhancements of the bisimulation method: an example A property of replication !(a + b) ∼ !a | ! ...
Equivalence between the two machines ...
doi:10.1017/cbo9780511792588.007
fatcat:e6xito6k3bfhvohq5672rcj4e4
Bisimulation Proof Methods for Mobile Ambients
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We study the behavioural theory of Cardelli and Gordon's Mobile Ambients. ...
We also provide two up-to proof techniques that we use to prove a set of algebraic laws, including the perfect firewall equation. ...
Acknowledgements The authors would like to thank Vladimiro Sassone who spotted a problem in an early draft of the paper. The anonymous referees contributed useful comments. ...
doi:10.1007/3-540-45061-0_47
fatcat:ecsldwba6bcevb6farqhlfsr5a
Formal Methods for Systems Engineering Behavior Models
2008
IEEE Transactions on Industrial Informatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper thus aims at improving the verification practice in SE design: considering the widely-used model of EFFBDs (Enhanced Function Flow Block Diagrams), it formally establishes its syntax and behavioral ...
Safety analysis in Systems Engineering (SE) processes, as usually implemented, rarely relies on formal methods such as model checking since such techniques, however powerful and mature, are deemed too ...
For any EFFBD E with the semantics (S, s 0 , N , →) and a given k ∈ N, the following problem is decidable: ∀(A, C, I, ν) ∈ S, ∀A ∈ I, I(A) ≤ k Proof: Using proposition 5 and theorem 6, the proof is immediate ...
doi:10.1109/tii.2008.2008998
fatcat:bc47uv4ytbd4fothrs4edcw4ti
Globally Governed Session Semantics
2014
Logical Methods in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The difference between the governed and standard bisimulations only appears when more than two interleaved multiparty sessions exist. ...
The induced bisimulation is strictly more fine-grained than the standard session bisimulation. ...
The work has been partially sponsored by the Ocean Observatories Initiative, EPSRC EP/K011715/1, EP/K034413/1, EP/G015635/1 and EP/L00058X/1, and EU project FP7-612985 UpScale. ...
doi:10.2168/lmcs-10(4:20)2014
fatcat:kijoxsv4pvgwvggssmvy4fxaxi
On the Application of Formal Methods for Specifying and Verifying Distributed Protocols
2008
2008 Seventh IEEE International Symposium on Network Computing and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To the best of our knowledge, this is the first hands-on evaluation of the two models, and we view it as the cornerstone for a wider investigation of the strengths and weaknesses of the two methodologies ...
In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. ...
The choice of the protocol was made based on two facts: (a) the leader election problem is a fundamental problem in distributed computing and hence, an interesting problem to consider, and (b) the protocol ...
doi:10.1109/nca.2008.24
dblp:conf/nca/GelastouGP08
fatcat:yso6vcgy6jf4jdkhknm3kyqzd4
The Proof Technique of Unique Solutions of Contractions
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
represents an open problem. ...
In proofs of bisimilarity results, the bisimulation proof method has become predominant, particularly with the enhancements of the method provided by the so called 'up-to techniques' [29] . ...
doi:10.1007/978-3-319-25150-9_5
fatcat:kffsjhjj4rbjxkkao565f526oq
Stream Differential Equations: Specification Formats and Solution Methods
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Moreover, we describe in detail the connection between the so-called syntactic solution method and abstract GSOS. ...
Our focus is on the classification of different formats of stream differential equations, their solution methods, and the classes of streams they can define. ...
For all σ, we have: We conclude this section by an enhancement of the bisimulation proof method. The general result behind the soundness of this method is described in Section 9.3. ...
arXiv:1609.08367v1
fatcat:pwvidt3ubbfxdpsr2qqyyxs44m
On regions and zones for event-clock automata
2014
Formal methods in system design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This means in particular that regions do not form a time abstract bisimulation. ...
Then, we extend the classical notions of zones and DBMs to let them handle event clocks instead of plain clocks (as in timed automata) by introducing event zones and Event DBMs (EDBMs). ...
and the language inclusion problem (does L(A) ⊆ L(B) ?). ...
doi:10.1007/s10703-014-0212-1
fatcat:eperryv2braddi4o7izogrz2k4
A Junction Between State Based and Behavioural Specification
[chapter]
1999
Formal Methods for Open Object-Based Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Two of the dominant paradigms for formally describing and analysing 00 distributed systems are state based specification, e.g. Object-Z, and behavioural specification, e.g. process algebra. ...
This paper serves two purposes -firstly, it reviews the existing body of work on relating these two specification paradigms and secondly, it presents some new results on the topic. ...
, Maarten Steen and Ben Strulo. ...
doi:10.1007/978-0-387-35562-7_18
fatcat:4fqbndheevhrtn4uphcxkrxgym
Environmental Bisimulations for Higher-Order Languages
2007
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulation proof method with "up-to context" techniques, and (2) obtaining definitions and results that scale ...
context, as examples of possible enhancements of the associated bisimulation method. ...
We are grateful to Vassileios Koutavas: discussions with him in the initial development of this work were helpful in clarifying concepts. We would like also to thank Kohei Suenaga for comments. ...
doi:10.1109/lics.2007.17
dblp:conf/lics/SangiorgiKS07
fatcat:qgphe3yllrcj5g67z5d7gyykyi
Environmental bisimulations for higher-order languages
2011
ACM Transactions on Programming Languages and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulation proof method with "up-to context" techniques, and (2) obtaining definitions and results that scale ...
context, as examples of possible enhancements of the associated bisimulation method. ...
We are grateful to Vassileios Koutavas: discussions with him in the initial development of this work were helpful in clarifying concepts. We would like also to thank Kohei Suenaga for comments. ...
doi:10.1145/1889997.1890002
fatcat:6ca7e3evqvbg7enfp4i7hgjvxi
Tower Induction and Up-to Techniques for CCS with Fixed Points
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present a refinement of Pous' companion-based coinductive proof technique and apply it to CCS with general fixed points. ...
We show that relative bisimilarity is a congruence, a basic result implying soundness of bisimulation up to context. The entire development is constructively formalized in Coq. ...
Fortunately, there are several enhancements of the coinductive proof method, which mitigate these problems. ...
doi:10.1007/978-3-319-57418-9_17
fatcat:5oehvrfjgzbnria3scuejuli4e
Symbolic bisimulation for open and parameterized systems
2020
Proceedings of the 2020 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - PEPM 2020
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We prove that this algorithm terminates when the data domains are finite. Both algorithms use an SMT-solver as a basis to solve the proof obligations. ...
Then we propose two algorithms to check StrFH-Bisimulation: the first one requires a (user-defined) relation between the states of two finite OAs, and checks whether it is a StrFH-Bisimulation. ...
Acknowledgments This work is partially supported by the National Key Research and Development Project 2017YFB1001800, and the National Natural Science Foundation of China (61972150, 61572195, 61672229, ...
doi:10.1145/3372884.3373161
dblp:conf/pepm/HouM20
fatcat:kxvo3qshxnfevj35nbtg3q5xyu
Formal methods for the specification and design of real-time safety critical systems
1992
Journal of Systems and Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
This paper surveys formal methods for specifying, designing and verifying real-time systems, so as to improve their safety and reliability. ...
Computers control the planes we y on, monitor our health in hospitals and do our work in hazardous environments. ...
Pragmatics | Semi-automated proof and synthesis methods: A proof system, with perhaps some small examples to illustrate the method of proof, is not on its own su cient to make the proof system practically ...
doi:10.1016/0164-1212(92)90045-l
fatcat:zgh4zhmpjbbarecagzor3cxkh4
Presenting Distributive Laws
2015
Logical Methods in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
proof method. ...
They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural operational semantics and, more recently, also for enhancements of the bisimulation ...
More technically, it remains an open problem whether a converse of Proposition 5.1 holds. We intend to investigate this matter in future work. ...
doi:10.2168/lmcs-11(3:2)2015
fatcat:s4rlgr4wkrhsjde2hzwxnzicva
« Previous
Showing results 1 — 15 out of 766 results