61 search results - page 4 / 13 » Invariant Checking for Programs with Procedure Calls |
ACSC
2004
IEEE
13 years 11 months ago
2004
IEEE
Types are fundamental for enforcing levels of abstraction in modern high-level programming languages and their lower-level representations. However, some type-related features suc...
SPIN
2007
Springer
14 years 1 months ago
2007
Springer
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
ASE
2002
13 years 7 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
SEFM
2006
IEEE
14 years 1 months ago
2006
IEEE
tic analysis tools based on abstraction are sound but not complete. Several practical static analysis tools are heuristic in nature —they are neither sound nor complete, but have...
KBSE
2005
IEEE
14 years 28 days ago
2005
IEEE
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...