Sciweavers

1226 search results - page 25 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
ENDM
2010
87views more  ENDM 2010»
15 years 2 months ago
Euler Complexes (Oiks)
We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence...
Jack Edmonds
ATVA
2008
Springer
144views Hardware» more  ATVA 2008»
15 years 4 months ago
Tests, Proofs and Refinements
1 : Logic in Specification and Verification (abstract) Natarajan Shankar (SRI) Session Chair : Sungdeok Cha 12 : 00 13 : 00 Lunch 13 : 00 15 : 00 2 : Boolean Modeling of Cell Biolo...
Sriram K. Rajamani
CORR
2010
Springer
100views Education» more  CORR 2010»
15 years 2 months ago
Products of Weighted Logic Programs
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
Shay B. Cohen, Robert J. Simmons, Noah A. Smith
ICFP
2006
ACM
16 years 1 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
CADE
2002
Springer
16 years 2 months ago
A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
Robert R. Schneck, George C. Necula