A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
Abstraction Refinement-Based Verification of Timed Automata
2021
Zenodo
Preserved Fulltext
Formal methods are mathematical techniques that enable the rigorous specification and verification of hardware and software systems, typically in design time. ...
Model checking is an automatic formal verification technique that is based on exhaustive traversal of the design model's state space. ...
and verification of hardware and software systems, typically in design time. ...
doi:10.5281/zenodo.4759046
fatcat:3vrprqrhfjeknjjdn74uqoreo4
Software Model Checking for People Who Love Automata
[chapter]
2013
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.
In this expository paper, we use automata for software model checking in a new way. The starting point is to fix the alphabet: the set of statements of the given program. ...
We show how automata over the alphabet of statements can help to decompose the main problem in software model checking, which is to find the right abstraction of a program for a given correctness property ...
the statement form a Hoare triple) We will use the example to illustrate how automata can be used to infer this kind of partitioning automatically for a given verification task. ...
doi:10.1007/978-3-642-39799-8_2
fatcat:747u6glqwvapnlt4t2yp3l2w54
Abstraction Refinement Algorithms for Timed Automata
[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 2020; you can also visit the original URL.
The file type is application/pdf.
We implement this idea in two ways: an enumerative algorithm where a lazy abstraction approach is adopted, meaning that possibly different abstract domains are assigned to each exploration node; and a ...
must be taken into consideration in the abstraction so as to exclude a given spurious counterexample. ...
This approach, named CEGAR (counter-example guided abstraction refinement) [11] , was further developed and used, for instance, in software verification (BLAST [20] , SLAM [5] , ...). ...
doi:10.1007/978-3-030-25540-4_2
fatcat:5ju5dna3fbe3dpnbmzh5ks3fce
Abstraction Refinement Algorithms for Timed Automata
[article]
2019
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 2019; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1905.07365v2 fatcat:4x7jx47rzfcadofpzloiofwoemOther Versions
We implement this idea in two ways: an enumerative algorithm where a lazy abstraction approach is adopted, meaning that possibly different abstract domains are assigned to each exploration node; and a ...
must be taken into consideration in the abstraction so as to exclude a given spurious counterexample. ...
This approach, named CEGAR (counter-example guided abstraction refinement) [11] , was further developed and used, for instance, in software verification (BLAST [20] , SLAM [5] , ...). ...
arXiv:1905.07365v3
fatcat:s7nv5gs74nbnpclwnibokceseu
Modeling, Verification, and Testing Using Timed and Hybrid Automata
[chapter]
2009
Model-Based Design for Embedded 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.
This approach indeed can be thought of as a simulation-based verification approach. ...
Modeling is of course a task by itself, and probably the most crucial one, since it is a creative and to a large extent non-automatable task. • Exhaustive verification: We use the term exhaustive verification ...
to the numerous papers published on these topics, in addition to those referenced in our bibliography section. ...
doi:10.1201/9781420067859-c13
fatcat:ipdmb52ph5bjxir65x527fqj2u
String Analysis via Automata Manipulation with Logic Circuit Representation
[chapter]
2016
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.
In this paper, we propose a new string analysis method based on a scalable logic circuit representation for (nondeterministic) finite automata to support various string and automata manipulation operations ...
The two approaches exhibit distinct strengths and weaknesses. ...
Moreover, to convert a transition relation to a set of transition functions, we introduce n new input variables y for n = |s| and a new state variable z with initial value 1, and construct a new sequential ...
doi:10.1007/978-3-319-41528-4_13
fatcat:3crbgjhjz5bilahvwabjisuz6q
Automatic Verification of Real-Time Systems with Rich Data: An Overview
[chapter]
2012
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 2017; you can also visit the original URL.
The file type is application/pdf.
We present an overview of the results of the project "Beyond Timed Automata" of the Collaborative Research Center AVACS (Automatic Verification and Analysis of Complex Systems) during the period 2008-2011 ...
, which advances the automatic verification of high-level specifications of systems exhibiting the three dimensions of process behavior, complex infinite data, and continuous real-time-beyond the capabilities ...
This paper is a report of the work done in the project ...
doi:10.1007/978-3-642-29952-0_14
fatcat:tplffbonpngj7hsyxyhan5rm6m
Novel applications of cellular automata in computing and computational astrophysics
2019
Zenodo
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 2021; you can also visit the original URL.
The file type is application/pdf.
This project deals with the design and analysis of cellular automata for its use in solving matrix multiplication in sub-quadratic time, formal verification of artificial neural networks, the security ...
of cloud computing environments, and classifying null geodesics of charged black holes in polynomial time. ...
Acknowledgements Acknowledgements Authors would like to thank the anonymous referee for helpful suggestions. ...
doi:10.5281/zenodo.4923838
fatcat:hex2yqetvrfjtd2fmeifckvr2q
Modelling Urban Development with Geographical Information Systems and Cellular Automata
2010
Photogrammetric Record
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.
Batty, Xie, and Sun (1999) also developed a software program to implement a GIS-based cellular automata model to simulate urban dynamics. ...
The point data of spot elevations were interpolated in ArcGIS ™ using a linear interpolation technique, also incorporating data on water bodies and the coastline to generate a digital elevation model ( ...
along the railway line to Riverstone and Windsor. ...
doi:10.1111/j.1477-9730.2010.00593.x
fatcat:qtafjg5qq5cr7n4hbq7pktwqfy
Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461)
2013
Dagstuhl Reports
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.
The seminar brought together researchers working in rigorous software engineering, with a special focus on the interaction between synthesis and automated deduction. ...
This event was the first seminar of this kind and a kickoff of a series of seminars organised on rigorous systems engineering. ...
Using PIA for both data abstraction and a new form of counter abstraction, we reduce the parameterized problem to finite-state model checking. ...
doi:10.4230/dagrep.2.11.45
dblp:journals/dagstuhl-reports/BjornerCKM12
fatcat:gs36midqlvfhzky6v7ebawumtq
Traceability and model checking to support safety requirement verification
2014
Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering - FSE 2014
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.
Ensuring safety-critical software safety requires strict verification of the conformance between safety requirements and programs. ...
First, a formal language for specifying software safety requirements which are relevant to event sequences is introduced. ...
A formal language, which is event-driven and state-of-art, fits the above features.
Event Automata I introduce a formal language called Event Automata (EA) to specify software safety requirements. ...
doi:10.1145/2635868.2666606
dblp:conf/sigsoft/Kan14
fatcat:zhbqidyqgzerfdz6hqvqnllw4m
Machine Learning for Dynamic Software Analysis: Potentials and Limits (Dagstuhl Seminar 16172)
2016
Dagstuhl Reports
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.
The organisers would like to express their gratitude to the participants and the Schloss Dagstuhl team for a productive and exciting seminar.
Learning and Testing ...
A second approach would be to start from individual automata of each component and then learn mediator models that allow the composition of the individual automata. ...
Are there similarities between learning automata and logic-based learning that can be exploited to allow synergisms between the two types of ML approaches in the context of software analysis. ...
doi:10.4230/dagrep.6.4.161
dblp:journals/dagstuhl-reports/BennaceurGHM16
fatcat:7t3jl5y7dfanfjeev3k42nmfau
Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction
[article]
2020
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.
We propose a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs. ...
All of the algorithms proposed have been implemented and we have conducted a series of experiments, comparing the performance of our new approach to state-of-the-art tools in classical reachability, robustness ...
The research was partially funded by Innovation Fund Denmark center DiCyPS and ERC Advanced Grant LASSO. ...
arXiv:2007.10539v1
fatcat:lqjg7eppwfdrzii2zc2ckp2jxm
Predicate Analysis with BLAST 2.7
[chapter]
2012
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.
The paper overviews the tool and outlines our contribution to it. ...
We present the software verification tool BLAST 2.7, which we submitted for the Competition on Software Verification. ...
A number of people contributed to BLAST, including its former maintainers Dirk Beyer, Rupak Majumdar, Ranjit Jhala, and Thomas Henzinger, and the others mentioned in the README file. ...
doi:10.1007/978-3-642-28756-5_39
fatcat:q4vc4v4dx5ceva3dhf2vbrxvee
Automated Hypersafety Verification
[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 2020; you can also visit the original URL.
The file type is application/pdf.
We propose an algorithm based on a counterexampleguided refinement loop that simultaneously searches for a reduction and a proof of the correctness for the reduction. ...
We propose an automated verification technique for hypersafety properties, which express sets of valid interrelations between multiple finite runs of a program. ...
This paper proposes an approach to automatically reduce verification of k-safety to verification of 1-safety, and hence a way to leverage existing safety verification techniques for hypersafety verification ...
doi:10.1007/978-3-030-25540-4_11
fatcat:zecykuzxpberxkpva27ac7okvy
« Previous
Showing results 1 — 15 out of 582 results