Sciweavers

10715 search results - page 375 / 2143
» Proofs from Tests
Sort
View
195
Voted
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
15 years 4 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
185
Voted
EJC
2011
15 years 1 months ago
Enumeration of connected Catalan objects by type
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product f...
Brendon Rhoades
ANLP
2000
85views more  ANLP 2000»
15 years 8 months ago
Improving Testsuites via Instrumentation
This paper explores the usefulness of a technique from software engineering, namely code instrumentation, for the development of large-scale natural language grammars. Information...
Norbert Bröker
POPL
2006
ACM
16 years 7 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
160
Voted
ICFP
2002
ACM
16 years 6 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy