134 Hits in 4.8 sec

A Practical Approach to Partial Functions in CVC Lite

Sergey Berezin, Clark Barrett, Igor Shikanian, Marsha Chechik, Arie Gurfinkel, David L. Dill
2005 Electronical Notes in Theoretical Computer Science  
in our tool, CVC Lite.  ...  Most verification approaches assume a mathematical formalism in which functions are total, even though partial functions occur naturally in many applications.  ...  We plan to use these ideas to test larger examples in CVC Lite.  ... 
doi:10.1016/j.entcs.2004.06.064 fatcat:srdjzfgflrbqnlckcqqps7pvdy

Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005)

Clark Barrett, Leonardo de Moura, Aaron Stump
2005 Journal of automated reasoning  
Public competitions are a well-known means of stimulating advancement in automated reasoning. Evaluation of SMT solvers entered in SMT-COMP took place while CAV 2005 was meeting.  ...  The Satisfiability Modulo Theories Competition (SMT-COMP) is intended to spark further advances in the decision procedures field, especially for applications in hardware and software verification.  ...  Ackermann's reduction [1] is a well known technique used to eliminate uninterpreted function symbols. This approach is generally considered inefficient in practice.  ... 
doi:10.1007/s10817-006-9026-1 fatcat:gquapu5hw5hgbejnp3caczojl4

Practical predicate dispatch

Todd Millstein
2004 SIGPLAN notices  
Unfortunately, prior languages supporting predicate dispatch have had several deficiencies that limit its utility in practice.  ...  After describing the JPred language and type system, we present a case study illustrating the utility of JPred in a real-world application, including its use in the detection of several errors.  ...  Let F be a query formula provided to CVC Lite.  ... 
doi:10.1145/1035292.1029006 fatcat:w3zoovdvd5hrxm4yx7t246umsi

Practical predicate dispatch

Todd Millstein
2004 Proceedings of the 19th annual ACM SIGPLAN Conference on Object-oriented programming, systems, languages, and applications - OOPSLA '04  
Unfortunately, prior languages supporting predicate dispatch have had several deficiencies that limit its utility in practice.  ...  After describing the JPred language and type system, we present a case study illustrating the utility of JPred in a real-world application, including its use in the detection of several errors.  ...  Let F be a query formula provided to CVC Lite.  ... 
doi:10.1145/1028976.1029006 dblp:conf/oopsla/Millstein04 fatcat:66hxil3lercttexa33w6txzrfu

New results on rewrite-based satisfiability procedures

Alessandro Armando, Maria Paola Bonacina, Silvio Ranise, Stephan Schulz
2009 ACM Transactions on Computational Logic  
We compare the rewrite-based theorem prover E with the validity checkers CVC and CVC Lite.  ...  approach is elegant and conceptually simple, but has important practical implications.  ...  ACKNOWLEDGMENTS We thank Mnacho Echenim for several suggestions to improve preliminary versions of this article, and especially for helping us correcting the proofs of Section 3.2.  ... 
doi:10.1145/1459010.1459014 fatcat:q7ztkpc4lfbhzmkywvpk7fitoa

Determination of mechanical and functional properties by continuous vertical cast NiTi rod
Določitev mehanskih in funkcionalnih lastnosti vertikalno kontinuirno lite NiTi palice

A. Stambolić, M. Jenko, A. Kocijan, B. Žužek, D. Drobne, R. Rudolf
2018 Materiali in Tehnologije  
V~lanku je podana informacija o mikrostrukturi in metodah za dolo~itev mehanskih in funkcionalnih lastnosti vertikalno-kontinuirno lite (CVC) NiTi palice.  ...  Vrednost trdote rahlo nara{~a proti sredini palice in je posledica nastale mikrostrukture.  ...  replace any failing tissue, organ or function of the body in order to improve the quality of life of the individual.  ... 
doi:10.17222/mit.2018.030 fatcat:jsdfgshkp5h3hccqna4wuyy32y

Refined typechecking with Stardust

Jana Dunfield
2007 Proceedings of the 2007 workshop on Programming languages meets program verification - PLPV '07  
This is the first implementation of unrestricted intersection and union types in a mainstream functional programming setting, as well as the first implementation of a system with both datasort and index  ...  While typechecking with intersection and union types is intrinsically complex, our experience so far suggests that it can be practical in many instances. • datasort refinements (also called refinement  ...  Interface to CVC Lite Stardust also includes an interface to CVC Lite (Barrett and Berezin 2004) , the successor to CVC, the Cooperating Validity Checker (Stump et al. 2002) , which in turn succeeded  ... 
doi:10.1145/1292597.1292602 dblp:conf/plpv/Dunfield07 fatcat:2yyj7xgczzeqpm2uissj47lhcu

Mothers of Pipelines

Sava Krstić, Robert B. Jones, John O'Leary
2007 Electronical Notes in Theoretical Computer Science  
This theorem reduces proving the correctness of a given pipelined implementation of the ISA to verifying that each of its transitions can be modeled as a sequence of MOP state transitions.  ...  We present a method for pipeline verification using SMT solvers. It is based on a non-deterministic "mother pipeline" machine (MOP ) that abstracts the instruction set architecture (ISA). The MOP vs.  ...  to practical verification.  ... 
doi:10.1016/j.entcs.2006.11.036 fatcat:unrp5fkob5cthcuiotre2ic7im

Predicate Abstraction of Programs with Non-linear Computation [chapter]

Songtao Xia, Ben Di Vito, Cesar Munoz
2006 Lecture Notes in Computer Science  
In this paper, we propose an approach to model checking a class of data-flow properties for engineering programs that contain non-linear products and transcendental functions.  ...  Using this approach, we construct a prototype model checker for C programs called VISA (Verification of Industrial-Strength Applications).  ...  We expect the approach to be integrated with other approaches as part of a collective method to prove or disprove run-time errors in an accurate and static way.  ... 
doi:10.1007/11901914_27 fatcat:gf3aybr6o5fsdfsgi7zeyfv7pe

A Two-Tier Technique for Supporting Quantifiers in a Lazily Proof-Explicating Theorem Prover [chapter]

K. Rustan M. Leino, Madan Musuvathi, Xinming Ou
2005 Lecture Notes in Computer Science  
Supporting quantifiers in this architecture poses a challenge as quantifier instantiations can dynamically introduce boolean structure in the formula, requiring a tighter interleaving between propositional  ...  Lazy proof explication is a theorem-proving architecture that allows a combination of Nelson-Oppen-style decision procedures to leverage a SAT solver's ability to perform propositional reasoning efficiently  ...  We thank the referees for their many useful comments on a previous version of this paper.  ... 
doi:10.1007/978-3-540-31980-1_22 fatcat:tdbvmgjvmbb7pfod7ih7o5pzr4

Validating the Translation of an Industrial Optimizing Compiler [chapter]

I. Gordin, R. Leviathan, A. Pnueli
2004 Lecture Notes in Computer Science  
The approach has been implemented on a tool called MCVT which is also described. *  ...  The paper presents an approach to the translation validation of an optimizing compiler which translates synchronous C programs into machine code programs.  ...  We plan to use a new updated version of CVC, CVC Lite [cvc] from Stanford University, which is faster and allows further simplification of the verification conditions.  ... 
doi:10.1007/978-3-540-30476-0_21 fatcat:hke2qrm3p5dlpppe5ospwgnvou

6 Years of SMT-COMP

Clark Barrett, Morgan Deters, Leonardo de Moura, Albert Oliveras, Aaron Stump
2012 Journal of automated reasoning  
logic, and the collection of a library of benchmarks in SMT-LIB format.  ...  The annual Satisfiability Modulo Theories Competition (SMT-COMP) was initiated in 2005 in order to stimulate the advance of state-of-the-art techniques and tools developed by the Satisfiability Modulo  ...  CVC Lite has a custom SAT solver and is capable of producing independently checkable proofs for valid queries. CVC Lite competed in all divisions.Fx7. (Unversioned, 2007.)  ... 
doi:10.1007/s10817-012-9246-5 fatcat:4isj36vycjau5hmsxuihgpdozm

On Verifying Complex Properties using Symbolic Shape Analysis [article]

Thomas Wies, Viktor Kuncak, Karen Zee, Andreas Podelski, Martin Rinard
2006 arXiv   pre-print
To synthesize loop invariants of this form, Bohne uses a combination of decision procedures for Monadic Second-Order Logic over trees, SMT-LIB decision procedures (currently CVC Lite), and an automated  ...  We have deployed Bohne in the Hob and Jahob data structure analysis systems, enabling us to combine Bohne with analyses of data structure clients and apply it in the context of larger programs.  ...  This invariant enables CVC Lite to prove the verification condition. The Bohne Algorithm We next describe the symbolic shape analysis algorithm implemented in Bohne.  ... 
arXiv:cs/0609104v1 fatcat:fvo3jony5ja23fecutl6s5otzu

Lightweight integration of the Ergo theorem prover inside a proof assistant

Sylvain Conchon, Evelyne Contejean, Johannes Kanig, Stéphane Lescuyer
2007 Proceedings of the second workshop on Automated formal methods - AFM '07  
In order to make a sound integration in a proof assistant possible, Ergo is capable of generating proof traces for CC(X).  ...  Its core component is CC(X), a new combination scheme for the theory of uninterpreted symbols parameterized by a built-in theory X.  ...  Simplify, Yices, CVC Lite and other provers may be called from Coq. The first order prover Zenon even returns a proof trace in form of a Coq term.  ... 
doi:10.1145/1345169.1345176 fatcat:k6tzizy3lzciho5az7rmka2xu4

Mining Propositional Simplification Proofs for Small Validating Clauses

Ian Wehrman, Aaron Stump
2006 Electronical Notes in Theoretical Computer Science  
We report work in progress to find small subsets of the current partial assignment that imply the goal formula when it has been propositionally simplified to a boolean value.  ...  The approach used is algebraic proof mining. Proofs from a propositional reasoner that the goal is equivalent to a boolean value (in the current assignment) are viewed as first-order terms.  ...  SMT tools like CVC [6] and CVC Lite [2] work (roughly) by first choosing an atomic formula to case split on, followed by simplification of the (nonclausal) goal.  ... 
doi:10.1016/j.entcs.2005.12.008 fatcat:fm6xhzeqqjfntkje6qy3xu4iji
« Previous Showing results 1 — 15 out of 134 results