233 search results - page 41 / 47 » Specifying, Programming and Verifying with Equational Logic |
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
EMSOFT
2007
Springer
14 years 1 months ago
2007
Springer
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
PLDI
2006
ACM
14 years 1 months ago
2006
ACM
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
PLDI
2010
ACM
14 years 14 days ago
2010
ACM
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...