Sciweavers

1116 search results - page 22 / 224
» Applying Predicate Abstraction to Abstract State Machines
Sort
View
76
Voted
TLCA
2007
Springer
15 years 5 months ago
Predicative Analysis of Feasibility and Diagonalization
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
Jean-Yves Marion
SEC
2003
15 years 13 days ago
From Finite State Machines to Provably Correct Java Card Applets
Abstract This paper presents a systematic approach to developing Java Card applets and/or formal specifications for them, starting from descriptions in the form of finite state m...
Engelbert Hubbers, Martijn Oostdijk, Erik Poll
SBMF
2009
Springer
156views Formal Methods» more  SBMF 2009»
15 years 5 months ago
Applying Event and Machine Decomposition to a Flash-Based Filestore in Event-B
Abstract. Event-B is a formal method used for specifying and reasoning about systems. Rodin is a toolset for developing system models in Event-B. Our experiment which is outlined i...
Kriangsak Damchoom, Michael J. Butler
CAV
2006
Springer
116views Hardware» more  CAV 2006»
15 years 2 months ago
Lazy Shape Analysis
Abstract. Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is di...
Dirk Beyer, Thomas A. Henzinger, Grégory Th...
85
Voted
EUROGP
2007
Springer
116views Optimization» more  EUROGP 2007»
15 years 5 months ago
Genetic Programming with Fitness Based on Model Checking
Abstract. Model checking is a way of analysing programs and programlike structures to decide whether they satisfy a list of temporal logic statements describing desired behaviour. ...
Colin G. Johnson