Results 41 to 50 of about 6,025 (211)
Open Bisimulation for Aspects [PDF]
Proceedings of the 6th international conference on Aspect-oriented software development, 2007 We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive reasoning principles aimed at proving equality of aspect programs. The language we study is very small, yet powerful enough to encode mutable references and a range of ...
Radha Jagadeesan +2 more
openaire +2 more sources
CCS Dynamic Bisimulation is Progressing
, 1991 Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still woc, e.g.\ $\alpha.\tau.\beta.nil$ and $\alpha.\beta.nil$ are woc but $\tau ...
Montanari, U., Sassone, V.
core +2 more sources
Improved Efficiency of Object Code Verification Using Statically Abstracted Object Code
Scientific Programming, Volume 2020, Issue 1, 2020., 2020 One of the major challenges in the formal verification of embedded system software is the complexity and substantially large size of the implementation. The problem becomes crucial when the embedded system is a complex medical device that is executing convoluted algorithms.
N. Shaukat +4 more
wiley +1 more source
Games for Bisimulations and Abstraction [PDF]
Logical Methods in Computer Science, 2017 Weak bisimulations are typically used in process algebras where silent steps are used to abstract from internal behaviours. They facilitate relating implementations to specifications. When an implementation fails to conform to its specification, pinpointing the root cause can be challenging.
David de Frutos-Escrig +2 more
openaire +8 more sources
Open Ended Systems, Dynamic Bisimulation, and Tile Logic
, 2000 The SOS formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to characterize the coarsest congruence for CCS which is also a (weak) bisimulation ...
Bruni, R., Montanari, U., Sassone, V.
core +2 more sources
Journal of Advanced Transportation, Volume 2020, Issue 1, 2020., 2020 CADS (cooperative autonomous driving systems) are software‐intensive and safety‐critical reactive systems and give great promise to our daily life, but system errors may not be identified in the design stage until the implement stage, and the cost to correct them will be more expensive later than the early stage.
Jinyong Wang +5 more
wiley +1 more source
Mathematics, 2021 The coalgebraic method is of great significance to research in process algebra, modal logic, object-oriented design and component-based software engineering.
Ai Liu +3 more
doaj +1 more source
A Calculus of Mobile Resources
, 2002 We introduce a calculus of Mobile Resources (MR) tailored for the design and analysis of systems containing mobile, possibly nested, computing devices that may have resource and access constraints, and which are not copyable nor modifiable per se.
Godskesen, J.Chr. +8 more
core +2 more sources
Theoretical Computer Science, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthew Hennessy, Huimin Lin
openaire +1 more source
Possibilistic Cost Computation Tree Logic and Related Equivalence, Abstraction Technique
IEEE Access, 2023 Recently, probabilistic Kripke structures have been used to represent uncertain systems; nevertheless, important transition costs were ignored in earlier studies, making it impossible to model some uncertain systems with costs.
Hui Deng, Yuzhe Zhang, Zhilong Huang
doaj +1 more source