Sciweavers

523 search results - page 8 / 105
» A General Model for Reachability Testing of Concurrent Progr...
Sort
View
ICSE
2008
IEEE-ACM
14 years 9 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...
ENTCS
2007
105views more  ENTCS 2007»
13 years 8 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
12 years 4 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
ICOIN
2001
Springer
14 years 27 days ago
A Conformance Testing Method for Communication Protocols Modeled as Concurrent DFSMs
According to the progress of high-speed networks, many communication protocols are specified as concurrent systems. Such systems can be modeled as concurrent deterministic FSMs (D...
Atsushi Fukada, Akio Nakata, Junji Kitamichi, Teru...
AAAI
2008
13 years 9 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor