Sciweavers

1001 search results - page 77 / 201
» Testing Formal Dialectic
Sort
View
IPL
2007
105views more  IPL 2007»
13 years 9 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
RTCSA
1999
IEEE
14 years 1 months ago
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
Zhe Dang, Richard A. Kemmerer
LICS
2008
IEEE
14 years 3 months ago
An Algebraic Process Calculus
We present an extension of the πI-calculus with formal sums of terms. The study of the properties of this sum reveals that its neutral element can be used to make assumptions abo...
Emmanuel Beffara
ICSE
2008
IEEE-ACM
14 years 9 months ago
On the automation of fixing software bugs
Software Testing can take up to half of the resources of the development of new software. Although there has been a lot of work on automating the testing phase, fixing a bug after...
Andrea Arcuri
IJIT
2004
13 years 10 months ago
Modeling Biology Inspired Reactive Agents Using X-machines
Recent advances in both the testing and verification of software based on formal specifications of the system to be built have reached a point where the ideas can be applied in a p...
George Eleftherakis, Petros Kefalas, Anna Sotiriad...