Sciweavers

58 search results - page 3 / 12
» Correctness of Multiplicative Additive Proof Structures is N...
Sort
View
LICS
2008
IEEE
13 years 11 months ago
Cut Elimination for Monomial MALL Proof Nets
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
Olivier Laurent, Roberto Maieli
JSS
2007
105views more  JSS 2007»
13 years 5 months ago
Composing pattern-based components and verifying correctness
Designing large software systems out of reusable components has become increasingly popular. Although liberal composition of reusable components saves time and expense, many exper...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan, S...
ASPDAC
2008
ACM
106views Hardware» more  ASPDAC 2008»
13 years 6 months ago
Verifying full-custom multipliers by Boolean equivalence checking and an arithmetic bit level proof
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
Udo Krautz, Markus Wedler, Wolfgang Kunz, Kai Webe...
PLDI
2009
ACM
14 years 5 months ago
An integrated proof language for imperative programs
We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs....
Karen Zee, Viktor Kuncak, Martin C. Rinard
CORR
2002
Springer
111views Education» more  CORR 2002»
13 years 5 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter