Sciweavers

101 search results - page 16 / 21
» Zap: Automated Theorem Proving for Software Analysis
Sort
View
ICSE
2008
IEEE-ACM
14 years 8 months ago
A verification system for timed interval calculus
Timed Interval Calculus (TIC) is a highly expressive set-based notation for specifying and reasoning about embedded real-time systems. However, it lacks mechanical proving support...
Chunqing Chen, Jin Song Dong, Jun Sun 0001
MKM
2004
Springer
14 years 25 days ago
A Graph-Based Approach Towards Discerning Inherent Structures in a Digital Library of Formal Mathematics
As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, ...
Lori Lorigo, Jon M. Kleinberg, Richard Eaton, Robe...
FM
2005
Springer
112views Formal Methods» more  FM 2005»
14 years 1 months ago
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...
ASWEC
2001
IEEE
13 years 11 months ago
Applying Static Analysis to Large-Scale, Multi-Threaded Java Programs
Static analysis is a tremendous help when trying to find faults in complex software. Writing multi-threaded programs is difficult, because the thread scheduling increases the prog...
Cyrille Artho, Armin Biere
ICSM
2000
IEEE
13 years 12 months ago
ConSIT: A Conditioned Program Slicer
Conditioned slicing is a powerful generalisation of static and dynamic slicing which has applications to many problems in software maintenance and evolution, including re-use, ree...
Chris Fox, Mark Harman, Robert M. Hierons, Sebasti...