923 search results - page 5 / 185 » Proving the value of formal methods |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
CADE
2003
Springer
15 years 9 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
96
Voted
SGAI
2009
Springer
15 years 2 months ago
2009
Springer
Temporality and uncertainty are important features of many real world systems. Solving problems in such systems requires the use of formal mechanism such as logic systems, statisti...
AUSAI
2010
Springer
14 years 8 months ago
2010
Springer
A general game player is a system that can play previously unknown games given nothing but their rules. A key to success in this endeavour is the ability to automatically gain know...
EMSOFT
2007
Springer
15 years 3 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...