1410 search results - page 194 / 282 » Proving theorems by reuse |
SIGSOFT
2010
ACM
13 years 4 months ago
2010
ACM
We argue that lightweight, language-based verification is poised to enter mainstream industrial use, where it will have a major impact on software quality and reliability. We expl...
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
CADE
2011
Springer
12 years 10 months ago
2011
Springer
We describe asasp, a symbolic reachability procedure for the analysis of administrative access control policies. The tool represents access policies and their administrative action...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
This paper examines sparse grid quadrature on weighted tensor products (wtp) of reproducing kernel Hilbert spaces on products of the unit sphere S2 . We describe a wtp quadrature ...
CADE
2012
Springer
12 years 14 days ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...