Sciweavers

1059 search results - page 81 / 212
» Standard Logics Are Valuation-Nonmonotonic
Sort
View
APAL
2006
107views more  APAL 2006»
15 years 6 months ago
Frege systems for extensible modal logics
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
Emil Jerábek
AAAI
1990
15 years 7 months ago
Inductive Synthesis of Equational Programs
An equational approach to the synthesis of functional and logic programs is taken. Typically, a target program contains equations that are only true in the standard model of the g...
Nachum Dershowitz, Eli Pinchover
ENTCS
2008
134views more  ENTCS 2008»
15 years 6 months ago
A Stack-Slicing Algorithm for Multi-Core Model Checking
The broad availability of multi-core chips on standard desktop PCs provides strong motivation for the development of new algorithms for logic model checkers that can take advantag...
Gerard J. Holzmann
FPGA
2008
ACM
173views FPGA» more  FPGA 2008»
15 years 7 months ago
The amorphous FPGA architecture
This paper describes the Amorphous FPGA, an innovative architecture attempting to optimally allocate logic and routing resource on per-mapping basis. Designed for high performance...
Mingjie Lin
CAV
2010
Springer
198views Hardware» more  CAV 2010»
15 years 10 months ago
Automatically Proving Linearizability
Abstract. This paper presents a practical automatic verification procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure im...
Viktor Vafeiadis