Sciweavers

493 search results - page 37 / 99
» Bounded LTL Model Checking with Stable Models
Sort
View
CORR
2004
Springer
124views Education» more  CORR 2004»
14 years 9 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
ISORC
1999
IEEE
15 years 2 months ago
v-Promela: A Visual, Object-Oriented Language for SPIN
We describe the design of VIP, a graphical front-end to the model checker SPIN. VIP supports a visual formalism, called v-Promela that connects the model checker to modern hierarc...
Stefan Leue, Gerard J. Holzmann
RTAS
2006
IEEE
15 years 3 months ago
Scalable Modeling and Performance Evaluation of Wireless Sensor Networks
A notable features of many proposed Wireless Sensor Networks (WSNs) deployments is their scale: hundreds to thousands of nodes linked together. In such systems, modeling the state...
YoungMin Kwon, Gul Agha
POPL
2007
ACM
15 years 10 months ago
On the analysis of interacting pushdown systems
Pushdown Systems (PDSs) has become an important paradigm for program analysis. Indeed, recent work has shown a deep connection between inter-procedural dataflow analysis for seque...
Vineet Kahlon, Aarti Gupta
CHARME
2005
Springer
176views Hardware» more  CHARME 2005»
15 years 3 months ago
An Analysis of SAT-Based Model Checking Techniques in an Industrial Environment
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
Nina Amla, Xiaoqun Du, Andreas Kuehlmann, Robert P...