Sciweavers

52 search results - page 6 / 11
» Compositional State Space Generation from Lotos Programs
Sort
View
JSC
2010
100views more  JSC 2010»
13 years 2 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov
MM
2003
ACM
190views Multimedia» more  MM 2003»
14 years 23 days ago
Human + agent: creating recombinant information
combinFormation is a tool that enables browsing and collecting information elements in a generative space. By generative, we mean that the tool is an agent that automatically retr...
Andruid Kerne, Vikram Sundaram, Jin Wang, Madhur K...
KI
2007
Springer
14 years 1 months ago
Options in Readylog Reloaded - Generating Decision-Theoretic Plan Libraries in Golog
Readylog is a logic-based agent programming language and combines many important features from other Golog dialects. One of the features of Readylog is to make use of decision-theo...
Lutz Böhnstedt, Alexander Ferrein, Gerhard La...
ICSE
2008
IEEE-ACM
14 years 8 months ago
Incremental state-space exploration for programs with dynamically allocated data
We present a novel technique that speeds up state-space exploration (SSE) for evolving programs with dynamically allocated data. SSE is the essence of explicit-state model checkin...
Steven Lauterburg, Ahmed Sobeih, Darko Marinov, Ma...
KBSE
2007
IEEE
14 years 1 months ago
Testing concurrent programs using value schedules
Concurrent programs are difficult to debug and verify because of the nondeterministic nature of concurrent executions. A particular concurrency-related bug may only show up under ...
Jun Chen, Steve MacDonald