6978 search results - page 234 / 1396 » On Proofs in System P |
285
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
220
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
157
click to vote
JLP
2006
15 years 6 months ago
2006
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
162
click to vote
APWEB
2007
Springer
16 years 24 days ago
2007
Springer
How can a RFID (Radio Frequency Identification Devices) system prove that two or more RFID tags are in the same location? Previous researchers have proposed yoking-proof and groupi...
181
click to vote
CADE
2004
Springer
16 years 12 hour ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...