Sciweavers

1111 search results - page 99 / 223
» Program Analysis as Model Checking of Abstract Interpretatio...
Sort
View
SIGSOFT
2010
ACM
15 years 1 months ago
An effective dynamic analysis for detecting generalized deadlocks
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
Pallavi Joshi, Mayur Naik, Koushik Sen, David Gay
112
Voted
SIGSOFT
2005
ACM
16 years 4 months ago
Fluent temporal logic for discrete-time event-based models
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...
133
Voted
ATVA
2009
Springer
158views Hardware» more  ATVA 2009»
15 years 10 months ago
Logahedra: A New Weakly Relational Domain
Weakly relational numeric domains express restricted classes of linear inequalities that strike a balance between what can be described and what can be efficiently computed. Popula...
Jacob M. Howe, Andy King
ASE
2005
103views more  ASE 2005»
15 years 3 months ago
Component Verification with Automatically Generated Assumptions
Abstract. Model checking is an automated technique that can be used to determine whether a system satisfies certain required properties. The typical approach to verifying propertie...
Dimitra Giannakopoulou, Corina S. Pasareanu, Howar...
117
Voted
ESOP
2007
Springer
15 years 9 months ago
Interprocedurally Analysing Linear Inequality Relations
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
Helmut Seidl, Andrea Flexeder, Michael Petter