Sciweavers

1101 search results - page 83 / 221
» Forcing in proof theory
Sort
View
114
Voted
ICSE
2003
IEEE-ACM
16 years 3 months ago
Toward an Understanding of the Motivation of Open Source Software Developers
An Open Source Software (OSS) project is unlikely to be successful unless there is an accompanied community that provides the platform for developers and users to collaborate. Mem...
Yunwen Ye, Kouichi Kishida
SIGGRAPH
1987
ACM
15 years 7 months ago
Elastically deformable models
Abstract: The theory of elasticity describes deformable materials such as rubber, cloth, paper, and flexible metals. We employ elasticity theory to construct differential equations...
Demetri Terzopoulos, John C. Platt, Alan H. Barr, ...
123
Voted
FORMATS
2010
Springer
15 years 1 months ago
Natural Domain SMT: A Preliminary Assessment
SMT solvers have traditionally been based on the DPLL(T) algorithm, where the driving force behind the procedure is a DPLL search over truth valuations. This traditional framework ...
Scott Cotton
121
Voted
CADE
2002
Springer
16 years 3 months ago
Formal Verification of a Combination Decision Procedure
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
Jonathan Ford, Natarajan Shankar
122
Voted
ENTCS
2006
103views more  ENTCS 2006»
15 years 3 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström