Sciweavers

231 search results - page 28 / 47
» Mu-calculus path checking
Sort
View
AMAST
2008
Springer
15 years 1 months ago
A Hybrid Approach for Safe Memory Management in C
In this paper, we present a novel approach that establishes a synergy between static and dynamic analyses for detecting memory errors in C code. We extend the standard C type syste...
Syrine Tlili, Zhenrong Yang, Hai Zhou Ling, Mourad...
ISSTA
1998
ACM
15 years 3 months ago
Automatic Test Data Generation Using Constraint Solving Techniques
Automatic test data generation leads to identify input values on which a selected point in a procedure is executed. This paper introduces a new method for this problem based on co...
Arnaud Gotlieb, Bernard Botella, Michel Rueher
HIPC
2007
Springer
15 years 3 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
FORTE
2004
15 years 21 days ago
Witness and Counterexample Automata for ACTL
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
Robert Meolic, Alessandro Fantechi, Stefania Gnesi
ACTA
2010
191views more  ACTA 2010»
14 years 11 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar