A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Local Theory Extensions, Hierarchical Reasoning and Applications to Verification
2007
Preserved Fulltext
We present some new results on hierarchical and modular reasoning in complex theories, as well as several examples of application domains in which efficient reasoning is possible. ...
We show, in particular, that various phenomena analyzed in the verification literature can be explained in a unified way using the notion of local theory extension. ...
This work was partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center "Automatic Verification and Analysis of Complex Systems" (SFB/TR 14 AVACS) ...
doi:10.4230/dagsemproc.07401.6
fatcat:rlkihz3z7bdqdjczyff55ymjc4
Automatic Verification of Real-Time Systems with Rich Data: An Overview
[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.
We present an overview of the results of the project "Beyond Timed Automata" of the Collaborative Research Center AVACS (Automatic Verification and Analysis of Complex Systems) during the period 2008-2011 ...
, which advances the automatic verification of high-level specifications of systems exhibiting the three dimensions of process behavior, complex infinite data, and continuous real-time-beyond the capabilities ...
The verification tool H-PILoT (Hierarchical Proving by Instantiation in Local Theory Extensions) [25] implements the method for hierarchical reasoning in extensions of logical theories and chains thereof ...
doi:10.1007/978-3-642-29952-0_14
fatcat:tplffbonpngj7hsyxyhan5rm6m
Applications of Hierarchical Reasoning in the Verification of Complex Systems
2007
Electronical Notes in 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 2009; you can also visit the original URL.
The file type is application/pdf.
Chains of local theory extensions are used to model a case study taken from the European Train Control System (ETCS) standard, but considerably simplified. ...
In this paper we show how hierarchical reasoning can be used to verify properties of complex systems. ...
Many thanks to Johannes Faber for sending us a case study taken from the specification of the European Train Control System which we used as a starting point for the specification considered in this paper ...
doi:10.1016/j.entcs.2006.11.038
fatcat:magdhkcbqvadlkcyxo5fr2hutm
Interpolation in local theory extensions
2008
Logical Methods 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.
Other Versions
We present several examples of theory extensions in which interpolants can be computed this way, and discuss applications in verification, knowledge representation, and modular reasoning in combinations ...
In this paper we study interpolation in local extensions of a base theory. ...
This work was partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center "Automatic Verification and Analysis of Complex Systems" (SFB/TR 14 AVACS) ...
doi:10.2168/lmcs-4(4:1)2008
fatcat:tyfqpk46wbfpjadnng32ype2dq
Interpolation in Local Theory Extensions
[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.
We present several examples of theory extensions in which interpolants can be computed this way, and discuss applications in verification, knowledge representation, and modular reasoning in combinations ...
In this paper we study interpolation in local extensions of a base theory. ...
This work was partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center "Automatic Verification and Analysis of Complex Systems" (SFB/TR 14 AVACS) ...
doi:10.1007/11814771_21
fatcat:q7yvsk6xwjcfdcb7ssodseabim
System Description: H-PILoT
[chapter]
2009
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.
This system description provides an overview of H-PILoT (Hierarchical Proving by Instantiation in Local Theory extensions), a program for hierarchical reasoning in extensions of logical theories with functions ...
For local theory extensions this hierarchical reduction is sound and complete and -if the formulae obtained this way belong to a fragment decidable in the base theory -H-PILoT provides a decision procedure ...
This work was partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center "Automatic Verification and Analysis of Complex Systems" (SFB/TR 14 AVACS, ...
doi:10.1007/978-3-642-02959-2_9
fatcat:jomrcl2cengxvfx4xa6qaaunei
Deciding Local Theory Extensions via E-matching
[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 2015; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We have used two SMT solvers to implement this algorithm and conducted an extensive experimental evaluation on benchmarks derived from verification conditions for heap-manipulating programs. ...
In this work, we show how SMT solvers can be used to obtain complete decision procedures for local theory extensions, an important class of theories that are decidable using finite instantiation of axioms ...
We would like to thank the anonymous reviewers for their insightful comments and suggestions. ...
doi:10.1007/978-3-319-21668-3_6
fatcat:3p365liwjfakviyqss4sfrxcfi
Constraint solving for interpolation
2010
Journal of 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 2017; you can also visit the original URL.
The file type is application/pdf.
We propose an algorithm for the generation of interpolants for the combined theory of linear arithmetic and uninterpreted function symbols that does not require a priori constructed proofs to derive interpolants ...
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of 'good' and 'bad' states. ...
, which is due to the applied constraint solver [8] . ...
doi:10.1016/j.jsc.2010.06.005
fatcat:5af5n2wizjetje6y4ujp5okhuy
System Description: H-PILoT (Version 1.9)
[article]
2010
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.
For a certain type of theory extension (namely for local theory extensions) this hierarchical reduction is sound and complete and -- if the formulae obtained this way belong to a fragment decidable in ...
This system description provides an overview of H-PILoT (Hierarchical Proving by Instantiation in Local Theory extensions), a program for hierarchical reasoning in extensions of logical theories. ...
This work was partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center "Automatic Verification and Analysis of Complex Systems" (SFB/TR 14 AVACS, ...
arXiv:1009.0673v1
fatcat:6sogrtwno5azfaawzi4kwr6hzm
Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting
[chapter]
1999
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.
Applications The notion of locality allows us to: • uniformly explain existing results, e.g. • • generate / recognize in a systematic way a class of local theory extensions related to data structures, ...
search: consider certain instances Mon(f ) [G ] without loss of completeness hierarchical/modular reasoning: reduce to checking satisfiability of a set of constraints over R ∪ Z Local theory extensions ...
To show:
Verification of the Case Study Second Reduction: • instantiate Mon(pos) wrt. ground extension terms • Reasoning about these systems can be reduced to a decidable base theory
Example: List ...
doi:10.1007/3-540-48685-2_9
fatcat:6fkddjaqzvcqhpntpkn6x57j7a
Automatic Verification of Parametric Specifications with Complex Topologies
[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 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
For specifications, we use the modular language CSP-OZ-DC, which allows us to decouple verification tasks concerning data from those concerning durations. ...
The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. ...
Many thanks to Werner Damm, Ernst-Rüdiger Olderog and the anonymous referees for their helpful comments. ...
doi:10.1007/978-3-642-16265-7_12
fatcat:b3o57vbfyrgytio2nbzblmp53m
Assertion-Based Analysis of Hybrid Systems with PVS
[chapter]
2001
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 2011; you can also visit the original URL.
The file type is application/pdf.
Such systems, which combine discrete and continuous behavior, are increasingly used in safety-critical applications. To guarantee safe functioning, formal verification techniques are crucial. ...
To allow for machine-assisted proofs, we implement a deductive assertional proof method within PVS. ...
PVS is based on higher-order logic, includes extensive libraries of datastructures and theories, offers powerful strategies to assist in routine verification tasks, as well as modularization facilities ...
doi:10.1007/3-540-45654-6_8
fatcat:k4mntjvcsnds7hstmh4sjnkq7e
Deduction Beyond Satisfiability (Dagstuhl Seminar 19371)
2020
Dagstuhl Reports
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.
Extending automated deduction methods and tools to support these new functionalities is often intrinsically difficult, and challenging both in theory and implementation. ...
This is proving to be a key enabler in a variety of areas such as formal methods (for software/hardware development) and knowledge representation and reasoning. ...
A Fixpoint Logic and Dependent Effects for Temporal Property Verification
Abduction in DL by translation to FOL
On Hierarchical Symbol Elimination and Applications Viorica Sofronie-Stokkermans License ...
doi:10.4230/dagrep.9.9.23
dblp:journals/dagstuhl-reports/FuhsRST19
fatcat:j6moci5zgvgjzgpsqblemwsrlm
Hierarchical Specification and Verification of Architectural Design Patterns
[chapter]
2018
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.
Our approach is based on interactive theorem proving and leverages the hierarchical nature of patterns to foster reuse of verification results. ...
Moreover, it describes an algorithm to map a given FACTum specification to a corresponding Isabelle/HOL theory and shows its soundness. ...
We would like to thank Veronika Bauer, Maximilian Junker, and all the anonymous reviewers of FASE 2018 for their comments and helpful suggestions on earlier versions of this paper. ...
doi:10.1007/978-3-319-89363-1_9
fatcat:jx3gt4rakzhg3iirgeq5drhbwm
On Hierarchical Palmprint Coding With Multiple Features for Personal Identification in Large Databases
2004
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 2017; you can also visit the original URL.
The file type is application/pdf.
coarse-to-fine matching for efficient and effective palmprint verification and identification in a large database. ...
To tackle the key issues such as feature extraction, representation, indexing, similarity measurement, and fast search for the best match, we propose a hierarchical multifeature coding scheme to facilitate ...
ACKNOWLEDGMENT The authors are grateful to the anonymous reviewers for their comments and advice. ...
doi:10.1109/tcsvt.2003.821978
fatcat:6xzxaicip5hmvbvk7mo2ujkhhe
« Previous
Showing results 1 — 15 out of 24,428 results