Sciweavers

6978 search results - page 322 / 1396
» On Proofs in System P
Sort
View
162
Voted
AMAI
2005
Springer
15 years 6 months ago
Resolution cannot polynomially simulate compressed-BFS
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
DoRon B. Motter, Jarrod A. Roy, Igor L. Markov
AMAST
2010
Springer
15 years 1 months ago
Matching Logic: An Alternative to Hoare/Floyd Logic
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
Grigore Rosu, Chucky Ellison, Wolfram Schulte
IPPS
2007
IEEE
16 years 1 months ago
Gossip-based Reputation Aggregation for Unstructured Peer-to-Peer Networks
: Peer-to-Peer (P2P) reputation systems are needed to evaluate the trustworthiness of participating peers and to combat selfish and malicious peer behaviors. The reputation system ...
Runfang Zhou, Kai Hwang
CDC
2010
IEEE
129views Control Systems» more  CDC 2010»
15 years 1 months ago
On parameterized Lyapunov and control Lyapunov functions for discrete-time systems
This paper deals with the existence and synthesis of parameterized-(control) Lyapunov functions (p-(C)LFs) for discrete-time nonlinear systems that are possibly subject to constrai...
Mircea Lazar, Rob H. Gielen
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
16 years 3 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein