Sciweavers

1914 search results - page 150 / 383
» Verification by Abstract Interpretation
Sort
View
SBMF
2010
Springer
132views Formal Methods» more  SBMF 2010»
14 years 7 months ago
Midlet Navigation Graphs in JML
Abstract. In the context of the EU project Mobius on Proof Carrying Code for Java programs (midlets) on mobile devices, we present a way to express midlet navigation graphs in JML....
Wojciech Mostowski, Erik Poll
MABS
2000
Springer
15 years 4 months ago
The Use of Models - Making MABS More Informative
g of target systems attempted but rather an abstraction of the target systems is modelled and insights bout the abstraction then applied back to the target systems. The MABS modell...
Bruce Edmonds
107
Voted
CADE
2007
Springer
16 years 1 months ago
Inferring Invariants by Symbolic Execution
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
Benjamin Weiß, Peter H. Schmitt
107
Voted
JANCL
2007
115views more  JANCL 2007»
15 years 20 days ago
A logical characterisation of qualitative coalitional games
Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goa...
Paul E. Dunne, Wiebe van der Hoek, Michael Wooldri...
LOPSTR
2004
Springer
15 years 6 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...