2291 search results - page 361 / 459 » Representational Reasoning and Verification |
SIGSOFT
2007
ACM
14 years 10 months ago
2007
ACM
A software system interacts with third-party libraries through various APIs. Using these library APIs often needs to follow certain usage patterns. Furthermore, ordering rules (sp...
SIGSOFT
2007
ACM
14 years 10 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
SIGSOFT
2003
ACM
14 years 10 months ago
2003
ACM
State machine based formalisms such as labelled transition systems (LTS) are generally assumed to be complete descriptions m behaviour at some level of abstraction: if a labelled ...
SAS
2009
Springer
14 years 10 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
CAV
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Contract-based property checkers hold the potential for precise, scalable, and incremental reasoning. However, it is difficult to apply such checkers to large program mod...