Sciweavers

493 search results - page 58 / 99
» Bounded LTL Model Checking with Stable Models
Sort
View
FUIN
2010
172views more  FUIN 2010»
14 years 7 months ago
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...
ICWS
2009
IEEE
15 years 7 months ago
A Tool for Choreography Analysis Using Collaboration Diagrams
Analyzing interactions among peers that interact via messages is a crucial problem due to increasingly distributed nature of current software systems, especially the ones built us...
Tevfik Bultan, Chris Ferguson, Xiang Fu
CHARME
2003
Springer
73views Hardware» more  CHARME 2003»
15 years 1 months ago
Towards Diagrammability and Efficiency in Event Sequence Languages
Industrial verification teams are actively developing suitable event sequence languages for hardware verification. Such languages must be expressive, designer friendly, and hardwar...
Kathi Fisler
SPIN
2007
Springer
15 years 4 months ago
SAT-Based Summarization for Boolean Programs
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
Gérard Basler, Daniel Kroening, Georg Weiss...
ECOOPW
1999
Springer
15 years 2 months ago
Aspects and Superimpositions
The model checking of applications of aspects is explained, by showing the stages and proof obligations when a collection of generic aspects (called a superimposition) is combined...
Shmuel Katz, Joseph Gil