Sciweavers

245 search results - page 22 / 49
» Class Algebra as a Description Logic
Sort
View
108
Voted
VMCAI
2004
Springer
15 years 5 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
87
Voted
ACTAC
2002
75views more  ACTAC 2002»
15 years 11 days ago
Framework for Studying Substitution
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
Härmel Nestra
ICCAD
1999
IEEE
119views Hardware» more  ICCAD 1999»
15 years 4 months ago
Factoring logic functions using graph partitioning
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...
Martin Charles Golumbic, Aviad Mintz
93
Voted
AML
2006
83views more  AML 2006»
15 years 17 days ago
The Medvedev lattice of computably closed sets
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
Sebastiaan Terwijn
91
Voted
APAL
2007
78views more  APAL 2007»
15 years 19 days ago
Partial Horn logic and cartesian categories
A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the subs...
Erik Palmgren, Steven J. Vickers