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.
Filters
Domain-Type-Guided Refinement Selection Based on Sliced Path Prefixes
[article]
2015
arXiv
pre-print
Preserved Fulltext
For example, we can select based on domain types of variables in the interpolants, prefer to avoid loop counters, or compare with templates for potential loop invariants, and thus control what kind of ...
abstraction refinement. ...
CONCLUSION In this work we presented our novel approach of slice-based refinement selection, which extracts several infeasible sliced prefixes from one single infeasible error path. ...
arXiv:1502.00045v1
fatcat:vmpn7jgnancntodys7t6yzbk2u
Sliced Path Prefixes: An Effective Method to Enable Refinement Selection
[chapter]
2015
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 method takes as input one given infeasible error path and applies a slicing technique to obtain a set of new error paths that are more abstract than the original error path but still infeasible, each ...
Counterexample-guided abstraction refinement is a standard technique that suggests to extract information from infeasible error paths, in order to refine the abstract model if it is too imprecise. ...
prefix, (3) sliced prefix with best domain-type score, and (4) sliced prefix with worst domain-type score. ...
doi:10.1007/978-3-319-19195-9_15
fatcat:oenglol6afgp5maqdzw4zqsaty
Efficient Strategies for CEGAR-Based Model Checking
2019
Journal of automated 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.
Automated formal verification is often based on the Counterexample-Guided Abstraction Refinement (CEGAR) approach. ...
Many variants of CEGAR have been developed over the years as different problem domains usually require different strategies for efficient verification. ...
its prefix with the currently examined path, and will need refinement earlier. ...
doi:10.1007/s10817-019-09535-x
fatcat:pab76on3wfhu7jz34etj45bbfu
State space exploration using feedback constraint generation and Monte-Carlo sampling
2007
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering - ESEC-FSE '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 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a framework for validating programs based on statistical sampling of inputs guided by statically generated constraints, that steer the simulations towards more "desirable" traces. ...
Our approach works iteratively: each iteration first simulates the system on some inputs sampled from a restricted space, while recording facts about the simulated traces. ...
The automaton generated from the call sequences defines a bias function based on the size of the path prefix that belongs to the language of the automaton. Ranges. ...
doi:10.1145/1287624.1287670
dblp:conf/sigsoft/SankaranarayananCJI07
fatcat:v7pdkus3zvajthjyf65degqgou
Multi-dimensional exploration of API usage
2013
2013 21st International Conference on Program Comprehension (ICPC)
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.
., based on code search, code completion, or API documentation. In contrast, our approach is highly interactive and can be seen as an extension of what IDEs readily provide today. ...
Exploration is based on multiple dimensions: i) the hierarchically organized scopes of projects and APIs; ii) metrics of API usage (e.g., number of project classes extending API classes); iii) metadata ...
Selection of projects, APIs, or parts thereof is based on names of APIs and projects as well as qualified names for the relevant scopes; we do not cover here selection based on API domain tags and API ...
doi:10.1109/icpc.2013.6613843
dblp:conf/iwpc/RooverLP13
fatcat:jqx3kvsjtvawxmlhqncjz6onxy
Identifying high-level dependence structures using slice-based dependence analysis
2009
2009 IEEE International Conference on Software Maintenance
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 thesis addresses dependence based concept assignment using slicing based dependence analysis on concept assignment. Concepts are domain level entities concerned with the real world. ...
Traditional concept assignment maps the low level of source code to the high level of the domain through the medium of associations. ...
For a concept binding two types of dependence graph are considered based on the direction of edges. ...
doi:10.1109/icsm.2009.5306275
dblp:conf/icsm/Li09
fatcat:vsdcfkqfrbf7ranety7knu24n4
Operational abstractions of model transforms
2014
Proceedings of the 7th India Software Engineering Conference on - ISEC '14
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.
Our results indicate that selective path enumeration can be highly effective in reducing the scope of path exploration, while ensuring that the abstraction is complete. ...
We present an automated approach that uses a combination of selective path enumeration, forced execution of enumerated paths, and an offline trace-merging analysis to synthesize operational abstractions ...
Our characterization is based on dependence chains (or static slices [26] ) across peer-level hammocks. Our simpler hammock-based path enumeration is suitable for the domain of model transforms. ...
doi:10.1145/2590748.2590751
dblp:conf/indiaSE/SinhaDMS14
fatcat:a2lxoomguvbjhdfuxq7pe77upu
Verification and falsification of programs with loops using predicate abstraction
2009
Formal Aspects of Computing
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 many cases, predicate abstraction suffers from the need for at least one predicate for each iteration of a loop construct in the program. ...
Thomas Wahl deserves a special note of thanks for his thorough reading and his insightful comments on this paper. ...
Peter Lucas for awakening his lasting interest in formal verification by teaching Hoare logic in the introductory course on computer science at the Graz University of Technology. ...
doi:10.1007/s00165-009-0110-2
fatcat:wwd3wjrylbb6vceuyavmythcv4
Path-Sensitive Dataflow Analysis with Iterative Refinement
[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 2018; you can also visit the original URL.
The file type is application/pdf.
These tracked predicates are then used to guide join operations and path feasibility analysis, so that expensive computations are performed only at the right places. ...
In this paper, we present a new method for supporting abstraction refinement in path-sensitive dataflow analysis. ...
With the variable-based refinement technique, an application is allowed to, and can afford to, have a "deep" analysis when necessary, because it only focuses on a small number of selected variables. ...
doi:10.1007/11823230_27
fatcat:3b6346axcbhzrdamssfcn5qmpe
Finding feasible abstract counter-examples
2002
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 2017; you can also visit the original URL.
The file type is application/pdf.
The theorem applies to our approach since: (i) predicate abstraction subsumes type-based abstraction, where the abstract domain is finite [31] ; and (ii) Java programs can be modeled by a guarded-assignment ...
This type-based approach to abstraction is a specialized form of predicate abstraction (e.g., [4, 5, 34] ). ...
doi:10.1007/s10009-002-0088-z
fatcat:hgvhe74r55aj7owvpdyk7vw7km
LinkedSpending: OpenSpending becomes Linked Open Data
2015
Semantic Web Journal
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.
Faceted search offers a selection of values for certain properties and thus slice and dice of the dataset according to the interests on the fly. ...
Data cubes may contain slices, which are presets for certain dimension values, effectively selecting a subset of a cube. ...
doi:10.3233/sw-150172
fatcat:uxmbezueinghfhnkaotr6vubqq
Context-based adaptive binary arithmetic coding in the H.264/AVC video compression standard
2003
IEEE transactions on circuits and systems for video technology (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 2004; you can also visit the original URL.
The file type is application/pdf.
Context-Based Adaptive Binary Arithmetic Coding (CABAC) as a normative part of the new ITU-T/ISO/IEC standard H.264/AVC for video compression is presented. ...
Moreover, the third type does not rely on past coded data, but on the position in the scanning path. ...
The context indices in the range from 0 to 72 are related to syntax elements of macroblock type, submacroblock type, and prediction modes of spatial and of temporal type as well as slice-based and macroblock-based ...
doi:10.1109/tcsvt.2003.815173
fatcat:yoljy5p6nnbtfbkwhuckqxu4ya
Building CMS-based Web applications using a model-driven approach
2012
2012 Sixth International Conference on Research Challenges in Information Science (RCIS)
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.
A model-driven approach for building distributed ontology-based web applications. ...
Eindhoven: Technische Universiteit Eindhoven. https://doi.org/10.6100/IR589984 A model-driven approach for building distributed ontology-based web applications / by Richard Vdovják. ...
Slices contain sets of attributes from one or more (related) entity types of the ER domain model. ...
doi:10.1109/rcis.2012.6240465
dblp:conf/rcis/Trias12
fatcat:bhbsaprjfbgcvpffjr6ooeljge
Domain-Polymorphic Programming of Privacy-Preserving Applications
2014
Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security - PLAS'14
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.
It is a simple imperative language with function calls where the types of data items are annotated with protection domains and where the function declarations may be domain-polymorphic. ...
Secure Multiparty Computation (SMC) is seen as one of the main enablers for secure outsourcing of computation. ...
The context ∆ is needed to dispatch function calls dynamically based on the possible protection domains the function call resides in and the protection domains of the arguments. ...
doi:10.1145/2637113.2637119
dblp:conf/ecoop/BogdanovLR14
fatcat:e55qmili5zb7flfeuoda7kb75q
CA-RAM: A High-Performance Memory Substrate for Search-Intensive Applications
2007
2007 IEEE International Symposium on Performance Analysis of Systems & Software
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.
Searchable records are stored in CA-RAM at a location determined by a hash function, defined on their search key. ...
Compared with a conventional CAM (Content Addressable Memory) solution, CA-RAM capitalizes on dense SRAM and DRAM designs, and achieves comparable search performance while occupying much smaller area and ...
The prefix count in the table is 186,760. First, we need to determine the hash function. Our hash function is based on the bit selection scheme by Zane et al. ...
doi:10.1109/ispass.2007.363753
dblp:conf/ispass/ChoMXHM07
fatcat:mbbovdjy7fg3jhoymyolvullki
« Previous
Showing results 1 — 15 out of 1,427 results