A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Filters
Automatic Synthesis of Assumptions for Compositional Model Checking
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
We present a new technique for automatically synthesizing the assumptions needed in compositional model checking. ...
The model checker can therefore apply compositional reasoning without risking an exponential penalty for computing A. ...
Compositional model checking considers the composition M A instead of the full system M N . ...
doi:10.1007/11888116_12
fatcat:gtuq6jddnbh2tlipmrzpka2rre
Distributed Mils (D-Mils) Specification, Analysis, Deployment, And Assurance Of Distributed Critical Systems
2015
International Conference on High Performance Embedded Architectures and Compilers
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.
for compositional GSN assurance cases n Synthesis of MILS component configuration data for target components n Operational D-MILS Platform (distributed LynxSecure separation kernel running over TTEthernet ...
MILS-AADL dialect n Parser for MILS-AADL n Transformations of MILS-AADL for verification and configuration n Compositional verification framework for MILS-AADL models n Foundations and tool support ...
Demonstrator: fortiss Smart Microgrid Automatic generation of invariants ...
doi:10.5281/zenodo.47985
dblp:conf/hipeac/RuessT15
fatcat:ovbvzpwbarh5dmeckjxa3ru2e4
Compositional Verification of a Switch Fabric from Nortel Networks
[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 2005; you can also visit the original URL.
The file type is application/pdf.
Model checking is a fully automatic approach to verify a finite state machine against its temporal specifications. However, its application is limited by the size of the system to be verified. ...
In case a module under verification is beyond the capability of model checking, the proposed model reduction algorithm is used. ...
Compositional Verification and Environment Synthesis Compositional verification has been proposed for some time as an efficient way to address the state space explosion problem in model checking. ...
doi:10.1007/978-3-540-39893-6_32
fatcat:dmjib37tynfcxaxxipdler5sw4
Safe design method of embedded control systems. Case study
2013
Journal Europeen des Systemes Automatises
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.
This paper proposes an approach for safe design of hardware embedded control systems. The approach is based on a combination of formal verification and discrete controller synthesis techniques. ...
It automatically produces control code, which is assembled to the erroneous component in order to provide a system correct by construction with respect to the specification to enforce. ...
The method uses model checking in synergy with Discrete Controller Synthesis for automatically finding and automatically correcting design errors respectively. ...
doi:10.3166/jesa.47.403-421
fatcat:7demetzazveatnppyeg42vn3km
STV+AGR: Towards Practical Verification of Strategic Ability Using Assume-Guarantee Reasoning
[article]
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
We present a substantially expanded version of our tool STV for strategy synthesis and verification of strategic abilities. ...
The new version provides a web interface and support for assume-guarantee verification of multi-agent systems. ...
Acknowledgement The authors thank Witold Pazderski and Yan Kim for assistance with the web interface. ...
arXiv:2203.01033v1
fatcat:2rruq23ginayhg3kxvzwnqcbaa
Synthesizing Service Composition Models on the Basis of Temporal Business Rules
2008
Journal of Computer Science and Technology
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 2009; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a framework and associated techniques to generate the process model of a service composition from a set of temporal business rules. ...
Dedicated techniques including pathfinding, branching structure identification and parallel structure identification are used for semi-automatically synthesizing the process model from the semantics-equivalent ...
Conclusion In this paper, we present a framework and associated techniques to semi-automatically synthesis service composition process models from temporal business rules. ...
doi:10.1007/s11390-008-9196-x
fatcat:br256bi5inf6divuhjkthk2kry
Integrating formal verification and high-level processor pipeline synthesis
2011
2011 IEEE 9th Symposium on Application Specific Processors (SASP)
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.
Well known compositional model checking techniques are automatically applied to curtail state explosion during model checking. ...
As an integral part of the pipeline synthesis, our framework also emits SMV models for checking the functional equivalence between the output pipelined processor implementation and its input non-pipelined ...
Clarke from School of Computer Science at Carnegie Mellon, Scott Robinson from Intel, and our colleagues in the Computer Architecture Lab at Carnegie Mellon for their interaction and feedback. ...
doi:10.1109/sasp.2011.5941073
dblp:conf/sasp/NurvitadhiHKL11
fatcat:xrnee2lta5eexexddvf5ndr2di
Automatic Synthesis of Distributed Protocols
2017
ACM SIGACT News
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.
model of the environment, and given a set of safety and liveness requirements, find a completion of the FSMs for the processes such that the composition satisfies all the requirements. ...
In model checking, a given model of the distributed protocol is checked against its correctness requirements specified in temporal logic. ...
Special thanks go to Christos Stergiou for his invaluable help with modeling the alternating bit protocol and using the distributed protocol completion tool, as well as for implementing additional functionality ...
doi:10.1145/3061640.3061652
fatcat:qgpyesxc3jcrfaztpag4zqb4e4
Contract-Based Requirement Modularization via Synthesis of Correct Decompositions
2016
ACM Transactions on Embedded Computing 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 2018; you can also visit the original URL.
The file type is application/pdf.
This is an instance of the classical synthesis problems: "can we construct a model that satisfies some given specification?" ...
This is an instance of the classical synthesis problems: "can we construct a model that satisfies some given specification?" ...
Checking whether the decomposition is right (using a tool that can do so automatically), the developer notices that the composition 1≤i≤n C i (which we shall define precisely in the next section) does ...
doi:10.1145/2885752
fatcat:q426vvvssja3lix42jz35tg54i
Component Verification with Automatically Generated Assumptions
2005
Automated Software Engineering : An International Journal
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 2006; you can also visit the original URL.
The file type is application/pdf.
When checking a component against a property, our modified model checking algorithms return one of the following three results: the component satisfies a property for any environment; the component violates ...
The typical approach to verifying properties of software components is to check them for all possible environments. ...
Acknowledgements The authors wish to thank Klaus Havelund for providing descriptions and the Promela model for the Remote Agent case study. ...
doi:10.1007/s10515-005-2641-y
fatcat:c3eux6ifs5bipccdhpz5bxanm4
Learning-Based Assume-Guarantee Verification (Tool Paper)
[chapter]
2005
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 2009; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements We thank Howard Barringer and Jamieson Cobleigh for their contributions to our techniques and Sagar Chaki for helping with the Magic integration. ...
-) automatic way by code synthesis). ...
Assume-guarantee rules that property P holds for the composition of two models M 1 and M 2 . ...
doi:10.1007/11537328_24
fatcat:pkc3xi6uwbgyvfokbmllmwjn4u
Machine-Assisted Parameter Synthesis of the Biphase Mark Protocol Using Event Order Abstraction
[chapter]
2009
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 2011; you can also visit the original URL.
The file type is application/pdf.
Safety property verification of the protocol by a conventional untimed model-checker under the condition that "bad" event orders do not occur; and 2. ...
Though the user has to provide information about bad event orders, the rest of the synthesis process is automated. ...
Acknowledgment: First of all, I thank my supervisor, Prof. Nancy Lynch, for her patient guidance and fruitful advice on this research work. I also thank anonymous reviews for their helpful comments. ...
doi:10.1007/978-3-642-04368-0_20
fatcat:3wy7yv4wizgyneyn77vc3dktbe
COMPASS 3.0
[chapter]
2019
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.
New features include Timed Failure Propagation Graphs, contract-based analysis, hierarchical fault tree generation, probabilistic analysis of non-deterministic models and statistical model checking. ...
COMPASS (COrrectness, Modeling and Performance of AeroSpace Systems) is an international research effort aiming to ensure system-level correctness, safety, dependability and performability of onboard computer-based ...
COMPASS 3.0 supports three kinds of analyses based on TFPGs: synthesis, where a TFPG is automatically derived from the model, behavioral validation, which checks whether a given TFPG is complete (i.e., ...
doi:10.1007/978-3-030-17462-0_25
fatcat:whgtgnwptfa5xo7lokmhctbn6m
Synthesis of correct adaptors for protocol enhancement in component-based systems
[article]
2015
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
Taking into account the specification of the system to be assembled and the specification of the protocol enhancements, our tool (called SYNTHESIS) automatically derives, in a compositional way, the glue ...
code for the set of components. ...
In other words, our approach is compositional in the automatic synthesis of the enhanced glue code. ...
arXiv:1504.07504v2
fatcat:lhh23lev6jdvdpwj6zgzm4gnui
Combining Induction, Deduction, and Structure for Verification and Synthesis
2015
Proceedings of the IEEE
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.
We present a formalization of such an integration, show how it can tackle hard problems in verification and synthesis, and outline directions for future work. ...
Chief amongst these are environment modeling, incompleteness in specifications, and the hardness of underlying decision problems. ...
Acknowledgments This article is a result of ideas synthesized and verified (!) over many years in collaboration with several students and colleagues. ...
doi:10.1109/jproc.2015.2471838
fatcat:cfj3tcy3njg3debcuxzqjye2ii
« Previous
Showing results 1 — 15 out of 30,561 results