Sciweavers

632 search results - page 17 / 127
» Proving Invariants of Functional Programs
Sort
View
93
Voted
LFCS
2007
Springer
15 years 6 months ago
A Temporal Dynamic Logic for Verifying Hybrid System Invariants
We combine first-order dynamic logic for reasoning about possible behaviour of hybrid systems with temporal logic for reasoning about the temporal behaviour during their operation...
André Platzer
ICPR
2008
IEEE
15 years 7 months ago
Object recognition using graph spectral invariants
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
Bai Xiao, Richard C. Wilson, Edwin R. Hancock
92
Voted
HYBRID
2009
Springer
15 years 4 months ago
Trajectory Based Verification Using Local Finite-Time Invariance
Abstract. In this paper we propose a trajectory based reachability analysis by using local finite-time invariance property. Trajectory based analysis are based on the execution tra...
A. Agung Julius, George J. Pappas
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 5 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
GECCO
2010
Springer
172views Optimization» more  GECCO 2010»
15 years 5 months ago
Designing better fitness functions for automated program repair
Evolutionary methods have been used to repair programs automatically, with promising results. However, the fitness function used to achieve these results was based on a few simpl...
Ethan Fast, Claire Le Goues, Stephanie Forrest, We...