Sciweavers

1023 search results - page 100 / 205
» A Formal Method for Program Slicing
Sort
View
BMEI
2008
IEEE
15 years 8 months ago
Adaptive Gene Expression Programming Algorithm Based on Cloud Model
Standard Gene Expression Programming(GEP) works with fixed rate of mutation and crossover, ignoring the variation of the individual fitness, hence it works in the local optimum st...
Yue Jiang, Chang-jie Tang, Haichun Zheng, Chuan Li...
ENTCS
2007
144views more  ENTCS 2007»
15 years 1 months ago
Partial Order Reduction for Rewriting Semantics of Programming Languages
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
Azadeh Farzan, José Meseguer
ENTCS
2008
140views more  ENTCS 2008»
15 years 1 months ago
Linking Event-B and Concurrent Object-Oriented Programs
The Event-B method is a formal approach to modelling systems, using refinement. Initial specification is a high level of abstraction; detail is added in refinement steps as the de...
Andrew Edmunds, Michael Butler
VLSID
2002
IEEE
177views VLSI» more  VLSID 2002»
16 years 2 months ago
RTL-Datapath Verification using Integer Linear Programming
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
Raik Brinkmann, Rolf Drechsler
ICDCS
2003
IEEE
15 years 7 months ago
Enhancing The Fault-Tolerance of Nonmasking Programs
In this paper, we focus on automated techniques to enhance the fault-tolerance of a nonmasking fault-tolerant program to masking. A masking program continually satisfies its spec...
Sandeep S. Kulkarni, Ali Ebnenasir