159 search results - page 25 / 32 » Specifying Proof Systems in Linear Logic with Subexponential... |
KBSE
2005
IEEE
15 years 3 months ago
2005
IEEE
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
111
Voted
ICFP
2004
ACM
15 years 9 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
IJCAI
2007
14 years 11 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The Windows Vista operating system implements an interesting model of multi-level integrity. We observe that in this model, trusted code must participate in any information-flow a...
186
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...