6274 search results - page 187 / 1255 » Proofs, Programs, Processes |
174
click to vote
SAS
2007
Springer
16 years 16 days ago
2007
Springer
Concurrent programs are difficult to verify because the proof must consider the interactions between the threads. Fine-grained concurrency and heap allocated data structures exacer...
176
click to vote
ICTCS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Non-interference is a desirable property of systems in a multilevel security architecture, stating that confidential information is not disclosed in public output. The c...
137
click to vote
PASTE
2004
ACM
15 years 12 months ago
2004
ACM
This work discusses two non-traditional approaches for evaluating the imprecision of static analysis. The approaches are based on proofs of feasibility or infeasibility that are c...
167
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We prove a new congruence result for the π-calculus: bisimilarity is a congruence in the sub-calculus that does not include restriction nor sum, and features top-level r...
157
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...