Sciweavers

1809 search results - page 96 / 362
» Software Model Checking Using Linear Constraints
Sort
View
PG
2003
IEEE
14 years 2 months ago
Bounding Recursive Procedural Models Using Convex Optimization
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
Orion Sky Lawlor, John C. Hart
SCP
2010
172views more  SCP 2010»
13 years 7 months ago
Alternating-time stream logic for multi-agent systems
Constraint automata have been introduced to provide a compositional, operational semantics for the exogenous coordination language Reo, but they can also serve interface specifica...
Sascha Klüppelholz, Christel Baier
SPIN
2010
Springer
13 years 7 months ago
Context-Bounded Translations for Concurrent Software: An Empirical Evaluation
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
Naghmeh Ghafari, Alan J. Hu, Zvonimir Rakamaric
SIGSOFT
2007
ACM
14 years 9 months ago
Beyond refactoring: a framework for modular maintenance of crosscutting design idioms
Despite the automated refactoring support provided by today's IDEs many program transformations that are easy to conceptualize-such as improving the implementation of a desig...
Macneil Shonle, William G. Griswold, Sorin Lerner
ICSE
2009
IEEE-ACM
14 years 3 months ago
Verifying networked programs using a model checker extension
Model checking finds failures in software by exploring every possible execution schedule. Until recently it has been mainly applied to stand-alone applications. This paper presen...
Watcharin Leungwattanakit, Cyrille Artho, Masami H...