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.
Filters
Lazy abstraction
2002
Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '02
Preserved Fulltext
• Avoid repetitive work by refining what is
already known about the model from a
"pivot state".
• Unite abstraction, verification and
counter-example refinement on-the-fly. ...
Introduction • What is model checking? • Why should we care? • Who uses it? • And what is it used for? Do as much with as little as possible. • Semi-algorithm. What??? If yes, finite time verifiable. ...
doi:10.1145/503272.503279
dblp:conf/popl/HenzingerJMS02
fatcat:t33s2zpx6jdrvfiab63rsp6pzu
Model Checking: Back and Forth between Hardware and Software
[chapter]
2008
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 2007; you can also visit the original URL.
The file type is application/pdf.
Originally intended for the analysis of concurrent software, model checking was first used in hardware verification. ...
The interplay back and forth between software model checking and hardware model checking has been fruitful for both. ...
Abstraction techniques which enable us to remove significant parts of the data flow from the system. 3. Efficient tools to check properties on the abstracted systems. ...
doi:10.1007/978-3-540-69149-5_27
fatcat:42jggsgsqzajxflkckzi4wan2i
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. ...
The inputs required for the execution are derived from the abstract model. ...
However, the Check stage relies on program execution to refine the model. ...
doi:10.1007/978-3-540-30482-1_23
fatcat:i4z5jwnltrc3zc7km4u6yphdui
Lazy abstraction
2002
SIGPLAN notices
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.
• Avoid repetitive work by refining what is
already known about the model from a
"pivot state".
• Unite abstraction, verification and
counter-example refinement on-the-fly. ...
Introduction • What is model checking? • Why should we care? • Who uses it? • And what is it used for? Do as much with as little as possible. • Semi-algorithm. What??? If yes, finite time verifiable. ...
doi:10.1145/565816.503279
fatcat:zszzjyf5kfffxlyyy65qj5v2xa
Analyzing hierarchical complex real-time systems
2010
Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering - 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.
Experiments show that our tool has compatible performance with the state-of-the-art verifiers, and complement them with additional capabilities like LTL model checking, refinement checking. ...
Further, we augment a system model with mutable variables and data structures (e.g., arrays, * ...
The refinement relationship is verified using an on-the-fly simulation checking approach. Timed Refinement Checking We have looked at the refinement checking without timed transitions. ...
doi:10.1145/1882291.1882350
dblp:conf/sigsoft/LiuSD10
fatcat:7bt5ap6f2fdilet7knsrhnvm7m
Modular Design and Verification of Distributed Adaptive Real-Time Systems Based on Refinements and Abstractions
2015
EAI Endorsed Transactions on Self-Adaptive 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.
Therefore, we discuss how common refinements and abstractions from the context of Timed CSP can be used as a formal basis for refinements and abstractions in SystemC. ...
Our pattern explicitly differentiates between functional data and adaptive control data and thereby allows for a strict separation of adaptation and functional components. ...
For example, the domain of SystemC models allows for abstractions based on CSP-like refinement. ...
doi:10.4108/sas.1.1.e5
fatcat:5kmrb67ogvhfjhi6dziivtdm2m
Efficient Refinement Checking in VCC
[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 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a methodology for carrying out refinement proofs across declarative abstract models and concrete implementations in C, using the VCC verification tool. ...
Subsequent refinement proofs between successively refined abstract models and between abstract and concrete implementations are carried out in VCC. ...
However it is not clear if these works make use of a formal theory of refinement and if so, how the refinement conditions are checked in VCC. ...
doi:10.1007/978-3-319-12154-3_2
fatcat:zbwgc6a4yva27j3ayi2lkviy7m
Software Verification with BLAST
[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.
Blast implements an abstract-model check-refine loop to check for reachability of a specified label in the program. The abstract model is built on the fly using predicate abstraction. ...
Blast (the Berkeley Lazy Abstraction Software verification Tool) is a verification system for checking safety properties of C programs using automatic property-driven construction and model checking of ...
We thank George Necula and Westley Weimer for various discussions and for providing support with CIL. ...
doi:10.1007/3-540-44829-2_17
fatcat:5rtm4bzyqjhy5mciwguurejdvy
Model checking unbounded concurrent lists
2015
International Journal on Software Tools for Technology Transfer (STTT)
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.
We present a method for model checking list-based concurrent data structures. ...
In previous work, we showed how the unbounded threads can be model checked by using the CMP (CoMPositional) method. ...
Introduction We present a method for model checking list-based concurrent data structures. ...
doi:10.1007/s10009-015-0369-y
fatcat:oft2cb65hrhglhzoi2mwhqxkuq
Theta: A framework for abstraction refinement-based model checking
2017
2017 Formal Methods in Computer Aided Design (FMCAD)
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 demonstrate the applicability of the framework by use cases for the safety checking of PLC, hardware, C programs and timed automata models. ...
It enables the definition of input formalisms, abstract domains, model interpreters, and strategies for abstraction and refinement. ...
Abstraction refinement is a widely used approach for model checking software. Several tools, e.g. SLAM [1] , BLAST [2] and SATABS [3] are based on predicate abstraction. ...
doi:10.23919/fmcad.2017.8102257
dblp:conf/fmcad/TothHVMM17
fatcat:f5qmm4cxzrgfdntw53jb4746ai
Diagnosing Abstraction Failure for Separation Logic–Based Analyses
[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 2019; you can also visit the original URL.
The file type is application/pdf.
To check feasibility of abstract error traces, we perform Bounded Model Checking over the traces using a novel encoding into SMT. ...
The diagnosis has been implemented in SLAyer, and we present a simple scheme for refining the abstraction of hierarchical data structures, and illustrate its effectiveness on benchmarks from the SLAyer ...
A finite subset of these abstract traces is checked for feasibility using a very precise modeling of memory allocation and a new technique for encoding bounded model checking (BMC) as a single satisfiability ...
doi:10.1007/978-3-642-31424-7_16
fatcat:zmat27hfpje43mcpxpf35jkavm
Application and Verification of Local Nonsemantic-Preserving Transformations in System Design
2008
IEEE Transactions on Computer-Aided Design of Integrated Circuits and 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 2008; you can also visit the original URL.
The file type is application/pdf.
Our approach divides the verification tasks into two activities: 1) the local correctness of a refined block is checked by using formal verification tools and predefined properties, which are developed ...
Due to the increasing abstraction gap between the initial system model and a final implementation, the verification of the respective models against each other is a formidable task. ...
In order to use model checking efficiently, we define a set of properties to every design transformation and combine the properties with proper abstraction strategies to check the correctness of the refined ...
doi:10.1109/tcad.2008.923249
fatcat:rmtkirn665gm7fq2ya7fggmwbm
PRISM 4.0: Verification of Probabilistic Real-Time Systems
[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.
These include: an extensible toolkit for building, verifying and refining abstractions of probabilistic models; an explicit-state probabilistic model checking library; a discrete-event simulation engine ...
for statistical model checking; support for generation of optimal adversaries/strategies; and a benchmark suite. ...
For a full list of PRISM contributors, see [16]. ...
doi:10.1007/978-3-642-22110-1_47
fatcat:y6aqczsj3fhtrcwwwljw5iqqki
On PSL Properties Re-use in SoC Design Flow Based on Transaction Level Modeling
2005
International Workshop on Microprocessor Test and Verification
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 Transaction Level Modeling (TLM) is the defacto reference model for SoC design flow, we evaluate PSL adoption in TLM context. ...
Two PSLbased techniques, "properties re-use" and "properties refinement", are described and compared in terms of refinement effort and simulation speed delay. ...
on their actual implementations (e.g. on actual protocol used for data transfer). ...
doi:10.1109/mtv.2005.15
dblp:conf/mtv/BombieriFF05
fatcat:plm7z3hk2zcn5mrhrkac2nplge
Assertion-Based Functional Consistency Checking between TLM and RTL Models
2013
2013 26th International Conference on VLSI Design and 2013 12th International Conference on 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 2020; you can also visit the original URL.
The file type is application/pdf.
Transaction Level Modeling (TLM) is promising for functional validation at an early stage of System-on-Chip (SoC) design. ...
This paper proposes an efficient mechanism for functional consistency checking using assertion observability. ...
Refinement of TLM Assertions/Tests In our framework, we use SystemC for transaction level modeling and Verilog for RTL modeling. ...
doi:10.1109/vlsid.2013.208
dblp:conf/vlsid/ChenM13
fatcat:whpltsrfvvgnvhyojsh37df3au
« Previous
Showing results 1 — 15 out of 172,920 results