Sciweavers

3333 search results - page 219 / 667
» Abstract Proof Search
Sort
View
KI
1990
Springer
15 years 8 months ago
The Representation of Program Synthesis in Higher Order Logic
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
Christoph Kreitz
DBSEC
2003
137views Database» more  DBSEC 2003»
15 years 5 months ago
Certifying Data from Multiple Sources
Abstract Data integrity can be problematic when integrating and organizing information from many sources. In this paper we describe efficient mechanisms that enable a group of data...
Glen Nuckolls, Charles U. Martel, Stuart G. Stubbl...
JAR
2006
103views more  JAR 2006»
15 years 4 months ago
A Framework for Verifying Bit-Level Pipelined Machines Based on Automated Deduction and Decision Procedures
We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...
Panagiotis Manolios, Sudarshan K. Srinivasan
COMBINATORICS
2000
96views more  COMBINATORICS 2000»
15 years 4 months ago
Automorphisms and Enumeration of Switching Classes of Tournaments
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
László Babai, Peter J. Cameron
CAV
2012
Springer
222views Hardware» more  CAV 2012»
13 years 6 months ago
Leveraging Interpolant Strength in Model Checking
Craig interpolation is a well known method of abstraction successfully used in both hardware and software model checking. The logical strength of interpolants can affect the quali...
Simone Fulvio Rollini, Ondrej Sery, Natasha Sharyg...