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
From Well Structured Transition Systems to Program Verification
2020
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
Other Versions
We describe the use of the theory of WSTS for verifying programs. ...
The Abstract Interpretation [7] could be completed in the direction to produce WSTSs. ...
If M is strongly monotone for , we may use the WSTS theory. ...
doi:10.4204/eptcs.320.3
fatcat:ex6susvyvvajjpgy7vqstaoeaq
A Certified Denotational Abstract Interpreter
[chapter]
2010
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 2015; you can also visit the original URL.
The file type is application/pdf.
In contrast, abstract interpreters are looking for fixpoints in infinite lattices where widening and narrowing are used for accelerating the convergence. ...
In this paper, we show how we manage to program and prove correct in Coq an abstract interpreter that uses iteration strategies based on program syntax. ...
Lattice Theory Intermezzo Abstract Interpretation heavily relies on lattice theory to formalize semantic notions and approximation of properties. ...
doi:10.1007/978-3-642-14052-5_3
fatcat:spqaffa76bfzzkikywdk5ccu7u
On the Integration of Software Testing and Formal Analysis
[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.
Undergoing efforts include concolic execution, testing-based correctness prove, execution driven abstract interpretation and dynamic invariant generation. ...
In particular, this paper surveys the most promising approaches to combine dynamic testing and static program analysis. ...
The authors are solely responsible for the content of this paper. ...
doi:10.1007/978-3-642-25231-0_4
fatcat:no3u2cdsdjhx5oa67nix42xnf4
Finite state abstraction and formal methods for traffic flow networks
2016
2016 American Control Conference (ACC)
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 2016; you can also visit the original URL.
The file type is application/pdf.
Using properties of the mixed monotone dynamics, a finite state abstraction is efficiently computed by overapproximating the set of states that are one-step reachable under the traffic flow dynamics. ...
This tutorial paper exploits structural properties in a class of networked systems motivated by traffic flow networks to overcome some of these challenges and points towards new directions of research. ...
One Step Reachable Sets of Mixed Monotone Systems One of the most important properties of mixed monotone systems is that we are able to overapproximate reachable sets by evaluating the decomposition function ...
doi:10.1109/acc.2016.7525022
dblp:conf/amcc/CooganAB16
fatcat:rnmmzqkwczcx3pmg4izizg2lka
A minimalistic look at widening operators
[article]
2009
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
We consider the problem of formalizing the familiar notion of widening in abstract interpretation in higher-order logic. ...
In type systems supporting dependent products and sums, this tree can be made to reflect the condition of correct termination of the widening sequence. ...
Acknowledgments The author would like to thank the anonymous referees, whose suggestions greatly improved this article. This work was partially funded by ANR project "ASOPT". ...
arXiv:0902.3722v3
fatcat:qhyzx66llvb2fngvddjzesr2te
A minimalistic look at widening operators
2009
Higher-Order and Symbolic Computation
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.
We consider the problem of formalizing in higher-order logic the familiar notion of widening from abstract interpretation. ...
In type systems supporting dependent products and sums, this tree can be made to reflect the condition of correct termination of the widening sequence. * VERIMAG is a joint laboratory of CNRS, Université ...
Acknowledgments The author would like to thank the anonymous referees, whose suggestions greatly improved this article. This work was partially funded by ANR project "ASOPT". ...
doi:10.1007/s10990-009-9046-8
fatcat:53rl62mtpjfvfh5m3sjmk64one
Invariant Generation for Parametrized Systems Using Self-reflection
[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.
In our approach, the key enabler is the notion of a reflective abstraction that we prove has an important correspondence with inductive invariants. ...
The central challenge in invariant inference for parametrized systems is that naïvely exploding the transition system with all interleavings is not just impractical but impossible. ...
First, we briefly recall the theory of abstract interpretation [13, 14, 5] for finding inductive assertion maps as the fixed point of a monotone operator over an abstract domain. ...
doi:10.1007/978-3-642-33125-1_12
fatcat:til3cge7qrcs7mzwnrnwitq3cu
Delay-Bounded Scheduling Without Delay! (Extended Technical Report)
[article]
2021
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 2021; you can also visit the original URL.
The file type is application/pdf.
We consider the broad problem of analyzing safety properties of asynchronous concurrent programs under arbitrary thread interleavings. ...
In this paper we first present a technique to lift the delay bound for the case of finite-domain variable programs, thus adding to the efficiency of bug detection the ability to prove safety of programs ...
The translation is constructed such that, for any state s reachable in P, the abstract state α(s) is reachable in B. As a result, B can be used to prove safety properties for P. ...
arXiv:2105.07277v1
fatcat:j4dysqt3uve2tlkw47pe67i33a
Searching for points-to analysis
2002
Proceedings of the tenth ACM SIGSOFT symposium on Foundations of software engineering - SIGSOFT '02/FSE 10
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.
In this paper, we show how points-to analysis algorithms can be defined as transformed versions of an exact algorithm. ...
Our transformations are generic and may be useful in the design of other program analysis algorithms. ...
They also thank the reviewers of a previous version that appeared in the 2002 Symposium on Foundations of Software Engineering. Dave Schmidt also provided several insightful comments on this work. ...
doi:10.1145/587051.587061
dblp:conf/sigsoft/BrunsC02
fatcat:7i7cgclznrb4zbdn26n4v6arf4
Searching for points-to analysis
2003
IEEE Transactions on Software Engineering
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.
In this paper, we show how points-to analysis algorithms can be defined as transformed versions of an exact algorithm. ...
Our transformations are generic and may be useful in the design of other program analysis algorithms. ...
They also thank the reviewers of a previous version that appeared in the 2002 Symposium on Foundations of Software Engineering. Dave Schmidt also provided several insightful comments on this work. ...
doi:10.1109/tse.2003.1237170
fatcat:njgevnlid5h67mguz33vhn6tnu
Searching for points-to analysis
2002
Software engineering notes
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.
In this paper, we show how points-to analysis algorithms can be defined as transformed versions of an exact algorithm. ...
Our transformations are generic and may be useful in the design of other program analysis algorithms. ...
They also thank the reviewers of a previous version that appeared in the 2002 Symposium on Foundations of Software Engineering. Dave Schmidt also provided several insightful comments on this work. ...
doi:10.1145/605466.605476
fatcat:ioehnchrtjf2vaxjzomp6te7ve
Searching for points-to analysis
2002
Proceedings of the tenth ACM SIGSOFT symposium on Foundations of software engineering - SIGSOFT '02/FSE 10
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.
In this paper, we show how points-to analysis algorithms can be defined as transformed versions of an exact algorithm. ...
Our transformations are generic and may be useful in the design of other program analysis algorithms. ...
They also thank the reviewers of a previous version that appeared in the 2002 Symposium on Foundations of Software Engineering. Dave Schmidt also provided several insightful comments on this work. ...
doi:10.1145/587059.587061
fatcat:bvk4egazira45dsogt4qeodz4a
Algorithmic Analysis of Programs with Well Quasi-ordered Domains
2000
Information and Computation
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 safety properties can be reduced to the reachability problem. ...
We show that the following properties are decidable for well-structured systems: v Reachability: whether a certain set of control states is reachable. ...
I _ pre(X) in
2 In the abstract interpretation literature, a Galois insertion is defined as follows. ...
doi:10.1006/inco.1999.2843
fatcat:7vkbq4w2jje6hmosmsgomumcuy
Page 4504 of Mathematical Reviews Vol. , Issue 87h
[page]
1987
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In particular, it is not clear that by capturing the reachability-based properties the authors have indeed covered the main spatial properties of concurrent systems. ...
The presentation of the theory is very abstract, but not very clear, at least to the reviewer. Small (toy) examples do not help either. ...
Safe & robust reachability analysis of hybrid systems
2018
Theoretical 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
of the set of states reachable in finite time from a set of initial states. ...
First, we observe that, in this context, the usual definition of reachability - namely, the reflexive and transitive closure of a transition relation - can be unsafe, ie, it may compute a proper subset ...
Thus, we can exploit the universal property of the least prefix-point X for a monotonic map F , i.e., F (Y ) ≤ Y =⇒ X ≤ Y . ...
doi:10.1016/j.tcs.2018.06.020
fatcat:wdylpcldh5arpfroufp2mwbrmy
« Previous
Showing results 1 — 15 out of 5,168 results