Sciweavers

1027 search results - page 9 / 206
» Callgraph properties of executables
Sort
View
123
Voted
AICOM
2010
127views more  AICOM 2010»
15 years 2 months ago
Interactive verification of concurrent systems using symbolic execution
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
Simon Bäumler, Michael Balser, Florian Nafz, ...
120
Voted
CADE
2008
Springer
16 years 2 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
115
Voted
ESOP
2009
Springer
15 years 6 months ago
Verified, Executable Parsing
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
Aditi Barthwal, Michael Norrish
137
Voted
LOGCOM
2010
128views more  LOGCOM 2010»
14 years 9 months ago
Comparing LTL Semantics for Runtime Verification
When monitoring a system wrt. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is,...
Andreas Bauer 0002, Martin Leucker, Christian Scha...
126
Voted
COMPSAC
2007
IEEE
15 years 9 months ago
Visualization of Concurrent Program Executions
Various program analysis techniques are efficient at discovering failures and properties. However, it is often difficult to evaluate results, such as program traces. ls for abst...
Cyrille Artho, Klaus Havelund, Shinichi Honiden