Sciweavers

227 search results - page 37 / 46
» Bounded Model Checking of Concurrent Programs
Sort
View
POPL
2008
ACM
15 years 10 months ago
Proving non-termination
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumda...
RTA
2005
Springer
15 years 3 months ago
Natural Narrowing for General Term Rewriting Systems
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...
Santiago Escobar, José Meseguer, Prasanna T...
ENTCS
2010
165views more  ENTCS 2010»
14 years 9 months ago
Correct Execution of Reconfiguration for Stateful Components
In component-based software engineering, reconfiguration describes structural changes to the architecture of a component system. For stateful components, not only structural but a...
Moritz Hammer, Alexander Knapp
FMSD
2002
128views more  FMSD 2002»
14 years 9 months ago
Combining Software and Hardware Verification Techniques
Combining verification methods developed separately for software and hardware is motivated by the industry's need for a technology that would make formal verification of reali...
Robert P. Kurshan, Vladimir Levin, Marius Minea, D...
87
Voted
POPL
2010
ACM
15 years 1 days ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...