Filters








19,961 Hits in 5.5 sec

Modular Design and Verification of Distributed Adaptive Real-Time Systems Based on Refinements and Abstractions

Thomas Göthel, Verena Klös, Björn Bartels
2015 EAI Endorsed Transactions on Self-Adaptive Systems  
A promising way to cope with complexity in verifying large systems is to perform modular verification where components are verified separately.  ...  We enable the modular verification of functional and adaptation behaviour, respectively, based on the notion of process refinement in Timed CSP.  ...  We show how this idea can be modelled and used for refinementbased verification with Timed CSP in a modular and stepwise manner using automatic tool support.  ... 
doi:10.4108/sas.1.1.e5 fatcat:5kmrb67ogvhfjhi6dziivtdm2m

Modular Verification for a Class of PLTL Properties [chapter]

Pierre-Alain Masson, Hassan Mountassir, Jacques Julliand
2000 Lecture Notes in Computer Science  
We call such properties modular properties. We propose a modular decomposition based on the B refinement process.  ...  In order to deal with this problem, we define a strategy based on local verifications rather than on a global verification.  ...  Finally, we conclude this work and give some future directions of research. Modular Verification Principle of the Modular Verification The basic idea of the modular verification is simple.  ... 
doi:10.1007/3-540-40911-4_23 fatcat:2fo3bxhfijhfpmxudwy2etbdei

Ready-Simulation Is Not Ready to Express a Modular Refinement Relation [chapter]

Françoise Bellegarde, Jacques Julliand, Olga Kouchnarenko
2000 Lecture Notes in Computer Science  
The results of the paper allow us to build a bridge between the above view of the refinement and the notions of observability characterized as simulation relations by Milner, van Glabbeek, Bloom and others  ...  It makes sense to qualify the refinement relation as being modular.  ...  This allows us to keep the same refinement notion for both modular design and modular verification of reactive systems.  ... 
doi:10.1007/3-540-46428-x_19 fatcat:chwkrpcfrjcbnfhjkpqvrdfawm

Transition-Oriented Programming: Developing Verifiable Systems [article]

Yepeng Ding, Hiroyuki Sato
2020 arXiv   pre-print
Although formal verification has made significant progress over the past decades, the issue caused by the gulf between the system implementation and formal verification still has a huge cost.  ...  It is extremely challenging to develop verifiable systems that are regulated by formal specifications and checked by formal verification techniques in practice.  ...  verification in practice.  ... 
arXiv:2009.06029v2 fatcat:clfwy2itsfa7za5djhmvow3aa4

Discovering Empirical Theories of Modular Software Systems. An Algebraic Approach [chapter]

Nicola Angius, Petros Stefaneas
2016 Computing and Philosophy  
Empirical theories of computational systems are required to be modular, as modular are most software verification and testing activities.  ...  It is first argued that mathematical theories of programs are not able to provide predictions that are consistent with observed executions.  ...  Framework (NSRF) -Research Funding Program: THALES: Reinforcement of the interdisciplinary and/or inter-institutional research and innovation.  ... 
doi:10.1007/978-3-319-23291-1_7 fatcat:dsqxvydsbrg5jhb7hhsjhqe74e

Relaxing B Sharing Restrictions within CSP||B [chapter]

Arnaud Lanoix, Olga Kouchnarenko, Samuel Colin, Vincent Poirriez
2012 Lecture Notes in Computer Science  
We show that the inconsistencies in state sharing can be identified by translating the CSP controllers into B specifications and then using a more refined consistency checking process.  ...  To achieve this, we present a B-based solution for allowing architectures with B state sharing in the CSP B components.  ...  their refinement [23] , or modularization like in [24] .  ... 
doi:10.1007/978-3-642-30564-1_3 fatcat:6svlacn46jha7cn4qdbzmoxfs4

Modular reasoning about invariants over shared state with interposed data members

Stephanie Balzer, Thomas R. Gross
2010 Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification - PLPV '10  
We discuss the implications of member interposition for the modular verification of object invariants with an example.  ...  We have implemented the described modularization discipline and the mechanism of member interposition in the context of Rumer, a relationship-based programming language with support for contract specifications  ...  We also thank the annononymous reviewers for their detailed and insightful comments.  ... 
doi:10.1145/1707790.1707794 dblp:conf/plpv/BalzerG10 fatcat:opaqy7aogjajfdtlsky5yxu27y

Modular reasoning about invariants over shared state with interposed data members

Stephanie Balzer, Thomas R. Gross
2010 SIGPLAN notices  
We discuss the implications of member interposition for the modular verification of object invariants with an example.  ...  We have implemented the described modularization discipline and the mechanism of member interposition in the context of Rumer, a relationship-based programming language with support for contract specifications  ...  We also thank the annononymous reviewers for their detailed and insightful comments.  ... 
doi:10.1145/1816027.1816033 fatcat:q35bqxvntfdh3dzn4vlkmkbmmy

Progress of Concurrent Objects

Hongjin Liang, Xinyu Feng
2020 Foundations and Trends® in Programming Languages  
when verifying clients of the objects, we can soundly replace the concrete object implementations with their abstractions, achieving modular verification.  ...  However, they fail to describe how clients are affected, making it difficult to utilize them in layered and modular program verification.  ... 
doi:10.1561/2500000041 fatcat:5ko7v5ggmrdoddfqnv24w62g24

Modular Verification for Computer Security

Andrew W. Appel
2016 2016 IEEE 29th Computer Security Foundations Symposium (CSF)  
Here I explain some of the modularity principles that make these verifications possible.  ...  Several recent projects have demonstrated that formal, deductive functional-correctness verification is now possible for kernels, crypto, and compilers.  ...  The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of DARPA  ... 
doi:10.1109/csf.2016.8 dblp:conf/csfw/Appel16 fatcat:7667qxql2ne5dapggwi76wrryq

Towards Compositional Verification for Modular Robotic Systems

Rafael C. Cardoso, Louise A. Dennis, Marie Farrell, Michael Fisher, Matt Luckcuck
2020 Electronic Proceedings in Theoretical Computer Science  
We also discuss a way of defining confidence for the verification associated with each component.  ...  This paper discusses how to use compositional verification to integrate the various verification techniques that are applied to modular robotic software, using a First-Order Logic (FOL) contract that captures  ...  Our work also deals with several different levels of abstraction, but we tackle the use of compositional verification in modular systems.  ... 
doi:10.4204/eptcs.329.2 fatcat:4zvqzkb6xjhorlrfavrm4hgiae

Modular reasoning in the presence of event subtyping

Mehdi Bagherzadeh, Robert Dyer, Rex D. Fernando, José Sánchez, Hridesh Rajan
2015 Proceedings of the 14th International Conference on Modularity - MODULARITY 2015  
Event types paired with event specifications were shown to be effective in enabling modular reasoning about subjects and observers.  ...  Our refining relation is the inverse of the classical refining for blackbox specifications [31] and extends it to greybox specifications with control effect specifications.  ...  Acknowledgements We thank Modularity'15 reviewers. Bagherzadeh, Dyer and Rajan were partly supported by the NSF grant CCF-10-17334.  ... 
doi:10.1145/2724525.2724569 dblp:conf/aosd/Bagherzadeh0FSR15 fatcat:txgqzf2qz5ck5p4wvjkabgfmee

Modular Reasoning in the Presence of Event Subtyping [chapter]

Mehdi Bagherzadeh, Robert Dyer, Rex D. Fernando, José Sánchez, Hridesh Rajan
2016 Lecture Notes in Computer Science  
Event types paired with event specifications were shown to be effective in enabling modular reasoning about subjects and observers.  ...  Our refining relation is the inverse of the classical refining for blackbox specifications [31] and extends it to greybox specifications with control effect specifications.  ...  Acknowledgements We thank Modularity'15 reviewers. Bagherzadeh, Dyer and Rajan were partly supported by the NSF grant CCF-10-17334.  ... 
doi:10.1007/978-3-319-46969-0_5 fatcat:aoebgnexxfbrlmbisvcoytzuam

Mechanized verification of refinement [chapter]

Niels Maxetti
1995 Lecture Notes in Computer Science  
In some cases this is too restrictive and the verification technique proposed here is based on a more liberal notion where information about the environment is exploited.  ...  The verification technique is supported by a prototype tool for mechanizing 1) the axiomati~.ation of the design descriptions in the logic of an existing theorem prover~ and 2) the generation of proof  ...  At first glance, the verification technique does not seem only to be concerned with the observable part of the interface. This concern, however, is taken care of by the refinement mapping.  ... 
doi:10.1007/3-540-59047-1_49 fatcat:xy5jbk6imnantir7assivomhqq

Decomposing Verification Around End-User Features [chapter]

Kathi Fisler, Shriram Krishnamurthi
2008 Lecture Notes in Computer Science  
Such modules ameliorate some difficulties with conventional modular verification, such as property decomposition, while creating others, by contradicting assumptions that underlie most modular program  ...  The interplay between feature-oriented modules and verification raises some interesting challenges and opportunities.  ...  One of the main challenges in modular verification is the decomposition of properties to align with the program module's boundaries.  ... 
doi:10.1007/978-3-540-69149-5_10 fatcat:35dppiu5obdkrap2mwvlb2yrfy
« Previous Showing results 1 — 15 out of 19,961 results