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
Software Model-Checking as Cyclic-Proof Search
[article]
2021
arXiv
pre-print
Preserved Fulltext
This paper shows that a variety of software model-checking algorithms can be seen as proof-search strategies for a non-standard proof system, known as a cyclic proof system. ...
Our use of the cyclic proof system as a logical foundation of software model checking enables us to compare different algorithms, to reconstruct well-known algorithms from a few simple principles, and ...
BASIC NOTIONS OF SOFTWARE MODEL-CHECKING
The Goal Sequent As the first step to establish a connection between software model-checking and cyclic-proof search, this section describes the goal sequent ...
arXiv:2111.05617v1
fatcat:vwvtp7mno5ey7i557wmeoed3hm
The Key System: Integrating Object-Oriented Design and Formal Methods
[chapter]
2002
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 2003; you can also visit the original URL.
The file type is application/pdf.
This paper gives a brief description of the KeY system, a tool written as part of the ongoing KeY project 1 , which is aimed at bridging the gap between (a) OO software engineering methods and tools and ...
More precisely, we confine ourselves to the subset of Java known as Java Card. -Through direct contacts with software companies we check the soundness of our approach for real world applications. ...
Even worse, to make serious use of many tools, intimate knowledge of employed logic calculi and proof search strategies is necessary. ...
doi:10.1007/3-540-45923-5_23
fatcat:7s5ubpggurd5ln2su5emkpic2u
ActionScript bytecode verification with co-logic programming
2009
Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security - PLAS '09
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.
Our experience with co-logic programming indicates that it is an extremely useful paradigm for elegantly expressing algorithms that lie at the heart of model-checking technologies. ...
While important, these systems do not address certain significant practical issues, such as state space explosion, that typically arise when model-checking real software systems. ...
LTL underpins many modern software model checking technologies, and allows us to conveniently draw upon existing techniques from the field. ...
doi:10.1145/1554339.1554342
dblp:conf/pldi/DeVriesGHMS09
fatcat:gkclucx7hvesnkev32kkcc64pe
Modeling and Validation of a Software Architecture for the Ariane-5 Launcher
[chapter]
2006
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.
: a model of the Ariane-5 flight software obtained by manual reverse engineering. ...
The study is also a proof of concept for the UML-based validation technique proposed in IFx. † Work performed while at VERIMAG. ...
The model-checking phase is the main validation phase, in which the product space of the relevant part of the model and of a set of observers is searched for absence of error states, while avoiding the ...
doi:10.1007/11768869_6
fatcat:vh3snu3qebbrbebaqqlhpvkfme
RECORD MAINTENANCE AND SECURE PRESERVING OF SHARED DATA IN PUBLIC AUDITING
2015
International Journal of Research in Engineering 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 2020; you can also visit the original URL.
The file type is application/pdf.
Here we are using ring signatures for providing hash values and also to check the hash values where the data canbe divided into number of blocks. ...
Integrity Threats In this model the software or hardware failures and human errors can be corrupted. ...
users are cyclic. ...
doi:10.15623/ijret.2015.0417019
fatcat:i3jqlz7ldvhxzduw4tleisf7ym
Small flag complexes with torsion
[article]
2012
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.
As a consequence we confirm a folklore conjecture that the smallest poset whose order complex is homotopy equivalent to the real projective plane (and also the smallest poset with torsion in the first ...
We now proceed with the proof of Theorem 2. Proof. This is an immediate brute-force computer check. Proof of Theorem 2. ...
From this set we need to choose graphs with cyclic links. This condition is easily verified as follows. ...
arXiv:1208.3892v1
fatcat:gjtb5gyzs5ayhfym5epqnd5kga
Non-intrusive Repair of Reactive Programs
2012
2012 IEEE 17th International Conference on Engineering of Complex Computer 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 2012; you can also visit the original URL.
The file type is application/pdf.
Our repair algorithms apply model checking to the program and transform the counterexamples produced by the model-checker into corrective modules. ...
Our work is supported by a proof-ofconcept tool, which creates understandable modules that can be further manually managed as part of ongoing incremental system development. ...
The cyclic patching algorithm is as follows (G denotes the full state graph traversed by the model-checker): Cyclic Patching(P, Φ): Run the model checker on (P, Φ) if P ⊧ Φ then return P for each violating ...
doi:10.1109/iceccs20050.2012.6299199
fatcat:5ykq62bs4fhenbsbtocttcrpnm
Satisfiability Modulo Heap-Based Programs
[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 2018; you can also visit the original URL.
The file type is application/pdf.
In each iteration, it searches for a proof of either satisfiability or unsatisfiability. Our procedure is further enhanced with automatically inferred invariants as well as detection of cyclic proof. ...
We have evaluated our system on benchmark programs from a software verification competition. ...
If there is a cyclic proof of λ ind 0 , λ ind 0 is UNSAT. Proof We reduce our cyclic proof problem for satisfiability to the cyclic proof problem for entailment check, i.e., λ ind 0 false of CYCLIC. ...
doi:10.1007/978-3-319-41528-4_21
fatcat:hclclgaucnfw3bfyaug4s3sh7e
Lazy Annotation Revisited
[chapter]
2014
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.
Lazy Annotation is a method of software model checking that performs a backtracking search for a symbolic counterexample. ...
The resulting algorithm is compared both conceptually and experimentally to two approaches based on similar principles but using different learning strategies: unfolding-based Bounded Model Checking and ...
Comparing LA with PDR on software model checking problems, we found that PDR's interpolation strategy as implemented in Z3 produced less effective learned annotations. ...
doi:10.1007/978-3-319-08867-9_16
fatcat:ma7r5ihrjzcdhpbgfwnueyz33u
On theorem proving for program checking
2010
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming - PPDP '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 2013; you can also visit the original URL.
The file type is application/pdf.
This article is a survey of recent results, related works and new challenges in automated theorem proving for program checking. ...
The essence of software model checking is to do model checking for infinite-state systems. ...
logic, as in symbolic model checking. ...
doi:10.1145/1836089.1836090
dblp:conf/ppdp/Bonacina10
fatcat:mh3666vskfcxvgnisxp7hnwvi4
Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning
2014
Annals of Mathematics and Artificial Intelligence
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.
., as in testing, even if performed by a model checking tool) than to translate the program and property into a set of constraints, as in abstractionbased and bounded model checkers. ...
The approaches we describe here are based on testing, model checking, constraint-solving, monitoring, and finite-state machine learning, in addition to static code analysis. ...
Acknowledgments: We are indebted to the members of the Mars Science Laboratory Flight Software Internal Test (FIT) team for contributions to the pattern language design and the early efforts at learning ...
doi:10.1007/s10472-014-9408-8
fatcat:2s5dwnoavzhibosf2if2ycsbhe
Page 1896 of Mathematical Reviews Vol. , Issue 81E
[page]
1981
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.
“As an example of use of this axiomatization for proving proper-
ties of programs (with a machine-checked proof), we present the correctness of a program for the ‘McCarthy airline’ reservation system. ...
Programmirovanie 1979, no. 5, 11-17, 79 (Russian); translated as Programming and Comput. Software 5 (1979), no. 5, 303-309 (1980). ...
Page 7289 of Mathematical Reviews Vol. , Issue 98K
[page]
1998
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.
We give a new algorithm, its correctness proof, and a proof of its execution time bound. This algorithm has time complexity O(n*logn) and can be considered as a direct improvement of D. ...
Because of that, a cyclic net model for CSP is introduced, such that the whole set of solutions can be characterized by means of a subset of the set of minimal support 7-invariants of the net model. ...
Towards Certified Model Checking for PLTL Using One-Pass Tableaux
2019
International Symposium/Workshop on Temporal Representation and Reasoning
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.
At the same time, it is often useful to have an explicit proof that certifies the satisfiability. This is exactly what the certified model checking (CMC) has been introduced for. ...
The standard model checking setup analyses whether the given system specification satisfies a dedicated temporal property of the system, providing a positive answer here or a counter-example. ...
A model M is cyclic if it is a cyclic path. ...
doi:10.4230/lipics.time.2019.12
dblp:conf/time/AbuinBDHL19
fatcat:bnbnyj6xvffyrjwzbyg4wdalri
Non-cyclic Sorts for First-Order Satisfiability
[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 2017; you can also visit the original URL.
The file type is application/pdf.
The non-cyclic fragment can be seen as a generalisation of the effectively propositional fragment (EPR) in the many-sorted setting. ...
We show that the non-cyclic fragment is decidable by instantiation-based methods and present a linear time algorithm for checking whether a given clause set is in this fragment. ...
Another explanation can be that in some cases searching for minimal models can still be quicker. ...
doi:10.1007/978-3-642-40885-4_15
fatcat:qrsnrwxiuzbfpn3hwjvydmuhgq
« Previous
Showing results 1 — 15 out of 13,730 results