Filters








5 Hits in 6.7 sec

LEO-II and Satallax on the Sledgehammer test bench

Nik Sultana, Jasmin Christian Blanchette, Lawrence C. Paulson
2013 Journal of Applied Logic  
We do honour the TPTP convention that variable names start with an uppercase letter and constants with lowercase. The use of sans serif for constants further emphasises this distinction.  ...  This paper presents a double materialisation of this vision: an extension of Sledgehammer with LEO-II and Satallax as additional backends (Section 3).  ...  Christoph Benzmüller and Chad Brown gave advice on their systems and adapted them to accommodate our needs.  ... 
doi:10.1016/j.jal.2012.12.002 fatcat:fsgwocqzgrgyjgbepkrqvrto6a

Definability of Accelerated Relations in a Theory of Arrays and Its Applications [chapter]

Francesco Alberti, Silvio Ghilardi, Natasha Sharygina
2013 Lecture Notes in Computer Science  
Notably, our technique can be easily plugged-in into abstraction/refinement loops, and strongly contributes to avoid divergence: experiments conducted with the MCMT model checker attest the effectiveness  ...  Acceleration is an approach which is widely used to avoid divergence, but it has been applied mostly to integer programs.  ...  It relies on the availability of interpolation procedures (nowadays efficiently embedded in SMT-Solvers [17] ) to generate new predicates as (quantifier-free) interpolants for refining infeasible counterexamples  ... 
doi:10.1007/978-3-642-40885-4_3 fatcat:qgv5xz2sabghrlri4xetzwwvcu

Reasoning about Partial Correctness Assertions in Isabelle/HOL

Alfio Ricardo Martini
2020 Revista de Informática Teórica e Aplicada  
With the proof language Isar, it is possible to write structured, readable proofs that are suitable for human understanding and communication.  ...  The purpose of this work is to provide a detailed and accessible exposition of the several ways the user can conduct, explore and write proofs of correctness of sequential imperative programs with Hoare  ...  delegates the proof search to external resolution provers like E, SPASS and vampire [22, 23, 24] and SMT solvers like CVC4 and Z3 [25, 26] .  ... 
doi:10.22456/2175-2745.98483 fatcat:6gk5qkp3nrcurhwxj3zbc2clcq

Deep Learning for Computer Vision (Dagstuhl Seminar 17391) Body-Centric Computing (Dagstuhl Seminar 17392)

Jeremy Blackburn, Emiliano De Cristofaro, Michael Sirivianos, Thorsten Strufe, Adnan Darwiche, Pierre Marquis, Dan Suciu, Stefan, Ute Schmid, Stephen Muggleton, Rishabh Singh, Daniel Cremers (+7 others)
unpublished
and personal growth to deepen their understanding and engagement with their own bodies.  ...  In order to drive such an agenda that supports both instrumental and experiential perspectives of the active human body, this seminar brings together leading experts, including those who are central to  ...  that of modern SMT solvers.  ... 
fatcat:7srdlw7mxfhrpiwdxshf2n455y

Union, intersection, and refinement types and reasoning about type disjointness for security protocol analysis [article]

Catalin Hritcu, Universität Des Saarlandes, Universität Des Saarlandes
2012
The two type systems combine prior work on refinement types with union and intersection types and with the novel ability to reason statically about the disjointness of types.  ...  The analysis is scalable and provides security proofs for an unbounded number of protocol executions.  ...  We use first-order logic with equality as the authorization logic and the type-checker invokes the Z3 SMT solver [dMB08] to discharge proof obligations.  ... 
doi:10.22028/d291-26373 fatcat:6qebdtv4x5frbkjic444rjh7re