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.
Filters
Executing Model Checking Counterexamples in Simulink
2012
2012 Sixth International Symposium on Theoretical Aspects of Software Engineering
Preserved Fulltext
In this paper we extend our tool integration chain of parallel, explicit-state LTL model checker DIVINE and Matlab Simulink tool suit with an improved support of counterexample simulation. ...
In particular, we show how to provide the verification engineer with a direct connection between the error discovered by the model checker and the simulation in Matlab Simulink. ...
We now focus only on the latter case, when a counterexample is generated. ===== Trace from initial ===== Under the LTL model checking setting, the counterexample is always an infinite execution of the ...
doi:10.1109/tase.2012.42
dblp:conf/tase/BarnatBBKO12
fatcat:54kvtppvlrgv5jry6365h2trxu
A Latent Implementation Error Detection Method for Software Validation
2013
Journal of Applied Mathematics
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.
Model checking and conformance testing play an important role in software system design and implementation. ...
From the view of integrating model checking and conformance testing into a tightly coupled validation approach, this paper presents a novel approach to detect latent errors in software implementation. ...
Software model checking [2] and model-based conformance testing [3] are two well-established approaches validating the accuracy of software executions. ...
doi:10.1155/2013/138287
fatcat:z664crp5ibdazhqw3wuiu5kry4
Counterexample Guided Abstraction Refinement Via Program Execution
[chapter]
2004
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.
Software model checking tools based on a Counterexample Guided Abstraction Refinement (CEGAR) framework have attained considerable success in limited domains. ...
This paper presents an approach to software model checking that actually executes the program in order to drive abstraction-refinement. ...
Introduction Software model checking has, in recent years, been applied successfully to real software programs -within certain restricted domains. ...
doi:10.1007/978-3-540-30482-1_23
fatcat:i4z5jwnltrc3zc7km4u6yphdui
Automated support for diagnosis and repair
2015
Communications of the ACM
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.
is a reader in applied computational logic in the Pull Quotes The marriage of model checking and logic-based learning thus provides automated support for specification verification, diagnosis, and repair ...
Model checking automatically detects errors in the formal description, and learning carries out the diagnosis and repair tasks for the identified errors, resulting in a correctly revised description. ...
It then checks whether P is satisfied in all executions of the LTS. ...
doi:10.1145/2658986
fatcat:cmp55coxdjfgzcnksqfwj3hpdu
Software Model Checking: The Bandera Approach
[chapter]
2002
Formal Methods for Open Object-Based Distributed Systems V
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.
Bandera is like a debugger in the sense that it maps counterexamples produced by back-end model checkers to the source code level, and it allows the user to replay program execution both forwards and backwards ...
The increased use of concurrent software in embedded applications and the widespread adoption of Java with its built-in concurrency constructs have led researchers to attempt to adapt model-checking techniques ...
These case studies also point out the need for additional functionality to enable scaling of software model checking to even larger and more complex systems. ...
doi:10.1007/978-0-387-35496-5_1
fatcat:kxlggmhkk5e6vdbpidam3hfn5a
Bounded Model Checking and Feature Omission Diversity
[article]
2016
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.
In this paper we introduce a novel way to speed up the discovery of counterexamples in bounded model checking, based on parallel runs over versions of a system in which features have been randomly disabled ...
As shown in previous work, adding constraints to a bounded model checking problem can reduce the size of the verification problem and dramatically decrease the time required to find counterexample. ...
DISCUSSION In this paper, we proposed that feature omission diversity, known to be useful in software testing, may also be valuable in bounded model checking. ...
arXiv:1610.08020v1
fatcat:4swgc2guybgb7owjagpqwjnbzi
Model checking concurrent linux device drivers
2007
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering - ASE '07
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 2008; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we take predicate abstraction one step further and introduce a technique to verify concurrent software with shared memory. ...
Our predicate abstraction-based tool DDVerify enables the automated verification of Linux device drivers and provides an accurate model of the relevant parts of the kernel. ...
The abstract programM contains all execution traces of M , and potentially more. In phase two, the abstract modelM is examined by a model checking tool. ...
doi:10.1145/1321631.1321719
dblp:conf/kbse/WitkowskiBKW07
fatcat:zopjgi3zlzbjtf554vd7gyoefe
Synchronization Verification in System-Level Design with ILP Solvers
2006
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
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.
Verification is conducted in two steps. First, similar to other software model checkers, we compute the reachability of an error state in the absence of timing constraints. ...
Abstraction and abstraction refinement techniques based on the Counterexample-Guided Abstraction Refinement (CEGAR) paradigm are applied. ...
There are two major approaches to software model checking. ...
doi:10.1093/ietfec/e89-a.12.3387
fatcat:5x6xj5inwzazlltw4fidv5vwmu
Whodunit? Causal Analysis for Counterexamples
[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 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we provide an automated procedure to zoom in to potential software defects by analyzing a single concrete counterexample. ...
The procedure uses an efficient weakest pre-condition algorithm carried out on a single concrete execution path, which is significantly more scalable than other model checking based approaches. ...
A drawback of model checking based method is their limited scalability in dealing with large systems or long counterexamples. ...
doi:10.1007/11901914_9
fatcat:txhziw2jfveljc2qocqpctrtcm
Deriving minimal models for resource utilization
2013
Proceedings of the 2013 workshop on Green in/by software engineering - GIBSE '13
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 show how compact Resource Utilization Models (RUMs) can be extracted from concrete overly-detailed models of systems or sub-systems in order to model energy-aware software. ...
Using the Counterexample-Guided Abstraction Refinement (CEGAR) approach, along with model-checking tools, abstract models can be generated that help establish key properties relating to energy consumption ...
If not, (2) (minimal) information can automatically be extracted from the concrete model to make a refined abstract model in which the previous counterexample cannot occur, and then the model checking ...
doi:10.1145/2451605.2451612
fatcat:vfh5agdbqrefxcwvuzzidwstv4
The hidden models of model checking
2012
Journal of Software and Systems Modeling
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 illustrate the value of hidden models by surveying successful examples of their use in different areas of model checking (hardware and software) and how a lack of suitable models hamper a new area ( ...
In the past, applying formal analysis, such as model checking, to industrial problems required a team of formal methods experts and a great deal of effort. ...
Most existing software model checking tools that we are aware of provide support for interpreting the counterexample as an execution of the system model, i.e., the program source code [4, 26, 95] . ...
doi:10.1007/s10270-012-0281-9
fatcat:hpfpl3ufwrhpxbhg7koafunnuq
Fault Localization in Multi-threaded C Programs Using Bounded Model Checking
2015
2015 Brazilian Symposium on Computing Systems Engineering (SBESC)
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.
The code transformation is implemented with rules and context switch information from counterexamples, which are typically generated by bounded model checkers. ...
In this study, a new method for fault localization, in multi-threaded C programs, is proposed. ...
Part of the results presented in this paper were obtained with the project for research and human resources qualification, for under-and post-graduate levels, in the areas of industrial automation, mobile ...
doi:10.1109/sbesc.2015.25
dblp:conf/sbesc/AlvesCF15
fatcat:xqjweotopnf3hhjd5kiqcwqdna
Distributed and Predictable Software Model Checking
[chapter]
2011
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 a predicate abstraction and refinement-based algorithm for software verification that is designed for the distributed execution on compute nodes that communicate via message passing, as found ...
We present an algorithm that overcomes this pitfall by making deterministic the counterexample selection in spite of the distribution, and still efficiently exploits distributed computational resources ...
In this paper we present a distributed version of a software model checking algorithm that is designed for the distributed execution on compute nodes that communicate via message passing. ...
doi:10.1007/978-3-642-18275-4_24
fatcat:s3h4ywku6ja27pawxmy753uwh4
Model-based abductive reasoning in automated software testing
2013
Logic Journal of the IGPL
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 Automated software testing computational models are algorithmically checked to find paths that satisfy or falsify the properties of interest; such paths are used to select executions to be observed ...
Automated software testing using model checking is in this paper epistemologically analysed in order to argue in favour of the model-based abductive reasoning paradigm in the computer science field. ...
Models in Model Checking Automated Software Testing Observing a program's executions enables to detect only the presence of failures; for this reason coverage criteria are meant as selecting those executions ...
doi:10.1093/jigpal/jzt006
fatcat:vkiytuxrafd4vagshwpxrehvxm
Counterexample guided abstraction refinement of product-line behavioural models
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 2017; you can also visit the original URL.
The file type is application/pdf.
The model-checking problem for Software Products Lines (SPLs) is harder than for single systems: variability constitutes a new source of complexity that exacerbates the state-explosion problem. ...
Abstraction techniques have successfully alleviated state explosion in single-system models. ...
Counterexample Guided Abstraction Refinement Model checking is an established technique for verifying both hardware and software against temporal properties [12, 5] . ...
doi:10.1145/2635868.2635919
dblp:conf/sigsoft/CordyHLSDL14
fatcat:4u6c56uzlvfq7ipbrkjt6djpyu
« Previous
Showing results 1 — 15 out of 7,954 results