Sciweavers

2200 search results - page 193 / 440
» The Generalized Pignistic Transformation
Sort
View
50
Voted
DAC
2005
ACM
16 years 1 months ago
Exploiting suspected redundancy without proving it
We present several improvements to general-purpose sequential redundancy removal. First, we propose using a robust variety of synergistic transformation and verification algorithm...
Hari Mony, Jason Baumgartner, Viresh Paruthi, Robe...
100
Voted
ICFP
2008
ACM
16 years 22 days ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss
82
Voted
WDAG
2009
Springer
130views Algorithms» more  WDAG 2009»
15 years 7 months ago
Contention-Sensitive Data Structures and Algorithms
A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in the common cases, when there is no contention, or ...
Gadi Taubenfeld
101
Voted
CSL
2009
Springer
15 years 7 months ago
Expanding the Realm of Systematic Proof Theory
Abstract. This paper is part of a general project of developing a systematic and algebraic proof theory for nonclassical logics. Generalizing our previous work on intuitionistic-su...
Agata Ciabattoni, Lutz Straßburger, Kazushig...
RULEML
2009
Springer
15 years 7 months ago
TomML: A Rule Language for Structured Data
Abstract. We present the Tom language that extends Java with the purpose of providing high level constructs inspired by the rewriting community. Tom bridges thus the gap between a ...
Horatiu Cirstea, Pierre-Etienne Moreau, Antoine Re...