Sciweavers

577 search results - page 51 / 116
» Model Checking Based on Simultaneous Reachability Analysis
Sort
View
FMSD
2006
103views more  FMSD 2006»
13 years 9 months ago
Compositional SCC Analysis for Language Emptiness
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
Chao Wang, Roderick Bloem, Gary D. Hachtel, Kavita...
CAISE
2008
Springer
13 years 11 months ago
Formal Modeling and Discrete-Time Analysis of BPEL Web Services
Abstract. Web services are increasingly used for building enterprise information systems according to the Service Oriented Architecture (Soa) paradigm. We propose in this paper a t...
Radu Mateescu, Sylvain Rampacek
FOSSACS
2007
Springer
14 years 3 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
ISSTA
2009
ACM
14 years 3 months ago
Exception analysis and points-to analysis: better together
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
Martin Bravenboer, Yannis Smaragdakis
ADAEUROPE
2008
Springer
13 years 11 months ago
On the Timed Automata-Based Verification of Ravenscar Systems
The Ravenscar profile for Ada enforces several restrictions on the usage of general-purpose tasking constructs, thereby facilitating most analysis tasks and in particular functiona...
Iulian Ober, Nicolas Halbwachs