Sciweavers

276 search results - page 41 / 56
» Representing Transition Systems by Logic Programs
Sort
View
ISSTA
2004
ACM
14 years 1 months ago
Optimal strategies for testing nondeterministic systems
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
Lev Nachmanson, Margus Veanes, Wolfram Schulte, Ni...
SAS
2009
Springer
171views Formal Methods» more  SAS 2009»
14 years 8 months ago
Bottom-Up Shape Analysis
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
Bhargav S. Gulavani, Supratik Chakraborty, Ganesan...
C5
2004
IEEE
13 years 11 months ago
Skeleton - Easy Simulation System
Skeleton is a visual scripting environment as an extension of Squeak etoy [1] with Connectors [2] system to make mathematical and physical simulation for non professional computer...
Takashi Yamamiya
MIDDLEWARE
2007
Springer
14 years 1 months ago
Life cycle support for sensor network applications
Developing applications for sensor networks is a challenging task. Most programming systems narrowly focus on programming issues while ignoring that programming represents only a ...
Urs Bischoff, Gerd Kortuem
HASKELL
2006
ACM
14 years 1 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser