Sciweavers

13383 search results - page 162 / 2677
» Abstractions from proofs
Sort
View
ENTCS
2008
170views more  ENTCS 2008»
15 years 6 months ago
A Coq Library for Verification of Concurrent Programs
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Reynald Affeldt, Naoki Kobayashi
CACM
2011
84views more  CACM 2011»
15 years 1 months ago
Using simple abstraction to reinvent computing for parallelism
ple abstraction encapsulating the desired interface between programmers and system builders. Using Simple ion to Reinvent Computing for Parallelism doi:10.1145/1866739.1866757 abst...
Uzi Vishkin
CASSIS
2005
Springer
16 years 1 days ago
Mobile Resource Guarantees and Policies
This paper introduces notions of resource policy for mobile code to be run on smart devices, to integrate with the proof-carrying code architecture of the Mobile Resource Guarantee...
David Aspinall, Kenneth MacKenzie
CSL
2005
Springer
16 years 1 days ago
Permutative Logic
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
Jean-Marc Andreoli, Gabriele Pulcini, Paul Ruet
CAV
2001
Springer
119views Hardware» more  CAV 2001»
15 years 11 months ago
Certifying Model Checkers
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
Kedar S. Namjoshi